Pith. sign in

REVIEW 2 cited by

On the grid-sampling limit SDE

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.07778 v1 pith:33XBLH2H submitted 2024-10-10 stat.ML cs.LGmath.PR

On the grid-sampling limit SDE

classification stat.ML cs.LGmath.PR
keywords grid-samplingcontinuous-timediscussexplorationfurtherintroducedjumpslearning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In our recent work [3] we introduced the grid-sampling SDE as a proxy for modeling exploration in continuous-time reinforcement learning. In this note, we provide further motivation for the use of this SDE and discuss its wellposedness in the presence of jumps.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Continuous-time q-learning for mean-field control with common noise, part-I: Theoretical foundations

    math.OC 2026-04 unverdicted novelty 7.0

    Establishes existence and uniqueness for optimal policies in continuous-time entropy-regularized mean-field control with common noise via an integrated q-function, plus explicit Gaussian characterization in the LQ setting.

  2. Discretization error from regularized Reinforcement Learning to continuous-time stochastic control

    math.OC 2026-04 unverdicted novelty 5.0

    Derives quantitative convergence rates for the gap between optimal policies from regularized discrete-time Bellman equations and true optimal controls in underlying continuous-time stochastic problems.