activity
20132023
most citedDiscriminative Embeddings of Latent Variable Models for Structured Data

498 citations · 1.8k across the 44 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

cs.LG2019★ 80 cited

AlgaeDICE: Policy Gradient from Arbitrary Experience

Ofir Nachum, Bo Dai, Ilya Kostrikov +3

In many real-world applications of reinforcement learning (RL), interactions with the environment are limited due to cost or feasibility. This presents a challenge to traditional R…

cs.LG2019★ 2 cited

Energy-Inspired Models: Learning with Sampler-Induced Distributions

Dieterich Lawson, George Tucker, Bo Dai +1

Energy-based models (EBMs) are powerful probabilistic models, but suffer from intractable sampling and density evaluation due to the partition function. As a result, inference in E…

cs.LG2019★ 111 cited

DualDICE: Behavior-Agnostic Estimation of Discounted Stationary Distribution Corrections

Ofir Nachum, Yinlam Chow, Bo Dai +1

In many real-world reinforcement learning applications, access to the environment is limited to a fixed dataset, instead of direct (online) interaction with the environment. When u…

cs.LG2019★ 2 cited

Cooperative neural networks (CoNN): Exploiting prior independence structure for improved classification

Harsh Shrivastava, Eugene Bart, Bob Price +3

We propose a new approach, called cooperative neural networks (CoNN), which uses a set of cooperatively trained neural networks to capture latent representations that exploit prior…

cs.LG2019★ 13 cited

Exponential Family Estimation via Adversarial Dynamics Embedding

Bo Dai, Zhen Liu, Hanjun Dai +4

We present an efficient algorithm for maximum likelihood estimation (MLE) of exponential family models, with a general parametrization of the energy function that includes neural n…

cs.LG2019★ 29 cited

Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees

Binghong Chen, Bo Dai, Qinjie Lin +3

We propose a meta path planning algorithm named \emph{Neural Exploration-Exploitation Trees~(NEXT)} for learning from prior experience for solving new path planning problems in hig…