Cover Image

Ruppert-Polyak averaging for Stochastic Order Oracle

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Smirnov, V. N., Kazistova, K. M., Sudakov, I. A., Leplat, V., Gasnikov, A. V., Lobanov, A. V.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Minimisation of Polyak-Łojasewicz Functions Using Random Zeroth-Order Oracles
by: Farzin, Amir Ali, et al.
Published: (2024)

Gaussian Approximation and Multiplier Bootstrap for Polyak-Ruppert Averaged Linear Stochastic Approximation with Applications to TD Learning
by: Samsonov, Sergey, et al.
Published: (2024)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
by: Lobanov, Aleksandr, et al.
Published: (2025)

When Does Dynamic Preconditioning Preserve the Polyak-Ruppert CLT? A Stabilization Threshold
by: An, Sunyoung, et al.
Published: (2026)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
by: Suvorikova, Alexandra, et al.
Published: (2026)

Non-convex Stochastic Composite Optimization with Polyak Momentum
by: Gao, Yuan, et al.
Published: (2024)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
by: Chervonenkis, Boris, et al.
Published: (2024)

The Black-Box Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
by: Lobanov, Aleksandr, et al.
Published: (2023)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
by: Lobanov, Aleksandr, et al.
Published: (2024)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
by: Oikonomou, Dimitris, et al.
Published: (2024)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
by: Chen, Lesi, et al.
Published: (2023)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
by: Lobanov, Aleksandr, et al.
Published: (2023)

Accelerated zero-order SGD under high-order smoothness and overparameterized regime
by: Bychkov, Georgii, et al.
Published: (2024)

SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms
by: Abdukhakimov, Farshed, et al.
Published: (2023)

A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging
by: Khodadadian, Sajad, et al.
Published: (2025)

Simulation-Based Optimisation of Batting Order and Bowling Plans in T20 Cricket
by: Ganesh, Tinniam V
Published: (2026)

Taking the Road Less Scheduled with Adaptive Polyak Steps
by: Oikonomou, Dimitris, et al.
Published: (2025)

Enhancing Policy Gradient with the Polyak Step-Size Adaption
by: Li, Yunxiang, et al.
Published: (2024)

Motivating Next-Gen Accelerators with Flexible (N:M) Activation Sparsity via Benchmarking Lightweight Post-Training Sparsification Approaches
by: Alanova, Shirin, et al.
Published: (2025)

Monotone, Bi-Lipschitz, and Polyak-Lojasiewicz Networks
by: Wang, Ruigang, et al.
Published: (2024)

Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity
by: Prokhorov, Boris, et al.
Published: (2026)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models
by: Cohen, Jeremy E., et al.
Published: (2024)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
by: Oikonomou, Dimitris, et al.
Published: (2025)

Second-Order Actor-Critic Methods for Discounted MDPs via Policy Hessian Decomposition
by: Manivannan, Sanjeev, et al.
Published: (2026)

Survival Analysis as Imprecise Classification with Trainable Kernels
by: Konstantinov, Andrei V., et al.
Published: (2025)

Towards a Relationship-Aware Transformer for Tabular Data
by: Konstantinov, Andrei V., et al.
Published: (2025)

Federated Learning: A Stochastic Approximation Approach
by: P V, Srihari, et al.
Published: (2024)

About some works of Boris Polyak on convergence of gradient methods and their development
by: Ablaev, Seydamet, et al.
Published: (2023)

HONEM: Learning Embedding for Higher Order Networks
by: Saebi, Mandana, et al.
Published: (2019)

Neural Network Compression for Reinforcement Learning Tasks
by: Ivanov, Dmitry A., et al.
Published: (2024)

Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates
by: Imaizumi, Kento, et al.
Published: (2024)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2021)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
by: Xia, Lu, et al.
Published: (2023)

Market-Driven Subset Selection for Budgeted Training
by: Jha, Ashish, et al.
Published: (2025)

Pixel-Translation-Equivariant Quantum Convolutional Neural Networks via Fourier Multiplexers
by: Chirkov, Dmitry, et al.
Published: (2026)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)

Path-integral molecular dynamics with actively-trained and universal machine learning force fields
by: Solovykh, A. A., et al.
Published: (2025)

Overcoming linguistic barriers in code assistants: creating a QLoRA adapter to improve support for Russian-language code writing instructions
by: Pronin, C. B., et al.
Published: (2024)