Cover Image

From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pedramfar, Mohammad, Aggarwal, Vaneet
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Computational Complexity Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization
by: Lu, Yiyang, et al.
Published: (2025)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

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

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

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

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

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

BAGEL: Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization
by: Lu, Yiyang, et al.
Published: (2025)

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

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

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

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

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

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

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

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

Subgradient Method for System Identification with Non-Smooth Objectives
by: Yalcin, Baturalp, et al.
Published: (2025)

Boosting Gradient Ascent for Continuous DR-submodular Maximization
by: Zhang, Qixin, et al.
Published: (2024)

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

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

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

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

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

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

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

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

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

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

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

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

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

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
by: Ketkov, Sergey S., et al.
Published: (2026)

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

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

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

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

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

The Adaptive Complexity of Finding a Stationary Point
by: Zhou, Huanjian, et al.
Published: (2025)

Learning Exactly Linearizable Deep Dynamics Models
by: Moriyasu, Ryuta, et al.
Published: (2023)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)