Fr. 176.40

Tutorial on Amortized Optimization

English · Paperback / Softback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more










Optimization is a ubiquitous modeling tool and is often deployed in settings which repeatedly solve similar instances of the same problem. Amortized optimization methods use learning to predict the solutions to problems in these settings, exploiting the shared structure between similar problem instances. These methods have been crucial in variational inference and reinforcement learning and are capable of solving optimization problems many orders of magnitudes times faster than traditional optimization methods that do not use amortization. In this tutorial, the author presents an introduction to the amortized optimization foundations behind these advancements and overviews their applications in variational inference, sparse coding, gradient-based meta-learning, control, reinforcement learning, convex optimization, optimal transport, and deep equilibrium networks. Of practical use for the reader, is the source code accompanying the Implementation and Software Examples chapter. This tutorial provides the reader with a complete source for understanding the theory behind and implementing amortized optimization in many machine learning applications. It will be of interest to students and practitioners alike.

Product details

Authors Brandon Amos
Publisher Now Publishers Inc
 
Languages English
Product format Paperback / Softback
Released 27.06.2023
 
EAN 9781638282082
ISBN 978-1-63828-208-2
No. of pages 156
Dimensions 156 mm x 234 mm x 9 mm
Weight 248 g
Subjects Guides
Natural sciences, medicine, IT, technology > IT, data processing > General, dictionaries

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.