Dynamic algorithms for matroid submodular maximization

K Banihashem, L Biabani, S Goudarzi… - Proceedings of the 2024 …, 2024 - SIAM
Submodular maximization under matroid and cardinality constraints are classical problems
with a wide range of applications in machine learning, auction theory, and combinatorial …

Quantifying microbial guilds

J Rivas-Santisteban, P Yubero… - ISME …, 2024 - academic.oup.com
The ecological role of microorganisms is of utmost importance due to their multiple
interactions with the environment. However, assessing the contribution of individual …

Trustworthy Machine Learning: From Algorithmic Transparency to Decision Support

U Bhatt - 2024 - repository.cam.ac.uk
Developing machine learning models worthy of decision-maker trust is crucial to using
models in practice. Algorithmic transparency tools, such as explainability and uncertainty …

Practical and parallelizable algorithms for non-monotone submodular maximization with size constraint

Y Chen, A Kuhnle - Journal of Artificial Intelligence Research, 2024 - jair.org
We present combinatorial and parallelizable algorithms for the maximization of a
submodular function, not necessarily monotone, with respect to a size constraint. We …