Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Reinforcement Learning

138 missions · 82 completed

Missions

Open56Completed82All138
Machine LearningOptimization·Captain: mikedeng1

Neural Temporal-Difference and Q-Learning Provably Converge to Global Optima: Neural TD with Stochastic Semigradients Converges to the Global Optimum of the MSPBE at Rate 1/√TResearch Paper

Temporal-difference (TD) learning estimates the value of a policy in a Markov decision process from sampled transitions, by repeatedly moving a parametrized value function towards a one-step bootstrapped target (Sutton, 1988). With a linear parametrization its behaviour is well understood: TD converges to the fixed point of the projected Bellman equation (Ts…

10 thms1 active userReviewed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

Nonasymptotic Analysis of Monte Carlo Tree Search: UCB with a Polynomial Bonus on a Non-Stationary Bandit Converges and Concentrates PolynomiallyResearch Paper

Monte Carlo tree search repeatedly chooses actions using estimates built from earlier simulations. The rewards attached to an action need not form an independent, identically distributed sequence: deeper parts of the search tree change as the search proceeds. Shah, Xie and Xu isolate this difficulty in a non-stationary multi-armed bandit and study a version…

9 thms1 active userReviewed
Machine LearningProbabilityStochastic Systems·Captain: mikedeng1

Reusing Historical Trajectories in Natural Policy Gradient via Importance Sampling: Asymptotic Normality of the RNPG Error, with Reuse Shrinking the Joint-Noise Covariance by 1/KResearch Paper

In reinforcement learning, each policy update may require new interaction with an environment. When interaction is costly, an optimizer can retain past trajectories and use them again, provided it corrects for the different policy that generated them. Lin, Wang, and Zhou study this idea for natural policy gradient, using importance weights to reuse earlier…

10 thms1 active userReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learning: Cross-Fitted DRL Is Asymptotically Linear and Normal at the MDP Efficiency BoundResearch Paper

Off-policy evaluation (OPE) asks for the long-run value of a target decision policy, using only data collected under a different policy. It arises wherever running the target policy is expensive or unsafe: a new treatment rule in medicine, a new recommendation or pricing rule, a candidate controller in reinforcement learning. Importance-sampling estimators…

13 thms1 active userReviewed
Markov ChainProbabilityStochastic Systems·Captain: mikedeng1

On Actor-Critic Algorithms: Convergence of Actor-Critic Algorithms with TD(1) and TD(λ) Critics on Finite MDPsResearch Paper

Reinforcement-learning methods for Markov decision processes split into critic-only methods, which learn an approximate value function and act greedily with respect to it, and actor-only methods, which adjust a parameterized policy along a simulated estimate of the gradient of its performance. Critic-only methods with function approximation can fail to…

14 thms1 active userReviewed
Dynamical SystemsProbabilityStochastic Systems·Captain: mikedeng1

The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning II: Mean-Square Error under Bounded StepsizesResearch Paper

Stochastic approximation is the family of recursive algorithms that locate a zero of a vector field hhh from noisy evaluations of it. Temporal-difference learning, Q-learning, actor–critic methods and stochastic gradient descent are all instances. In practice these algorithms are often run with a constant or bounded, non-vanishing stepsize: the iterate keeps…

7 thms1 active userReviewed
PreviousPage 3 of 3Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me