Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit
by
Yang, Greg
, Littwin, Etai
in
Kernels
/ Mathematical analysis
/ Neural networks
/ Optimization
/ Tensors
2023
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?
Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit
by
Yang, Greg
, Littwin, Etai
in
Kernels
/ Mathematical analysis
/ Neural networks
/ Optimization
/ Tensors
2023
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.
Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit
Paper
Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit
2023
Request Book From Autostore
and Choose the Collection Method
Overview
Going beyond stochastic gradient descent (SGD), what new phenomena emerge in wide neural networks trained by adaptive optimizers like Adam? Here we show: The same dichotomy between feature learning and kernel behaviors (as in SGD) holds for general optimizers as well, including Adam -- albeit with a nonlinear notion of \"kernel.\" We derive the corresponding \"neural tangent\" and \"maximal update\" limits for any architecture. Two foundational advances underlie the above results: 1) A new Tensor Program language, NEXORT, that can express how adaptive optimizers process gradients into updates. 2) The introduction of bra-ket notation to drastically simplify expressions and calculations in Tensor Programs. This work summarizes and generalizes all previous results in the Tensor Programs series of papers.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.