:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Yu, Hang, Yan, Yu-Hu, Zhao, Peng
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2602.04761
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2025)

Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
por: Zhao, Yuheng, et al.
Publicado: (2025)

Bandit Convex Optimization with Gradient Prediction Adaptivity
por: Wang, Shuche, et al.
Publicado: (2026)

Improved Regret for Bandit Convex Optimization with Delayed Feedback
por: Wan, Yuanyu, et al.
Publicado: (2024)

Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach
por: Yan, Yu-Hu, et al.
Publicado: (2023)

The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization
por: Schliserman, Matan, et al.
Publicado: (2024)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
por: Partohaghighi, Mohammad, et al.
Publicado: (2025)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
por: Liu, Xiaoqi, et al.
Publicado: (2025)

Bandit Convex Optimisation
por: Lattimore, Tor
Publicado: (2024)

Variational Quantum Optimization with Continuous Bandits
por: Wanner, Marc, et al.
Publicado: (2025)

Gradient-Variation Online Learning under Generalized Smoothness
por: Xie, Yan-Feng, et al.
Publicado: (2024)

Mitigating Gradient Overlap in Deep Residual Networks with Gradient Normalization for Improved Non-Convex Optimization
por: Yun, Juyoung
Publicado: (2024)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
por: Zhao, Peng, et al.
Publicado: (2021)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
por: Liu, Zijian, et al.
Publicado: (2025)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
por: Chen, Sijia, et al.
Publicado: (2023)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
por: Zhao, Yuheng, et al.
Publicado: (2026)

HOME-3: High-Order Momentum Estimator with Third-Power Gradient for Convex and Smooth Nonconvex Optimization
por: Zhang, Wei, et al.
Publicado: (2025)

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
por: Ye, Haishan
Publicado: (2026)

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
por: Wan, Yuanyu, et al.
Publicado: (2023)

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

Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification
por: Liu, Haolin, et al.
Publicado: (2024)

Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update
por: Zhang, Yu-Jie, et al.
Publicado: (2025)

CR-LSO: Convex Neural Architecture Optimization in the Latent Space of Graph Variational Autoencoder with Input Convex Neural Networks
por: Rao, Xuan, et al.
Publicado: (2022)

Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
por: Li, Long-Fei, et al.
Publicado: (2024)

Stochastic Gradient Succeeds for Bandits
por: Mei, Jincheng, et al.
Publicado: (2024)

Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
por: Wang, Jing, et al.
Publicado: (2025)

Small Gradient Norm Regret for Online Convex Optimization
por: Gao, Wenzhi, et al.
Publicado: (2026)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
por: Kovalev, Dmitry
Publicado: (2026)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
por: Livni, Roi
Publicado: (2024)

Online Newton Method for Bandit Convex Optimisation
por: Fokkema, Hidde, et al.
Publicado: (2024)

Adaptive Proximal Gradient Method for Convex Optimization
por: Malitsky, Yura, et al.
Publicado: (2023)

An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
por: van Erven, Tim, et al.
Publicado: (2025)

How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization
por: Lowy, Andrew, et al.
Publicado: (2024)

Fréchet Cumulative Covariance Net for Deep Nonlinear Sufficient Dimension Reduction with Random Objects
por: Yuan, Hang, et al.
Publicado: (2025)

All ERMs Can Fail in Stochastic Convex Optimization Lower Bounds in Linear Dimension
por: Burla, Tal, et al.
Publicado: (2026)

Improved Bound for Robust Causal Bandits with Linear Models
por: Yan, Zirui, et al.
Publicado: (2024)

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

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
por: Cao, Jincheng, et al.
Publicado: (2024)

Aggregation of Dependent Expert Distributions in Multimodal Variational Autoencoders
por: Mancisidor, Rogelio A, et al.
Publicado: (2025)

AYLA: Amplifying Gradient Sensitivity via Loss Transformation in Non-Convex Optimization
por: Keslaki, Ben
Publicado: (2025)