Copertina

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mualem, Loay, Tukan, Murad, Fledman, Moran
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
di: Lu, Yiyang, et al.
Pubblicazione: (2026)

Online Submodular Maximization via Online Convex Optimization
di: Salem, Tareq Si, et al.
Pubblicazione: (2023)

Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
di: Zhou, Julien, et al.
Pubblicazione: (2024)

Improving Model Classification by Optimizing the Training Dataset
di: Tukan, Morad, et al.
Pubblicazione: (2025)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
di: Bach, Francis
Pubblicazione: (2025)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
di: Jambulapati, Arun, et al.
Pubblicazione: (2024)

Convex Hulls of Reachable Sets
di: Lew, Thomas, et al.
Pubblicazione: (2023)

Online Dynamic Submodular Optimization
di: Lesage-Landry, Antoine, et al.
Pubblicazione: (2023)

Distributed Online Submodular Maximization under Communication Delays: A Simultaneous Decision-Making Approach
di: Xu, Zirui, et al.
Pubblicazione: (2026)

Projection-free Online Learning over Strongly Convex Sets
di: Wan, Yuanyu, et al.
Pubblicazione: (2020)

Inexact Column Generation for Bayesian Network Structure Learning via Difference-of-Submodular Optimization
di: Yang, Yiran, et al.
Pubblicazione: (2025)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
di: Wang, Jie, et al.
Pubblicazione: (2024)

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems
di: Lyu, Jiameng, et al.
Pubblicazione: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
di: Hihat, Massil, et al.
Pubblicazione: (2023)

A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD
di: Jin, Ruinan, et al.
Pubblicazione: (2024)

Stronger Approximation Guarantees for Non-Monotone γ-Weakly DR-Submodular Maximization
di: Jadav, Hareshkumar, et al.
Pubblicazione: (2026)

Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization
di: Gao, Yihang, et al.
Pubblicazione: (2025)

$γ$-weakly $θ$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2026)

Are Convex Optimization Curves Convex?
di: Barzilai, Guy, et al.
Pubblicazione: (2025)

A Theoretical and Empirical Study on the Convergence of Adam with an "Exact" Constant Step Size in Non-Convex Settings
di: Mazumder, Alokendu, et al.
Pubblicazione: (2023)

The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
di: Schaipp, Fabian, et al.
Pubblicazione: (2025)

On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Sets
di: Xu, Haonan, et al.
Pubblicazione: (2024)

Generalized Schrödinger Bridge Matching
di: Liu, Guan-Horng, et al.
Pubblicazione: (2023)

$k$-Submodular Interdiction Problems under Distributional Risk-Receptiveness and Robustness: Application to Machine Learning
di: Park, Seonghun, et al.
Pubblicazione: (2024)

Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization
di: Maier, Severin, et al.
Pubblicazione: (2023)

Bandit Convex Optimisation
di: Lattimore, Tor
Pubblicazione: (2024)

Convex Optimization with Nested Evolving Feasible Sets
di: M., Karthick Krishna, et al.
Pubblicazione: (2026)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
di: Dahal, Hari, et al.
Pubblicazione: (2023)

Analyzing Neural Network-Based Generative Diffusion Models through Convex Optimization
di: Zhang, Fangzhao, et al.
Pubblicazione: (2024)

Heat Death of Generative Models in Closed-Loop Learning
di: Marchi, Matteo, et al.
Pubblicazione: (2024)

Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
di: Demidovich, Yury, et al.
Pubblicazione: (2024)

Maximizing Reliability with Bayesian Optimization
di: Buckingham, Jack M., et al.
Pubblicazione: (2026)

The Price of Adaptivity in Stochastic Convex Optimization
di: Carmon, Yair, et al.
Pubblicazione: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
di: Chayti, El Mahdi, et al.
Pubblicazione: (2025)

Online Convex Optimization with Unbounded Memory
di: Kumar, Raunak, et al.
Pubblicazione: (2022)

Astral Space: Convex Analysis at Infinity
di: Dudík, Miroslav, et al.
Pubblicazione: (2022)

Smooth Quasar-Convex Optimization with Constraints
di: Martínez-Rubio, David
Pubblicazione: (2025)

Unconstrained Robust Online Convex Optimization
di: Zhang, Jiujia, et al.
Pubblicazione: (2025)

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