"Provides a comprehensive and accessible exploration of modern topics in convex analysis and optimization algorithms, with an emphasis on bridging the two areas"--
Introduction to Online Convex Optimization
β Scribed by Elad Hazan
- Publisher
- The MIT Press
- Year
- 2022
- Tongue
- English
- Leaves
- 248
- Series
- Adaptive Computation and Machine Learning
- Edition
- 2
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
New edition of a graduate-level textbook on that focuses on online convex optimization, a machine learning framework that views optimization as a process.
In many practical applications, the environment is so complex that it is not feasible to lay out a comprehensive theoretical model and use classical algorithmic theory and/or mathematical optimization. Introduction to Online Convex Optimization presents a robust machine learning approach that contains elements of mathematical optimization, game theory, and learning theory: an optimization method that learns from experience as more aspects of the problem are observed. This view of optimization as a process has led to some spectacular successes in modeling and systems that have become part of our daily lives.
Based on the βTheoretical Machine Learningβ course taught by the author at Princeton University, the second edition of this widely used graduate level text features:
- Thoroughly updated material throughout
- New chapters on boosting, adaptive regret, and approachability and expanded exposition on optimization
- Examples of applications, including prediction from expert advice, portfolio selection, matrix completion and recommendation systems, SVM training, offered throughout
- Exercises that guide students in completing parts of proofs
π SIMILAR VOLUMES
<span>This book provides a unified, insightful, and modern treatment of linear optimization, that is, linear programming, network flow problems, and discrete optimization. It includes classical topics as well as the state of the art, in both theory and practice.</span>
Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropr
Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropr