Cover Image

Which Algorithms Have Tight Generalization Bounds?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gastpar, Michael, Nachum, Ido, Shafer, Jonathan, Weinberger, Thomas
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Structure of Cross-Validation Error: Stability, Covariance, and Minimax Limits
by: Nachum, Ido, et al.
Published: (2025)

Minimax Limits of k-Fold Cross-Validation via Majority
by: Nachum, Ido, et al.
Published: (2026)

Batch Normalization Decomposed
by: Nachum, Ido, et al.
Published: (2024)

Block-Sample MAC-Bayes Generalization Bounds
by: Frey, Matthias, et al.
Published: (2026)

Optimal Mistake Bounds for Transductive Online Learning
by: Chase, Zachary, et al.
Published: (2025)

Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2024)

The Conditional Regret-Capacity Theorem for Batch Universal Prediction
by: Bondaschi, Marco, et al.
Published: (2025)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective
by: Yao, Yunzhen, et al.
Published: (2025)

Non-Asymptotic Analysis of Efficiency in Conformalized Regression
by: Yao, Yunzhen, et al.
Published: (2025)

Tight Generalization Bounds for Noiseless Inverse Optimization
by: Fatemi, Pouria, et al.
Published: (2026)

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

An Optimal Tightness Bound for the Simulation Lemma
by: Lobel, Sam, et al.
Published: (2024)

Tight Bounds for Logistic Regression with Large Stepsize Gradient Descent in Low Dimension
by: Crawshaw, Michael, et al.
Published: (2026)

Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Clipping Bias and Remedies
by: Li, Qiang, et al.
Published: (2024)

Tight Generalization Error Bounds for Stochastic Gradient Descent in Non-convex Learning
by: Xiong, Wenjun, et al.
Published: (2025)

Tight Bounds for Jensen's Gap with Applications to Variational Inference
by: Mazur, Marcin, et al.
Published: (2025)

Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)

Reliable Abstention under Adversarial Injections: Tight Lower Bounds and New Upper Bounds
by: Edelman, Ezra, et al.
Published: (2026)

Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers
by: Grishina, Ekaterina, et al.
Published: (2024)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)

Style Classification of Rabbinic Literature for Detection of Lost Midrash Tanhuma Material
by: Tannor, Shlomo, et al.
Published: (2022)

Tight Bounds for Learning Polyhedra with a Margin
by: Patel, Shyamal, et al.
Published: (2026)

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

Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback
by: Huang, Ruiyuan, et al.
Published: (2025)

Tight Lower Bounds and Improved Convergence in Performative Prediction
by: Khorsandi, Pedram, et al.
Published: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2024)

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
by: Mussi, Marco, et al.
Published: (2024)

Tight Bounds for Answering Adaptively Chosen Concentrated Queries
by: Rapoport, Emma, et al.
Published: (2025)

Tight Bounds for Schrödinger Potential Estimation in Unpaired Data Translation
by: Puchkin, Nikita, et al.
Published: (2025)

Oblivious Defense in ML Models: Backdoor Removal without Detection
by: Goldwasser, Shafi, et al.
Published: (2024)

Algorithm- and Data-Dependent Generalization Bounds for Diffusion Models
by: Dupuis, Benjamin, et al.
Published: (2025)

Locally Private Parametric Methods for Change-Point Detection
by: Yadav, Anuj Kumar, et al.
Published: (2026)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
by: Chase, Zachary, et al.
Published: (2025)

SDP-CROWN: Efficient Bound Propagation for Neural Network Verification with Tightness of Semidefinite Programming
by: Chiu, Hong-Ming, et al.
Published: (2025)

Generalization Bounds for Markov Algorithms through Entropy Flow Computations
by: Dupuis, Benjamin, et al.
Published: (2025)

Measuring the Data
by: Cohen, Ido
Published: (2025)

Deep Neural Networks as Iterated Function Systems and a Generalization Bound
by: Vacher, Jonathan
Published: (2026)

Landscape Features in Single-Objective Continuous Optimization: Have We Hit a Wall in Algorithm Selection Generalization?
by: Cenikj, Gjorgjina, et al.
Published: (2025)

Never Train from Scratch: Fair Comparison of Long-Sequence Models Requires Data-Driven Priors
by: Amos, Ido, et al.
Published: (2023)