:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Smirnov, V. N., Kazistova, K. M., Sudakov, I. A., Leplat, V., Gasnikov, A. V., Lobanov, A. V.
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2411.15866
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
por: Puchkin, Nikita, et al.
Publicado: (2023)

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

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

First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities
por: Beznosikov, Aleksandr, et al.
Publicado: (2023)

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

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

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

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

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

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

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

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

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