The limits of squared Euclidean distance regularization
暂无分享,去创建一个
[1] Manfred K. Warmuth,et al. Additive versus exponentiated gradient updates for linear prediction , 1995, STOC '95.
[2] Nitish Srivastava,et al. Improving neural networks by preventing co-adaptation of feature detectors , 2012, ArXiv.
[3] Wojciech Kotlowski,et al. Kernelization of Matrix Updates, When and How? , 2012, ALT.
[4] A. Ng. Feature selection, L1 vs. L2 regularization, and rotational invariance , 2004, Twenty-first international conference on Machine learning - ICML '04.
[5] Shai Ben-David,et al. Limitations of Learning Via Embeddings in Euclidean Half Spaces , 2003, J. Mach. Learn. Res..
[6] Hans Ulrich Simon,et al. On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution , 2002, ALT.
[7] Manfred K. Warmuth,et al. The Perceptron Algorithm Versus Winnow: Linear Versus Logarithmic Mistake Bounds when Few Input Variables are Relevant (Technical Note) , 1997, Artif. Intell..
[8] S. V. N. Vishwanathan,et al. Leaving the Span , 2005, COLT.
[9] Manfred K. Warmuth,et al. The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant , 1995, COLT '95.
[10] Bernhard Schölkopf,et al. A Generalized Representer Theorem , 2001, COLT/EuroCOLT.
[11] Nathan Srebro,et al. Learning with matrix factorizations , 2004 .
[12] Hans Ulrich Simon,et al. On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes , 2006, Theor. Comput. Sci..
[13] G. Wahba,et al. Some results on Tchebycheffian spline functions , 1971 .
[14] Vojtech Rödl,et al. Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[15] Manfred K. Warmuth,et al. Relative loss bounds for single neurons , 1999, IEEE Trans. Neural Networks.
[16] Maria-Florina Balcan,et al. Improved Guarantees for Learning via Similarity Functions , 2008, COLT.
[17] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..