Leaving the Span
暂无分享,去创建一个
[1] G. Wahba,et al. Some results on Tchebycheffian spline functions , 1971 .
[2] Gene H. Golub,et al. Matrix computations , 1983 .
[3] 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).
[4] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[5] Klaus P. Jantke,et al. Analogical and Inductive Inference , 1986, Lecture Notes in Computer Science.
[6] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[7] K. Zietak. Properties of the Approximations of a Matrix which Lower its Rank , 1989 .
[8] Manfred K. Warmuth. Towards Representation Independence in PAC Learning , 1989, AII.
[9] Leonard Pitt,et al. The minimum consistent DFA problem cannot be approximated within any polynomial , 1993, JACM.
[10] Manfred K. Warmuth,et al. On Weak Learning , 1995, J. Comput. Syst. Sci..
[11] Manfred K. Warmuth,et al. The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant , 1995, COLT '95.
[12] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[13] N. Alon. Tools from higher algebra , 1996 .
[14] 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..
[15] Dale Schuurmans,et al. General Convergence Results for Linear Discriminant Updates , 1997, COLT '97.
[16] Yoav Freund,et al. Boosting the margin: A new explanation for the effectiveness of voting methods , 1997, ICML.
[17] Manfred K. Warmuth,et al. Exponentiated Gradient Versus Gradient Descent for Linear Predictors , 1997, Inf. Comput..
[18] Claudio Gentile,et al. Linear Hinge Loss and Average Margin , 1998, NIPS.
[19] Alexander J. Smola,et al. Learning with kernels , 1998 .
[20] Claudio Gentile,et al. The Robustness of the p-Norm Algorithms , 1999, COLT '99.
[21] Nello Cristianini,et al. Multiplicative Updatings for Support Vector Learning , 1999 .
[22] Nello Cristianini,et al. Multiplicative Updatings for Support Vector Machines , 1999 .
[23] Manfred K. Warmuth,et al. Relative loss bounds for single neurons , 1999, IEEE Trans. Neural Networks.
[24] Shai Ben-David,et al. Limitations of Learning Via Embeddings in Euclidean Half Spaces , 2003, J. Mach. Learn. Res..
[25] Bernhard Schölkopf,et al. A Generalized Representer Theorem , 2001, COLT/EuroCOLT.
[26] Jürgen Forster,et al. A linear lower bound on the unbounded error probabilistic communication complexity , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[27] J. Lindenstrauss,et al. Handbook of geometry of Banach spaces , 2001 .
[28] S. Szarek,et al. Chapter 8 - Local Operator Theory, Random Matrices and Banach Spaces , 2001 .
[29] Rocco A. Servedio,et al. Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms , 2001, NIPS.
[30] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..
[31] Eric R. Ziegel,et al. The Elements of Statistical Learning , 2003, Technometrics.
[32] Manfred K. Warmuth,et al. Relative Loss Bounds for Multidimensional Regression Problems , 1997, Machine Learning.
[33] Hans Ulrich Simon,et al. Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces , 2004, Machine Learning.
[34] Manfred K. Warmuth,et al. Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.
[35] M. Meckes. Concentration of norms and eigenvalues of random matrices , 2002, math/0211192.
[36] S. Szarek,et al. BANACH SPACE THEORY AND LOCAL OPERATOR THEORY , 2004 .
[37] A. Ng. Feature selection, L1 vs. L2 regularization, and rotational invariance , 2004, Twenty-first international conference on Machine learning - ICML '04.
[38] Shahar Mendelson,et al. On the Limitations of Embedding Methods , 2005, COLT.
[39] Adi Shraibman,et al. Rank, Trace-Norm and Max-Norm , 2005, COLT.
[40] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[41] Dan Suciu,et al. Journal of the ACM , 2006 .
[42] Babak Hassibi,et al. The p-norm generalization of the LMS algorithm for adaptive filtering , 2003, IEEE Transactions on Signal Processing.
[43] 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..
[44] R. C. Williamson,et al. The Structure of Version Space , 2006 .
[45] Lakhmi C. Jain,et al. Innovations in Machine Learning , 2006 .