activity
20102022
most citedRobust Recovery of Subspace Structures by Low-Rank Representation

3.7k citations · 6.9k across the 74 of their papers we have counts for

collaborators
Showing 2021Show all

8 papers · 1 filter

cs.IR2021

Retrieval & Interaction Machine for Tabular Data Prediction

Jiarui Qin, Weinan Zhang, Rong Su +5

Prediction over tabular data is an essential task in many data science applications such as recommender systems, online advertising, medical treatment, etc. Tabular data is structu…

cs.AI2021★ 2 cited

MapGo: Model-Assisted Policy Optimization for Goal-Oriented Tasks

Menghui Zhu, Minghuan Liu, Jian Shen +7

In Goal-oriented Reinforcement learning, relabeling the raw goals in past experience to provide agents with hindsight ability is a major solution to the reward sparsity problem. In…

math.OC2021

Learning to Select Cuts for Efficient Mixed-Integer Programming

Zeren Huang, Kerong Wang, Furui Liu +6

Cutting plane methods play a significant role in modern solvers for tackling mixed-integer programming (MIP) problems. Proper selection of cuts would remove infeasible solutions in…

cs.IR2021★ 32 cited

An Adversarial Imitation Click Model for Information Retrieval

Xinyi Dai, Jianghao Lin, Weinan Zhang +7

Modern information retrieval systems, including web search, ads placement, and recommender systems, typically rely on learning from user feedback. Click models, which study how use…

q-bio.BM2021★ 29 cited

MARS: Markov Molecular Sampling for Multi-objective Drug Discovery

Yutong Xie, Chence Shi, Hao Zhou +4

Searching for novel molecules with desired chemical properties is crucial in drug discovery. Existing work focuses on developing neural models to generate either molecular sequence…

cs.LG2021★ 28 cited

Bag of Tricks for Node Classification with Graph Neural Networks

Yangkun Wang, Jiarui Jin, Weinan Zhang +3

Over the past few years, graph neural networks (GNN) and label propagation-based methods have made significant progress in addressing node classification tasks on graphs. However,…

q-fin.TR2021

Universal Trading for Order Execution with Oracle Policy Distillation

Yuchen Fang, Kan Ren, Weiqing Liu +5

As a fundamental problem in algorithmic trading, order execution aims at fulfilling a specific trading order, either liquidation or acquirement, for a given instrument. Towards eff…

cs.LG2021

Towards Generalized Implementation of Wasserstein Distance in GANs

Minkai Xu, Zhiming Zhou, Guansong Lu +3

Wasserstein GANs (WGANs), built upon the Kantorovich-Rubinstein (KR) duality of Wasserstein distance, is one of the most theoretically sound GAN models. However, in practice it doe…