:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhu, Bowei, Li, Shaojie, Yi, Mingyang, Liu, Yong
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	https://arxiv.org/abs/2410.09766
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards Sharper Risk Bounds for Minimax Problems
par: Zhu, Bowei, et autres
Publié: (2024)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
par: Markou, Evan, et autres
Publié: (2025)

Sharper Generalization Bounds for Transformer
par: Li, Yawen, et autres
Publié: (2026)

Sharper Risk Bound for Multi-Task Learning with Multi-Graph Dependent Data
par: Shao, Xiao, et autres
Publié: (2025)

Improved Learning Rates for Stochastic Optimization
par: Li, Shaojie, et autres
Publié: (2021)

Sharper Bounds for Chebyshev Moment Matching, with Applications
par: Musco, Cameron, et autres
Publié: (2024)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
par: Woodruff, David P., et autres
Publié: (2023)

Sharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportion
par: Du, Liang, et autres
Publié: (2024)

Sharper Perturbed-Kullback-Leibler Exponential Tail Bounds for Beta and Dirichlet Distributions
par: Perrault, Pierre
Publié: (2025)

A Sharper Global Convergence Analysis for Average Reward Reinforcement Learning via an Actor-Critic Approach
par: Ganesh, Swetha, et autres
Publié: (2024)

A Sharper Picture of Generalization in Transformers
par: Lintilhac, Paul, et autres
Publié: (2026)

Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
par: Henzinger, Monika, et autres
Publié: (2025)

Linear $Q$-Learning Does Not Diverge in $L^2$: Convergence Rates to a Bounded Set
par: Liu, Xinyu, et autres
Publié: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
par: Maran, Davide, et autres
Publié: (2026)

An $\tilde{O}$ptimal Differentially Private Learner for Concept Classes with VC Dimension 1
par: Yan, Chao
Publié: (2025)

A Parameter-Free First-Order Algorithm for Non-Convex Optimization with $\tilde{\mkern1mu O}(ε^{-5/3})$ Global Rate
par: Xiong, Sichao, et autres
Publié: (2026)

Logistic Bandits with $\tilde{O}(\sqrt{dT})$ Regret without Context Diversity Assumptions
par: Bae, Seoungbin, et autres
Publié: (2026)

Towards a Theoretical Understanding to the Generalization of RLHF
par: Li, Zhaochun, et autres
Publié: (2026)

Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods
par: Taheri, Hossein, et autres
Publié: (2024)

Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2025)

Solving Convex-Concave Problems with $\tilde{\mathcal{O}}(ε^{-4/7})$ Second-Order Oracle Complexity
par: Chen, Lesi, et autres
Publié: (2025)

Convergence Rates for Gradient Descent on the Edge of Stability in Overparametrised Least Squares
par: MacDonald, Lachlan Ewen, et autres
Publié: (2025)

Convergence Rate Analysis of LION
par: Dong, Yiming, et autres
Publié: (2024)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
par: Maiti, Arnab, et autres
Publié: (2026)

Tight Convergence Rate Bounds for Optimization Under Power Law Spectral Conditions
par: Velikanov, Maksim, et autres
Publié: (2022)

Tight Stability, Convergence, and Robustness Bounds for Predictive Coding Networks
par: Mali, Ankur, et autres
Publié: (2024)

Optimal Convergence Rates for Neural Operators
par: Nguyen, Mike, et autres
Publié: (2024)

On the $O(\frac{\sqrt{d}}{K^{1/4}})$ Convergence Rate of AdamW Measured by $\ell_1$ Norm
par: Li, Huan, et autres
Publié: (2025)

Convergence Rates of Constrained Expected Improvement
par: Wang, Haowei, et autres
Publié: (2025)

Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails
par: Jin, Ruinan, et autres
Publié: (2026)

Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD
par: Emmanouilidis, Konstantinos, et autres
Publié: (2026)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
par: Zhou, Zhiling, et autres
Publié: (2024)

A Policy-Gradient Approach to Solving Imperfect-Information Games with Best-Iterate Convergence
par: Liu, Mingyang, et autres
Publié: (2024)

Label-NTK Alignments and A Tighter Convergence Bound in the NTK Regime
par: Marreddy, Ruchirinkil, et autres
Publié: (2026)

Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space
par: Yi, Mingyang, et autres
Publié: (2024)

In-Context Learning as Nonparametric Conditional Probability Estimation: Risk Bounds and Optimality
par: Liu, Chenrui, et autres
Publié: (2025)

When Does $\ell_2$-Boosting Overfit Benignly? High-Dimensional Risk Asymptotics and the $\ell_1$ Implicit Bias
par: Su, Ye, et autres
Publié: (2026)

On the Rate of Convergence of Kolmogorov-Arnold Network Regression Estimators
par: Liu, Wei, et autres
Publié: (2025)

Fast Rate Information-theoretic Bounds on Generalization Errors
par: Wu, Xuetong, et autres
Publié: (2023)

On the Convergence Rate of LoRA Gradient Descent
par: Mu, Siqiao, et autres
Publié: (2025)