Learning universal policies via text-guided video generation

Y Du, S Yang, B Dai, H Dai… - Advances in …, 2024 - proceedings.neurips.cc
A goal of artificial intelligence is to construct an agent that can solve a wide variety of tasks.
Recent progress in text-guided image synthesis has yielded models with an impressive …

Foundation models for decision making: Problems, methods, and opportunities

S Yang, O Nachum, Y Du, J Wei, P Abbeel… - arxiv preprint arxiv …, 2023 - arxiv.org
Foundation models pretrained on diverse data at scale have demonstrated extraordinary
capabilities in a wide range of vision and language tasks. When such models are deployed …

Contrastive learning as goal-conditioned reinforcement learning

B Eysenbach, T Zhang, S Levine… - Advances in Neural …, 2022 - proceedings.neurips.cc
In reinforcement learning (RL), it is easier to solve a task if given a good representation.
While deep RL should automatically acquire such good representations, prior work often …

Pessimistic model-based offline reinforcement learning under partial coverage

M Uehara, W Sun - arxiv preprint arxiv:2107.06226, 2021 - arxiv.org
We study model-based offline Reinforcement Learning with general function approximation
without a full coverage assumption on the offline data distribution. We present an algorithm …

Leveraging offline data in online reinforcement learning

A Wagenmaker, A Pacchiano - International Conference on …, 2023 - proceedings.mlr.press
Two central paradigms have emerged in the reinforcement learning (RL) community: online
RL and offline RL. In the online RL setting, the agent has no prior knowledge of the …

Hybrid rl: Using both offline and online data can make rl efficient

Y Song, Y Zhou, A Sekhari, JA Bagnell… - arxiv preprint arxiv …, 2022 - arxiv.org
We consider a hybrid reinforcement learning setting (Hybrid RL), in which an agent has
access to an offline dataset and the ability to collect experience via real-world online …

Efficient model-free exploration in low-rank mdps

Z Mhammedi, A Block, DJ Foster… - Advances in Neural …, 2024 - proceedings.neurips.cc
A major challenge in reinforcement learning is to develop practical, sample-efficient
algorithms for exploration in high-dimensional domains where generalization and function …

Representation learning with multi-step inverse kinematics: An efficient and optimal approach to rich-observation rl

Z Mhammedi, DJ Foster… - … Conference on Machine …, 2023 - proceedings.mlr.press
We study the design of sample-efficient algorithms for reinforcement learning in the
presence of rich, high-dimensional observations, formalized via the Block MDP problem …

Contrastive ucb: Provably efficient contrastive self-supervised learning in online reinforcement learning

S Qiu, L Wang, C Bai, Z Yang… - … Conference on Machine …, 2022 - proceedings.mlr.press
In view of its power in extracting feature representation, contrastive self-supervised learning
has been successfully integrated into the practice of (deep) reinforcement learning (RL) …

Spectral decomposition representation for reinforcement learning

T Ren, T Zhang, L Lee, JE Gonzalez… - arxiv preprint arxiv …, 2022 - arxiv.org
Representation learning often plays a critical role in reinforcement learning by managing the
curse of dimensionality. A representative class of algorithms exploits a spectral …