Image de couverture de livre

Mini-batch Submodular Maximization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Schwartzman, Gregory
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Mini-Batch Kernel $k$-means
par: Jourdan, Ben, et autres
Publié: (2024)

Consistent Submodular Maximization
par: Dütting, Paul, et autres
Publié: (2024)

Decomposable Submodular Maximization in Federated Setting
par: Rafiey, Akbar
Publié: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
par: Pedramfar, Mohammad, et autres
Publié: (2023)

Linear Submodular Maximization with Bandit Feedback
par: Chen, Wenjing, et autres
Publié: (2024)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse
par: Dütting, Paul, et autres
Publié: (2024)

Deletion Robust Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Fully Dynamic Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2023)

A Note On Deterministic Submodular Maximization With Bounded Curvature
par: Li, Wenxin
Publié: (2024)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
par: Cui, Shuang, et autres
Publié: (2023)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
par: Yuan, Jing, et autres
Publié: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
par: Chen, Yixin, et autres
Publié: (2020)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
par: Chen, Yixin, et autres
Publié: (2021)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
par: Amanatidis, Georgios, et autres
Publié: (2020)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
par: Pham, Canh V.
Publié: (2024)

Coreset Spectral Clustering
par: Jourdan, Ben, et autres
Publié: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
par: Amanatidis, Georgios, et autres
Publié: (2021)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
par: Halabi, Marwa El, et autres
Publié: (2023)

Stochastic Multi-round Submodular Optimization with Budget
par: Auletta, Vincenzo, et autres
Publié: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
par: Chen, Yixin, et autres
Publié: (2024)

Minimum Cost Adaptive Submodular Cover
par: Al-Thani, Hessa, et autres
Publié: (2022)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
par: Tukan, Murad, et autres
Publié: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

Multi-Agent Reinforcement Learning with Submodular Reward
par: Chen, Wenjing, et autres
Publié: (2026)

Local Max-Cut on Sparse Graphs
par: Schwartzman, Gregory
Publié: (2023)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
par: Nie, Guanyu, et autres
Publié: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
par: Banihashem, Kiarash, et autres
Publié: (2024)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

Optimal Survival Trees: A Dynamic Programming Approach
par: Huisman, Tim, et autres
Publié: (2024)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
par: Sun, Yiwen, et autres
Publié: (2024)

Model Stealing for Any Low-Rank Language Model
par: Liu, Allen, et autres
Publié: (2024)

Block-Diagonal Guided DBSCAN Clustering
par: Zhao, Weibing
Publié: (2024)

Contract Scheduling with Distributional and Multiple Advice
par: Angelopoulos, Spyros, et autres
Publié: (2024)

SubGen: Token Generation in Sublinear Time and Memory
par: Zandieh, Amir, et autres
Publié: (2024)

Online bipartite matching with imperfect advice
par: Choo, Davin, et autres
Publié: (2024)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)