Cover Image

An Accelerated Variance Reduced Extra-Point Approach to Finite-Sum VI and Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Kevin, Wang, Nuozhou, Zhang, Shuzhong
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
by: Wang, Nuozhou, et al.
Published: (2025)

Novel Optimization Techniques for Parameter Estimation
by: Wu, Chenyu, et al.
Published: (2024)

Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
by: Dereziński, Michał
Published: (2022)

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback
by: He, Chang, et al.
Published: (2025)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
by: Jiang, Xiaotian, et al.
Published: (2026)

Variance Reduced Random Relaxed Projection Method for Constrained Finite-sum Minimization Problems
by: Yang, Zhichun, et al.
Published: (2022)

Variance-Reduced Accelerated First-order Methods: Central Limit Theorems and Confidence Statements
by: Lei, Jinlong, et al.
Published: (2020)

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

On Relatively Smooth Optimization over Riemannian Manifolds
by: He, Chang, et al.
Published: (2025)

A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms
by: Jiang, Xiaotian, et al.
Published: (2024)

Alternating Stochastic Variance-Reduced Algorithms with Optimal Complexity for Bilevel Optimization
by: Huo, Haimei, et al.
Published: (2024)

A Correspondence-Driven Approach for Bilevel Decision-making with Nonconvex Lower-Level Problems
by: Jiang, Xiaotian, et al.
Published: (2025)

Importance Sampling in Expensive Finite-Sum Optimization via Contextual Bandit Methods
by: Menickelly, Matt
Published: (2026)

A Variance-Reduced Stochastic Gradient Tracking Algorithm for Decentralized Optimization with Orthogonality Constraints
by: Wang, Lei, et al.
Published: (2022)

On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
by: Luo, Luo, et al.
Published: (2022)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2024)

Efficient Sign-Based Optimization: Accelerating Convergence via Variance Reduction
by: Jiang, Wei, et al.
Published: (2024)

Variance-Reduced Gradient Estimator for Nonconvex Zeroth-Order Distributed Optimization
by: Mu, Huaiyi, et al.
Published: (2024)

Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction
by: Rodomanov, Anton, 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)

Beyond Bounded Variance: Variance-Reduced Normalized Methods for Nonconvex Optimization under Blum-Gladyshev Noise
by: Upadhyay, Antesh, et al.
Published: (2026)

Variance-Reduced $(\varepsilon,δ)-$Unlearning using Forget Set Gradients
by: Van Waerebeke, Martin, et al.
Published: (2026)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

Improved Rates for Stochastic Variance-Reduced Difference-of-Convex Algorithms
by: Nguyen, Anh Duc, et al.
Published: (2025)

Efficient Algorithms for Sum-of-Minimum Optimization
by: Ding, Lisang, et al.
Published: (2024)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
by: Liang, Ling, et al.
Published: (2024)

History-Aware Adaptive High-Order Tensor Regularization
by: He, Chang, et al.
Published: (2025)

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

Extended Zero-Gradient-Sum Approach for Constrained Distributed Optimization with Free Initialization
by: Shi, Xinli, et al.
Published: (2023)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)

Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization
by: Condat, Laurent, et al.
Published: (2025)

Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
by: Wang, Bokun, et al.
Published: (2023)

Divergence Results and Convergence of a Variance Reduced Version of ADAM
by: Wang, Ruiqi, et al.
Published: (2022)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

Efficient Continual Finite-Sum Minimization
by: Mavrothalassitis, Ioannis, et al.
Published: (2024)

A GPU-Accelerated Interior Point Method for Radiation Therapy Optimization
by: Liu, Felix, et al.
Published: (2024)

Bounding the Settling Time of Finite-Time Stable Systems using Sum of Squares
by: Kisole, Sengiyumva, et al.
Published: (2025)