Guarantees of stochastic greedy algorithms for non-monotone submodular maximization with cardinality constraintsAug 26, 2020·Shinsaku Sakaue· 0 min read PDFTypeConference paperPublicationInternational Conference on Artificial Intelligence and Statistics (AISTATS)Last updated on Aug 26, 2020 ← Learning individually fair classifier with path-specific causal-effect constraint May 1, 2021On maximization of weakly modular functions: Guarantees of multi-stage algorithms, tractability, and hardness Aug 26, 2020 →