SlowGuess/NeurIPS_2023_OCR huggingface dataset:
[30] Rémi Bardenet and Adrien Hardy. Monte carlo with determinantal point processes. Annals of Applied Probability, 2020.
[31] Guillaume Gautier, Rémi Bardenet, and Michal Valko. On two ways to use determinantal point processes for monte carlo integration. Advances in Neural Information Processing Systems, 32, 2019.
[32] Satoshi Hayakawa, Harald Oberhauser, and Terry Lyons. Positively weighted kernel quadrature via subsampling. arXiv preprint arXiv:2107.09597, 2021.
[33] Satoshi Hayakawa, Harald Oberhauser, and Terry Lyons. Sampling-based nyström approximation and kernel quadrature. arXiv preprint arXiv:2301.09517, 2023.
[34] Yutian Chen, Max Welling, and Alex Smola. Super-samples from kernel herding. arXiv preprint arXiv:1203.3472, 2012.
[35] Simon Lacoste-Julien, Fredrik Lindsten, and Francis Bach. Sequential kernel herding: Frankwolfe optimization for particle filtering. In Artificial Intelligence and Statistics, pages 544-552. PMLR, 2015.
[36] Ferenc Huszár and David Duvenaud. Optimally-weighted herding is bayesian quadrature. arXiv preprint arXiv:1204.1664, 2012.
[37] Wilson Ye Chen, Lester Mackey, Jackson Gorham, François-Xavier Briol, and Chris Oates. Stein points. In International Conference on Machine Learning, pages 844-853. PMLR, 2018.
[38] Raaz Dwivedi and Lester Mackey. Kernel thinning. arXiv preprint arXiv:2105.05842, 2021.
[39] Raaz Dwivedi and Lester Mackey. Generalized kernel thinning. arXiv preprint arXiv:2110.01593, 2021.
[40] Erich Novak. Deterministic and stochastic error bounds in numerical analysis, volume 1349. Springer, 2006.
[41] Joseph F Traub, GW Wasilkowski, H Wozniakowski, and Erich Novak. Information-based complexity. SIAM Review, 36(3):514-514, 1994.
[42] E Novak and H Wozniakowski. Tractability of multivariate problems, volume i: Linear information, european math. Soc., Zürich, 2(3), 2008.
[43] Erich Novak and Henryk Wozniakowski. Tractability of Multivariate Problems: Standard Information for Functionals, volume 2. European Mathematical Society, 2008.
[44] Nikolai Sergeevich Bakhvalov. On the approximate calculation of multiple integrals. Journal of Complexity, 31(4):502-516, 2015.
[45] Aicke Hinrichs, Erich Novak, Mario Ullrich, and H Wozniakowski. The curse of dimensionality for numerical integration of smooth functions. Mathematics of Computation, 83(290):2853-2863, 2014.
[46] Erich Novak. Some results on the complexity of numerical integration. Monte Carlo and Quasi-Monte Carlo Methods: MCQMC, Leuven, Belgium, April 2014, pages 161-183, 2016.
[47] Aicke Hinrichs, David Krieg, Erich Novak, Joscha Prochno, and Mario Ullrich. On the power of random information. Multivariate Algorithms and information-based complexity, 27:43-64, 2020.
[48] Aicke Hinrichs, David Krieg, Erich Novak, and Jan Vybiral. Lower bounds for integration and recovery in  $l_{2}$ . Journal of Complexity, 72:101662, 2022.
[49] David Krieg and Mathias Sonnleitner. Random points are optimal for the approximation of sobolev functions. arXiv preprint arXiv:2009.11275, 2020.
[50] David Krieg, Erich Novak, and Mathias Sonnleitner. Recovery of sobolev functions restricted to iid sampling. Mathematics of Computation, 91(338):2715-2738, 2022.