No article text was recorded for this version.
function approximation scalability
Version 2 of 2931 papers970 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Convergence of Indirect Adaptive Asynchronous Value Iteration Algorithms
- Blog: Minimax-Optimal Reward-Agnostic Exploration in Reinforcement Learning
- Blog: Private Reinforcement Learning with PAC and Regret Guarantees
- Blog: Instance-Dependent Confidence and Early Stopping for Reinforcement Learning
- Blog: Upper Confidence Primal-Dual Reinforcement Learning for CMDP with Adversarial Loss
- Blog: Bayesian inference approach for entropy regularized reinforcement learning with stochastic dynamics
- Blog: A note on the function approximation error bound for risk-sensitive reinforcement learning
- Blog: Multi-Agent Reinforcement Learning with Reward Delays
- Blog: Efficient Risk-sensitive Planning via Entropic Risk Measures
- Blog: Is Inverse Reinforcement Learning Harder than Standard Reinforcement Learning?
- Blog: Robust Phi-Divergence MDPs
- Blog: Cascaded Gaps: Towards Gap-Dependent Regret for Risk-Sensitive Reinforcement Learning
- Blog: A Simple Reward-free Approach to Constrained Reinforcement Learning
- Blog: A Natural Actor-Critic Framework for Zero-Sum Markov Games
- Blog: Optimistic Policy Optimization with Bandit Feedback
- Blog: Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space
- Blog: Counterfactual Optimism: Rate Optimal Regret for Stochastic Contextual MDPs
- Blog: Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs
- Blog: PAC-Bayesian Policy Evaluation for Reinforcement Learning
- Blog: Double Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coverage
- Blog: Policy Optimization for Stochastic Shortest Path
- Blog: Risk-Sensitive Reinforcement Learning with Function Approximation: A Debiasing Approach
- Blog: Performative Reinforcement Learning
- Blog: Reward-Free Exploration for Reinforcement Learning
- Blog: Near-Optimal Differentially Private Reinforcement Learning
- Blog: Finite-Time Analysis for Double Q-learning
- Blog: Cautious Reinforcement Learning via Distributional Risk in the Dual Domain
- Blog: Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies
- Blog: Provably Efficient Reinforcement Learning with Linear Function Approximation
- Blog: Near-Optimal Reinforcement Learning with Self-Play
- Blog: Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis
- Blog: SaVeR: Optimal Data Collection Strategy for Safe Policy Evaluation in Tabular MDP
- Blog: Cascaded Gaps: Towards Logarithmic Regret for Risk-Sensitive Reinforcement Learning
- Blog: Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst Path
- Blog: Defense Against Reward Poisoning Attacks in Reinforcement Learning
- Blog: A Statistical Analysis of Polyak-Ruppert Averaged Q-learning
- Blog: From Generative to Episodic: Sample-Efficient Replicable Reinforcement Learning
- Blog: Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents
- Blog: POMRL: No-Regret Learning-to-Plan with Increasing Horizons
- Blog: Hierarchical Successor Representation for Robust Transfer
- Blog: Periodic agent-state based Q-learning for POMDPs
- Blog: On Corruption-Robustness in Performative Reinforcement Learning
- Blog: Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism
- Blog: Fast Rates for Maximum Entropy Exploration
- Blog: Provably Efficient Q-Learning with Low Switching Cost
- Blog: State-free Reinforcement Learning
- Blog: Reward-Free Exploration for Reinforcement Learning
- Blog: Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost
- Blog: Concave Utility Reinforcement Learning with Zero-Constraint Violations
- Blog: Bridging Imitation and Online Reinforcement Learning: An Optimistic Tale
- Blog: Near-Optimal Reinforcement Learning in Dynamic Treatment Regimes
- Blog: Non-asymptotic Performances of Robust Markov Decision Processes
- Blog: Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning
- Blog: The Power of Exploiter: Provable Multi-Agent RL in Large State Spaces
- Blog: Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
- Blog: Learning Adversarial MDPs with Stochastic Hard Constraints
- Blog: Multi-Channel Interactive Reinforcement Learning for Sequential Tasks
- Blog: Provable Self-Play Algorithms for Competitive Reinforcement Learning
- Blog: A New Policy Iteration Algorithm For Reinforcement Learning in Zero-Sum Markov Games
- Blog: On Generalization of Adversarial Imitation Learning and Beyond
Showing 60 of 931 papers.
History & citation
Current · Permanent link
- Minimizing Burn-In Costs for Sample-Optimal Reinforcement Learning merged into this direction (50% overlap)
- Robustness as Regularization in Markov Decision Processes merged into this direction (70% overlap)
- Optimal Sample Complexity for Robust Reinforcement Learning merged into this direction (52% overlap)
- reference-advantage decomposition split from this direction (56% overlap)
- function approximation gap split from this direction (80% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_function_approximation_scalability_289e7857,
title = {function approximation scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/function-approximation-scalability/rdr_289e7857e5e54474ab659ee7dfda211d},
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_function_approximation_scalability_289e7857_v2,
title = {function approximation scalability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/function-approximation-scalability/rdr_289e7857e5e54474ab659ee7dfda211d/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}