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

Kevin Course

dblp:280/1243 · also Kevin L. Course · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 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
3 papers
Probabilistic and Bayesian machine learning · 55% Deep learning architectures and training · 45%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
neural operator
0.912025
Shifting Time: Time-series Forecasting with Khatri-Rao Neural Operators · ICML 2025
Smart cities and intelligent transportation
spatio-temporal prediction
0.912025
Shifting Time: Time-series Forecasting with Khatri-Rao Neural Operators · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
amortized inference
0.712023
Amortized Reparametrization: Efficient and Scalable Variational Inference for Latent SDEs · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › continuous-time model › stochastic differential equations
latent stochastic differential equation
0.712023
Amortized Reparametrization: Efficient and Scalable Variational Inference for Latent SDEs · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.712023
Amortized Reparametrization: Efficient and Scalable Variational Inference for Latent SDEs · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning
continuous-time model
0.412020
Weak Form Generalized Hamiltonian Learning · NeurIPS 2020
Machine learning › Deep learning architectures and training › neural differential equations
neural ordinary differential equations
0.412020
Weak Form Generalized Hamiltonian Learning · NeurIPS 2020
Machine learning › Deep learning architectures and training
physics-informed neural network
0.412020
Weak Form Generalized Hamiltonian Learning · NeurIPS 2020
Machine learning › Deep learning architectures and training
operator learning
0.312025
Shifting Time: Time-series Forecasting with Khatri-Rao Neural Operators · ICML 2025

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

khatri-rao neural operators · 1.7autoregressive model · 1.7adjoint sensitivity · 1.1integral transforms · 0.9integral transform · 0.9reparametrization of expectations · 0.7weak form estimation · 0.4
YearPublicationVenuePosition
2025 Shifting Time: Time-series Forecasting with Khatri-Rao Neural Operators
abstract
We present an operator-theoretic framework for temporal and spatio-temporal forecasting based on learning a continuous time-shift operator. Our operator learning paradigm offers a continuous relaxation of the discrete lag factor used in traditional autoregressive models, enabling the history of a system up to a given time to be mapped to its future values. We parametrize the time-shift operator using Khatri-Rao neural operators (KRNOs), a novel architecture based on non-stationary integral transforms with nearly linear computational scaling. Our framework naturally handles irregularly sampled observations and enables forecasting at super-resolution in both space and time. Extensive numerical studies across diverse temporal and spatio-temporal benchmarks demonstrate that our approach achieves state-of-the-art or competitive performance with leading methods.
Srinath Dama, Kevin Course, Prasanth B. Nair
ICML2
2023 Amortized Reparametrization: Efficient and Scalable Variational Inference for Latent SDEs
abstract
We consider the problem of inferring latent stochastic differential equations (SDEs) with a time and memory cost that scales independently with the amount of data, the total length of the time series, and the stiffness of the approximate differential equations. This is in stark contrast to typical methods for inferring latent differential equations which, despite their constant memory cost, have a time complexity that is heavily dependent on the stiffness of the approximate differential equation. We achieve this computational advancement by removing the need to solve differential equations when approximating gradients using a novel amortization strategy coupled with a recently derived reparametrization of expectations under linear SDEs. We show that, in practice, this allows us to achieve similar performance to methods based on adjoint sensitivities with more than an order of magnitude fewer evaluations of the model in training.
Kevin Course, Prasanth B. Nair
NeurIPS1
2020 Weak Form Generalized Hamiltonian Learning
abstract
We present a method for learning generalized Hamiltonian decompositions of ordinary differential equations given a set of noisy time series measurements. Our method simultaneously learns a continuous time model and a scalar energy function for a general dynamical system. Learning predictive models in this form allows one to place strong, high-level, physics inspired priors onto the form of the learnt governing equations for general dynamical systems. Moreover, having shown how our method extends and unifies some previous work in deep learning with physics inspired priors, we present a novel method for learning continuous time models from the weak form of the governing equations which is less computationally taxing than standard adjoint methods.
Kevin Course, Trefor W. Evans, Prasanth B. Nair
NeurIPS1