Introduction to Online Convex Optimization, second edition
43.00 JOD
Please allow 2 – 5 weeks for delivery of this item
Description
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 throughoutNew chapters on boosting, adaptive regret, and approachability and expanded exposition on optimizationExamples 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
Additional information
Weight | 0.45 kg |
---|---|
Dimensions | 1.68 × 15.73 × 23.5 cm |
PubliCanadation City/Country | USA |
by | |
Format | Hardback |
Language | |
Pages | 248 |
Publisher | |
Year Published | 2022-9-6 |
Imprint | |
ISBN 10 | 0262046989 |
About The Author | Elad Hazan is Professor of Computer Science at Princeton University and cofounder and director of Google AI Princeton. An innovator in the design and analysis of algorithms for basic problems in machine learning and optimization, he is coinventor of the AdaGrad optimization algorithm for deep learning, the first adaptive gradient method. |
Table Of Content | Preface xiAcknowledgments xvList of Figures xviiList of Symbols xix1 Introduction 12 Basic Concepts in Convex Optimization 153 First-Order Algorithms for Online Convex Optimization 374 Second-Order Methods 495 Regularization 636 Bandit Convex Optimization 897 Projection-Free Algorithms 1078 Games, Duality and Regret 1239 Learning Theory, Generalization, and Online Convex Optimization 13310 Learning in Changing Environments 14711 Boosting and Regret 16312 Online Boosting 17113 Blackwell Approachability and Online Convex Optimization 181Notes 191References 193Index 207 |
Series |
Only logged in customers who have purchased this product may leave a review.
Reviews
There are no reviews yet.