:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhu, Bowei, Li, Shaojie, Liu, Yong
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2410.08497
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$
by: Zhu, Bowei, et al.
Published: (2024)

Sharper Generalization Bounds for Transformer
by: Li, Yawen, et al.
Published: (2026)

Sharper Risk Bound for Multi-Task Learning with Multi-Graph Dependent Data
by: Shao, Xiao, et al.
Published: (2025)

Towards Sharp Minimax Risk Bounds for Operator Learning
by: Adcock, Ben, et al.
Published: (2025)

Sharper Bounds for Chebyshev Moment Matching, with Applications
by: Musco, Cameron, et al.
Published: (2024)

Sharper Bounds for $\ell_p$ Sensitivity Sampling
by: Woodruff, David P., et al.
Published: (2023)

Sharper Error Bounds in Late Fusion Multi-view Clustering Using Eigenvalue Proportion
by: Du, Liang, et al.
Published: (2024)

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

A Sharper Picture of Generalization in Transformers
by: Lintilhac, Paul, et al.
Published: (2026)

Normalized Square Root: Sharper Matrix Factorization Bounds for Differentially Private Continual Counting
by: Henzinger, Monika, et al.
Published: (2025)

Sharper Guarantees for Misspecified Kernelized Bandit Optimization
by: Maran, Davide, et al.
Published: (2026)

Improved Learning Rates for Stochastic Optimization
by: Li, Shaojie, et al.
Published: (2021)

MRCpy: A Library for Minimax Risk Classifiers
by: Bondugula, Kartheek, et al.
Published: (2021)

Efficient Large-Scale Learning of Minimax Risk Classifiers
by: Bondugula, Kartheek, et al.
Published: (2025)

Minimax Linear Regression under the Quantile Risk
by: Hanchi, Ayoub El, et al.
Published: (2024)

Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods
by: Taheri, Hossein, et al.
Published: (2024)

Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings
by: Markou, Evan, et al.
Published: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

Minimax Optimal Fair Classification with Bounded Demographic Disparity
by: Zeng, Xianli, et al.
Published: (2024)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
by: Zhang, Lijun, et al.
Published: (2023)

Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality
by: Bongole, Raghav, et al.
Published: (2024)

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Nonparametric Instrumental Regression via Kernel Methods is Minimax Optimal
by: Meunier, Dimitri, et al.
Published: (2024)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
by: Zhang, Haochen, et al.
Published: (2026)

Towards Minimax Optimality of Model-based Robust Reinforcement Learning
by: Clavier, Pierre, et al.
Published: (2023)

Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems
by: Kim, Juno, et al.
Published: (2023)

Minimax Generalized Cross-Entropy
by: Bondugula, Kartheek, et al.
Published: (2026)

Existence and Minimax Theorems for Adversarial Surrogate Risks in Binary Classification
by: Frank, Natalie S., et al.
Published: (2022)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Minimax Regret Learning for Data with Heterogeneous Subgroups
by: Mo, Weibin, et al.
Published: (2024)

Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs
by: Boudart, Pierre, et al.
Published: (2026)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
by: Gao, Hongchang
Published: (2022)

Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails
by: Jin, Ruinan, et al.
Published: (2026)

Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD
by: Emmanouilidis, Konstantinos, et al.
Published: (2026)

A Sharper Global Convergence Analysis for Average Reward Reinforcement Learning via an Actor-Critic Approach
by: Ganesh, Swetha, et al.
Published: (2024)

In-Context Learning as Nonparametric Conditional Probability Estimation: Risk Bounds and Optimality
by: Liu, Chenrui, et al.
Published: (2025)

Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization
by: Kim, Kaheon, et al.
Published: (2025)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
by: Yang, Junnan, et al.
Published: (2024)

Minimax Semiparametric Learning With Approximate Sparsity
by: Bradic, Jelena, et al.
Published: (2019)