References
Published online by Cambridge University Press: 05 July 2014
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Understanding Machine LearningFrom Theory to Algorithms, pp. 385 - 394Publisher: Cambridge University PressPrint publication year: 2014
References
, , & (2008), “Optimal strategies and minimax lower bounds for online convex games,” in Proceedings of the nineteenth annual conference on computational learning theory.Google Scholar
& (2008), “Measures of clustering quality: A working set of axioms for clustering,” in Proceedings of Neural Information Processing Systems (NIPS), pp. 121-128.Google Scholar
& (2005), “Learnability of bipartite ranking functions,” in Proceedings of the 18th annual conference on learning theory, pp. 16-31.Google Scholar
(1954), “The relaxation method for linear inequalities,” Canadian Journal of Mathematics 6(3), 382-392.CrossRefGoogle Scholar
, & (1964), “Theoretical foundations of the potential function method in pattern recognition learning,” Automation and Remote Control 25, 821-837.Google Scholar
, & (2000), “Reducing multiclass to binary: A unifying approach for margin classifiers,” Journal of Machine Learning Research 1, 113-141.Google Scholar
, , & (1997), “Scale-sensitive dimensions, uniform convergence, and learnability,” Journal of the ACM 44(4), 615-631.CrossRefGoogle Scholar
& (1999), Neural Network Learning: Theoretical Foundations, Cambridge University Press.CrossRefGoogle Scholar
, , & (2008), “A simple proof of the restricted isometry property for random matrices,” Constructive Approximation 28(3), 253-263.CrossRefGoogle Scholar
, & (2005), “Local rademacher complexities,” Annals of Statistics 33(4), 1497-1537.CrossRefGoogle Scholar
& (2002), “Hardness results for neural network approximation problems,” Theor. Comput. Sci. 284(1), 53-66.CrossRefGoogle Scholar
, & (1994), “Fat-shattering and the learn-ability of real-valued functions,” in Proceedings of the seventh annual conference on computational learning theory, (ACM), pp. 299-310.Google Scholar
& (2001), “Rademacher and Gaussian complexities: Risk bounds and structural results,” in 14th Annual Conference on Computational Learning Theory (COLT) 2001, Vol. 2111, Springer, Berlin, pp. 224-240.Google Scholar
& (2002), “Rademacher and Gaussian complexities: Risk bounds and structural results,” Journal of Machine Learning Research 3, 463-482.Google Scholar
, , & (1995), “Characterizations of learnability for classes of {0,…, n}-valued functions,” Journal of Computer and System Sciences 50, 74-86.Google Scholar
, & (2003), “On the difficulty of approximately maximizing agreements,” Journal of Computer and System Sciences 66(3), 496-514.CrossRefGoogle Scholar
& (1998), “Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemes,” Discrete Applied Mathematics 86(1), 3-25.CrossRefGoogle Scholar
& (2001), “Efficient learning of linear perceptrons,” Advances in Neural Information Processing Systems, pp. 189-195.Google Scholar
(2009), “Learning deep architectures for AI,” Foundations and Trends in Machine Learning 2(1), 1-127.CrossRefGoogle Scholar
(1946), “Three observations on linear algebra,” Revi. Univ. Nac. Tucuman, ser. A 5, 147-151.Google Scholar
, & (1989), “On a theory of computation and complexity over the real numbers: Np-completeness, recursive functions and universal machines,” Am. Math. Soc. 21(1), 1-46.Google Scholar
, , & (1989), “Learnability and the Vapnik-Chervonenkis dimension,” Journal of the Association for Computing Machinery 36(4), 929-965.CrossRefGoogle Scholar
, & (1992), “A training algorithm for optimal margin classifiers,” in COLT, pp. 144-152.Google Scholar
, & (2005), “Theory of classification: A survey of recent advances,” ESAIM: Probability and Statistics 9, 323-375.Google Scholar
(2002), Concentration Inequalities and Empirical Processes Theory Applied to the Analysis of Learning Algorithms, PhD thesis, Ecole Polytechnique.Google Scholar
& (2002), “Stability and generalization,” Journal of Machine Learning Research 2, 499-526.Google Scholar
(1996), Bias, variance, and arcing classifiers, Technical Report 460, Statistics Department, University of California at Berkeley.Google Scholar
(2008), “The restricted isometry property and its implications for compressed sensing,” Comptes Rendus Mathematique 346(9), 589-592.CrossRefGoogle Scholar
(2006), “Compressive sampling,” in Proc. of the int. congress of math., Madrid, Spain.Google Scholar
& (2005), “Decoding by linear programming,” IEEE Trans. on Information Theory 51, 4203-4215.CrossRefGoogle Scholar
, & (2007), “Large margin optimization of ranking measures,” in NIPS workshop: Machine learning for Web search (Machine Learning).Google Scholar
(2002), “Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms,” in Conference on Empirical Methods in Natural Language Processing.Google Scholar
& (2008), “A unified architecture for natural language processing: deep neural networks with multitask learning,” in International Conference on Machine Learning (ICML).CrossRefGoogle Scholar
(1965), “Behavior of sequential predictors of binary sequences,” Trans. 4th Prague conf. information theory statistical decision functions, random processes, pp. 263-272.Google Scholar
& (1967), “Nearest neighbor pattern classification,” Information Theory, IEEE Transactions on 13(1), 21-27.CrossRefGoogle Scholar
& (2001), “On the algorithmic implementation of multiclass kernel-based vector machines,” Journal of Machine Learning Research 2, 265-292.Google Scholar
, & (2012), “Multiclass learning approaches: A theoretical comparison with implications,” in NIPS.Google Scholar
, & (1997), “Greedy adaptive approximation,” Journal of Constructive Approximation 13, 57-98.Google Scholar
& (1995), “Solving multiclass learning problems via error-correcting output codes,” Journal of Artificial Intelligence Research 2, 263-286.Google Scholar
(2006), “Compressed sensing,” Information Theory, IEEE Transactions 52(4), 1289-1306.CrossRefGoogle Scholar
, & (1991), “Uniform and universal glivenko-cantelli classes,” Journal of Theoretical Probability 4(3), 485-510.CrossRefGoogle Scholar
(1987), “Universal Donsker classes and metric entropy,” Annals of Probability 15(4), 1306-1326.CrossRefGoogle Scholar
(1922), “On the mathematical foundations of theoretical statistics,” Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character 222, 309-368.Google Scholar
(1989), “Space-bounded learning and the Vapnik-Chervonenkis dimension,” in COLT, pp. 349-364.Google Scholar
& (1995), “Sample compression, learnability, and the Vapnik-Chervonenkis dimension,” Machine Learning 21(3), 269-304.CrossRefGoogle Scholar
& (1956), “An algorithm for quadratic programming,” Naval Res. Logist. Quart. 3, 95-110.CrossRefGoogle Scholar
& (1995), “A decision-theoretic generalization of on-line learning and an application to boosting,” in European Conference on Computational Learning Theory (EuroCOLT), Springer-Verlag, pp. 23-37.Google Scholar
& (1999), “Large margin classification using the perceptron algorithm,” Machine Learning 37(3), 277-296.CrossRefGoogle Scholar
& (1996), “Relation of cue to consequence in avoidance learning,” Foundations of animal behavior: classic papers with commentaries 4, 374.Google Scholar
(2003), “The robustness of the p-norm algorithms,” Machine Learning 53(3), 265-299.CrossRefGoogle Scholar
, & (2001), “From few to many: Illumination cone models for face recognition under variable lighting and pose,” IEEE Trans. Pattern Anal. Mach. Intelligence 23(6), 643-660.CrossRefGoogle Scholar
(1999), “Regret bounds for prediction problems,” in Conference on Learning Theory (COLT).CrossRefGoogle Scholar
-A., & (2010), “Efficient classification for metric data,” in 23rd conference on learning theory, pp. 433-440.Google Scholar
& (2003), “An introduction to variable and feature selection,” Journal of Machine Learning Research, Special Issue on Variable and Feature Selection 3, 1157-1182.Google Scholar
(1902), “Sur les problèmes aux dérivées partielles et leur signification physique,” Princeton University Bulletin 13, 49-52.Google Scholar
(1992), “Decision theoretic generalizations of the PAC model for neural net and other learning applications,” Information and Computation 100(1), 78-150.CrossRefGoogle Scholar
& (1995), “A generalization of sauer's lemma,” Journal of Combinatorial Theory, Series A 71(2), 219-240.CrossRefGoogle Scholar
, & (2007), “Logarithmic regret algorithms for online convex optimization,” Machine Learning 69(2-3), 169-192.CrossRefGoogle Scholar
, & (2006), “A fast learning algorithm for deep belief nets,” Neural Computation 18(7), 1527-1554.CrossRefGoogle ScholarPubMed
& (1976), “Constructing optimal binary decision trees is NP-complete,” Information Processing Letters 5(1), 15-17.CrossRefGoogle Scholar
(2005), “A support vector method for multivariate performance measures,” in Proceedings of the international conference on machine learning (ICML).Google Scholar
, & (2008), “On the complexity of linear prediction: Risk bounds, margin bounds, and regularization,” in NIPS.Google Scholar
& (1996), “On the boosting ability of top-down decision tree learning algorithms,” in ACM Symposium on the Theory of Computing (STOC).CrossRefGoogle Scholar
& (1999), “Algorithmic stability and sanity-check bounds for leave-one-out cross-validation,” Neural Computation 11(6), 1427-1453.CrossRefGoogle ScholarPubMed
& (1988), “Learning Boolean formulae or finite automata is as hard as factoring”, Technical Report TR-14-88, Harvard University, Aiken Computation Laboratory.Google Scholar
, & (1994), “Toward efficient agnostic learning,” Machine Learning 17, 115-141.CrossRefGoogle Scholar
R. & (2006), Cryptographic hardness for learning intersections of halfspaces, in FOCS.CrossRefGoogle Scholar
& (2000), “Rademacher processes and bounding the risk of function learning,” in High Dimensional Probability II, Springer, pp. 443-457.Google Scholar
(1955), “The hungarian method for the assignment problem,” Naval Research Logistics Quarterly 2(1-2), 83-97.CrossRefGoogle Scholar
& (2002), “Almost-everywhere algorithmic stability and generalization error,” in Proceedings of the 18th conference in uncertainty in artificial intelligence, pp. 275-282.Google Scholar
, & (2001), “Conditional random fields: Probabilistic models for segmenting and labeling sequence data,” in International conference on machine learning, pp. 282-289.Google Scholar
(2006), “Tutorial on practical prediction theory for classification,” Journal of machine learning research 6(1), 273.Google Scholar
, , , , , , & (2012), “Building high-level features using large scale unsupervised learning,” in ICML.Google Scholar
(2004), “Large scale online learning,” in Advances in neural information processing systems 16: Proceedings of the 2003 conference, Vol. 16, MIT Press, p. 217.Google Scholar
& (1995), “Convolutional networks for images, speech, and time series,” in The handbook of brain theory and neural networks, The MIT Press.Google Scholar
, , & (2009), “Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations,” in ICML.CrossRefGoogle Scholar
(1988), “Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm,” Machine Learning 2, 285-318.CrossRefGoogle Scholar
& (1994), “The weighted majority algorithm,” Information and Computation 108, 212-261.CrossRefGoogle Scholar
, & (2013), “A provably eficient algorithm for training deep networks,” arXiv preprint arXiv:1304.7045.Google Scholar
& (2013), “Honest compressions and their application to compression schemes,” in COLT.Google Scholar
(2003), Information theory, inference and learning algorithms, Cambridge University Press1.Google Scholar
& (1993), “Matching pursuits with time-frequency dictionaries,” IEEE Transactions on Signal Processing 41, 3397-3415.CrossRefGoogle Scholar
, , & (2006), “Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization,” Advances in Computational Mathematics 25(1-3), 161-193.CrossRefGoogle Scholar
(1998), “A statistical study of on-line learning,” Online Learning and Neural Networks, Cambridge University Press.Google Scholar
(1995), “Sparse approximate solutions to linear systems,” SIAM J. Computing 25(2), 227-234.Google Scholar
, , & (2009), “Robust stochastic approximation approach to stochastic programming,” SIAM Journal on Optimization 19(4), 1574-1609.CrossRefGoogle Scholar
(2005), Primal-dual subgradient methods for convex problems, Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (UCL).Google Scholar
& (2004), Introductory lectures on convex optimization: A basic course, Vol. 87, Springer, Netherlands.CrossRefGoogle Scholar
(1962), “On convergence proofs on perceptrons,” in Proceedings of the symposium on the mathematical theory of automata, Vol. XII, pp. 615-622.Google Scholar
(1901), “On lines and planes of closest fit to systems of points in space,” The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 2(11), 559-572.CrossRefGoogle Scholar
(1962), “A technique for the numerical solution of certain integral equations of the first kind,” Journal of the ACM 9(1), 84-97.CrossRefGoogle Scholar
& (1988), “Computational limitations on learning from examples,” Journal of the Association for Computing Machinery 35(4), 965-984.CrossRefGoogle Scholar
& (2011), “Sum-product networks: A new deep architecture,” in Conference on Uncertainty in Artificial Intelligence (UAI).Google Scholar
& (1986), “An introduction to hidden markov models,” IEEE ASSP Magazine 3(1), 4-16.CrossRefGoogle Scholar
, & (2012), “Making gradient descent optimal for strongly convex stochastic optimization,” in ICML.Google Scholar
, & (2010), “Online learning: Random averages, combinatorial parameters, and learnability,” in NIPS.Google Scholar
, & (2005), “Stability results in learning theory,” Analysis and Applications 3(4), 397-419.CrossRefGoogle Scholar
, , & (2007), “Unsupervised learning of invariant feature hierarchies with applications to object recognition,” in Computer Vision and Pattern Recognition, 2007. CVPR'07. IEEE Conference on, IEEE, pp. 1-8.Google Scholar
(1983), “A universal prior for integers and estimation by minimum description length,” The Annals of Statistics 11(2), 416-431.CrossRefGoogle Scholar
& (1951), “A stochastic approximation method,” The Annals of Mathematical Statistics, pp. 400-407.Google Scholar
& (1978), “A finite sample distribution-free performance bound for local discrimination rules,” The Annals of Statistics 6(3), 506-514.CrossRefGoogle Scholar
(2007), Data mining with decision trees: Theory and applications, Vol. 69, World Scientific.CrossRefGoogle Scholar
(1958), “The perceptron: A probabilistic model for information storage and organization in the brain,” Psychological Review 65, 386-407. (Reprinted in Neurocomputing, MIT Press, 1988).CrossRefGoogle Scholar
, & (1986), “Learning internal representations by error propagation,” in & , eds, Parallel distributed processing - explorations in the microstructure of cognition, MIT Press, chapter 8, pp. 318-362.Google Scholar
(1993), “A note on resolving infeasibility in linear programs by constraint relaxation,” Operations Research Letters 13(1), 19-20.CrossRefGoogle Scholar
(1972), “On the density of families of sets,” Journal of Combinatorial Theory Series A 13, 145-147.CrossRefGoogle Scholar
& (2002), Learning with kernels: Support vector machines, regularization, optimization and beyond, MIT Press.Google Scholar
, & (2001), “A generalized representer theorem,” in Computational learning theory, pp. 416-426.Google Scholar
, & (1998), ‘Nonlinear component analysis as a kernel eigenvalue problem’, Neural computation 10(5), 1299-1319.CrossRefGoogle Scholar
(2003), “Pac-bayesian generalisation error bounds for gaussian process classiication,” The Journal of Machine Learning Research 3, 233-269.Google Scholar
, & (2006), Nearest-neighbor methods in learning and vision: Theory and practice, MIT Press.Google Scholar
(2007), Online Learning: Theory, Algorithms, and Applications, PhD thesis, The Hebrew University.Google Scholar
(2011), “Online learning and online convex optimization,” Foundations and Trends ® in Machine Learning 4(2), 107-194.Google Scholar
, , & (2010), “Learnability, stability and uniform convergence,” The Journal of Machine Learning Research 9999, 2635-2670.Google Scholar
& (2008), “On the equivalence of weak learnability and linear separability: New relaxations and eficient boosting algorithms,” in Proceedings of the nineteenth annual conference on computational learning theory.Google Scholar
, & (2007), “Pegasos: Primal Estimated sub-GrAdient SOlver for SVM,” in International conference on machine learning, pp. 807-814.Google Scholar
& (2008), “SVM optimization: Inverse dependence on training set size,” in International conference on machine learningICML, pp. 928-935.Google Scholar
, & (2010), “Trading accuracy for sparsity in optimization problems with sparsity constraints,” Siam Journal on Optimization 20, 2807-2832.CrossRefGoogle Scholar
& (2013), “Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes,” in ICML.Google Scholar
, & (2009), Lectures on stochastic programming: modeling and theory, Vol. 9, Society for Industrial and Applied Mathematics.CrossRefGoogle Scholar
(1972), “A combinatorial problem; stability and order for models and theories in infinitary languages,” Pac. J. Math 4, 247-261.Google Scholar
(1977), “Distribution inequalities for the binomial law,” The Annals of Probability 5(3), 404-412.CrossRefGoogle Scholar
(1977), “Consistent nonparametric regression,” The Annals of Statistics 5(4), 595-620.CrossRefGoogle Scholar
(1996), “Regression shrinkage and selection via the lasso,” J. Royal. Statist. Soc B. 58(1), 267-288.Google Scholar
, & (1999), “The information bottleneck method,” in The 37'th Allerton conference on communication, control, and computing.Google Scholar
, , & (2004), “Support vector machine learning for interdependent and structured output spaces,” in Proceedings of the twenty-first international conference on machine learning.Google Scholar
(1984), “A theory of the learnable,” Communications of the ACM 27(11), 1134-1142.CrossRefGoogle Scholar
(1992), “Principles of risk minimization for learning theory,” in , & , eds., Advances in Neural Information Processing Systems 4, Morgan Kaufmann, pp. 831-838.Google Scholar
& (1971), “On the uniform convergence of relative frequencies of events to their probabilities,” Theory of Probability and Its Applications XVI(2), 264-280.Google Scholar
(2007), “A tutorial on spectral clustering,” Statistics and Computing 17(4), 395-416.CrossRefGoogle Scholar
(1928), “Zur theorie der gesellschaftsspiele (on the theory of parlor games),” Math. Ann. 100, 295-320.Google Scholar
(1953), “A certain zero-sum two-person game equivalent to the optimal assignment problem,” Contributions to the Theory of Games 2, 5-12.Google Scholar
, & (2006), “Totally corrective boosting algorithms that maximize the margin,” in Proceedings of the 23rd international conference on machine learning.Google Scholar
, , , & (2002), “Kernel dependency estimation,” in Advances in neural information processing systems, pp. 873-880.Google Scholar
& (1999), “Support vector machines for multi-class pattern recognition,” in Proceedings of the seventh european symposium on artificial neural networks.Google Scholar
& (1997), “No free lunch theorems for optimization,” Evolutionary Computation, IEEE Transactions on 1(1), 67-82.CrossRefGoogle Scholar
(2004), “Solving large scale linear prediction problems using stochastic gradient descent algorithms,” in Proceedings of the twenty-first international conference on machine learning.Google Scholar
& (2006), “On model selection consistency of Lasso,” Journal of Machine Learning Research 7, 2541-2567.Google Scholar
(2003), “Online convex programming and generalized infinitesimal gradient ascent,” in International conference on machine learning.Google Scholar
- 1
- Cited by