Generalization bounds: perspectives from information theory and PAC-Bayes (Q7033677)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Generalization bounds: perspectives from information theory and PAC-Bayes

scientific article; zbMATH DE number 7978373

Language	Label	Description	Also known as
default for all languages	No label defined
English	Generalization bounds: perspectives from information theory and PAC-Bayes	scientific article; zbMATH DE number 7978373

Statements

instance of

scholarly article

0 references

title

Generalization bounds: perspectives from information theory and PAC-Bayes (English)

0 references

0 references

0 references

0 references

0 references

Foundations and Trends in Machine Learning

0 references

publication date

3 February 2025

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The information complexity of learning tasks, their structure and their distance

0 references

Emergence of invariance and disentanglement in deep representations

0 references

A new look at the statistical model identification

0 references

PAC-Bayesian bounds for randomized empirical risk minimizers

0 references

User-friendly Introduction to PAC-Bayes Bounds

0 references

Sparse single-index model

0 references

An oracle inequality for quasi-Bayesian nonnegative matrix factorization

0 references

Simpler PAC-Bayesian bounds for hostile data

0 references

PAC-Bayesian bounds for sparse regression estimation with exponential weights

0 references

On the properties of variational approximations of Gibbs posteriors

0 references

Chaining meets chain rule: multilevel entropic regularization and training of neural networks

0 references

Combining PAC-Bayesian and generic chaining bounds

0 references

The minimum description length principle in coding and modeling

0 references

Minimum complexity density estimation

0 references

Q3148808

0 references

10.1162/153244303321897690

0 references

Learners that use little information

0 references

Algorithmic stability for adaptive data analysis

0 references

Q4954173

0 references

Learnability and the Vapnik-Chervonenkis dimension

0 references

Occam's razor

0 references

Concentration inequalities. A nonasymptotic theory of independence

0 references

10.1162/153244302760200704

0 references

Q4171434

0 references

Q3623263

0 references

Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.

0 references

Wide stochastic networks: Gaussian limit and PAC-Bayesian training

0 references

Elements of Information Theory

0 references

I-divergence geometry of probability distributions and minimization problems

0 references

Information theory. Coding theorems for discrete memoryless systems

0 references

Sharp oracle inequalities for aggregation of affine estimators

0 references

Aggregation by Exponential Weighting and Sharp Oracle Inequalities

0 references

Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity

0 references

Sparse regression learning by aggregation and Langevin Monte-Carlo

0 references

Distribution-free performance bounds for potential function rules

0 references

Asymptotic evaluation of certain markov process expectations for large time, I

0 references

Generalization Error Bounds via Rényi-, <i>f</i>-Divergences and Maximal Leakage

0 references

On Conjugate Convex Functions

0 references

On the mathematical foundations of theoretical statistics.

0 references

PAC-Bayesian lifelong learning for multi-armed bandits

0 references

Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm

0 references

Some limit theorems for empirical processes (with discussion)

0 references

Fast rates for general unbounded loss functions: from ERM to generalized Bayes

0 references

A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity

0 references

Q5133500

0 references

PAC-Bayesian estimation and prediction in sparse additive models

0 references

PAC-Bayesian high dimensional bipartite ranking

0 references

Information-theoretic analysis of minimax excess risk

0 references

Limitations of information-theoretic generalization bounds for gradient descent methods in stochastic convex optimization

0 references

Predicting \(\{ 0,1\}\)-functions on randomly drawn points

0 references

A PAC-Bayesian margin bound for linear classifiers

0 references

A PAC-Bayes Bound for Tailored Density Estimation

0 references

An Operational Approach to Information Leakage

0 references

Transfer Meta-Learning: Information- Theoretic Bounds and Information Meta-Risk Minimization

0 references

Q5333652

0 references

Rademacher penalties and structural risk minimization

0 references

Q4524759

0 references

Concentration of measure without independence: a unified approach via the martingale method

0 references

Concentration inequalities for dependent random variables via the martingale method

0 references

Regularization and the small-ball method. II: Complexity dependent error rates

0 references

Regularization and the small-ball method. I: Sparse recovery

0 references

The importance of convexity in learning with squared loss

0 references

Information Theory and Mixing Least-Squares Regressions

0 references

Distribution-Dependent PAC-Bayes Priors

0 references

Tighter PAC-Bayes bounds through distribution-dependent priors

0 references

A quasi-Bayesian perspective to online clustering

0 references

A measure concentration inequality for contracting Markov chains

0 references

Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.

0 references

PAC-Bayesian stochastic model selection

0 references

Learning without concentration

0 references

Learning without concentration for general loss functions

0 references

Foundations of machine learning

0 references

Probabilistic machine learning. An introduction

0 references

Average-case information complexity of learning

0 references

Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization

0 references

Lautum Information

0 references

PAC-Bayes bounds with data dependent priors

0 references

Q5053235

0 references

Some remarks on the value-at-risk and the conditional value-at-risk

0 references

Information-theoretic methods in data science

0 references

Concentration of measure inequalities in information theory, communications, and coding

0 references

STABILITY RESULTS IN LEARNING THEORY

0 references

Chromatic PAC-Bayes bounds for non-IID data: applications to ranking and stationary \(\beta \)-mixing processes

0 references

Sparse estimation by exponential weighting

0 references

Modeling by shortest data description

0 references

A universal prior for integers and estimation by minimum description length

0 references

Convex Analysis

0 references

Upper Bounds on the Generalization Error of Private Algorithms for Discrete Data

0 references

A finite sample distribution-free performance bound for local discrimination rules

0 references

Q4340161

0 references

An information-theoretic analysis of Thompson sampling

0 references

Concentration of measure inequalities for Markov chains and \(\Phi\)-mixing processes.

0 references

On the information bottleneck theory of deep learning

0 references

Estimating the dimension of a model

0 references

PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification

0 references

PAC-Bayesian Inequalities for Martingales

0 references

PAC-Bayesian analysis of co-clustering and beyond

0 references

Active learning

0 references

Understanding machine learning. From theory to algorithms

0 references

Learnability, stability and uniform convergence

0 references

A Mathematical Theory of Communication

0 references

A formal theory of inductive inference. Part I

0 references

On the likelihood that one unkrown probability exeeds another in view of the evidence of two samples.

0 references

Q4375383

0 references

Operational Interpretation of Rényi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions

0 references

A theory of the learnable

0 references

Fast rates in statistical and online learning

0 references

Rényi Divergence and Kullback-Leibler Divergence

0 references

On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

0 references

Q4770512

0 references

High-dimensional probability. An introduction with applications in data science

0 references

High-dimensional statistics. A non-asymptotic viewpoint

0 references

Weak transport inequalities and applications to exponential and oracle inequalities

0 references

Minimum Excess Risk in Bayesian Learning

0 references

Information-theoretic determination of minimax rates of convergence

0 references

Information-theoretic upper and lower bounds for statistical estimation

0 references

Individually Conditional Individual Mutual Information Bound on Generalization Error

0 references

Stochastic chaining and strengthened information-theoretic generalization bounds

0 references

Identifiers

zbMATH Open document ID

1557.682

0 references

DOI

10.1561/2200000112

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Generalization bounds: perspectives from information theory and PAC-Bayes