Fetching the paper…
Reading the bibliography…
A key challenge facing deep learning is that neural networks are often not robust to shifts in the underlying data distribution.
An introduction to computational learning theory
M. J. Kearns, U. V. Vazirani, and U. Vazirani · 1994
Earlier work this paper cites.
Improving predictive inference under covariate shift by weighting the log-likelihood function
H. Shimodaira · 2000
Earlier work this paper cites.
Rademacher and gaussian complexities: Risk bounds and structural results
P. L. Bartlett and S. Mendelson · 2002
Earlier work this paper cites.
Analysis of representations for domain adaptation
S. Ben-David, J. Blitzer, K. Crammer, and F. Pereira · 2007
Earlier work this paper cites.
Convex sparse matrix factorizations
F. Bach, J. Mairal, and J. Ponce · 2008
Earlier work this paper cites.
Learning bounds for domain adaptation
J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. Wortman · 2008
Earlier work this paper cites.
Linearly parameterized bandits
P. Rusmevichientong and J. N. Tsitsiklis · 2010
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Y. Abbasi-Yadkori, D. Pál, and C. Szepesvári · 2011
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
E. J. Candes and Y. Plan · 2011
Earlier work this paper cites.
Identifiability and unmixing of latent parse trees
D. Hsu, S. M. Kakade, and P. Liang · 2012
Earlier work this paper cites.
Thompson sampling for contextual bandits with linear payoffs
S. Agrawal and N. Goyal · 2013
Earlier work this paper cites.
Intriguing properties of neural networks
C. Szegedy, W. Zaremba, I. Sutskever, J. Bruna, D. Erhan, I. Goodfellow, and R. Fergus · 2013
Earlier work this paper cites.
Explaining and harnessing adversarial examples
I. J. Goodfellow, J. Shlens, and C. Szegedy · 2014
Earlier work this paper cites.
Robust learning under uncertain test distributions: Relating covariate shift to model misspecification
J. Wen, C.-N. Yu, and R. Greiner · 2014
Earlier work this paper cites.
A useful variant of the davis–kahan theorem for statisticians
Y. Yu, T. Wang, and R. J. Samworth · 2015
Earlier work this paper cites.
Neural module networks
J. Andreas, M. Rohrbach, T. Darrell, and D. Klein · 2016
Earlier work this paper cites.
Stable low-rank matrix recovery via null space properties
M. Kabanava, R. Kueng, H. Rauhut, and U. Terstiege · 2016
Cited alongside, same era.
High-dimensional statistics: A non-asymptotic viewpoint
M. Wainwright · 2016
Cited alongside, same era.
Exploring generalization in deep learning
B. Neyshabur, S. Bhojanapalli, D. McAllester, and N. Srebro · 2017
Cited alongside, same era.
Certified defenses for data poisoning attacks
J. Steinhardt, P. W. Koh, and P. Liang · 2017
Cited alongside, same era.
On the power of over-parametrization in neural networks with quadratic activation
S. Du and J. Lee · 2018
Cited alongside, same era.
Learning models with uniform performance via distributionally robust optimization
Convergence of adversarial training in overparametrized neural networks
R. Gao, T. Cai, H. Li, C.-J. Hsieh, L. Wang, and J. D. Lee · 2019
Later among the works it cites.
Learning neural networks with two nonlinear layers in polynomial time
S. Goel and A. R. Klivans · 2019
Later among the works it cites.
Benchmarking neural network robustness to common corruptions and perturbations
D. Hendrycks and T. Dietterich · 2019
Later among the works it cites.
Adversarial examples are not bugs, they are features
A. Ilyas, S. Santurkar, D. Tsipras, L. Engstrom, B. Tran, and A. Madry · 2019
Later among the works it cites.
Generalization bounds for deep convolutional neural networks
P. M. Long and H. Sedghi · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Duchi and H. Namkoong · 2018
Cited alongside, same era.
Neural tangent kernel: Convergence and generalization in neural networks
A. Jacot, F. Gabriel, and C. Hongler · 2018
Cited alongside, same era.
Generalization without systematicity: On the compositional skills of sequence-to-sequence recurrent networks
B. Lake and M. Baroni · 2018
Cited alongside, same era.
Algorithmic regularization in over-parameterized matrix sensing and neural networks with quadratic activations
Y. Li, T. Ma, and H. Zhang · 2018
Cited alongside, same era.
Certified defenses against adversarial examples
A. Raghunathan, J. Steinhardt, and P. Liang · 2018
Cited alongside, same era.
Theoretical insights into the optimization landscape of over-parameterized shallow neural networks
M. Soltanolkotabi, A. Javanmard, and J. D. Lee · 2018
Cited alongside, same era.
Robustness may be at odds with accuracy
D. Tsipras, S. Santurkar, L. Engstrom, A. Turner, and A. Madry · 2018
Cited alongside, same era.
The implicit regularization of stochastic gradient flow for least squares
A. Ali, E. Dobriban, and R. Tibshirani · 2020
Later among the works it cites.
Predicting with proxies: Transfer learning in high dimension
H. Bastani · 2020
Later among the works it cites.
Beyond ucb: Optimal and efficient contextual bandits with regression oracles
D. Foster and A. Rakhlin · 2020
Later among the works it cites.
Wilds: A benchmark of in-the-wild distribution shifts
P. W. Koh, S. Sagawa, H. Marklund, S. M. Xie, M. Zhang, A. Balsubramani, W. Hu, M. Yasunaga, R. L. Phillips, I. Gao, et al · 2020
Later among the works it cites.
Beyond accuracy: Behavioral testing of nlp models with checklist
M. T. Ribeiro, T. Wu, C. Guestrin, and S. Singh · 2020
Later among the works it cites.
A benchmark for systematic generalization in grounded language understanding
L. Ruis, J. Andreas, M. Baroni, D. Bouchacourt, and B. M. Lake · 2020
Later among the works it cites.
Measuring robustness to natural distribution shifts in image classification
R. Taori, A. Dave, V. Shankar, N. Carlini, B. Recht, and L. Schmidt · 2020
Later among the works it cites.
Neural contextual bandits with ucb-based exploration
D. Zhou, L. Li, and Q. Gu · 2020
Later among the works it cites.
Tight hardness results for training depth-2 relu networks
S. Goel, A. Klivans, P. Manurangsi, and D. Reichman · 2021
Closest in time.
Group-sparse matrix factorization for transfer learning of word embeddings
K. Xu, X. Zhao, H. Bastani, and O. Bastani · 2021
Closest in time.