:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Tran-Dinh, Quoc, Luo, Yang
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control Machine Learning
Acceso en línea:	https://arxiv.org/abs/2301.03113
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

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

Shuffling Momentum Gradient Algorithm for Convex Optimization
por: Tran, Trang H., et al.
Publicado: (2024)

From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems
por: Tran-Dinh, Quoc
Publicado: (2022)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Omega: Optimistic EMA Gradients
por: Ramirez, Juan, et al.
Publicado: (2023)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
por: Tran-Dinh, Quoc
Publicado: (2025)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
por: Daskalakis, Constantinos, et al.
Publicado: (2018)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
por: Lekeufack, Jordan, et al.
Publicado: (2024)

A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
por: Nguyen-Trung, Nghia, et al.
Publicado: (2025)

Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions
por: Tran-Dinh, Quoc, et al.
Publicado: (2026)

Differentially Private Random Block Coordinate Descent
por: Maranjyan, Artavazd, et al.
Publicado: (2024)

On Stability in Optimistic Bilevel Optimization
por: Royset, Johannes O.
Publicado: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
por: Zhang, Jiawei, et al.
Publicado: (2020)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
por: Chen, Lesi, et al.
Publicado: (2023)

Optimistic Online LQR via Intrinsic Rewards
por: Bartos, Marcell, et al.
Publicado: (2026)

Tail Distribution of Regret in Optimistic Reinforcement Learning
por: Khodadadian, Sajad, et al.
Publicado: (2025)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
por: Jiang, Tao, et al.
Publicado: (2025)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
por: Yan, Yu-Hu, et al.
Publicado: (2025)

Optimistic Online Non-stochastic Control via FTRL
por: Mhaisen, Naram, et al.
Publicado: (2024)

Layer-wise Quantization for Quantized Optimistic Dual Averaging
por: Nguyen, Anh Duc, et al.
Publicado: (2025)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
por: Ozaslan, Ibrahim K., et al.
Publicado: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
por: Hutchinson, Spencer, et al.
Publicado: (2024)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing
por: Goldshlager, Gil, et al.
Publicado: (2025)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
por: Shen, Weiping, et al.
Publicado: (2026)

Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise
por: Ramirez, Juan, et al.
Publicado: (2025)

On the Gradient Domination of the LQG Problem
por: Fallah, Kasra, et al.
Publicado: (2025)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
por: Curtis, Frank E., et al.
Publicado: (2023)

Block Decomposable Methods for Large-Scale Optimization Problems
por: Maia, Leandro Farias
Publicado: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
por: Zhang, Liang, et al.
Publicado: (2023)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
por: Zhang, Huiling, et al.
Publicado: (2024)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
por: Borodich, Ekaterina, et al.
Publicado: (2025)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
por: Xu, Yewei, et al.
Publicado: (2026)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
por: Zhou, Yijie, et al.
Publicado: (2025)

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
por: Choudhury, Sayantan, et al.
Publicado: (2025)

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
por: Lin, Wu, et al.
Publicado: (2024)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
por: Phunyaphibarn, Prin, et al.
Publicado: (2023)