Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Levon Nurbekyan

dblp:192/2896 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6227-0941ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 67% Generative modeling · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › generative model
continuous-time generative model
0.412020
How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization · ICML 2020
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.412020
How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization · ICML 2020
Machine learning › Deep learning architectures and training › regularization
training regularization
0.412020
How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization · ICML 2020

Methods — techniques the papers use, named apart from their topics

stability regularization · 0.4optimal transport regularization · 0.4adaptive ODE solver · 0.4
YearPublicationVenuePosition
2020 How to Train Your Neural ODE: the World of Jacobian and Kinetic Regularization
abstract
Training neural ODEs on large datasets has not been tractable due to the necessity of allowing the adaptive numerical ODE solver to refine its step size to very small values. In practice this leads to dynamics equivalent to many hundreds or even thousands of layers. In this paper, we overcome this apparent difficulty by introducing a theoretically-grounded combination of both optimal transport and stability regularizations which encourage neural ODEs to prefer simpler dynamics out of all the dynamics that solve a problem well. Simpler dynamics lead to faster convergence and to fewer discretizations of the solver, considerably decreasing wall-clock time without loss in performance. Our approach allows us to train neural ODE-based generative models to the same performance as the unregularized dynamics, with significant reductions in training time. This brings neural ODEs closer to practical relevance in large-scale applications.
Chris Finlay, Jörn-Henrik Jacobsen, Levon Nurbekyan, Adam M. Oberman
ICML3