[1] R. Bassily, K. Nissim, A. D. Smith, T. Steinke, U. Stemmer, and J. R. Ullman. Algorithmic stability for adaptive data analysis. Proceedings of the SIAM Journal on Computing, 50(3), 2021.
[2] O. Bastani, V. Gupta, C. Jung, G. Noarov, R. Ramalingam, and A. Roth. Practical adversarial multivalid conformal prediction, 2022.
[3] A. Blum and T. Lykouris. Advancing subgroup fairness via sleeping experts. In T. Vidick, editor, Proceedings of the ACM Conference on Innovations in Theoretical Computer Science Conference (ITCS), 2020.
[4] A. Blum, N. Haghtalab, A. D. Procaccia, and M. Qiao. Collaborative PAC learning. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems 30, pages 2392-2401. Curran Associates, Inc., 2017.
[5] A. Daniely, A. Gonen, and S. Shalev-Shwartz. Strongly adaptive online learning. In F. R. Bach and D. M. Blei, editors, Proceedings of the International Conference on Machine Learning (ICML), volume 37 of Proceedings of the Journal of Machine Learning Research, pages 1405-1411. JMLR.org, 2015.
[6] A. P. Dawid. The well-calibrated Bayesian. Journal of the American Statistical Association, 77 (379):605-610, 1982.
[7] C. Dwork, M. P. Kim, O. Reingold, G. N. Rothblum, and G. Yona. Outcome indistinguishability. In Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1095-1108. ACM, 2021.
[8] C. Dwork, D. Lee, H. Lin, and P. Tankala. New insights into multicalibration, 2023.
[9] D. Foster and R. Vohra. Calibrated learning and correlated equilibrium. Games and Economic Behavior, 21:40-55, 1997.
[10] D. P. Foster. A proof of calibration via blackwell's approachability theorem. Games and Economic Behavior, 29(1-2):73-78, 1999.
[11] D. P. Foster and S. M. Kakade. Calibration via regression. In G. Seroussi and A. Viola, editors, Proceedings of 2006 IEEE Information Theory Workshop, pages 82-86. IEEE, 2006.
[12] D. P. Foster and R. V. Vohra. Asymptotic calibration. Biometrika, 85(2):379-390, 1998.
[13] Y. Freund and R. E. Schapire. Game theory, on-line prediction and boosting. In A. Blum and M. J. Kearns, editors, Proceedings of the Conference on Learning Theory (COLT), pages 325-332. ACM, 1996.
[14] Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
[15] P. Gaillard, G. Stoltz, and T. van Erven. A second-order bound with excess losses. In M. Balcan, V. Feldman, and C. Szepesvári, editors, Proceedings of the Conference on Learning Theory (COLT), volume 35 of Proceedings of the Journal of Machine Learning Research, pages 176-196. JMLR.org, 2014.
[16] P. Gopalan, A. T. Kalai, O. Reingold, V. Sharan, and U. Wieder. Omnipredictors. In M. Braverman, editor, Proceedings of the ACM Conference on Innovations in Theoretical Computer Science Conference (ITCS), pages 79:1-79:21, 2022.
[17] P. Gopalan, M. P. Kim, M. Singhal, and S. Zhao. Low-degree multicalibration. In P.-L. Loh and M. Raginsky, editors, Proceedings of the Conference on Learning Theory (COLT), pages 3193-3234. PMLR, 2022.
[18] V. Gupta, C. Jung, G. Noarov, M. M. Pai, and A. Roth. Online multivalid learning: Means, moments, and prediction intervals. In M. Braverman, editor, Proceedings of the ACM Conference on Innovations in Theoretical Computer Science Conference (ITCS), pages 82:1-82:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[19] N. Haghtalab, M. I. Jordan, and E. Zhao. On-demand sampling: Learning optimally from multiple distributions. In S. Bengio, H. M. Wallach, H. Larochelle, K. Grauman, N. Cesà-Bianchi, and R. Garnett, editors, Advances in Neural Information Processing Systems, 2022.