Cover Image

Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sonoda, Sho, Kasaura, Kazumi, Mizuno, Yuma, Tsukamoto, Kei, Onda, Naoto
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computation and Language Statistics Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Discovering New Theorems via LLMs with In-Context Proof Learning in Lean
by: Kasaura, Kazumi, et al.
Published: (2025)

LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Proving
by: Onda, Naoto, et al.
Published: (2025)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
by: Jia, Zeyu, et al.
Published: (2025)

Statistical Learning Theory in Lean 4: Empirical Processes from Scratch
by: Zhang, Yuanhe, et al.
Published: (2026)

Do we really need the Rademacher complexities?
by: Bartl, Daniel, et al.
Published: (2025)

Generalization Error Bounds for Picard-Type Operator Learning in Nonlinear Parabolic PDEs
by: Taniguchi, Koichi, et al.
Published: (2026)

Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound
by: Adams, Reuben, et al.
Published: (2022)

Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries
by: Lee, Dongmin, et al.
Published: (2026)

Generation of Geodesics with Actor-Critic Reinforcement Learning to Predict Midpoints
by: Kasaura, Kazumi
Published: (2024)

Coupled Entropy: A Goldilocks Generalization for Complex Systems
by: Nelson, Kenric P.
Published: (2025)

Finite-Sample Wasserstein Error Bounds and Concentration Inequalities for Nonlinear Stochastic Approximation
by: Kong, Seo Taek, et al.
Published: (2026)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)

Error Analysis of Discrete Flow with Generator Matching
by: Wan, Zhengyan, et al.
Published: (2025)

Feature Incremental Clustering with Generalization Bounds
by: Zhang, Jing, et al.
Published: (2026)

Transfer Learning with Distance Covariance for Random Forest: Error Bounds and an EHR Application
by: Li, Chenze, et al.
Published: (2025)

Comparing Comparators in Generalization Bounds
by: Hellström, Fredrik, et al.
Published: (2023)

Information-theoretic Generalization Analysis for Expected Calibration Error
by: Futami, Futoshi, et al.
Published: (2024)

Complexity Dependent Error Rates for Physics-informed Statistical Learning via the Small-ball Method
by: Marcondes, Diego
Published: (2025)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)

Poisson Midpoint Method for Log Concave Sampling: Beyond the Strong Error Lower Bounds
by: Srinivasan, Rishikesh, et al.
Published: (2025)

Retrieval-Augmented Generation as Noisy In-Context Learning: A Unified Theory and Risk Bounds
by: Guo, Yang, et al.
Published: (2025)

Benign Overfitting under Learning Rate Conditions for $α$ Sub-exponential Input
by: Okudo, Kota, et al.
Published: (2024)

P-Tensors: a General Formalism for Constructing Higher Order Message Passing Networks
by: Hands, Andrew, et al.
Published: (2023)

PAC-Chernoff Bounds: Understanding Generalization in the Interpolation Regime
by: Masegosa, Andrés R., et al.
Published: (2023)

Characterizing the Generalization Error of Random Feature Regression with Arbitrary Data-Augmentation
by: Morisset, Lucas, et al.
Published: (2026)

Generalization Error Curves for Analytic Spectral Algorithms under Power-law Decay
by: Li, Yicheng, et al.
Published: (2024)

Theoretical Insights into CycleGAN: Analyzing Approximation and Estimation Errors in Unpaired Data Generation
by: Sun, Luwei, et al.
Published: (2024)

Provable Generalization Bounds for Deep Neural Networks with Momentum-Adaptive Gradient Dropout
by: Safder, Adeel
Published: (2025)

Tight Margin-Based Generalization Bounds for Voting Classifiers over Finite Hypothesis Sets
by: Larsen, Kasper Green, et al.
Published: (2025)

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

Quantifying perturbation impacts for large language models
by: Rauba, Paulius, et al.
Published: (2024)

Berezinskii--Kosterlitz--Thouless transition in a context-sensitive random language model
by: Toji, Yuma, et al.
Published: (2024)

Phase transition on a context-sensitive random language model with short range interactions
by: Toji, Yuma, et al.
Published: (2026)

Generalization Bounds and Stopping Rules for Learning with Self-Selected Data
by: Rodemann, Julian, et al.
Published: (2025)

Precise Error Rates for Computationally Efficient Testing
by: Moitra, Ankur, et al.
Published: (2023)

Hallucinations are inevitable but can be made statistically negligible
by: Suzuki, Atsushi, et al.
Published: (2025)

Statistical analysis of Inverse Entropy-regularized Reinforcement Learning
by: Belomestny, Denis, et al.
Published: (2025)

On the Natural Gradient of the Evidence Lower Bound
by: Ay, Nihat, et al.
Published: (2023)

Improved Algorithm and Bounds for Successive Projection
by: Jin, Jiashun, et al.
Published: (2024)

Optimal Lower Bounds for Online Multicalibration
by: Collina, Natalie, et al.
Published: (2026)