No article text was recorded for this version.
data-dependent generalization bounds
Version 1 of 140 papers53 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Generalization Guarantees for Learning Score-Based Branch-and-Cut Policies in Integer Programming
- Blog: An Improved Algorithm for Learning Drifting Discrete Distributions
- Blog: Some Local Measures of Complexity of Convex Hulls and Generalization Bounds
- Blog: PAC-Bayesian bounds for randomized empirical risk minimizers
- Blog: Structural Risk Minimization and Rademacher Complexity for Regression
- Blog: Relative Deviation Margin Bounds
- Blog: Algorithmic Luckiness
- Blog: Generalization error bounds for classifiers trained with interdependent data
- Blog: Sharp uniform convergence bounds through empirical centralization
- Blog: PAC-Bayes & Margins
- Blog: Refined bounds for algorithm configuration: The knife-edge of dual class approximability
- Blog: A Novel Data-Dependent Learning Paradigm for Large Hypothesis Classes
- Blog: Deep Boosting
- Blog: A Note on the Convergence of Denoising Diffusion Probabilistic Models
- Blog: Generalization Guarantees via Algorithm-dependent Rademacher Complexity
- Blog: Dropout: Explicit Forms and Capacity Control
- Blog: A Rademacher Complexity Based Method for Controlling Power and Confidence Level in Adaptive Statistical Analysis
- Blog: A Critique of the Valiant Model
- Blog: Entropy-Based Concentration Inequalities for Dependent Variables
- Blog: Structured Sparsity and Generalization
- Blog: Learning Bounds for Risk-sensitive Learning
- Blog: Data-Dependent Structural Risk Minimization for Perceptron Decision Trees
- Blog: Generalisation in Feedforward Networks
- Blog: Norm-Based Generalisation Bounds for Deep Multi-Class Convolutional Neural Networks
- Blog: Efficient Centrality Maximization with Rademacher Averages
- Blog: Relative Deviation Margin Bounds
- Blog: Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data
- Blog: Toward a Theory of Pattern Discovery
- Blog: Progressive Rademacher Sampling
- Blog: Distribution-dependent sample complexity of large margin learning
- Blog: Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime
- Blog: Hypothesis Set Stability and Generalization
- Blog: MLP Can Provably Generalize Much Better than VC-bounds Indicate
- Blog: In Defense of Uniform Convergence: Generalization via Derandomization with an Application to Interpolating Predictors
- Blog: A Uniform Convergence Bound for the Area Under the ROC Curve
- Blog: Robustness Implies Generalization via Data-Dependent Generalization Bounds
- Blog: Fantastic Generalization Measures are Nowhere to be Found
- Blog: Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory
- Blog: PAC-Bayes-Empirical-Bernstein Inequality
- Blog: Information-theoretic analysis of generalization capability of learning algorithms
History & citation
Current · Permanent link
- This direction split from Tighter Generalization Guarantees Through Data Dependent Complexity (62% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_data_dependent_generalization_bounds_15907bda,
title = {data-dependent generalization bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/data-dependent-generalization-bounds/rdr_15907bda69044a018291438e2b09f707},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_data_dependent_generalization_bounds_15907bda_v1,
title = {data-dependent generalization bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/data-dependent-generalization-bounds/rdr_15907bda69044a018291438e2b09f707/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}