暂无分享,去创建一个
David A. McAllester | Nathan Srebro | Behnam Neyshabur | David McAllester | Srinadh Bhojanapalli | Nathan Srebro | Srinadh Bhojanapalli | Behnam Neyshabur | N. Srebro
[1] Peter L. Bartlett,et al. Rademacher and Gaussian Complexities: Risk Bounds and Structural Results , 2003, J. Mach. Learn. Res..
[2] David A. McAllester. Simplified PAC-Bayesian Margin Bounds , 2003, COLT.
[3] John Shawe-Taylor,et al. PAC-Bayes & Margins , 2002, NIPS.
[4] Matus Telgarsky,et al. Spectrally-normalized margin bounds for neural networks , 2017, NIPS.
[5] Gintare Karolina Dziugaite,et al. Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Data , 2017, UAI.
[6] David A. McAllester. Some PAC-Bayesian Theorems , 1998, COLT' 98.
[7] Peter L. Bartlett,et al. The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network , 1998, IEEE Trans. Inf. Theory.
[8] John Langford,et al. (Not) Bounding the True Error , 2001, NIPS.
[9] Ronald L. Rivest,et al. Training a 3-node neural network is NP-complete , 1988, COLT '88.
[10] Jorge Nocedal,et al. On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima , 2016, ICLR.
[11] Abbas Mehrabian,et al. Nearly-tight VC-dimension bounds for piecewise linear neural networks , 2017, COLT.
[12] Ryota Tomioka,et al. Norm-Based Capacity Control in Neural Networks , 2015, COLT.
[13] David A. McAllester. PAC-Bayesian model averaging , 1999, COLT '99.
[14] Joel A. Tropp,et al. User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..
[15] Peter L. Bartlett,et al. Nearly-tight VC-dimension and Pseudodimension Bounds for Piecewise Linear Neural Networks , 2017, J. Mach. Learn. Res..
[16] Nathan Srebro,et al. Exploring Generalization in Deep Learning , 2017, NIPS.