Fetching the paper…
Reading the bibliography…
We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales.
S. N. Bernstein, Probability Theory , 4th ed., Moscow-Leningrad, 1946, in Russian
1946
Earlier work this paper cites.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association , vol. 58, no. 301, pp. 13–30, 1963
1963
Earlier work this paper cites.
K. Azuma, “Weighted sums of certain dependent random variables,” Tôhoku Mathematical Journal , vol. 19, no. 3, 1967
1967
Earlier work this paper cites.
M. D. Donsker and S. S. Varadhan, “Asymptotic evaluation of certain Markov process expectations for large time.” Communications on Pure and Applied Mathematics , vol. 28, 1975
1975
Earlier work this paper cites.
D. A. Freedman, “On tail probabilities for martingales,” The Annals of Probability , vol. 3, no. 1, 1975
1975
Earlier work this paper cites.
L. G. Valiant, “A theory of the learnable,” Communications of the Association for Computing Machinery , vol. 27, no. 11, 1984
1984
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . John Wiley & Sons, 1991
1991
Earlier work this paper cites.
P. Dupuis and R. S. Ellis, A Weak Convergence Approach to the Theory of Large Deviations . Wiley-Interscience, 1997
1997
Earlier work this paper cites.
J. Shawe-Taylor and R. C. Williamson, “A PAC analysis of a Bayesian estimator,” in Proceedings of the International Conference on Computational Learning Theory (COLT) , 1997
1997
Earlier work this paper cites.
J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony, “Structural risk minimization over data-dependent hierarchies,” IEEE Transactions on Information Theory , vol. 44, no. 5, 1998
1998
Cited alongside, same era.
D. McAllester, “Some PAC-Bayesian theorems,” in Proceedings of the International Conference on Computational Learning Theory (COLT) , 1998
1998
Cited alongside, same era.
M. Seeger, “PAC-Bayesian generalization error bounds for Gaussian process classification,” Journal of Machine Learning Research , 2002
2002
Cited alongside, same era.
J. Langford and J. Shawe-Taylor, “PAC-Bayes & margins,” in Advances in Neural Information Processing Systems (NIPS) , 2002
2002
Cited alongside, same era.
D. McAllester, “PAC-Bayesian stochastic model selection,” Machine Learning , vol. 51, no. 1, 2003
2003
Cited alongside, same era.
J. Y. Audibert, R. Munos, and C. Szepesvári, “Exploration-exploitation trade-off using variance estimates in multi-armed bandits,” Theoretical Computer Science , 2009
2009
Later among the works it cites.
A. Maurer and M. Pontil, “Empirical Bernstein bounds and sample variance penalization,” in Proceedings of the International Conference on Computational Learning Theory (COLT) , 2009
2009
Later among the works it cites.
Y. Seldin and N. Tishby, “PAC-Bayesian analysis of co-clustering and beyond,” Journal of Machine Learning Research , vol. 11, 2010
2010
Later among the works it cites.
G. Lever, F. Laviolette, and J. Shawe-Taylor, “Distribution-dependent PAC-Bayes priors,” in Proceedings of the International Conference on Algorithmic Learning Theory (ALT) , 2010
2010
Later among the works it cites.
Y. Seldin, P. Auer, F. Laviolette, J. Shawe-Taylor, and R. Ortner, “PAC-Bayesian analysis of contextual bandits,” in Advances in Neural Information Processing Systems (NIPS) , 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Maurer, “A note on the PAC-Bayesian theorem,” www.arxiv.org, 2004
2004
Cited alongside, same era.
V. Mnih, C. Szepesvári, and J.-Y. Audibert, “Empirical Bernstein stopping,” in Proceedings of the International Conference on Machine Learning (ICML) , 2008
2008
Cited alongside, same era.
P. Germain, A. Lacasse, F. Laviolette, and M. Marchand, “PAC-Bayesian learning of linear classifiers,” in Proceedings of the International Conference on Machine Learning (ICML) , 2009
2009
Cited alongside, same era.
2011
Closest in time.
R. M. Gray, Entropy and Information Theory , 2nd ed. Springer, 2011
2011
Closest in time.
A. Beygelzimer, J. Langford, L. Li, L. Reyzin, and R. Schapire, “Contextual bandit algorithms with supervised learning guarantees,” in Proceedings on the International Conference on Artificial Intelligence and Statistics (AISTATS) , 2011
2011
Closest in time.