Copertina

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hollender, Alexandros, Zampetakis, Manolis
Natura:	Preprint
Pubblicazione:	2023
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

The Complexity of Computing KKT Solutions of Quadratic Programs
di: Fearnley, John, et al.
Pubblicazione: (2023)

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)

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

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

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

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

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

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

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
di: Cao, Jincheng, et al.
Pubblicazione: (2025)

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

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

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

Deterministic Nonsmooth Nonconvex Optimization
di: Jordan, Michael I., et al.
Pubblicazione: (2023)

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

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

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

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

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
di: Meng, Qing-xin, 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)

On the Hardness of Learning One Hidden Layer Neural Networks
di: Li, Shuchen, et al.
Pubblicazione: (2024)

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

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

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, 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)

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

Time-Varying Convex Optimization with $O(n)$ Computational Complexity
di: Rostami, M., et al.
Pubblicazione: (2024)

On the Complexity of p-Order Cone Programs
di: Blanco, Víctor, et al.
Pubblicazione: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
di: Chen, Rui, et al.
Pubblicazione: (2022)

Linear Equations with Min and Max Operators: Computational Complexity
di: Chatterjee, Krishnendu, et al.
Pubblicazione: (2024)

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

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

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

Optimal Preconditioning is a Geodesically Convex Optimization Problem
di: Doğan, M. Levent, et al.
Pubblicazione: (2025)

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

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

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
di: Bhargav, Jayanth, et al.
Pubblicazione: (2024)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
di: Borodich, Ekaterina, et al.
Pubblicazione: (2025)

Safe Online Convex Optimization with Multi-Point Feedback
di: Hutchinson, Spencer, et al.
Pubblicazione: (2024)

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
di: Mhanna, Elissa, et al.
Pubblicazione: (2024)