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

75 papers

cs.IR2022★ 1 cited

A Graph-Enhanced Click Model for Web Search

Jianghao Lin, Weiwen Liu, Xinyi Dai +6

To better exploit search logs and model users' behavior patterns, numerous click models are proposed to extract users' implicit interaction feedback. Most traditional click models…

cs.LG2022★ 1 cited

Generative Adversarial Exploration for Reinforcement Learning

Weijun Hong, Menghui Zhu, Minghuan Liu +4

Exploration is crucial for training the optimal reinforcement learning (RL) policy, where the key is to discriminate whether a state visiting is novel. Most previous work focuses o…

cs.LG2022★ 24 cited

DropNAS: Grouped Operation Dropout for Differentiable Architecture Search

Weijun Hong, Guilin Li, Weinan Zhang +4

Neural architecture search (NAS) has shown encouraging results in automating the architecture design. Recently, DARTS relaxes the search process with a differentiable formulation t…

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…

cs.IR2020★ 18 cited

U-rank: Utility-oriented Learning to Rank with Implicit Feedback

Xinyi Dai, Jiawei Hou, Qing Liu +6

Learning to rank with implicit feedback is one of the most important tasks in many real-world information systems where the objective is some specific utility, e.g., clicks and rev…

cs.LG2020★ 6 cited

Model-based Policy Optimization with Unsupervised Model Adaptation

Jian Shen, Han Zhao, Weinan Zhang +1

Model-based reinforcement learning methods learn a dynamics model with real data sampled from the environment and leverage it to generate simulated data to derive an agent. However…

math.OC2020★ 2 cited

Efficient Projection-Free Algorithms for Saddle Point Problems

Cheng Chen, Luo Luo, Weinan Zhang +1

The Frank-Wolfe algorithm is a classic method for constrained optimization problems. It has recently been popular in many machine learning applications because its projection-free…

cs.LG2020★ 53 cited

GeneraLight: Improving Environment Generalization of Traffic Signal Control via Meta Reinforcement Learning

Chang Liu, Huichu Zhang, Weinan Zhang +2

The heavy traffic congestion problem has always been a concern for modern cities. To alleviate traffic congestion, researchers use reinforcement learning (RL) to develop better tra…

cs.AI2020★ 17 cited

GIKT: A Graph-based Interaction Model for Knowledge Tracing

Yang Yang, Jian Shen, Yanru Qu +5

With the rapid development in online education, knowledge tracing (KT) has become a fundamental problem which traces students' knowledge status and predicts their performance on ne…

cs.CL2020★ 20 cited

Glancing Transformer for Non-Autoregressive Neural Machine Translation

Lihua Qian, Hao Zhou, Yu Bao +5

Recent work on non-autoregressive neural machine translation (NAT) aims at improving the efficiency by parallel decoding without sacrificing the quality. However, existing NAT meth…

cs.LG2020★ 12 cited

Bidirectional Model-based Policy Optimization

Hang Lai, Jian Shen, Weinan Zhang +1

Model-based reinforcement learning approaches leverage a forward dynamics model to support planning and decision making, which, however, may fail catastrophically if the model is i…

cs.IR2020★ 3 cited

An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph

Jiarui Jin, Jiarui Qin, Yuchen Fang +5

There is an influx of heterogeneous information network (HIN) based recommender systems in recent years since HIN is capable of characterizing complex graphs and contains rich sema…

cs.IR2020★ 3 cited

Interactive Recommender System via Knowledge Graph-enhanced Reinforcement Learning

Sijin Zhou, Xinyi Dai, Haokun Chen +5

Interactive recommender system (IRS) has drawn huge attention because of its flexible recommendation strategy and the consideration of optimal long-term user experiences. To deal w…

cs.IR2020★ 107 cited

User Behavior Retrieval for Click-Through Rate Prediction

Jiarui Qin, Weinan Zhang, Xin Wu +3

Click-through rate (CTR) prediction plays a key role in modern online personalization services. In practice, it is necessary to capture user's drifting interests by modeling sequen…

cs.IR2020★ 1 cited

A Deep Recurrent Survival Model for Unbiased Ranking

Jiarui Jin, Yuchen Fang, Weinan Zhang +7

Position bias is a critical problem in information retrieval when dealing with implicit yet biased user feedback data. Unbiased ranking methods typically rely on causality models a…

cs.LG2020★ 3 cited

Infomax Neural Joint Source-Channel Coding via Adversarial Bit Flip

Yuxuan Song, Minkai Xu, Lantao Yu +3

Although Shannon theory states that it is asymptotically optimal to separate the source and channel coding as two independent processes, in many practical communication scenarios t…

cs.CL2020★ 1 cited

Active Sentence Learning by Adversarial Uncertainty Sampling in Discrete Space

Dongyu Ru, Jiangtao Feng, Lin Qiu +5

Active learning for sentence understanding aims at discovering informative unlabeled data for annotation and therefore reducing the demand for labeled data. We argue that the typic…