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
Items 201–221 of 221
Matrix-free interior point method
Gondzio, J. (2010) · Computational Optimization and Applications · doi:10.1007/s10589-010-9361-3 · Cited by 84
Classifying matrices with a spectral regularization
Tomioka, R., & Aihara, K. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273609 · Cited by 82
Roux, N. L., Schmidt, M., & Bach, F. (2012) · Cited by 81
Lagrangian Relaxation for MAP Estimation in Graphical ModelsPreprint
Johnson, J. K., Malioutov, D., & Willsky, A. S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.0013 · Cited by 72
Optimized Cutting Plane Algorithm for Large-Scale Risk Minimization
Franc, V., & Sonnenburg, S. (2009) · doi:10.5555/1577069.1755859 · Cited by 71
Robust support vector machines for classification and computational issues
Trafali̇s, T. B., & Gilbert, R. C. (2006) · Optimization methods & software · doi:10.1080/10556780600883791 · Cited by 71
Non-monotonic feature selection
Xu, Z., Jin, R., Ye, J., Lyu, M. R.-T., & King, I. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553520 · Cited by 69
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
Dani, V., & Hayes, T. P. (2006) · doi:10.5555/1109557.1109660 · Cited by 66
Werner, T. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.134 · Cited by 59
A new look at entropy for solving linear inverse problems
Besnerais, G. L., Bercher, J., & Demoment, G. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771159 · Cited by 54
Szafranski, M., Grandvalet, Y., & Rakotomamonjy, A. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390287 · Cited by 51
On the Algorithmics and Applications of a Mixed-norm based Kernel Learning Formulation
Jagarlapudi, S. N., Dinesh, G., Sankaran, R., et al. (2009) · neural information processing systems · Cited by 51
Collaborative hierarchical sparse modeling
Sprechmann, P., Ramírez, I., Sapiro, G., & Eldar, Y. C. (2010) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2010.5464845 · Cited by 44
Robust Sparse Hyperplane Classifiers: Application to Uncertain Molecular Profiling Data
Bhattacharyya, C., Grate, L. R., Jordan, M. I., Ghaoui, L. E., & Mian, S. I. (2004) · Journal of Computational Biology · doi:10.1089/cmb.2004.11.1073 · Cited by 43
Exploiting separability in large-scale linear support vector machine training
Woodsend, K., & Gondzio, J. (2009) · Computational Optimization and Applications · doi:10.1007/s10589-009-9296-8 · Cited by 35
Better algorithms for benign bandits
Hazan, E., & Kale, S. (2009) · doi:10.5555/1496770.1496775 · Cited by 33
Goldfarb, D., & Scheinberg, K. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0377-7 · Cited by 27
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
Tomioka, R., Suzuki, T., Sugiyama, M., & Kashima, H. (2010) · International Conference on Machine Learning · Cited by 25
Primal-dual proximal point algorithm for linearly constrained convex programming problems
Ibaraki, S., Fukushima, M., & Ibaraki, T. (1992) · Computational Optimization and Applications · doi:10.1007/bf00253807 · Cited by 18
PAC-Bayesian aggregation and multi-armed banditsPreprint
Audibert, J.-Y. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1011.3396 · Cited by 15
Robustness and GeneralizationPreprint
Xu, H., & Mannor, S. (2010) · arXiv (Cornell University) · Cited by 11
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.