Fetching the paper…
Reading the bibliography…
Aggregated predictors are obtained by making a set of basic predictors vote according to some weights, that is, to some probability distribution.
“Deviation optimal learning using greedy Q Q -aggregation”
D. Dai, P. Rigollet and T. Zhang · 1905
Earlier work this paper cites.
“Chromatic PAC-Bayes bounds for non-i.i.d. data: Applications to ranking and stationary β \beta -mixing processes”
L. Ralaivola, M. Szafranski and G. Stempfel · 1956
Earlier work this paper cites.
“Information theory and statistics”
S. Kullback · 1959
Earlier work this paper cites.
“The uniform convergence of frequencies of the appearance of events to their probabilities”
V.. Vapnik and A.. Chervonenkis · 1968
Earlier work this paper cites.
“Prediction and limiting synthesis of recursively enumerable classes of functions”
J. Barzdinš and R. Freivalds · 1974
Earlier work this paper cites.
“Asymptotic evaluation of certain Markov process expectations for large time. III.”
M.. Donsker and S.. Varadhan · 1976
Earlier work this paper cites.
“Modeling by shortest data description”
J. Rissanen · 1978
Earlier work this paper cites.
“A theory of the learnable”
L. Valiant · 1984
Earlier work this paper cites.
“The weighted majority algorithm”
N. Littlestone and M.. Warmuth · 1989
Earlier work this paper cites.
“Aggregating strategies”
V.. Vovk · 1990
Earlier work this paper cites.
“Asymptotically minimax adaptive estimation I: upper bounds”
O. Lepski · 1992
Earlier work this paper cites.
“Keeping the neural networks simple by minimizing the description length of the weights”
G.. Hinton and D. Van · 1993
Earlier work this paper cites.
“A probabilistic theory of pattern recognition”
L. Devroye, L. Györfi and G. Lugosi · 1996
Earlier work this paper cites.
“How to use expert advice”
N. Cesa-Bianchi et al · 1997
Earlier work this paper cites.
“A PAC analysis of a Bayes estimator”
J. Shawe-Taylor and R. Williamson · 1997
Earlier work this paper cites.
“The minimum description length principle in coding and modeling”
A. Barron, J. Rissanen and B. Yu · 1998
Earlier work this paper cites.
“Some PAC-Bayesian theorems”
D.. Mc\-All\-ester · 1998
Earlier work this paper cites.
“Concentration”
C. McDiarmid · 1998
Earlier work this paper cites.
“Statistical learning theory”
V. Vapnik · 1998
Earlier work this paper cites.
“Averaging expert predictions”
J. Kivinen and M.. Warmuth · 1999
Earlier work this paper cites.
“Smooth discrimination analysis”
E. Mammen and A.. Tsybakov · 1999
Earlier work this paper cites.
“PAC-Bayesian model averaging”
D.. McAllester · 1999
Earlier work this paper cites.
“Functional aggregation for nonparametric regression”
A. Juditsky and A. Nemirovski · 2000
Earlier work this paper cites.
“Topics in non-parametric statistics”
A. Nemirovski · 2000
Earlier work this paper cites.
“Inégalités de Hoeffding pour les fonctions lipschitziennes de suites dépendantes”
E. Rio · 2000
Earlier work this paper cites.
“Concentration of measure inequalities for Markov chains and Φ \Phi -mixing processes”
P.-M. Samson · 2000
Earlier work this paper cites.
“Bounds for averaging classifiers”
J. Langford and M. Seeger · 2001
Earlier work this paper cites.
“Adaptive regression by mixing”
Y. Yang · 2001
Earlier work this paper cites.
“A PAC-Bayesian margin bound for linear classifiers”
R. Herbrich and T. Graepel · 2002
Earlier work this paper cites.
“(Not) bounding the true error”
J. Langford and R. Caruana · 2002
Earlier work this paper cites.
“PAC-Bayes & margins”
J. Langford and J. Shawe-Taylor · 2002
Earlier work this paper cites.
“PAC-Bayesian generalisation error bounds for Gaussian process classification”
M. Seeger · 2002
Earlier work this paper cites.
“A PAC-Bayesian approach to adaptive classification”
O. Catoni · 2003
Earlier work this paper cites.
“Microchoice bounds and self-bounding learning algorithms”
J. Langford and A. Blum · 2003
Earlier work this paper cites.
“PAC-Bayesian stochastic model selection”
D.. McAllester · 2003
Earlier work this paper cites.
“Generalization error bounds for Bayesian mixture algorithms”
R. Meir and T. Zhang · 2003
Earlier work this paper cites.
“Bayesian Gaussian process models: PAC-Bayesian generalisation error bounds and sparse approximations”, 2003
M. Seeger · 2003
Earlier work this paper cites.
“Optimal rates of aggregation”
A.. Tsybakov · 2003
Earlier work this paper cites.
“PAC-Bayesian statistical learning theory”
J.-Y. Audibert · 2004
Earlier work this paper cites.
“Statistical learning theory and stochastic optimization”, Saint-Flour Summer School on Probability Theory 2001 (Jean Picard ed.), Lecture Notes in Mathematics
O. Catoni · 2004
Earlier work this paper cites.
“A note on the PAC Bayesian theorem”
A. Maurer · 2004
Earlier work this paper cites.
“Aggregating regression procedures to improve performance”
Y. Yang · 2004
Earlier work this paper cites.
“Transductive and inductive adaptative inference for regression and density estimation”
P; Alquier · 2006
Earlier work this paper cites.
“Tighter PAC-Bayes bounds”
A. Ambroladze, E. Parrado-hernández and J. Shawe-taylor · 2006
Earlier work this paper cites.
“On Bayesian bounds”
A. Banerjee · 2006
Earlier work this paper cites.
“Convexity, classification, and risk bounds”
P.. Bartlett, M.. Jordan and J.. McAuliffe · 2006
Earlier work this paper cites.
“Empirical minimization”
P.. Bartlett and S. Mendelson · 2006
Earlier work this paper cites.
“Prediction, learning, and games”
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
“PAC-Bayes bounds for the risk of the majority vote and the variance of the Gibbs classifier”
A. Lacasse et al · 2006
Earlier work this paper cites.
“Information theory and mixing least-squares regressions”
G. Leung and A.. Barron · 2006
Earlier work this paper cites.
“Information-theoretic upper and lower bounds for statistical estimation”
T. Zhang · 2006
Earlier work this paper cites.
“Combining PAC-Bayesian and generic chaining bounds”
J.-Y. Audibert and O. Bousquet · 2007
Earlier work this paper cites.
“Occam’s hammer”
G. Blanchard and F. Fleuret · 2007
Earlier work this paper cites.
“PAC-Bayesian supervised classification: The thermodynamics of statistical learning”, Institute of Mathematical Statistics Lecture Notes – Monograph Series, 56
O. Ca\-toni · 2007
Earlier work this paper cites.
“Weak dependence”
J. Dedecker et al · 2007
Earlier work this paper cites.
“Optimal rates and adaptation in the single-index model using aggregation”
S. Gaïffas and G. Lecué · 2007
Earlier work this paper cites.
“The minimum description length principle”
P.. Grünwald · 2007
Earlier work this paper cites.
“Aggregation procedures: optimality and fast rates”, 2007
G. Lecué · 2007
Earlier work this paper cites.
“PAC-Bayesian bounds for randomized empirical risk minimizers”
P. Alquier · 2008
Earlier work this paper cites.
“Sequential procedures for aggregating arbitrary estimators of a conditional mean”
F. Bunea and A. Nobel · 2008
Earlier work this paper cites.
“Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity”
A.. Dalalyan and A.. Tsybakov · 2008
Earlier work this paper cites.
“Gibbs posterior for variable selection in high-dimensional classification and data mining”
W. Jiang and M.. Tanner · 2008
Earlier work this paper cites.
“Learning by mirror averaging”
A. Juditsky, P. Rigollet and A.. Tsybakov · 2008
Earlier work this paper cites.
“On the complexity of linear prediction: Risk bounds, margin bounds, and regularization”
S.. Kakade, K. Sridharan and A. Tewari · 2008
Earlier work this paper cites.
“Fast learning rates in statistical inference through aggregation”
J.-Y. Audibert · 2009
Earlier work this paper cites.
“PAC-Bayesian learning of linear classifiers”
P. Germain, A. Lacasse, F. Laviolette and M. Marchand · 2009
Earlier work this paper cites.
“A PAC-Bayes bound for tailored density estimation”
M. Higgs and J. Shawe-Taylor · 2010
Earlier work this paper cites.
“Distribution-dependent PAC-Bayes Priors”
G. Lever, F. Laviolette and J. Shawe-Taylor · 2010
Earlier work this paper cites.
“PAC-Bayesian analysis of co-clustering and beyond.”
Y. Seldin and N. Tishby · 2010
Earlier work this paper cites.
“Deviation inequalities for sums of weakly dependent time series”
O. Wintenberger · 2010
Earlier work this paper cites.
“PAC-Bayesian bounds for sparse regression estimation with exponential weights”
P. Alquier and K. Lounici · 2011
Earlier work this paper cites.
“Robust linear least squares regression”
J.-Y. Audibert and O. Catoni · 2011
Earlier work this paper cites.
“Machine learning, PAC-learning”
F. Fleuret · 2011
Earlier work this paper cites.
“From PAC-Bayes bounds to quadratic programs for majority votes”
F. Laviolette, M. Marchand and J.-F. Roy · 2011
Earlier work this paper cites.
“PAC-Bayesian analysis of contextual bandits”
Y. Seldin et al · 2011
Earlier work this paper cites.
“Online learning and online convex optimization”
S. Shalev-Shwartz · 2011
Earlier work this paper cites.
“Model selection for weakly dependent time series forecasting”
P. Alquier and O. Wintenberger · 2012
Earlier work this paper cites.
“Regret analysis of stochastic and nonstochastic multi-armed bandit problems”
S. Bubeck and N. Cesa-Bianchi · 2012
Earlier work this paper cites.
“Challenging the empirical mean and empirical variance: a deviation study”
O. Catoni · 2012
Earlier work this paper cites.
“Interactions between compressed sensing random matrices and high dimensional geometry”
D. Chafaï, O. Guédon, G. Lecué and A. Pajor · 2012
Earlier work this paper cites.
“Sharp oracle inequalities for aggregation of affine estimators”
A.. Dalalyan and J. Salmon · 2012
Earlier work this paper cites.
“Sparse regression learning by aggregation and Langevin Monte-Carlo”
A.. Dalalyan and A.. Tsybakov · 2012
Earlier work this paper cites.
“PAC-Bayes bounds with data dependent priors”
E. Parrado-Hernández, A. Ambroladze, J. Shawe-Taylor and S. Sun · 2012
Earlier work this paper cites.
“PAC-Bayes-Bernstein inequality for martingales and its application to multiarmed bandits”
Y. Seldin et al · 2012
Cited alongside, same era.
“PAC-Bayesian inequalities for martingales”
Y. Seldin et al · 2012
Cited alongside, same era.
“PAC-Bayesian bound for Gaussian process regression and multiple kernel additive model”
T. Suzuki · 2012
Cited alongside, same era.
“Bayesian methods for low-rank matrix estimation: short survey and theoretical study”
P. Alquier · 2013
Cited alongside, same era.
“Sparse single-index model.”
P. Alquier and G. Biau · 2013
Cited alongside, same era.
“Prediction of time series by statistical learning: general losses and fast rates”
P. Alquier, X. Li and O. Wintenberger · 2013
Cited alongside, same era.
“Generalization bounds via information density and conditional information density”
F. Hellström and G. Durisi · 2020
Later among the works it cites.
“Asymptotic consistency of α \alpha -Rényi-approximate posteriors”
P. Jaiswal, V. Rao and H. Honnappa · 2020
Later among the works it cites.
“PAC-Bayesian generalization bounds for multiLayer perceptrons”
X. Lan, X. Guo and K.. Barner · 2020
Later among the works it cites.
“A limitation of the PAC-Bayes framework”
R. Livni and S. Moran · 2020
Later among the works it cites.
“Second order PAC-Bayesian bounds for the weighted majority vote”
A. Masegosa, S. Lorenzen, C. Igel and Y. Seldin · 2020
Later among the works it cites.
“Learning under model misspecification: Applications to variational and ensemble methods”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Concentration inequalities”
S. Bou\-che\-ron, G. Lugosi and P. Massart · 2013
Cited alongside, same era.
“PAC-Bayesian estimation and prediction in sparse additive models”
B. Guedj and P. Alquier · 2013
Cited alongside, same era.
“On the optimality of the aggregate with exponential weights for low temperatures”
G. Lecué and S. Mendelson · 2013
Cited alongside, same era.
“Tighter PAC-Bayes bounds through distribution-dependent priors”
G. Lever, F. Laviolette and J. Shawe-Taylor · 2013
Cited alongside, same era.
“A PAC-Bayesian tutorial with a dropout bound”
D.. McAllester · 2013
Cited alongside, same era.
“PAC-Bayes-empirical-Bernstein inequality”
I. Tolstikhin and Y. Seldin · 2013
Cited alongside, same era.
A.. Masegosa · 2020
Later among the works it cites.
“PAC-Bayesian contrastive unsupervised representation learning”
K. Nozawa, P. Germain and B. Guedj · 2020
Later among the works it cites.
“Randomized learning and generalization of fair and private classifiers: From PAC-Bayes to stability and differential privacy”
L. Oneto, M. Donini, M. Pontil and J. Shawe-Taylor · 2020
Later among the works it cites.
“Dissecting non-vacuous generalization bounds based on the mean-field approximation”
K. Pitas · 2020
Later among the works it cites.
“Dynamics of coordinate ascent variational inference: A case study in 2D Ising models”
S. Plummer, D. Pati and A. Bhattacharya · 2020
Later among the works it cites.
“PAC-Bayes analysis beyond the usual bounds”
O. Rivasplata, I. Kuzborskij, C. Szepesvári and J. Shawe-Taylor · 2020
Later among the works it cites.
“Reasoning about generalization via conditional mutual information”
T. Steinke and L. Zakynthinou · 2020
Later among the works it cites.
“Generalization bound of globally optimal non-convex neural network training: Transportation map estimation by infinite dimensional Langevin dynamics”
T. Suzuki · 2020
Later among the works it cites.
“Normalized flat minima: Exploring scale invariant definition of flat minima for neural networks using PAC-Bayesian analysis”
Y. Tsuzuku, I. Sato and M. Sugiyama · 2020
Later among the works it cites.
“ α \alpha -variational inference with statistical guarantees”
Y. Yang, D. Pati and A. Bhattacharya · 2020
Later among the works it cites.
“Convergence rates of variational posterior distributions”
F. Zhang and C. Gao · 2020
Later among the works it cites.
“Characterizing the deneralization error of Gibbs algorithm with symmetrized KL information”
G. Aminian et al · 2021
Closest in time.
“New bounds for k k -means and information k k -means”
G. Appert and O. Catoni · 2021
Closest in time.
“On the robustness to misspecification of α \alpha -posteriors and their variational approximations”
M. Avena, J.. Montiel, C. Rush and A. Velez · 2021
Closest in time.
“PAC-Bayes bounds on variational tempered posteriors for Markov models”
I. Banerjee, V.. Rao and H. Honnappa · 2021
Closest in time.
“Information complexity and generalization bounds”
P.. Banerjee and G. Montúfar · 2021
Closest in time.
“Bayesian inference in high-dimensional models”
S. Banerjee, I. Castillo and S. Ghosal · 2021
Closest in time.
“Differentiable PAC–Bayes objectives with partially aggregated neural networks”
F. Biggs and B. Guedj · 2021
Closest in time.
“Minimax rates for conditional density estimation via empirical entropy”
B. Bilodeau, D.. Foster and D.. Roy · 2021
Closest in time.
“Learning with BOT-Bregman and Optimal Transport divergences”
A. Chee and S. Loustau · 2021
Closest in time.
“On the role of data in PAC-Bayes bounds”
G.. Dziugaite et al · 2021
Closest in time.
“On the role of data in PAC-Bayes”
Gintare Dziugaite et al · 2021
Closest in time.
“PAC-Bayesian theory for stochastic LTI systems”, 2021, pp. 6626–6633
D. Eringis et al · 2021
Closest in time.
“How tight can PAC-Bayes be in the small data regime?”
A… Foong, W.. Bruinsma, D.. Burt and R.. Turner · 2021
Closest in time.
“Loss-based variational Bayes prediction”
D.. Frazier, R. Loaiza-Maya, G.. Martin and B. Koo · 2021
Closest in time.
“PAC-Bayes, MAC-Bayes and conditional mutual information: fast rate bounds that handle general VC classes”
P. Grünwald, T. Steinke and L. Zakynthinou · 2021
Closest in time.
“PAC-Bayes unleashed: generalisation bounds with unbounded losses”
M. Haddouche, B. Guedj, O. Rivasplata and J. Shawe-Taylor · 2021
Closest in time.
“Towards a unified information-theoretic framework for generalization”
M. Haghifam, G.. Dziugaite, S. Moran and D. Roy · 2021
Closest in time.
“Learning partially known stochastic dynamics with empirical PAC-Bayes”
M. Haußmann et al · 2021
Closest in time.
“Transfer meta-learning: Information-theoretic bounds and information meta-risk minimization”
S.. Jose and O. Simeone · 2021
Closest in time.
M.. Khan and H. Rue · 2021
Closest in time.
“PAC-Bayes bounds for meta-learning with data-dependent prior”
T. Liu, J. Lu, Z. Yan and G. Zhang · 2021
Closest in time.
“Statistical generalization performance guarantee for meta-learning with data dependent prior”
T. Liu, J. Lu, Z. Yan and G. Zhang · 2021
Closest in time.
“Online-to-PAC conversions: Generalization bounds via regret analysis”
G. Lugosi and G. Neu · 2021
Closest in time.
“Meta-strategy for learning tuning parameters with guarantees”
D. Meunier and P. Alquier · 2021
Closest in time.
“Information-theoretic generalization bounds for stochastic gradient descent”
G. Neu, G.. Dziugaite, M. Haghifam and D.. Roy · 2021
Closest in time.
“Adaptive variational Bayes: Optimality, computation and applications”
I. Ohn and L. Lin · 2021
Closest in time.
“Novel change of measure inequalities with applications to PAC-Bayesian bounds and Monte Carlo estimation”
Y. Ohnishi and J. Honorio · 2021
Closest in time.
“Tighter risk certificates for neural networks”
M. Pérez-Ortiz, O. Rivasplata, J. Shawe-Taylor and C. Szepesvári · 2021
Closest in time.
“Tighter expected generalization error bounds via Wasserstein distance”
B. Rodríguez-Gálvez, G. Bassi, R; Thobaben and M. Skoglund · 2021
Closest in time.
“PACOH: Bayes-optimal meta-learning with PAC-guarantees”
J. Rothfuss, V. Fortuin, M. Josifoski and A. Krause · 2021
Closest in time.
“PAC-Bayes information bottleneck”
Z; Wang et al · 2021
Closest in time.
“Chebyshev-Cantelli PAC-Bayes-Bennett inequality for the weighted majority vote”
Y.-S. Wu et al · 2021
Closest in time.
N. Zhivotovskiy · 2021
Closest in time.
“On margins and derandomisation in PAC-Bayes”
F. Biggs and B. Guedj · 2022
Closest in time.
“On PAC-Bayesian reconstruction guarantees for VAEs”
B.-E. Chérief-Abdellatif, Y. Shi, A. Doucet and B. Guedj · 2022
Closest in time.
“Conditionally Gaussian PAC-Bayes”
E. Clerico, G. Deligiannidis and A. Doucet · 2022
Closest in time.
“A PAC-Bayes bound for deterministic classifiers”
E. Clerico, G. Deligiannidis, B. Guedj and A. Doucet · 2022
Closest in time.
“Chained generalisation bounds”
E. Clerico, A. Shidani, G. Deligiannidis and A. Doucet · 2022
Closest in time.
“Online PAC-Bayes Learning”
M. Haddouche and B. Guedj · 2022
Closest in time.
“Understanding generalization via leave-one-out conditional mutual information”
M. Haghifam, S. Moran, D.. Roy and G.. Dziugiate · 2022
Closest in time.
“Weight expansion: a new perspective on dropout and generalization”
G. Jin et al · 2022
Closest in time.
“An optimization-centric view on Bayes’ rule: Reviewing and generalizing variational inference”
J. Knoblauch, J. Jewson and T. Damoulas · 2022
Closest in time.
“Generalization bounds via convex analysis”
G. Lugosi and G. Neu · 2022
Closest in time.
“Dimension-free bounds for sum of dependent matrices and operators with heavy-tailed distribution”
S. Nakakita, P. Alquier and M. Imaizumi · 2022
Closest in time.
“A general framework for PAC-Bayes bounds for meta-learning”
A. Rezazadeh · 2022
Closest in time.
“PAC-Bayes training for neural networks: sparsity and uncertainty quantification”
M.. Steffen and M. Trabs · 2022
Closest in time.
“Split-kl and PAC-Bayes-split-kl inequalities for ternary random variables”
Y.-S. Wu and Y. Seldin · 2022
Closest in time.
“Exponential Smoothing for Off-Policy Learning”
I. Aouali, V.-E. Brunel, D. Rohde and A. Korba · 2023
Closest in time.
“A unified recipe for deriving (time-uniform) PAC-Bayes bounds”
B. Chugg, H. Wang and A. Ramdas · 2023
Closest in time.
“Wide stochastic networks: Gaussian limit and PAC-Bayesian training”
E. Clerico, A. Shidani, G. Deligiannidis and A. Doucet · 2023
Closest in time.
“Bayes complexity of learners vs overfitting”
G. Głuch and R. Urbanke · 2023
Closest in time.
“PAC-Bayes generalisation bounds for heavy-tailed losses through supermartingales”
M. Haddouche and B. Guedj · 2023
Closest in time.
“Limitations of information-theoretic generalization bounds for gradient descent methods in stochastic convex optimization”
M. Haghifam et al · 2023
Closest in time.
“Tighter PAC-Bayes Bounds Through Coin-Betting”
K. Jang, K.-S. Jun, I. Kuzborskij and F. Orabona · 2023
Closest in time.
“From bilinear regression to inductive matrix completion: a quasi-Bayesian analysis”
T.. Mai · 2023
Closest in time.
“Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion”
T.. Mai · 2023
Closest in time.
“PAC-Bayesian generalization bounds for adversarial generative models”
So.. Mbacke, F. Clerc and P. Germain · 2023
Closest in time.
“Local Risk Bounds for Statistical Aggregation”
J. Mourtada, T. Vaškevičius and N. Zhivotovskiy · 2023
Closest in time.
“Bayes meets Bernstein at the meta level: an analysis of fast rates in meta-learning with PAC-Bayes”
C. Riou, P. Alquier and B.-E. Chérief-Abdellatif · 2023
Closest in time.
B. Rodrígues-Gálvez, R. Thobaden and M. Skoglund · 2023
Closest in time.
“PAC-Bayesian Offline Contextual Bandits With Guarantees”
O. Sakhi, P. Alquier and N. Chopin · 2023
Closest in time.
“PAC-Bayesian learning of optimization algorithms”
M. Sucker and P. Ochs · 2023
Closest in time.
“Gibbs posterior concentration rates under sub-exponential type losses”
N. Syring and R. Martin · 2023
Closest in time.
“PAC-Bayesian soft actor-critic learning”
B. Tasdighi, A. Akgül, K.. Brink and M. Kandemir · 2023
Closest in time.
“Auto-tune: PAC-Bayes optimization over prior and posterior for neural networks”
X. Zhang, A; Ghosh, G. Liu and R. Wang · 2023
Closest in time.
“The many faces of exponential weights in online learning”
D. Hoeven, T. Erven and W. Kotłowski · 2092
Closest in time.