Learning complexity of gradient descent and conjugate gradient algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | Jiao, Xianqi, Liu, Jia, Chen, Zhiping |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024)
by: Ketkov, Sergey S., et al.
Published: (2024)
Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
by: Büsing, Christina, et al.
Published: (2025)
by: Büsing, Christina, et al.
Published: (2025)
Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
by: Sim, Chee-Khian
Published: (2024)
by: Sim, Chee-Khian
Published: (2024)
Adaptive control mechanisms in gradient descent algorithms
by: Iannelli, Andrea
Published: (2025)
by: Iannelli, Andrea
Published: (2025)
The Complexity of Recognizing Facets for the Knapsack Polytope
by: Chen, Rui, et al.
Published: (2022)
by: Chen, Rui, et al.
Published: (2022)
Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
by: Chen, Ying, et al.
Published: (2025)
by: Chen, Ying, et al.
Published: (2025)
A parallel framework for graphical optimal transport
by: Fan, Jiaojiao, et al.
Published: (2024)
by: Fan, Jiaojiao, et al.
Published: (2024)
Blended Conditional Gradients: the unconditioning of conditional gradients
by: Braun, Gábor, et al.
Published: (2018)
by: Braun, Gábor, et al.
Published: (2018)
Avoiding Deadlocks via Weak Deadlock Sets
by: Oriolo, Gianpaolo, et al.
Published: (2024)
by: Oriolo, Gianpaolo, et al.
Published: (2024)
A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
by: Maitra, Sarit
Published: (2024)
by: Maitra, Sarit
Published: (2024)
Geometric and computational hardness of bilevel programming
by: Bolte, Jérôme, et al.
Published: (2024)
by: Bolte, Jérôme, et al.
Published: (2024)
Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
by: Tyurin, Alexander
Published: (2024)
by: Tyurin, Alexander
Published: (2024)
On the Complexity of p-Order Cone Programs
by: Blanco, Víctor, et al.
Published: (2025)
by: Blanco, Víctor, et al.
Published: (2025)
Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)
by: Caprara, Alberto, et al.
Published: (2026)
On the Induced Norms of Matrices and Grothendieck problems
by: Truong, Lan V., et al.
Published: (2026)
by: Truong, Lan V., et al.
Published: (2026)
Efficient LP warmstarting for linear modifications of the constraint matrix
by: Derval, Guillaume, et al.
Published: (2025)
by: Derval, Guillaume, et al.
Published: (2025)
Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
by: Majumdar, Angshul
Published: (2026)
by: Majumdar, Angshul
Published: (2026)
On the Degree Automatability of Sum-of-Squares Proofs
by: Bortolotti, Alex, et al.
Published: (2025)
by: Bortolotti, Alex, et al.
Published: (2025)
Counterfactual Explanations for Integer Optimization Problems
by: Engelhardt, Felix, et al.
Published: (2025)
by: Engelhardt, Felix, et al.
Published: (2025)
Policy Gradient Algorithms in Average-Reward Multichain MDPs
by: Lee, Jongmin, et al.
Published: (2026)
by: Lee, Jongmin, et al.
Published: (2026)
A parameterized linear formulation of the integer hull
by: Eisenbrand, Friedrich, et al.
Published: (2025)
by: Eisenbrand, Friedrich, et al.
Published: (2025)
The Complexity of Computing KKT Solutions of Quadratic Programs
by: Fearnley, John, et al.
Published: (2023)
by: Fearnley, John, et al.
Published: (2023)
Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
by: Boche, Holger, et al.
Published: (2025)
by: Boche, Holger, et al.
Published: (2025)
On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
by: Ketkov, Sergey S., et al.
Published: (2026)
by: Ketkov, Sergey S., et al.
Published: (2026)
Information Redistribution Under Reductions in NP Search
by: Wei, Jing-Yuan
Published: (2026)
by: Wei, Jing-Yuan
Published: (2026)
Centrality of shortest paths: Algorithms and complexity results
by: Phosavanh, Johnson, et al.
Published: (2024)
by: Phosavanh, Johnson, et al.
Published: (2024)
Implicit regularization of normalized gradient descent
by: Josz, Cédric
Published: (2026)
by: Josz, Cédric
Published: (2026)
Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes
by: Gamarnik, David
Published: (2025)
by: Gamarnik, David
Published: (2025)
Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms
by: Bhargav, Jayanth, et al.
Published: (2024)
by: Bhargav, Jayanth, et al.
Published: (2024)
Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
by: Jin, Ruiyang, et al.
Published: (2025)
by: Jin, Ruiyang, et al.
Published: (2025)
A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)
by: Prunet, Thibault, et al.
Published: (2023)
A direct optimization algorithm for input-constrained MPC
by: Wu, Liang, et al.
Published: (2023)
by: Wu, Liang, et al.
Published: (2023)
The Complexity of Finding Local Optima in Contrastive Learning
by: Yan, Jingming, et al.
Published: (2025)
by: Yan, Jingming, et al.
Published: (2025)
A stochastic gradient descent algorithm with random search directions
by: Gbaguidi, Eméric
Published: (2025)
by: Gbaguidi, Eméric
Published: (2025)
The duality structure gradient descent algorithm: analysis and applications to neural networks
by: Flynn, Thomas
Published: (2017)
by: Flynn, Thomas
Published: (2017)
Real Stability and Log Concavity are coNP-Hard
by: Chin, Tracy
Published: (2024)
by: Chin, Tracy
Published: (2024)
On the convergence analysis of the decentralized projected gradient descent method
by: Choi, Woocheol, et al.
Published: (2023)
by: Choi, Woocheol, et al.
Published: (2023)
Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents
by: Borzechowski, Michaela, et al.
Published: (2024)
by: Borzechowski, Michaela, et al.
Published: (2024)
Projected gradient descent algorithm for $\textit{ab initio}$ crystal structure relaxation under a fixed unit cell volume
by: Hu, Yukuan, et al.
Published: (2024)
by: Hu, Yukuan, et al.
Published: (2024)
Non-smooth stochastic gradient descent using smoothing functions
by: Giovannelli, Tommaso, et al.
Published: (2025)
by: Giovannelli, Tommaso, et al.
Published: (2025)
Similar Items
-
On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024) -
Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
by: Büsing, Christina, et al.
Published: (2025) -
Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
by: Sim, Chee-Khian
Published: (2024) -
Adaptive control mechanisms in gradient descent algorithms
by: Iannelli, Andrea
Published: (2025) -
The Complexity of Recognizing Facets for the Knapsack Polytope
by: Chen, Rui, et al.
Published: (2022)