Publisher
Springer Nature Switzerland
Reference12 articles.
1. Baranyai, Z.: On the factrization of the complete uniform hypergraphs. Infinite Finite Sets 1 (1974). https://cir.nii.ac.jp/crid/1571417125147391744
2. Bassily, R., Nissim, K., Smith, A., Steinke, T., Stemmer, U., Ullman, J.: Algorithmic stability for adaptive data analysis. SIAM J. Comput. 50(3), STOC16-377–STOC16-405 (2021). https://doi.org/10.1137/16M1103646
3. Blum, A., Furst, M.L., Jackson, J.C., Kearns, M.J., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using fourier analysis. In: Leighton, F.T., Goodrich, M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23–25 May 1994, Montréal, Québec, Canada, pp. 253–262. ACM (1994). https://doi.org/10.1145/195058.195147
4. Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4), 506–519 (2003)
5. Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.: The reusable holdout: preserving validity in adaptive data analysis. Science 349(6248), 636–638 (2015)