Image de couverture de livre

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jia, Zeyu, Polyanskiy, Yury, Rakhlin, Alexander
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
par: Jia, Zeyu, et autres
Publié: (2025)

Rate of convergence of the smoothed empirical Wasserstein distance
par: Block, Adam, et autres
Publié: (2022)

Nonparametric MLE for Gaussian Location Mixtures: Certified Computation and Generic Behavior
par: Polyanskiy, Yury, et autres
Publié: (2025)

Refined Risk Bounds for Unbounded Losses via Transductive Priors
par: Qian, Jian, et autres
Publié: (2024)

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
par: Chen, Fan, et autres
Publié: (2024)

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits
par: Chen, Fan, et autres
Publié: (2025)

Testing and estimation in orthosymmetric Gaussian sequence model
par: Jia, Zeyu, et autres
Publié: (2025)

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
par: Chen, Fan, et autres
Publié: (2026)

Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral
par: Sonoda, Sho, et autres
Publié: (2025)

On the Variance, Admissibility, and Stability of Empirical Risk Minimization
par: Kur, Gil, et autres
Publié: (2023)

Scaling Limits of Long-Context Transformers
par: Bruno, Giuseppe, et autres
Publié: (2026)

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy
par: Chen, Fan, et autres
Publié: (2025)

Do we really need the Rademacher complexities?
par: Bartl, Daniel, et autres
Publié: (2025)

High-accuracy sampling for diffusion models and log-concave distributions
par: Chen, Fan, et autres
Publié: (2026)

Online Estimation via Offline Estimation: An Information-Theoretic Framework
par: Foster, Dylan J., et autres
Publié: (2024)

Beyond Covariance Matrix: The Statistical Complexity of Private Linear Regression
par: Chen, Fan, et autres
Publié: (2025)

On the Natural Gradient of the Evidence Lower Bound
par: Ay, Nihat, et autres
Publié: (2023)

Optimal Lower Bounds for Online Multicalibration
par: Collina, Natalie, et autres
Publié: (2026)

Lower Bounds on the Size of Markov Equivalence Classes
par: Jahn, Erik, et autres
Publié: (2025)

Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
par: Réveillard, William, et autres
Publié: (2025)

On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds
par: Agrawal, Shubhada, et autres
Publié: (2025)

General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions
par: Li, Yicheng
Publié: (2026)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

Near-Optimal Learning and Planning in Separated Latent MDPs
par: Chen, Fan, et autres
Publié: (2024)

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
par: Chen, Siyu, et autres
Publié: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
par: Zhang, Kaihong, et autres
Publié: (2024)

Dimension-Free Bounds for Generalized First-Order Methods via Gaussian Coupling
par: Reeves, Galen
Publié: (2025)

Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
par: Srinivasan, Rishikesh, et autres
Publié: (2025)

Sharp Structure-Agnostic Lower Bounds for General Linear Functional Estimation
par: Jin, Jikai, et autres
Publié: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Likelihood-free hypothesis testing
par: Gerber, Patrik Róbert, et autres
Publié: (2022)

PTF Testing Lower Bounds for Non-Gaussian Component Analysis
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Score Attack: A Lower Bound Technique for Optimal Differentially Private Learning
par: Cai, T. Tony, et autres
Publié: (2023)

High-Rate Quantized Matrix Multiplication II
par: Ordentlich, Or, et autres
Publié: (2026)

Approximation of Maximally Monotone Operators : A Graph Convergence Perspective
par: Furuya, Takashi, et autres
Publié: (2026)

Kernel Two-Sample Tests in High Dimension: Interplay Between Moment Discrepancy and Dimension-and-Sample Orders
par: Yan, Jian, et autres
Publié: (2021)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
par: Diakonikolas, Ilias, et autres
Publié: (2024)

A Limit Theory of Foundation Models: A Mathematical Approach to Understanding Emergent Intelligence and Scaling Laws
par: Shu, Jun, et autres
Publié: (2026)

Query Lower Bounds for Diffusion Sampling
par: Xun, Zhiyang, et autres
Publié: (2026)

A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits
par: Simchi-Levi, David, et autres
Publié: (2022)