Copertina

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lu, Yiyang, Pedramfar, Mohammad, Aggarwal, Vaneet
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Computational Complexity Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2024)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
di: Pedramfar, Mohammad, 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)

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
di: Lu, Yiyang, 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)

A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2024)

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

A Unified Approach for Maximizing Continuous DR-submodular Functions
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2023)

Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
di: Bhargav, Jayanth, et al.
Pubblicazione: (2024)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
di: Hollender, Alexandros, et al.
Pubblicazione: (2023)

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

Second-Order Min-Max Optimization with Lazy Hessians
di: Chen, Lesi, et al.
Pubblicazione: (2024)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2023)

Efficient Convex Optimization Requires Superlinear Memory
di: Marsden, Annie, et al.
Pubblicazione: (2022)

The Complexity of Finding Local Optima in Contrastive Learning
di: Yan, Jingming, et al.
Pubblicazione: (2025)

Benign landscape for Burer-Monteiro factorizations of MaxCut-type semidefinite programs
di: Endor, Faniriana Rakoto, et al.
Pubblicazione: (2024)

Multi-Armed Sampling Problem and the End of Exploration
di: Pedramfar, Mohammad, et al.
Pubblicazione: (2025)

ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions
di: Fourati, Fares, et al.
Pubblicazione: (2025)

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

Counterfactual Explanations for Integer Optimization Problems
di: Engelhardt, Felix, et al.
Pubblicazione: (2025)

Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
di: Fourati, Fares, et al.
Pubblicazione: (2025)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
di: Boche, Holger, et al.
Pubblicazione: (2025)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
di: Maitra, Sarit
Pubblicazione: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
di: Tyurin, Alexander
Pubblicazione: (2024)

High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise
di: Fang, Yuchen, et al.
Pubblicazione: (2025)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
di: Liu, Wei, et al.
Pubblicazione: (2025)

On Approximate Computation of Critical Points
di: Ahmadi, Amir Ali, et al.
Pubblicazione: (2026)

Learning-Augmented Decentralized Online Convex Optimization in Networks
di: Li, Pengfei, et al.
Pubblicazione: (2023)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, et al.
Pubblicazione: (2025)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
di: Jin, Ruiyang, et al.
Pubblicazione: (2025)

Min-Max Optimization Requires Exponentially Many Queries
di: Bernasconi, Martino, et al.
Pubblicazione: (2026)

Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
di: Sahinoglu, Emre, et al.
Pubblicazione: (2024)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
di: Chen, Shengminjie, et al.
Pubblicazione: (2026)

Arithmetic Circuits and Neural Networks for Regular Matroids
di: Hertrich, Christoph, et al.
Pubblicazione: (2025)

Unifying Formal Explanations: A Complexity-Theoretic Perspective
di: Bassan, Shahaf, et al.
Pubblicazione: (2026)

Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems
di: Blanchard, Moise
Pubblicazione: (2024)

Neural Networks and (Virtual) Extended Formulations
di: Hertrich, Christoph, et al.
Pubblicazione: (2024)

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
di: Yan, Wenjing, et al.
Pubblicazione: (2024)

Optimized Gradient Tracking for Decentralized Online Learning
di: Sharma, Shivangi Dubey, et al.
Pubblicazione: (2023)

(Sub)Exponential Quantum Speedup for Optimization
di: Leng, Jiaqi, et al.
Pubblicazione: (2025)