Imagen de Portada

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lobanov, Aleksandr, Gasnikov, Alexander
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
por: Lobanov, Aleksandr
Publicado: (2024)

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

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

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions
por: Sadchikov, Andrey, et al.
Publicado: (2024)

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

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
por: Lobanov, Aleksandr, et al.
Publicado: (2024)

Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness
por: Lobanov, Aleksandr, 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)

Gradient-free algorithm for saddle point problems under overparametrization
por: Statkevich, Ekaterina, et al.
Publicado: (2024)

Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks
por: Solodkin, Vladimir, et al.
Publicado: (2024)

Accelerated Methods with Compression for Horizontal and Vertical Federated Learning
por: Stanko, Sergey, et al.
Publicado: (2024)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
por: Kornilov, Nikita, et al.
Publicado: (2024)

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

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
por: Kuruzov, Ilya, et al.
Publicado: (2022)

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

Randomized gradient-free methods in convex optimization
por: Gasnikov, Alexander, et al.
Publicado: (2022)

Bregman Proximal Method for Efficient Communications under Similarity
por: Beznosikov, Aleksandr, et al.
Publicado: (2023)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
por: Vasin, Artem, et al.
Publicado: (2025)

Leveraging Coordinate Momentum in SignSGD and Muon: Memory-Optimized Zero-Order
por: Petrov, Egor, et al.
Publicado: (2025)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
por: Pichugin, Alexander, et al.
Publicado: (2024)

New Aspects of Black Box Conditional Gradient: Variance Reduction and One Point Feedback
por: Veprikov, Andrey, et al.
Publicado: (2024)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
por: Divilkovskiy, Maxim, et al.
Publicado: (2025)

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
por: Pichugin, Alexander, et al.
Publicado: (2024)

Adaptive Regularized Newton Method with Inexact Hessian
por: Shestakov, Aleksandr, et al.
Publicado: (2025)

A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization
por: Zhou, Yuke, et al.
Publicado: (2025)

Decentralized Distributed Optimization for Saddle Point Problems
por: Rogozin, Alexander, et al.
Publicado: (2021)

Optimal Data Splitting in Distributed Optimization for Machine Learning
por: Medyakov, Daniil, et al.
Publicado: (2024)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
por: Stonyakin, Fedor, et al.
Publicado: (2021)

Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity
por: Bylinkin, Dmitry, et al.
Publicado: (2024)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
por: Beznosikov, Aleksandr, et al.
Publicado: (2020)

Extragradient Sliding for Composite Non-Monotone Variational Inequalities
por: Emelyanov, Roman, et al.
Publicado: (2024)

Decentralized Finite-Sum Optimization over Time-Varying Networks
por: Metelev, Dmitry, et al.
Publicado: (2024)

Stochastic Frank-Wolfe: Unified Analysis and Zoo of Special Cases
por: Nazykov, Ruslan, et al.
Publicado: (2024)

One-Point Feedback for Composite Optimization with Applications to Distributed and Federated Learning
por: Beznosikov, Aleksandr, et al.
Publicado: (2021)

Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry
por: Solodkin, Vladimir, et al.
Publicado: (2024)

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

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
por: Kuruzov, Ilya, et al.
Publicado: (2022)

Decentralized Optimization with Mixed Affine Constraints
por: Yarmoshik, Demyan, et al.
Publicado: (2026)

Sign-SGD via Parameter-Free Optimization
por: Medyakov, Daniil, et al.
Publicado: (2025)