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

Thomas Newton

dblp:300/4159 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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
1 paper
Reinforcement learning · 65% Motion planning and robot control · 22% Kernel, tree and ensemble methods · 13%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › stochastic optimal control
hamilton-jacobi-bellman equation
1.012026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026
Machine learning › Reinforcement learning › value function approximation
kernel-based value function approximation
1.012026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026
Machine learning › Reinforcement learning
policy evaluation
1.012026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026
Machine learning › Reinforcement learning
stochastic control
1.012026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026
Machine learning › Kernel, tree and ensemble methods › kernel methods
kernel ridge regression
0.312026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026
Machine learning › Kernel, tree and ensemble methods › kernel methods
reproducing kernel hilbert space
0.312026
Continuous time policy evaluation is easier with noisy dynamics · COLT 2026

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

kernel ridge regression · 1.0elliptic partial differential equation theory · 1.0Matérn RKHS · 1.0
YearPublicationVenuePosition
2026 Continuous time policy evaluation is easier with noisy dynamics
abstract
In this work, we study continuous-time stochastic control problems governed by controlled stochastic differential equations with unknown dynamics. We focus on the discounted infinite-horizon setting and restrict attention to feedback controllers. In general, the continuous time value function is the solution to the nonlinear Hamilton-Jacobi-Bellman (HJB) equation, which typical only admits viscosity solutions with no regularity. Our first contribution is to establish sharp regularity results for value functions using elliptic partial differential equation theory. Under mild growth and regularity assumptions on the controlled dynamics and a uniform ellipticity condition on the diffusion, we show that the value function belongs to a Matérn reproducing kernel Hilbert space (RKHS) that is strictly smoother than the running reward. Building on this analysis, we develop a kernel-based policy evaluation method that estimates value functions directly from online trajectory rollouts of a fixed policy. The resulting algorithm exploits the RKHS structure with a kernel ridge regression technique, reducing the infinite-dimensional learning problem to a finite-dimensional one. Our results establish a direct connection between stochastic control, elliptic regularity theory, and kernel methods, and provide a foundation for online policy evaluation and policy improvement in continuous time.
Samuel Robertson, Thomas Newton, Csaba Szepesvári
COLT2