
Introduction to Online Convex Optimization
Elad Hazan(Author)
now publishers Inc
1st Edition
Published on 30. August 2016
Book
Paperback/Softback
190 pages
978-1-68083-170-2 (ISBN)
Description
Introduction to Online Convex Optimization portrays optimization as a process. In many practical applications the environment is so complex that it is infeasible to lay out a comprehensive theoretical model and use classical algorithmic theory and mathematical optimization. It is necessary as well as beneficial to take a robust approach, by applying an optimization method that learns as one goes along, learning from experience as more aspects of the problem are observed. This view of optimization as a process has become prominent in varied fields and has led to some spectacular success in modeling and systems that are now part of our daily lives.
Introduction to Online Convex Optimization is intended to serve as a reference for a self-contained course on online convex optimization and the convex optimization approach to machine learning for the educated graduate student in computer science/electrical engineering/ operations research/statistics and related fields. It is also an ideal reference for the researcher diving into this fascinating world at the intersection of optimization and machine learning.
Introduction to Online Convex Optimization is intended to serve as a reference for a self-contained course on online convex optimization and the convex optimization approach to machine learning for the educated graduate student in computer science/electrical engineering/ operations research/statistics and related fields. It is also an ideal reference for the researcher diving into this fascinating world at the intersection of optimization and machine learning.
More details
Series
Language
English
Place of publication
Hanover
United States
Target group
College/higher education
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 10 mm
Weight
275 gr
ISBN-13
978-1-68083-170-2 (9781680831702)
DOI
10.1561/2400000013
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
Preface 1: Introduction 2: Basic concepts in convex optimization 3: First Order Algorithms for Online Convex Optimization 4: Second Order Methods 5: Regularization 6: Bandit Convex Optimization 7: Projection-free Algorithms 8: Games, Duality and Regret 9: Learning Theory, Generalization and OCO. References.