No article text was recorded for this version.
non-contractive Bellman operators
Version 1 of 142 papers45 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Non-Asymptotic Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes
- Blog: Finite Sample Analysis of Average-Reward TD Learning and $Q$-Learning
- Blog: Approximate Modified Policy Iteration
- Blog: Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes
- Blog: Convergence Theorems for Entropy-Regularized and Distributional Reinforcement Learning
- Blog: Learning Stochastic Shortest Path with Linear Function Approximation
- Blog: Reinforcement Learning with Dynamic Boltzmann Softmax Updates
- Blog: Convergence of Stochastic Iterative Dynamic Programming Algorithms
- Blog: A Reduction Framework for Distributionally Robust Reinforcement Learning under Average Reward
- Blog: Inverse Reinforcement Learning with the Average Reward Criterion
- Blog: Faster Fixed-Point Methods for Multichain MDPs
- Blog: Operator-Theoretic Foundations and Policy Gradient Methods for General MDPs with Unbounded Costs
- Blog: Can We Really Learn One Representation to Optimize All Rewards?
- Blog: RiskQ: Risk-sensitive Multi-Agent Reinforcement Learning Value Factorization
- Blog: An Alternative Softmax Operator for Reinforcement Learning
- Blog: Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning
- Blog: A Minimum Discounted Reward Hamilton-Jacobi Formulation for Computing Reachable Sets
- Blog: Model-Free Reinforcement Learning for Branching Markov Decision Processes
- Blog: A Principled Path to Fitted Distributional Evaluation
- Blog: An analysis of distributional reinforcement learning with Gaussian mixtures
- Blog: Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis
- Blog: Learning in Herding Mean Field Games: Single-Loop Algorithm with Finite-Time Convergence Analysis
- Blog: Suboptimality Bounds for Stochastic Shortest Path Problems
- Blog: Near-Optimal Sample Complexity for MDPs via Anchoring
- Blog: Learning Stochastic Shortest Path with Linear Function Approximation
- Blog: Distributional Reinforcement Learning via Moment Matching
- Blog: Finite-Time Bounds for Average-Reward Fitted Q-Iteration
- Blog: Policy Optimization for Robust Average Reward MDPs
- Blog: Offline Actor-Critic for Average Reward MDPs
- Blog: How to Combine Tree-Search Methods in Reinforcement Learning
- Blog: Accelerating Value Iteration with Anchoring
- Blog: Towards Provable Log Density Policy Gradient
- Blog: Distributional reinforcement learning with unconstrained monotonic neural networks
- Blog: On the Convergence of Modified Policy Iteration in Risk-Sensitive Exponential Cost Markov Decision Processes
- Blog: Bridging the Gap Between Average and Discounted TD Learning
- Blog: A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs
- Blog: Budgeted Reinforcement Learning in Continuous State Space
- Blog: Finite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise
- Blog: Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
- Blog: A Distributional Perspective on Reinforcement Learning
- Blog: On the uniqueness of solution for the Bellman equation of LTL objectives
- Blog: One-Step Distributional Reinforcement Learning
History & citation
Current · Permanent link
- This direction split from Convergence in Average Reward Reinforcement Learning (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_non_contractive_bellman_operators_cca8ffd0,
title = {non-contractive Bellman operators},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-contractive-bellman-operators/rdr_cca8ffd041ba478e9a318f97c81392e7},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_non_contractive_bellman_operators_cca8ffd0_v1,
title = {non-contractive Bellman operators},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-contractive-bellman-operators/rdr_cca8ffd041ba478e9a318f97c81392e7/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}