Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Probabilistic Adaptive Computation Time
by
Vetrov, Dmitry
, Sobolev, Artem
, Figurnov, Michael
in
Computing time
/ Inference
/ Machine learning
/ Optimization
/ Probabilistic models
/ Production scheduling
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Probabilistic Adaptive Computation Time
by
Vetrov, Dmitry
, Sobolev, Artem
, Figurnov, Michael
in
Computing time
/ Inference
/ Machine learning
/ Optimization
/ Probabilistic models
/ Production scheduling
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Probabilistic Adaptive Computation Time
2017
Request Book From Autostore
and Choose the Collection Method
Overview
We present a probabilistic model with discrete latent variables that control the computation time in deep learning models such as ResNets and LSTMs. A prior on the latent variables expresses the preference for faster computation. The amount of computation for an input is determined via amortized maximum a posteriori (MAP) inference. MAP inference is performed using a novel stochastic variational optimization method. The recently proposed Adaptive Computation Time mechanism can be seen as an ad-hoc relaxation of this model. We demonstrate training using the general-purpose Concrete relaxation of discrete variables. Evaluation on ResNet shows that our method matches the speed-accuracy trade-off of Adaptive Computation Time, while allowing for evaluation with a simple deterministic procedure that has a lower memory footprint.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.