Online Learning and Online Convex Optimization (Foundations and Trends(r) in Machine Learning)
ISBN-13:
9781601985460
ISBN-10:
1601985460
Author:
Shai Shalev-Shwartz
Publication date:
2012
Publisher:
Now Publishers
Format:
Paperback
102 pages
FREE US shipping
Book details
ISBN-13:
9781601985460
ISBN-10:
1601985460
Author:
Shai Shalev-Shwartz
Publication date:
2012
Publisher:
Now Publishers
Format:
Paperback
102 pages
Summary
Online Learning and Online Convex Optimization (Foundations and Trends(r) in Machine Learning) (ISBN-13: 9781601985460 and ISBN-10: 1601985460), written by authors
Shai Shalev-Shwartz, was published by Now Publishers in 2012.
With an overall rating of 3.6 stars, it's a notable title among other
books. You can easily purchase or rent Online Learning and Online Convex Optimization (Foundations and Trends(r) in Machine Learning) (Paperback) from BooksRun,
along with many other new and used
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $1.24.
Description
Online learning is a well established learning paradigm which has both theoretical and practical appeals. The goal of online learning is to make a sequence of accurate predictions given knowledge of the correct answer to previous prediction tasks and possibly additional available information. Online learning has been studied in several research fields including game theory, information theory, and machine learning. It also became of great interest to practitioners due the recent emergence of large scale applications such as online advertisement placement and online web ranking. Online Learning and Online Convex Optimization is a modern overview of online learning. Its aim is to provide the reader with a sense of some of the interesting ideas and in particular to underscore the centrality of convexity in deriving efficient online learning algorithms. It connects and relates new results on online convex optimization to classic results on online classification, thus providing a fresh modern perspective on some classic algorithms. It is not intended to be comprehensive but rather to give a high-level, rigorous, yet easy to follow survey of the topic.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}