Diamond, S. and Boyd, S. CVXPY: A Python-embedded modeling language for convex optimization. Journal of Machine Learning Research, 17(83):1-5, 2016.
Donsker, M. D. and Varadhan, S. S. Asymptotic evaluation of certain Markov process expectations for large time—iii. Communications on pure and applied Mathematics, 29(4):389–461, 1976.
Dua, D. and Graff, C. UCI machine learning repository, 2017. URL http://archive.ics.uci.edu/ml.
Durand, A., Maillard, O.-A., and Pineau, J. Streaming kernel regression with provably adaptive mean, variance, and regularization. The Journal of Machine Learning Research, 19(1):650-683, 2018.
Grünwald, P. D. The minimum description length principle. MIT press, 2007.
Grunwald, P. D. The e-posterior. Philosophical Transactions of the Royal Society A, 381(2247): 20220146, 2023.
Guedj, B. A primer on PAC-Bayesian learning. In Proceedings of the second congress of the French Mathematical Society, volume 33, 2019. URL https://arxiv.org/abs/1901.05353.
Haddouche, M. and Guedj, B. Online PAC-Bayes learning. In Advances in Neural Information Processing Systems, volume 35, pp. 25725-25738. Curran Associates, Inc., 2022.
Haddouche, M. and Guedj, B. PAC-Bayes generalisation bounds for heavy-tailed losses through supermartingales. Transactions on Machine Learning Research [TMLR], 2023. ISSN 2835-8856. doi: 10.48550/ARXIV.2210.00928. URL https://openreview.net/forum?id=qxrtw6F3sf.
Howard, S. R., Ramdas, A., McAuliffe, J., and Sekhon, J. Time-uniform Chernoff bounds via nonnegative supermartingales. Probability Surveys, 17, 2020.
Kaufmann, E. and Koolen, W. M. Mixture martingales revisited with applications to sequential tests and confidence intervals. The Journal of Machine Learning Research, 22(1):11140-11183, 2021.
Kirschner, J. and Krause, A. Information directed sampling and bandits with heteroscedastic noise. In Conference On Learning Theory, pp. 358-384. PMLR, 2018.
Lai, T. L. On confidence sequences. The Annals of Statistics, pp. 265-280, 1976.
Li, L., Chu, W., Langford, J., and Schapire, R. E. A contextual-bandit approach to personalized news article recommendation. In Proceedings of the 19th international conference on World wide web, pp. 661-670, 2010.
Li, Z. and Scarlett, J. Gaussian process bandit optimization with few batches. In International Conference on Artificial Intelligence and Statistics, pp. 92-107. PMLR, 2022.
McAllester, D. A. Some PAC-Bayesian theorems. In Proceedings of the eleventh annual conference on Computational learning theory, pp. 230-234, 1998.
Molchanov, I. S. Theory of random sets, volume 19. Springer, 2005.
Neiswanger, W. and Ramdas, A. Uncertainty quantification using martingales for misspecified Gaussian processes. In Algorithmic Learning Theory, pp. 963-982. PMLR, 2021.
Petersen, K. B., Pedersen, M. S., et al. The matrix cookbook. Technical University of Denmark, 7 (15), 2008.
Rahimi, A. and Recht, B. Random features for large-scale kernel machines. Advances in neural information processing systems, 20, 2007.
Robbins, H. Statistical methods related to the law of the iterated logarithm. The Annals of Mathematical Statistics, 41(5):1397-1409, 1970.
Robbins, H. and Siegmund, D. Boundary crossing probabilities for the Wiener process and sample sums. The Annals of Mathematical Statistics, pp. 1410-1429, 1970.