Image de couverture de livre

Comparing Comparators in Generalization Bounds

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hellström, Fredrik, Guedj, Benjamin
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Information Theory Statistics Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Generalization Bounds: Perspectives from Information Theory and PAC-Bayes
par: Hellström, Fredrik, et autres
Publié: (2023)

Change of measure through the Legendre transform
par: Picard-Weibel, Antoine, et autres
Publié: (2022)

Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound
par: Adams, Reuben, et autres
Publié: (2022)

Rapidly Varying Completely Random Measures for Modeling Extremely Sparse Networks
par: Kilian, Valentin, et autres
Publié: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
par: Zhang, Kaihong, 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)

A Method For Bounding Tail Probabilities
par: Zlatanov, Nikola
Publié: (2024)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
par: Kim, Gilhan
Publié: (2026)

Generalization of LiNGAM that allows confounding
par: Suzuki, Joe, et autres
Publié: (2024)

Generalization and Informativeness of Conformal Prediction
par: Zecchin, Matteo, et autres
Publié: (2024)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
par: Fan, Jianqing, et autres
Publié: (2025)

Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models
par: Zhang, Yihan, et autres
Publié: (2022)

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
par: Li, Gen, et autres
Publié: (2023)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
par: Shi, Laixi, et autres
Publié: (2023)

Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
par: Lau, Ivan, et autres
Publié: (2026)

Relationship between Hölder Divergence and Functional Density Power Divergence: Intersection and Generalization
par: Kobayashi, Masahiro
Publié: (2025)

Efficient Unbiased Sparsification
par: Barnes, Leighton, et autres
Publié: (2024)

Generating Rectifiable Measures through Neural Networks
par: Riegler, Erwin, et autres
Publié: (2024)

Variational Optimality of Föllmer Processes in Generative Diffusions
par: Chen, Yifan, et autres
Publié: (2026)

Spectral Ranking Inferences based on General Multiway Comparisons
par: Fan, Jianqing, et autres
Publié: (2023)

Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing
par: Zhang, Yihan, et autres
Publié: (2023)

Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection
par: Liu, Jingbo
Publié: (2024)

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

Optimal Estimation in Orthogonally Invariant Generalized Linear Models: Spectral Initialization and Approximate Message Passing
par: Zhang, Yihan, et autres
Publié: (2026)

Generalization and Informativeness of Weighted Conformal Risk Control Under Covariate Shift
par: Zecchin, Matteo, et autres
Publié: (2025)

On the sample complexity of parameter estimation in logistic regression with normal design
par: Hsu, Daniel, et autres
Publié: (2023)

$L^1$ Estimation: On the Optimality of Linear Estimators
par: Barnes, Leighton P., et autres
Publié: (2023)

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression
par: Ioushua, Shahar Stein, et autres
Publié: (2023)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
par: Rajaraman, Nived, et autres
Publié: (2023)

A unified recipe for deriving (time-uniform) PAC-Bayes bounds
par: Chugg, Ben, et autres
Publié: (2023)

Mixed Regression via Approximate Message Passing
par: Tan, Nelvin, et autres
Publié: (2023)

Fine-Grained Uncertainty Quantification via Collisions
par: Friedbaum, Jesse, et autres
Publié: (2024)

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
par: Dmitriev, Daniil, et autres
Publié: (2026)

Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
par: Dudeja, Rishabh, et autres
Publié: (2022)

Online Clustering of Data Sequences with Bandit Information
par: Chandran, G Dhinesh, et autres
Publié: (2025)

Sample efficient inductive matrix completion with noise and inexact side information
par: Yang, Yuepeng, et autres
Publié: (2026)

Top-$K$ ranking with a monotone adversary
par: Yang, Yuepeng, et autres
Publié: (2024)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
par: Liang, Jiaming, et autres
Publié: (2024)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
par: Chen, Haohua, et autres
Publié: (2025)

Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
par: Lovig, Max
Publié: (2026)