No article text was recorded for this version.
memory-efficient reinforcement learning
Version 2 of 248 papers71 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Almost Optimal Model-Free Reinforcement Learningvia Reference-Advantage Decomposition
- Blog: Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time
- Blog: Model-Free Reinforcement Learning: from Clipped Pseudo-Regret to Sample Complexity
- Blog: Is Q-Learning Provably Efficient?
- Blog: Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning
- Blog: Speedy Q-Learning
- Blog: Truncated Variance Reduced Value Iteration
- Blog: Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
- Blog: Q-Learning with Fine-Grained Gap-Dependent Regret
- Blog: Near-Optimal Sample Complexity for MDPs via Anchoring
- Blog: Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity
- Blog: Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap
- Blog: Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path
- Blog: Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP
- Blog: Settling the sample complexity of model-based offline reinforcement learning
- Blog: Q-learning with Logarithmic Regret
- Blog: On-line Reinforcement Learning Using Incremental Kernel-Based Stochastic Factorization
- Blog: Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning
- Blog: Fast deep reinforcement learning using online adjustments from the past
- Blog: Randomized Ensembled Double Q-Learning: Learning Fast Without a Model
- Blog: UCB Momentum Q-learning: Correcting the bias without forgetting
- Blog: Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity
- Blog: Sample Efficient Reinforcement Learning with Partial Dynamics Knowledge
- Blog: Federated Q-Learning: Linear Regret Speedup with Low Communication Cost
- Blog: Provably Efficient Model-Free Algorithms for Non-stationary CMDPs
- Blog: Concurrent Reinforcement Learning with Aggregated States via Randomized Least Squares Value Iteration
- Blog: Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees
- Blog: AsyncQVI: Asynchronous-Parallel Q-Value Iteration for Discounted Markov Decision Processes with Near-Optimal Sample Complexity
- Blog: Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
- Blog: Adaptive Discretization in Online Reinforcement Learning
- Blog: Fully-Echoed Q-Routing With Simulated Annealing Inference for Flying Adhoc Networks
- Blog: Adaptive Discretization for Model-Based Reinforcement Learning
- Blog: Efficient Value-Function Approximation via Online Linear Regression
- Blog: Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes
- Blog: Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs
- Blog: Self-Motivated Multi-Agent Exploration
- Blog: Optimistic Q-learning for average reward and episodic reinforcement learning
- Blog: Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision Processes
- Blog: Catching Two Birds with One Stone: Reward Shaping with Dual Random Networks for Balancing Exploration and Exploitation
- Blog: Decentralized model-free reinforcement learning in stochastic games with average-reward objective
- Blog: Sample-Efficient Reinforcement Learning with Temporal Logic Objectives: Leveraging the Task Specification to Guide Exploration
- Blog: Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon MDP
- Blog: Stabilizing Q-learning with Linear Architectures for Provable Efficient Learning
- Blog: Is Q-Learning Provably Efficient? An Extended Analysis
- Blog: Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning
- Blog: VOQL: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation
- Blog: Truncated Variance Reduced Value Iteration
- Blog: Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning
History & citation
Current · Permanent link
- reference-advantage decomposition split from this direction (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_memory_efficient_reinforcement_learning_9b13e592,
title = {memory-efficient reinforcement learning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/memory-efficient-reinforcement-learning/rdr_9b13e592bb444edf86670650088a8478},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_memory_efficient_reinforcement_learning_9b13e592_v2,
title = {memory-efficient reinforcement learning},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/memory-efficient-reinforcement-learning/rdr_9b13e592bb444edf86670650088a8478/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}