conftrace_

linear function approximation

101 papers

Explore in graph

Also known as

LFA

Co-occurring keywords

reinforcement learning (4352) regret bound (1926) markov decision process (790) sample complexity (1169) function approximation (319) temporal difference learning (149) value function (295) value iteration (162) policy optimization (657) policy evaluation (115)

Papers

Distributionally Robust Online Markov Game with Linear Function Approximation AAAI 2026
Learning with Linear Function Approximations in Mean-Field Control JMLR 2025
Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation AAAI 2024
Refined Sample Complexity for Markov Games with Independent Linear Function Approximation (Extended Abstract) COLT 2024
Improved High-Probability Bounds for the Temporal Difference Learning Algorithm via Exponential Stability COLT 2024
Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation AISTATS 2024
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition AISTATS 2024
Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions COLT 2024
Regularized Q-Learning NIPS 2024
Sample Complexity Characterization for Linear Contextual MDPs AISTATS 2024
Hybrid Reinforcement Learning Breaks Sample Size Barriers In Linear MDPs NIPS 2024
Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration AAAI 2024
Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach JMLR 2024
Matryoshka Policy Gradient for Entropy-Regularized RL: Convergence and Global Optimality JMLR 2024
Reward-Relevance-Filtered Linear Offline Reinforcement Learning AISTATS 2024
Refined Regret for Adversarial MDPs with Linear Function Approximation ICML 2023
Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation ICML 2023
Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning AISTATS 2023
Exponential Hardness of Reinforcement Learning with Linear Function Approximation COLT 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation COLT 2023
Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation L4DC 2023
Multi-Agent congestion cost minimization with linear function approximations AISTATS 2023
A Complete Characterization of Linear Estimators for Offline Policy Evaluation JMLR 2023
Modified Retrace for Off-Policy Temporal Difference Learning UAI 2023
Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation ICML 2023