Cover Image

Adaptive Regularized Newton Method with Inexact Hessian

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shestakov, Aleksandr, Bashirov, Nail, Semenov, Andrei, Gasnikov, Alexander, Takáč, Martin, Beznosikov, Aleksandr, Kamzolov, Dmitry
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Decentralized Inexact Cubic Newton Method with Consensus Procedure
by: Agafonov, Artem, et al.
Published: (2026)

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

Unified Theory of Adaptive Variance Reduction
by: Shestakov, Aleksandr, et al.
Published: (2025)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
by: Agafonov, Artem, et al.
Published: (2024)

Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalities
by: Beznosikov, Aleksandr, et al.
Published: (2023)

OPTAMI: Global Superlinear Convergence of High-order Methods
by: Kamzolov, Dmitry, et al.
Published: (2024)

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

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

Cubic Regularized Newton Method with Variance Reduction for Finite-sum Non-convex Problems
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Random-reshuffled SARAH does not need a full gradient computations
by: Beznosikov, Aleksandr, et al.
Published: (2021)

Preconditioned Norms: A Unified Framework for Steepest Descent, Quasi-Newton and Adaptive Methods
by: Veprikov, Andrey, et al.
Published: (2025)

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
by: Chezhegov, Savelii, et al.
Published: (2024)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
by: Pichugin, Alexander, 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)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

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

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
by: Ostroukhov, Petr, et al.
Published: (2024)

Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning
by: Bylinkin, Dmitry, et al.
Published: (2024)

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

Loss-Transformation Invariance in the Damped Newton Method
by: Shestakov, Alexander, et al.
Published: (2025)

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

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

Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks
by: Solodkin, Vladimir, 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)

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

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

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

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

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

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

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
by: Agafonov, Artem, et al.
Published: (2023)

Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers
by: Riabinin, Artem, et al.
Published: (2026)

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

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

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

Decentralized Personalized Federated Learning for Min-Max Problems
by: Borodich, Ekaterina, et al.
Published: (2021)

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

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

Activations and Gradients Compression for Model-Parallel Training
by: Rudakov, Mikhail, et al.
Published: (2024)