SlowGuess/NeurIPS_2023_OCR huggingface dataset:
That said, there are several open and relevant avenues that our work has barely touched upon, such as understanding whether the robustness can be transferred to other algorithms beyond SGD, or addressing the semi-parametric problem when the link function is unknown, along the lines of Bietti et al. [2022], Abbe et al. [2023], Damian et al. [2022], Berthier et al. [2023]. A particularly interesting direction of future work is to extend the analysis of product measures to 'weakly dependent' distributions, motivated by natural images where locality in pixels captures most (but not all) of the statistical dependencies. Stein's method appears to be a powerful framework that can accommodate such weak dependencies, and deserves future investigation.
Acknowledgements This work was partially supported by NSF DMS 2134216, NSF CAREER CIF 1845360, NSF IIS 1901091 and the Alfred P Sloan Foundation.
F Ursell. Integrals with nearly coincident branch points: Gegenbauer polynomials of large degree. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 463(2079): 697-710, 2007.
George Neville Watson. A treatise on the theory of Bessel functions, volume 3. The University Press, 1922.
Lei Wu. Learning a single neuron for non-monotonic activation functions. In International Conference on Artificial Intelligence and Statistics, pages 4178-4197. PMLR, 2022.
Gilad Yehudai and Ohad Shamir. Learning a single neuron with gradient methods. In *Conference on Learning Theory*, pages 3756-3786. PMLR, 2020.