Cover Image

Stochastic Optimization and Data Science

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Avetisyan, Arutyun, Dvinskikh, Darina, Gasnikov, Alexander, Temlyakov, Vladimir, Tupitsa, Nazarii, Turdakov, Denis
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

CaCuTe: Casual Cubic-Model Technique for Faster Optimization
by: Tupitsa, Nazarii
Published: (2025)

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

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

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

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

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

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

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

Federated Learning Can Find Friends That Are Advantageous
by: Tupitsa, Nazarii, et al.
Published: (2024)

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

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

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

Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
by: Gorbunov, Eduard, et al.
Published: (2024)

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

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

Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad
by: Choudhury, Sayantan, et al.
Published: (2024)

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

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

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

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

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

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

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

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

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
by: Vasin, Artem, et al.
Published: (2026)

Dual Smoothing for Decentralized Optimization
by: Rogozin, Alexander, et al.
Published: (2025)

Adaptive Stepsize Selection in Decentralized Convex Optimization
by: Kuruzov, Ilya, et al.
Published: (2025)

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
by: Chen, Xiaokai, et al.
Published: (2025)

Norm-Constrained Flows and Sign-Based Optimization: Theory and Algorithms
by: Leplat, Valentin, et al.
Published: (2025)

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

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

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

Decentralized Optimization with Coupled Constraints
by: Yarmoshik, Demyan, et al.
Published: (2024)

Higher Degree Inexact Model for Optimization problems
by: Alkousa, Mohammad, et al.
Published: (2024)

Strengthening the finite characterizations of smooth min-max games
by: Krivchenko, Valery, et al.
Published: (2026)

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

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

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

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

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