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

Jesse Bettencourt

dblp:222/2940 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 3

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
3 papers
Generative modeling · 37% Deep learning architectures and training · 28% Optimization for machine learning · 14%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling › normalizing flow
continuous normalizing flow
0.722019
FFJORD: Free-Form Continuous Dynamics for Scalable Reversible Generative Models · ICLR 2019
Neural Ordinary Differential Equations · NeurIPS 2018
Robotics › Motion planning and robot control
learned dynamics
0.412020
Learning Differential Equations that are Easy to Solve · NeurIPS 2020
Machine learning › Deep learning architectures and training
neural differential equations
0.412020
Learning Differential Equations that are Easy to Solve · NeurIPS 2020
Machine learning › Generative modeling
invertible generative models
0.412019
FFJORD: Free-Form Continuous Dynamics for Scalable Reversible Generative Models · ICLR 2019
Machine learning › Efficient and distributed learning › large-scale learning
scalable training
0.412019
FFJORD: Free-Form Continuous Dynamics for Scalable Reversible Generative Models · ICLR 2019
Machine learning › Deep learning architectures and training › neural differential equations
continuous-depth neural networks
0.312018
Neural Ordinary Differential Equations · NeurIPS 2018
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.312018
Neural Ordinary Differential Equations · NeurIPS 2018
Machine learning › Generative modeling
normalizing flow
0.312018
Neural Ordinary Differential Equations · NeurIPS 2018

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

taylor-mode automatic differentiation · 0.4numerical ODE solvers · 0.4neural ODE · 0.4continuous dynamics · 0.4adjoint method · 0.3ODE solver · 0.3
YearPublicationVenuePosition
2020 Learning Differential Equations that are Easy to Solve
abstract
Differential equations parameterized by neural networks become expensive to solve numerically as training progresses. We propose a remedy that encourages learned dynamics to be easier to solve. Specifically, we introduce a differentiable surrogate for the time cost of standard numerical solvers, using higher-order derivatives of solution trajectories. These derivatives are efficient to compute with Taylor-mode automatic differentiation. Optimizing this additional objective trades model performance against the time cost of solving the learned dynamics. We demonstrate our approach by training substantially faster, while nearly as accurate, models in supervised classification, density estimation, and time-series modelling tasks.
Jacob Kelly, Jesse Bettencourt, Matthew J. Johnson 0002, David Duvenaud
NeurIPS2
2019 FFJORD: Free-Form Continuous Dynamics for Scalable Reversible Generative Models
Will Grathwohl, Ricky T. Q. Chen, Jesse Bettencourt, Ilya Sutskever, David Duvenaud
ICLR3
2018 Neural Ordinary Differential Equations
abstract
We introduce a new family of deep neural network models. Instead of specifying a discrete sequence of hidden layers, we parameterize the derivative of the hidden state using a neural network. The output of the network is computed using a blackbox differential equation solver. These continuous-depth models have constant memory cost, adapt their evaluation strategy to each input, and can explicitly trade numerical precision for speed. We demonstrate these properties in continuous-depth residual networks and continuous-time latent variable models. We also construct continuous normalizing flows, a generative model that can train by maximum likelihood, without partitioning or ordering the data dimensions. For training, we show how to scalably backpropagate through any ODE solver, without access to its internal operations. This allows end-to-end training of ODEs within larger models.
Tian Qi Chen, Yulia Rubanova, Jesse Bettencourt, David Duvenaud
NeurIPS3