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 cs.LGShow all

35 papers · 1 filter

cs.LG2021★ 7 cited

SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs

Hongyu Ren, Hanjun Dai, Bo Dai +4

Knowledge graphs (KGs) capture knowledge in the form of head--relation--tail triples and are a crucial component in many AI systems. There are two important reasoning tasks on KGs:…

cs.LG2021

Understanding the Effect of Stochasticity in Policy Optimization

Jincheng Mei, Bo Dai, Chenjun Xiao +2

We study the effect of stochasticity in on-policy policy optimization, and make the following four contributions. First, we show that the preferability of optimization methods depe…

cs.LG2021★ 28 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★ 2 cited

Optimization Variance: Exploring Generalization Properties of DNNs

Xiao Zhang, Dongrui Wu, Haoyi Xiong +1

Unlike the conventional wisdom in statistical learning theory, the test error of a deep neural network (DNN) often demonstrates double descent: as the model complexity increases, i…

cs.LG2021★ 2 cited

On the Optimality of Batch Policy Optimization Algorithms

Chenjun Xiao, Yifan Wu, Tor Lattimore +5

Batch policy optimization considers leveraging existing data for policy construction before interacting with an environment. Although interest in this problem has grown significant…

cs.LG2021★ 7 cited

Off-Policy Imitation Learning from Observations

Zhuangdi Zhu, Kaixiang Lin, Bo Dai +1

Learning from Observations (LfO) is a practical reinforcement learning scenario from which many applications can benefit through the reuse of incomplete resources. Compared to conv…

cs.LG2020★ 6 cited

Small Towers Make Big Differences

Yuyan Wang, Zhe Zhao, Bo Dai +4

Multi-task learning aims at solving multiple machine learning tasks at the same time. A good solution to a multi-task learning problem should be generalizable in addition to being…

cs.LG2020★ 22 cited

Off-Policy Evaluation via the Regularized Lagrangian

Mengjiao Yang, Ofir Nachum, Bo Dai +2

The recently proposed distribution correction estimation (DICE) family of estimators has advanced the state of the art in off-policy evaluation from behavior-agnostic data. While t…

cs.LG2020★ 17 cited

Scalable Deep Generative Modeling for Sparse Graphs

Hanjun Dai, Azade Nazi, Yujia Li +2

Learning graph generative models is a challenging task for deep learning and has wide applicability to a range of domains like chemistry, biology and social science. However curren…

cs.LG2020★ 11 cited

Learning Sparse Rewarded Tasks from Sub-Optimal Demonstrations

Zhuangdi Zhu, Kaixiang Lin, Bo Dai +1

Model-free deep reinforcement learning (RL) has demonstrated its superiority on many complex sequential decision-making problems. However, heavy dependence on dense rewards and hig…

cs.LG2020★ 11 cited

Batch Stationary Distribution Estimation

Junfeng Wen, Bo Dai, Lihong Li +1

We consider the problem of approximating the stationary distribution of an ergodic Markov chain given a set of sampled transitions. Classical simulation-based approaches assume acc…

cs.LG2020★ 2 cited

Energy-Based Processes for Exchangeable Data

Mengjiao Yang, Bo Dai, Hanjun Dai +1

Recently there has been growing interest in modeling sets with exchangeability such as point clouds. A shortcoming of current approaches is that they restrict the cardinality of th…

cs.LG2020★ 15 cited

Differentiable Top-k Operator with Optimal Transport

Yujia Xie, Hanjun Dai, Minshuo Chen +5

The top-k operation, i.e., finding the k largest or smallest elements from a collection of scores, is an important model component, which is widely used in information retrieval, m…

cs.LG2020★ 25 cited

Reinforcement Learning via Fenchel-Rockafellar Duality

Ofir Nachum, Bo Dai

We review basic concepts of convex duality, focusing on the very general and supremely useful Fenchel-Rockafellar duality. We summarize how this duality may be applied to a variety…

cs.LG2020★ 45 cited

Retrosynthesis Prediction with Conditional Graph Logic Network

Hanjun Dai, Chengtao Li, Connor W. Coley +2

Retrosynthesis is one of the fundamental problems in organic chemistry. The task is to identify reactants that can be used to synthesize a specified product molecule. Recently, com…

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…

cs.LG2018★ 25 cited

Meta Architecture Search

Albert Shaw, Wei Wei, Weiyang Liu +2

Neural Architecture Search (NAS) has been quite successful in constructing state-of-the-art models on a variety of tasks. Unfortunately, the computational cost can make it difficul…

cs.LG2018★ 20 cited

Kernel Exponential Family Estimation via Doubly Dual Embedding

Bo Dai, Hanjun Dai, Arthur Gretton +3

We investigate penalized maximum log-likelihood estimation for exponential family distributions whose natural parameter resides in a reproducing kernel Hilbert space. Key to our ap…

cs.LG2018★ 10 cited

Learning Deep Hidden Nonlinear Dynamics from Aggregate Data

Yisen Wang, Bo Dai, Lingkai Kong +3

Learning nonlinear dynamics from diffusion data is a challenging problem since the individuals observed may be different at different time points, generally following an aggregate…