Imagen de Portada

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Yixin, Dey, Tonmoy, Kuhnle, Alan
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
por: Chen, Yixin, et al.
Publicado: (2026)

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

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

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

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

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

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

Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Mini-batch Submodular Maximization
por: Schwartzman, Gregory
Publicado: (2024)

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

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
por: Tukan, Murad, et al.
Publicado: (2024)

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

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

Parallel Best Arm Identification in Heterogeneous Environments
por: Karpov, Nikolai, et al.
Publicado: (2022)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2023)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
por: Cervenjak, Philip, et al.
Publicado: (2023)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)

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

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

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

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

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

Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)

A Unified Approach to Submodular Maximization Under Noise
por: Bhawalkar, Kshipra, et al.
Publicado: (2025)

On the Problem of Best Arm Retention
por: Chen, Houshuang, et al.
Publicado: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
por: Buchbinder, Niv, et al.
Publicado: (2025)

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

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

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
por: Udwani, Rajan
Publicado: (2024)