The DOI matches its Crossref record; 221 of the 221 references it cites were found in a registry or an index.
Optimization for Machine Learning
Abstract
An up-to-date account of the interplay between optimization and machine learning, accessible to students and researchers in both communities. The interplay between optimization and machine learning is one of the most important developments in modern computational science. Optimization formulations and methods are proving to be vital in designing algorithms to extract essential knowledge from huge volumes of data. Machine learning, however, is not simply a consumer of optimization technology but a rapidly evolving field that is itself generating new optimization ideas. This book captures the state of the art of the interaction between optimization and machine learning in a way that is accessible to researchers in both fields. Optimization approaches have enjoyed prominence in machine learning because of their wide applicability and attractive theoretical properties. The increasing complexity, size, and variety of today's machine learning models call for the reassessment of existing assumptions. This book starts the process of reassessment. It describes the resurgence in novel contexts of established frameworks such as first-order methods, stochastic approximations, convex relaxations, interior-point methods, and proximal methods. It also devotes attention to newer themes such as regularized optimization, robust optimization, gradient and subgradient methods, splitting techniques, and second-order methods. Many of these techniques draw inspiration from other fields, including operations research, theoretical computer science, and subfields of optimization. The book will enrich the ongoing cross-fertilization between the machine learning community and these other fields, and within the broader optimization community.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Donoho, D. L. (2004) · Cited by 16,703
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Horn, R. A., & Johnson, C. R. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511840371 · Cited by 9,319
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Hearst, M. A., Dumais, S. T., Osuna, E., Platt, J., & Scholkopf, B. (1998) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.708428 · Cited by 7,243
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
A new polynomial-time algorithm for linear programming
Karmarkar, N. (1984) · Combinatorica · doi:10.1007/bf02579150 · Cited by 4,794
Adapting to Unknown Smoothness via Wavelet Shrinkage
Donoho, D. L., & Johnstone, I. M. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476626 · Cited by 4,630
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Zhou, K., Doyle, J. C., & Glover, K. (1997) · Cited by 4,556
Remarks on Some Nonparametric Estimates of a Density Function
Rosenblatt, M. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728190 · Cited by 4,547
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
Prediction, Learning, and Games
Cesa-Bianchi, N., & Lugosi, G. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546921 · Cited by 3,162
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Bandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Multivariate Density Estimation, Theory, Practice, and Visualbation
Ramsay, P. H. (1993) · Technometrics · doi:10.1080/00401706.1993.10485361 · Cited by 2,789
Sparsity and Smoothness Via the Fused Lasso
Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00490.x · Cited by 2,724
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Asymptotically efficient adaptive allocation rules
Lai, T. L., & Robbins, H. (1985) · Advances in Applied Mathematics · doi:10.1016/0196-8858(85)90002-8 · Cited by 2,406
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
(2002) · doi:10.1137/s0097539701398375 · Cited by 2,275
Stochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
Large Margin Methods for Structured and Interdependent Output Variables
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altün, Y. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1088722 · Cited by 2,225
Some aspects of the sequential design of experiments
Robbins, H. (1952) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1952-09620-8 · Cited by 2,184
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,793
On the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Robust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
Lectures on Stochastic Programming: Modeling and Theory
Shapiro, A., Dentcheva, D., & Ruszczyński, A. (2009) · Cited by 1,735
Feature selection, L 1 vs. L 2 regularization, and rotational invariance
Ng, A. Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015435 · Cited by 1,572
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Proximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
Multiple kernel learning, conic duality, and the SMO algorithm
Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015424 · Cited by 1,453
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Argyriou, A., Evgeniou, T., & Pontil, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0010 · Cited by 1,333
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
An EM algorithm for wavelet-based image restoration
Figueiredo, M. A. T., & Nowak, R. D. (2003) · IEEE Transactions on Image Processing · doi:10.1109/tip.2003.814255 · Cited by 1,219
Large Scale Multiple Kernel Learning
Sonnenburg, S., Rätsch, G., Schäfer, C., & Schölkopf, B. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248604 · Cited by 1,201
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Regularization Networks and Support Vector Machines
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018946025316 · Cited by 1,197
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
Bartlett, P. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661502 · Cited by 1,166
Pattern recognition using generalized portrait method
Vapnik, V. N. (1963) · Automation and Remote Control · Cited by 1,151
The Tradeoffs of Large-Scale Learning
Bottou, L., & Bousquet, O. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0015 · Cited by 1,128
Penalized Regressions: The Bridge versus the Lasso
Fu, W. J. (1998) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1998.10474784 · Cited by 1,092
Robust Solutions to Least-Squares Problems with Uncertain Data
El Ghaoui, L., & Lebret, H. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896298130 · Cited by 1,076
Deza, M. M., & Laurent, M. (1997) · Algorithms and combinatorics · doi:10.1007/978-3-642-04295-9 · Cited by 1,014
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics.
Oden, J. T., Glowinski, R., & Tallec, P. L. (1992) · Mathematics of Computation · doi:10.2307/2153048 · Cited by 972
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Linear Programming: Foundations and Extensions
Vanderbei, R. J. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600987 · Cited by 916
Sparse multinomial logistic regression: fast algorithms and generalization bounds
Krishnapuram, B., Carin, L., Figueiredo, M. A. T., & Hartemink, A. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.127 · Cited by 877
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Logarithmic regret algorithms for online convex optimization
Hazan, E., Agarwal, A., & Kale, S. (2007) · Machine Learning · doi:10.1007/s10994-007-5016-8 · Cited by 828
Large-Scale Bayesian Logistic Regression for Text Categorization
Genkin, A., Lewis, D. D., & Madigan, D. (2007) · Technometrics · doi:10.1198/004017007000000245 · Cited by 808
Nonparametric Density Estimation: The L 1 View.
Thompson, J., Devroye, L., & Györfi, L. (1987) · Journal of the American Statistical Association · doi:10.2307/2289176 · Cited by 787
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
A Course in Robust Control Theory
Dullerud, G. E., & Paganini, F. (2000) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3290-0 · Cited by 769
Coordinate descent algorithms for lasso penalized regressionPreprint
Wu, T. T., & Lange, K. L. (2008) · Cited by 735
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, P., & Yun, S. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0170-0 · Cited by 728
Osborne, M. R., Presnell, B., & Turlach, B. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474883 · Cited by 696
Robust Control of Markov Decision Processes with Uncertain Transition Matrices
Nilim, A., & El Ghaoui, L. (2005) · Operations Research · doi:10.1287/opre.1050.0216 · Cited by 694
A Direct Formulation for Sparse PCA Using Semidefinite Programming
d'Aspremont, A., El Ghaoui, L., Jordan, M. I., & Lanckriet, G. R. G. (2007) · SIAM Review · doi:10.1137/050645506 · Cited by 678
A statistical framework for genomic data fusion
Lanckriet, G. R. G., De Bie, T., Cristianini, N., Jordan, M. I., & Noble, W. S. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth294 · Cited by 671
Blankertz, B., Muller, K.-R., Curio, G., Vaughan, T. M., Schalk, G., Wolpaw, J. R., Schlogl, A., Neuper, C., Pfurtscheller, G., Hinterberger, T., et al. (2004) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2004.826692 · Cited by 670
Consistency of the group Lasso and multiple kernel learning
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3390 · Cited by 669
Robust solution to least squares problems with uncertain data
Ghaoui, L. E., & Lebret, H. (1997) · Cited by 638
The composite absolute penalties family for grouped and hierarchical variable selection
Zhao, P., Rocha, G., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos584 · Cited by 631
A note on the group lasso and a sparse group lasso
Friedman, J. H., Hastie, T. J., & Tibshirani, R. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.0736 · Cited by 619
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Efficient algorithms for online decision problems
Kalai, A., & Vempala, S. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.10.016 · Cited by 591
A polynomial-time algorithm, based on Newton's method, for linear programming
Renegar, J. (1988) · Mathematical Programming · doi:10.1007/bf01580724 · Cited by 588
An Interior-Point Method for Large-Scale '1-Regularized Logistic Regression
Koh, K., Kim, S.-J., & Boyd, S. (2007) · Cited by 579
Efficient svm training using low-rank kernel representations
Fine, S., & Scheinberg, K. (2002) · doi:10.5555/944790.944812 · Cited by 579
Exploration–exploitation tradeoff using variance estimates in multi-armed bandits
Audibert, J.-Y., Munos, R., & Szepesvári, C. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.016 · Cited by 569
Majorization–Minimization Algorithms for Wavelet-Based Image Restoration
Figueiredo, M. A. T., Bioucas-Dias, J. M., & Nowak, R. D. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909318 · Cited by 548
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408007 · Cited by 546
Bartlett, P. L., Bousquet, O., & Mendelson, S. (2002) · Cited by 533
Huang, J., & Zhang, T. (2010) · The Annals of Statistics · doi:10.1214/09-aos778 · Cited by 521
Fonctions convexes duales et points proximaux dans un espace hilbertien
Moreau, J. J. (1962) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 501
A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Application of ridge analysis to regression problems
Hoerl, A. E., & Hoerl, C. (1962) · Cited by 480
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Classifying Single Trial EEG: Towards Brain Computer Interfacing
Blankertz, B., Curio, G., & Müller, K.-R. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0025 · Cited by 467
Joint covariate selection and joint subspace selection for multiple classification problems
Obozinski, G., Taskar, B., & Jordan, M. I. (2010) · Statistics and Computing · doi:10.1007/s11222-008-9111-x · Cited by 451
Gill, P. E., Murray, W., Saunders, M. A., et al. (1986) · Mathematical Programming · doi:10.1007/bf02592025 · Cited by 446
A simple and efficient algorithm for gene selection using sparse logistic regression
Shevade, S. K., & Keerthi, S. S. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg308 · Cited by 401
More generality in efficient multiple kernel learning
Varma, M., & Babu, B. R. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553510 · Cited by 398
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
Kim, S., & Xing, E. P. (2018) · Figshare · doi:10.1184/r1/6476414 · Cited by 374
Pure Exploration in Multi-armed Bandits Problems
Bubeck, S., Munos, R., & Stoltz, G. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04414-4_7 · Cited by 362
Bottou, L., & Cun, Y. L. (2003) · Cited by 359
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
Schmidt, M., Fung, G., & Rosales, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74958-5_28 · Cited by 353
A Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
Scale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997) · Journal of the ACM · doi:10.1145/263867.263927 · Cited by 340
Dimension Reduction and Coefficient Estimation in Multivariate Linear Regression
Yuan, M., Ekici, A., Lu, Z., & Monteiro, R. (2007) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00591.x · Cited by 310
A new view of automatic relevance determination
Wipf, D., & Nagarajan, S. S. (2008) · Cited by 310
Nightmare at test time: robust learning by feature deletion
Globerson, A., & Roweis, S. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143889 · Cited by 309
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem
Mannor, S., & Tsitsiklis, J. N. (2004) · doi:10.5555/1005332.1005355 · Cited by 307
Robustness and Regularization of Support Vector Machines
Xu, H., Caramanis, C., & Mannor, S. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.3490 · Cited by 301
Convex Optimization with Sparsity-Inducing Norms
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0004 · Cited by 295
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012) · Statistical Science · doi:10.1214/12-sts400 · Cited by 287
More efficiency in multiple kernel learning
Rakotomamonjy, A., Bach, F., Canu, S., & Grandvalet, Y. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273594 · Cited by 280
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277
Filtering noise from images with wavelet transforms
Weaver, J. B., Xu, Y., Healy, D. M., & Cromwell, L. D. (1991) · Magnetic Resonance in Medicine · doi:10.1002/mrm.1910210213 · Cited by 276
General conditions for predictivity in learning theory
Poggio, T., Rifkin, R., Mukherjee, S., & Niyogi, P. (2004) · Nature · doi:10.1038/nature02341 · Cited by 276
Multiclass multiple kernel learning
Zien, A., & Ong, C. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273646 · Cited by 266
Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation
Maron, O., & Moore, A. (2018) · doi:10.1184/r1/6555050 · Cited by 265
Relation between PLSA and NMF and implications
Gaussier, E., & Goutte, C. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076148 · Cited by 264
MRF Optimization via Dual Decomposition: Message-Passing Revisited
Komodakis, N., Paragios, N., & Tziritas, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408890 · Cited by 256
Object-oriented software for quadratic programming
Gertz, E. M., & Wright, S. J. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/641876.641880 · Cited by 253
The SHOGUN Machine Learning Toolbox
Sonnenburg, S., Rätsch, G., Henschel, S., Widmer, C., Behr, J., Zien, A., Bona, F. D., Binder, A., Gehl, C., & Franc, V. (2010) · Max Planck Institute for Plasma Physics · Cited by 251
Tightening LP Relaxations for MAP using Message PassingPreprint
Sontag, D. A., Meltzer, T., Globerson, A., Jaakkola, T., & Weiss, Y. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.3288 · Cited by 235
Xu, H., Caramanis, C., & Mannor, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048503 · Cited by 230
Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
Steinwart, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839514 · Cited by 225
Bundle Methods for Regularized Risk Minimization
Teo, C. H., Vishwanthan, S. V. N., Smola, A. J., & Le, Q. V. (2010) · doi:10.5555/1756006.1756016 · Cited by 223
Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing
Setzer, S. (2011) · International Journal of Computer Vision · doi:10.1007/s11263-010-0357-3 · Cited by 221
An O(n) algorithm for quadratic knapsack problems
Brucker, P. (1984) · Operations Research Letters · doi:10.1016/0167-6377(84)90010-5 · Cited by 206
Mukherjee, S., Niyogi, P., Poggio, T., & Rifkin, R. (2006) · Advances in Computational Mathematics · doi:10.1007/s10444-004-7634-z · Cited by 198
Second Order Cone Programming Approaches for Handling Missing and Uncertain Data
Shivaswamy, P. K., Bhattacharyya, C., & Smola, A. J. (2006) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · doi:10.5555/1248547.1248594 · Cited by 197
Competing in the dark: An efficient algorithm for bandit linear optimization
Abernethy, J., Hazan, E., & Rakhlin, A. (2008) · Cited by 193
Empirical Bernstein Bounds and Sample Variance Penalization
Maurer, A., & Pontil, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0907.3740 · Cited by 192
Robust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.4237 · Cited by 192
Interior-Point Methods for Massive Support Vector Machines
Ferris, M. C., & Munson, T. S. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400374379 · Cited by 186
Consistency of trace norm minimization
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2848 · Cited by 182
Taking Advantage of Sparsity in Multi-Task Learning
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · Cited by 179
Online linear optimization and adaptive routing
Awerbuch, B., & Kleinberg, R. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.04.016 · Cited by 177
Computational Techniques of the Simplex Method
Maros, I. (2003) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-0257-9 · Cited by 173
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
Bach, F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.1493 · Cited by 172
A scalable modular convex solver for regularized risk minimization
Teo, C. H., Smola, A., Vishwanathan, S. V. N., & Le, Q. V. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281270 · Cited by 171
Network Flow Algorithms for Structured SparsityPreprint
Mairal, J., Jenatton, R., Obozinski, G., & Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.5209 · Cited by 170
Bandit Algorithms for Tree Search
Coquelin, P.-A., & Munos, R. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.2028 · Cited by 170
A regularized discriminative framework for EEG analysis with application to brain–computer interface
Tomioka, R., & Müller, K.-R. (2010) · NeuroImage · doi:10.1016/j.neuroimage.2009.07.045 · Cited by 167
The Price of Bandit Information for Online Optimization
Dani, V., Kakade, S. M., & Hayes, T. P. (2007) · ScholarlyCommons (University of Pennsylvania) · Cited by 161
Multiple Kernel Learning and the SMO Algorithm
Sun, Z., Theera-Ampornpunt, N., Varma, M., et al. (2010) · neural information processing systems · Cited by 154
An Extended Level Method for Efficient Multiple Kernel Learning
Xu, Z., Jin, R., King, I., et al. (2008) · Cited by 152
Cui, R., Huter, D., Lang, W., & Deecke, L. (1999) · NeuroImage · doi:10.1006/nimg.1998.0388 · Cited by 151
Relative Loss Bounds for Multidimensional Regression Problems
Kivinen, J., & Warmuth, M. K. (2001) · Machine Learning · doi:10.1023/a:1017938623079 · Cited by 135
General Convergence Results for Linear Discriminant Updates
Grove, A. J., Littlestone, N., & Schuurmans, D. (2001) · Machine Learning · doi:10.1023/a:1010844028087 · Cited by 135
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Online Optimization in X-Armed Bandits
Bubeck, S., Stoltz, G., Szepesvári, C., & Munos, R. (2008) · Cited by 132
Sparse Multiple Kernel Learning for Signal Processing Applications
Subrahmanya, N., & Shin, Y. C. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.98 · Cited by 121
Optimized cutting plane algorithm for support vector machines
Franc, V., & Sonnenburg, S. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390197 · Cited by 120
Decoupling Sparsity and Smoothness in the Discrete Hierarchical Dirichlet Process
Wang, C., & Blei, D. M. (2009) · Cited by 117
Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms
Domingo, C., Gavaldà, R., & Watanabe, O. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1014091514039 · Cited by 115
A DC-programming algorithm for kernel selection
Argyriou, A., Hauser, R., Micchelli, C. A., et al. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143850 · Cited by 114
Extracting certainty from uncertainty: regret bounded by variation in costs
Hazan, E., & Kale, S. (2010) · Machine Learning · doi:10.1007/s10994-010-5175-x · Cited by 112
Robust Fisher Discriminant Analysis
Kim, S.-J., Magnani, A., & Boyd, S. (2005) · Cited by 105
Combined Primal–Dual and Penalty Methods for Convex Programming
Kort, B., & Bertsekas, D. P. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314020 · Cited by 95
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
Nikos Komodakis, A., & Nikos Paragios, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88690-7_60 · Cited by 86
Iterative Projection Methods for Structured Sparsity Regularization
Rosasco, L., Verri, A., Santoro, M., Mosci, S., & Villa, S. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 85
Dual-Augmented Lagrangian Method for Efficient Sparse Reconstruction
Tomioka, R., & Sugiyama, M. (2009) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2030111 · Cited by 85
Cited by
Machine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
Deep learning for short-term traffic flow prediction
Polson, N. G., & Sokolov, V. O. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.02.024 · Cited by 1,015
All you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
Metadata
- Venue
- The MIT Press eBooks
- Publisher
- The MIT Press
- Published
- 2011-09-30
- OpenAlex
- W1569098853
- Cited by
- 875
- References
- 221
- FWCI
- 15.01
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.