Copertina

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Yixin, Kuhnle, Alan
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
di: Chen, Yixin, et al.
Pubblicazione: (2020)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
di: Chen, Yixin, et al.
Pubblicazione: (2021)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
di: Chen, Yixin, et al.
Pubblicazione: (2024)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
di: Chen, Yixin, et al.
Pubblicazione: (2022)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
di: Chen, Yixin, et al.
Pubblicazione: (2025)

Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
di: Kuhnle, Alan
Pubblicazione: (2026)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
di: Gallart, Joan Vendrell, et al.
Pubblicazione: (2025)

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
di: Nath, Ankur, et al.
Pubblicazione: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
di: Fahrbach, Matthew, et al.
Pubblicazione: (2024)

A Note On Deterministic Submodular Maximization With Bounded Curvature
di: Li, Wenxin
Pubblicazione: (2024)

Submodular Maximization in Exactly $n$ Queries
di: Balkanski, Eric, et al.
Pubblicazione: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
di: Harris, Blake, et al.
Pubblicazione: (2024)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
di: Gopal, Shivaram, et al.
Pubblicazione: (2024)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
di: Srivastava, Ajitesh, et al.
Pubblicazione: (2026)

Linear Submodular Maximization with Bandit Feedback
di: Chen, Wenjing, et al.
Pubblicazione: (2024)

Consistent Submodular Maximization
di: Dütting, Paul, et al.
Pubblicazione: (2024)

Multi-Agent Reinforcement Learning with Submodular Reward
di: Chen, Wenjing, et al.
Pubblicazione: (2026)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
di: Chen, Wenjing, et al.
Pubblicazione: (2023)

Online Two-Stage Submodular Maximization
di: Nikolaou, Iasonas, et al.
Pubblicazione: (2025)

Minimum Cost Adaptive Submodular Cover
di: Al-Thani, Hessa, et al.
Pubblicazione: (2022)

Deletion Robust Submodular Maximization over Matroids
di: Dütting, Paul, et al.
Pubblicazione: (2022)

The Cost of Consistency: Submodular Maximization with Constant Recourse
di: Dütting, Paul, et al.
Pubblicazione: (2024)

Fully Dynamic Submodular Maximization over Matroids
di: Dütting, Paul, et al.
Pubblicazione: (2023)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
di: Cui, Shuang, et al.
Pubblicazione: (2023)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
di: Nie, Guanyu, et al.
Pubblicazione: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
di: Banihashem, Kiarash, et al.
Pubblicazione: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
di: Dütting, Paul, et al.
Pubblicazione: (2022)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
di: Yuan, Jing, et al.
Pubblicazione: (2024)

Fair Submodular Cover
di: Chen, Wenjing, et al.
Pubblicazione: (2024)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
di: Amanatidis, Georgios, et al.
Pubblicazione: (2020)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
di: Harb, Elfarouk, et al.
Pubblicazione: (2025)

Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
di: Slivkins, Aleksandrs, et al.
Pubblicazione: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
di: Amanatidis, Georgios, et al.
Pubblicazione: (2021)

Lower Bounds for Greedy Teaching Set Constructions
di: Compton, Spencer, et al.
Pubblicazione: (2025)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
di: Chen, Wenjing, et al.
Pubblicazione: (2026)

Mini-batch Submodular Maximization
di: Schwartzman, Gregory
Pubblicazione: (2024)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
di: Goel, Surbhi, et al.
Pubblicazione: (2024)

Spectral Guarantees for Adversarial Streaming PCA
di: Price, Eric, et al.
Pubblicazione: (2024)

Discrete and Continuous Difference of Submodular Minimization
di: Orfanides, George, et al.
Pubblicazione: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
di: Laenen, Steinar, et al.
Pubblicazione: (2024)