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

Jacob Kelly

dblp:270/0335 · also Jacob Jin Kelly · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021

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
2 papers
Generative modeling · 36% Reinforcement learning · 18% Deep learning architectures and training · 16%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
amortized sampling
0.512021
No MCMC for me: Amortized sampling for fast and stable training of energy-based models · ICLR 2021
Machine learning › Generative modeling
energy-based model
0.512021
No MCMC for me: Amortized sampling for fast and stable training of energy-based models · ICLR 2021
Machine learning › Reinforcement learning
sample efficiency
0.512021
No MCMC for me: Amortized sampling for fast and stable training of energy-based models · ICLR 2021
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

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

markov chain monte carlo · 0.5amortized inference · 0.5taylor-mode automatic differentiation · 0.4numerical ODE solvers · 0.4
YearPublicationVenuePosition
2021 No MCMC for me: Amortized sampling for fast and stable training of energy-based models
Will Grathwohl, Jacob Kelly, Milad Hashemi, Mohammad Norouzi 0002, Kevin Swersky, David Duvenaud
ICLR2
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
NeurIPS1