Samplinglib
Lean gate not recorded for this source state main · ed709a7f320d

Samplinglib · research resources

AI-Assisted Works on Algorithm Design and Analysis

A complete source-listed bibliography; choose a title, then inspect the primary source before using its mathematical claims.

67 references. Dates are supplied by the Forum, not independently verified publication dates.

  1. DREAM: Delay-Resistant Acceleration with Momentum external reference
  2. Continuous-time analysis and algorithms for linear and convex quadratic programs via exactly solvable differential inclusions external reference
  3. A short proof of a range-relative FPTAS for polynomial integer optimization over bounded polyhedra external reference
  4. Weak-\(L^α\) Noise, Strong Guarantees: Gradient Clipping under Affine Heavy Tails external reference
  5. Gradient descent reaches arbitrary accuracy in a fixed number of large steps on multiclass logistic regression external reference
  6. On the Nonoccurrence of Gradient Restart in Nesterov Accelerated Gradient Method external reference
  7. Acceleration of Generalized Conditional Gradient Methods external reference
  8. Accelerating Finite-Sum Bilevel Optimization with Fully First-Order Oracles external reference
  9. Optimal degree bounds for sum-of-squares representations external reference
  10. Convergence Rates for Lasserre's Upper-Bound Hierarchy on \(\mathbb{R}^d\) with Gaussian Measure external reference
  11. Envelope Cubic Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization external reference
  12. First-order Optimization Methods with Generalized Smoothness for Low-rank Matrix Factorization external reference
  13. Cyclic steepest descent is \(R\)-superlinearly convergent for almost every initialization on two-spectrum quadratics external reference
  14. Adaptive two-points zero-order accelerated methods for stochastic convex optimization problems external reference
  15. The exact worst-case asymptotic rate of Nesterov acceleration for strongly convex optimization external reference
  16. Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints external reference
  17. Matching the Lower Bounds: Stochastic Contracting Cubic Newton and Its Optimal Acceleration external reference
  18. Accelerated Proximal Gradient Method for Non-Strongly Convex Time-Varying Optimization external reference
  19. SDDP has polynomial iteration complexity in the horizon external reference
  20. Polynomial Acceleration of Alternating Projections: Chebyshev Acceleration, Convergence Rates, and Retractions external reference
  21. Optimal Oracle Complexity for Finite-Sum Monotone Inclusions external reference
  22. Finding Stationary Points under Higher-Order Smoothness: Trapping Algorithms and First-Order Lower Bounds external reference
  23. Boundary Geometry and Global Rates of Cyclic Coordinate Descent for SVM Duals external reference
  24. Acceleration for Affine-coupling problems external reference
  25. Greedy sign-based box splitting: exact solvable classes, sharp thresholds and order-oracle complexity external reference
  26. Dual-Anchor Acceleration Is Near-Optimal for Stochastic Monotone Root-Finding external reference
  27. Accelerated Algorithms for Stochastic Monotone Inclusions with Fixed Queries external reference
  28. Annealed Sinkhorn with Momentum: Certified Unregularized Optimal Transport in Linear Memory external reference
  29. AltGDA Achieves Global \(O(1/T)\) Ergodic Convergence in Matrix Games external reference
  30. Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems external reference
  31. Optimal High-Order Methods for Solving Monotone Variational Inequalities external reference
  32. Moving-Average Iteration of Linear Maps external reference
  33. Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates external reference
  34. The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings external reference
  35. Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization external reference
  36. Optimal Recursive Composition and Dyadic Phase Laws for Gradient Descent with Predetermined Stepsizes external reference
  37. Constant Steps Are s-Composable: An Exact Interpolation Certificate for Gradient Descent external reference
  38. Global Linear Convergence of the Proximal Bundle Method under Unknown Piecewise Smoothness and Quadratic Growth external reference
  39. An \(O(1/T^3)\) algorithm for minimizing convex quadratic functions over the \(L_1\) ball external reference
  40. Heavy-Ball Method under Randomized Schedules external reference
  41. The Exact Time-Uniform Rate Frontier for Stochastic Gradient Descent on Smooth Convex Objectives external reference
  42. On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization external reference
  43. Centered Permutation Prefixes for SGD with Random Reshuffling: Sharp Rates, Hölder Geometry, and Composite Proximal Extensions external reference
  44. Sum-of-Squares Certificates for Copositive Matrices via Recursive Identities: The de Klerk-Pasechnik Conjecture and Hoffman--Pereira Matrices external reference
  45. Optimal Parameter-Free Gradient Minimization in \(\ell_p\) Geometry external reference
  46. When a Relaxed PEP Is Exact: The Sharp Queried-Gradient Rate of Nesterov's Fast Gradient Method external reference
  47. Zeroth-Order Nonsmooth Nonconvex Optimization with Convex Liftings and Its Application to State-Feedback \(H_\infty\) Policy Optimization external reference
  48. Doubling the dimension yields a benign landscape for the squared-stress external reference
  49. On the Complexity of BFGS Method for Smooth Convex Optimization external reference
  50. Radial-type error bounds for semidefinite feasibility problems without strict feasibility: qualitative estimates and asymptotic tightness external reference
  51. Halpern Iteration Achieves \(\tilde{\mathcal{O}}(ε^{-1/p})\) \(p\)th-Order Oracle Complexity for Monotone Variational Inequalities external reference
  52. Forward-Reflected-Backward algorithm with Linesearch external reference
  53. Improved Convergence Rate for Stochastic Multi-Gradient Descent: A Proof Discovered with AI external reference
  54. From Manifold Identification to Newton Acceleration on Intersections: Sparse Stiefel Optimization external reference
  55. Sharp \(O(1/k)\) convergence rate for the Sinkhorn algorithm via a local analysis external reference
  56. Accelerated and Stable Convergence with Anchored Generalized Optimistic Method external reference
  57. Unified Ergodic Primal-Dual Gap Rates with Unhalved Primal Stepsizes external reference
  58. Last-Iterate Convergence of Optimistic Multiplicative Weight Update external reference
  59. Accelerating Min-Max Optimization via Power-Law Stepsizes external reference
  60. Efficient Gradient Methods for Distributed Saddle Problems external reference
  61. Almost-sharp \(O(k^{-1} \log k)\) convergence rate for the Sinkhorn algorithm in the asymptotically scalable case external reference
  62. Boţ-Nguyen Acceleration, Weighted Mean Ergodic Iteration, and the Beta-Binomial Distribution external reference
  63. An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent external reference
  64. All roads lead to Rome: Path-following Augmented Lagrangian Methods via Bregman Proximal Regularization external reference
  65. Robust Sublinear Convergence Rates for Iterative Bregman Projections external reference
  66. Trajectory-Wise Certification for Vector-Field Mirror Descent with Deterministic Finite Differences external reference
  67. Point Convergence of Nesterov's Accelerated Gradient Method: An AI-Assisted Proof external reference

Original category and attribution