Reinforcement Learning

Provably Efficient Reinforcement Learning via Surprise Bound AISTATS 2023 Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP ICML 2023 Provably efficient representation selection in Low-rank Markov Decision Processes: from online to offline RL UAI 2023 Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst Path ICLR 2023 Provably Fast Convergence of Independent Natural Policy Gradient for Markov Potential Games NeurIPS 2023 Provably (More) Sample-Efficient Offline RL with Options NeurIPS 2023 Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards NeurIPS 2023 Provably Safe Reinforcement Learning with Step-wise Violation Constraints NeurIPS 2023 Provably Sample-Efficient Model-Free Algorithm for MDPs with Peak Constraints JMLR 2023 Q-functionals for Value-Based Continuous Control AAAI 2023 Q-Learning-Based Model Predictive Variable Impedance Control for Physical Human-Robot Collaboration (Extended Abstract) IJCAI 2023 Q-learning Decision Transformer: Leveraging Dynamic Programming for Conditional Sequence Modelling in Offline RL ICML 2023 Q-Learning for MDPs with General Spaces: Convergence and Near Optimality via Quantization under Weak Continuity JMLR 2023 q-Learning in Continuous Time JMLR 2023 Q-Pensieve: Boosting Sample Efficiency of Multi-Objective RL Through Memory Sharing of Q-Snapshots ICLR 2023 Q-Transformer: Scalable Offline Reinforcement Learning via Autoregressive Q-Functions CoRL 2023 Quality-Similar Diversity via Population Based Reinforcement Learning ICLR 2023 Quantile Credit Assignment ICML 2023 Quantum Multi-Agent Meta Reinforcement Learning AAAI 2023 Quantum Policy Gradient Algorithm with Optimized Action Decoding ICML 2023 Quasi-optimal Reinforcement Learning with Continuous Actions ICLR 2023 RACE: Improve Multi-Agent Reinforcement Learning with Representation Asymmetry and Collaborative Evolution ICML 2023 Reachability Analysis-based Safety-Critical Control using Online Fixed-Time Reinforcement Learning L4DC 2023 Reachability-Aware Laplacian Representation in Reinforcement Learning ICML 2023 Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path ALT 2023