activity
20202022
most citedCombiner: Full Attention Transformer with Sparse Computation Cost

28 citations · 64 across the 7 of their papers we have counts for

collaborators

8 papers

cs.LG20223 cited

Dichotomy of Control: Separating What You Can Control from What You Cannot

Mengjiao Yang, Dale Schuurmans, Pieter Abbeel +1

Future- or return-conditioned supervised learning is an emerging paradigm for offline reinforcement learning (RL), where the future outcome (i.e., return) associated with an observ…

cs.LG20224 cited

Chain of Thought Imitation with Procedure Cloning

Mengjiao Yang, Dale Schuurmans, Pieter Abbeel +1

Imitation learning aims to extract high-performance policies from logged demonstrations of expert behavior. It is common to frame imitation learning as a supervised learning proble…

cs.CL20221 cited

Context-Aware Language Modeling for Goal-Oriented Dialogue Systems

Charlie Snell, Mengjiao Yang, Justin Fu +2

Goal-oriented dialogue systems face a trade-off between fluent language generation and task-specific control. While supervised learning with large language models is capable of pro…

cs.LG20215 cited

TRAIL: Near-Optimal Imitation Learning with Suboptimal Data

Mengjiao Yang, Sergey Levine, Ofir Nachum

The aim in imitation learning is to learn effective policies by utilizing near-optimal expert demonstrations. However, high-quality demonstrations from human experts can be expensi…

cs.LG202128 cited

Combiner: Full Attention Transformer with Sparse Computation Cost

Hongyu Ren, Hanjun Dai, Zihang Dai +4

Transformers provide a class of expressive architectures that are extremely effective for sequence modeling. However, the key limitation of transformers is their quadratic memory a…

cs.LG2021

Provable Representation Learning for Imitation with Contrastive Fourier Features

Ofir Nachum, Mengjiao Yang

In imitation learning, it is common to learn a behavior policy to match an unknown target policy via max-likelihood training on a collected set of target demonstrations. In this wo…