Fetching the paper…
Reading the bibliography…
Classically, data interpolation with a parametrized model class is possible as long as the number of parameters is larger than the number of equations to be satisfied.
Isoperimetric Inequalities in Riemannian Manifolds
Mikhael Gromov · 1986
Earlier work this paper cites.
Principal curves
Trevor Hastie and Werner Stuetzle · 1989
Earlier work this paper cites.
Fast nonlinear dimension reduction
Nanda Kambhatla and Todd K Leen · 1993
Earlier work this paper cites.
Poincaré’s inequalities and talagrand’s concentration phenomenon for the exponential distribution
Sergey Bobkov and Michel Ledoux · 1997
Earlier work this paper cites.
Concentration of measure and logarithmic sobolev inequalities
Michel Ledoux · 1999
Earlier work this paper cites.
From brunn-minkowski to brascamp-lieb and to logarithmic sobolev inequalities
Sergey G Bobkov and Michel Ledoux · 2000
Earlier work this paper cites.
Nonlinear dimensionality reduction by locally linear embedding
Sam T Roweis and Lawrence K Saul · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
Joshua B Tenenbaum, Vin De Silva, and John C Langford · 2000
Earlier work this paper cites.
The concentration of measure phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
Sample complexity of testing the manifold hypothesis
Hariharan Narayanan and Sanjoy Mitter · 2010
Earlier work this paper cites.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Earlier work this paper cites.
Probability in high dimension
Ramon van Handel · 2014
Earlier work this paper cites.
Distilling the knowledge in a neural network
Geoffrey Hinton, Oriol Vinyals, and Jeff Dean · 2015
Earlier work this paper cites.
Unitary evolution recurrent neural networks
Martin Arjovsky, Amar Shah, and Yoshua Bengio · 2016
Earlier work this paper cites.
Testing the manifold hypothesis
Charles Fefferman, Sanjoy Mitter, and Hariharan Narayanan · 2016
Cited alongside, same era.
Spectrally-normalized margin bounds for neural networks
Peter L Bartlett, Dylan J Foster, and Matus J Telgarsky · 2017
Cited alongside, same era.
Parseval Networks: Improving Robustness to Adversarial Examples
Moustapha Cisse, Piotr Bojanowski, Edouard Grave, Yann Dauphin, and Nicolas Usunier · 2017
Cited alongside, same era.
Estimating the intrinsic dimension of datasets by a minimal neighborhood information
Elena Facco, Maria d’Errico, Alex Rodriguez, and Alessandro Laio · 2017
Cited alongside, same era.
Efficient orthogonal parametrisation of recurrent neural networks using householder reflections
Zakaria Mhammedi, Andrew Hellicar, Ashfaqur Rahman, and James Bailey · 2017
Cited alongside, same era.
Spectral norm regularization for improving the generalizability of deep learning
On computation and generalization of gans with spectrum control
Haoming Jiang, Zhehui Chen, Minshuo Chen, Feng Liu, Dingding Wang, and Tuo Zhao · 2019
Later among the works it cites.
The generalization error of random features regression: Precise asymptotics and the double descent curve
Song Mei and Andrea Montanari · 2019
Later among the works it cites.
Rademacher complexity for adversarially robust generalization
Dong Yin, Ramchandran Kannan, and Peter Bartlett · 2019
Later among the works it cites.
Small ReLU networks are powerful memorizers: a tight analysis of memorization capacity
Chulhee Yun, Suvrit Sra, and Ali Jadbabaie · 2019
Later among the works it cites.
Network size and size of the weights in memorization with two-layers neural networks
Sebastien Bubeck, Ronen Eldan, Yin Tat Lee, and Dan Mikulincer · 2020
Later among the works it cites.
Benign overfitting in linear regression
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yuichi Yoshida and Takeru Miyato · 2017
Cited alongside, same era.
Justin Gilmer, Luke Metz, Fartash Faghri, Samuel S Schoenholz, Maithra Raghu, Martin Wattenberg, and Ian Goodfellow · 2018
Cited alongside, same era.
Spectral normalization for generative adversarial networks
Takeru Miyato, Toshiki Kataoka, Masanori Koyama, and Yuichi Yoshida · 2018
Cited alongside, same era.
Towards deep learning models resistant to adversarial attacks
Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu · 2018
Cited alongside, same era.
Foundations of Machine Learning
Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar · 2018
Cited alongside, same era.
Sensitivity and generalization in neural networks: an empirical study
Roman Novak, Yasaman Bahri, Daniel A. Abolafia, Jeffrey Pennington, and Jascha Sohl-Dickstein · 2018
Cited alongside, same era.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Cited alongside, same era.
Peter L. Bartlett, Philip M. Long, Gábor Lugosi, and Alexander Tsigler · 2020
Later among the works it cites.
Uncovering the limits of adversarial training against norm-bounded adversarial examples
Sven Gowal, Chongli Qin, Jonathan Uesato, Timothy Mann, and Pushmeet Kohli · 2020
Later among the works it cites.
Deep double descent: Where bigger models and more data hurt
Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever · 2020
Later among the works it cites.
Overfitting in adversarially robust deep learning
Leslie Rice, Eric Wong, and Zico Kolter · 2020
Later among the works it cites.
Intriguing properties of adversarial training at scale
Cihang Xie and Alan Yuille · 2020
Later among the works it cites.
A law of robustness for two-layers neural networks
Sébastien Bubeck, Yuanzhi Li, and Dheeraj M Nagaraj · 2021
Closest in time.
Dimension-free log-sobolev inequalities for mixture distributions
Hong-Bin Chen, Sinho Chewi, and Jonathan Niles-Weed · 2021
Closest in time.
The intrinsic dimension of images and its impact on learning
Phil Pope, Chen Zhu, Ahmed Abdelkader, Micah Goldblum, and Tom Goldstein · 2021
Closest in time.