activity
20122021
most citedNetwork Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec

722 citations · 998 across the 13 of their papers we have counts for

collaborators

13 papers

cs.CL2021★ 51 cited

NAS-BERT: Task-Agnostic and Adaptive-Size BERT Compression with Neural Architecture Search

Jin Xu, Xu Tan, Renqian Luo +4

While pre-trained language models (e.g., BERT) have achieved impressive results on different natural language processing tasks, they have large numbers of parameters and suffer fro…

cs.DS2020★ 1 cited

Approximation Algorithms for Clustering with Dynamic Points

Shichuan Deng, Jian Li, Yuval Rabani

We study two generalizations of classic clustering problems called dynamic ordered -median and dynamic -supplier, where the points that need clustering evolve over time, and…

cs.LG2020★ 16 cited

Improved Algorithms for Convex-Concave Minimax Optimization

Yuanhao Wang, Jian Li

This paper studies minimax optimization problems , where is -strongly convex with respect to , -strongly concave with respect to and…

cs.MM2019★ 118 cited

TS-RNN: Text Steganalysis Based on Recurrent Neural Networks

Zhongliang Yang, Ke Wang, Jian Li +2

With the rapid development of natural language processing technologies, more and more text steganographic methods based on automatic text generation technology have appeared in rec…

math.OC2018★ 1 cited

A Fast Anderson-Chebyshev Acceleration for Nonlinear Optimization

Zhize Li, Jian Li

Anderson acceleration (or Anderson mixing) is an efficient acceleration method for fixed point iterations , e.g., gradient descent can be viewed as iteratively appl…

cs.LG2018★ 10 cited

Gradient Boosting With Piece-Wise Linear Regression Trees

Yu Shi, Jian Li, Zhize Li

Gradient Boosted Decision Trees (GBDT) is a very successful ensemble learning algorithm widely used across a variety of applications. Recently, several variants of GBDT training al…

math.OC2018★ 66 cited

A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization

Zhize Li, Jian Li

We analyze stochastic gradient algorithms for optimizing nonconvex, nonsmooth finite-sum problems. In particular, the objective function is given by the summation of a differentiab…

cs.SI2017★ 722 cited

Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec

Jiezhong Qiu, Yuxiao Dong, Hao Ma +3

Since the invention of word2vec, the skip-gram model has significantly advanced the research of network embedding, such as the recent emergence of the DeepWalk, LINE, PTE, and node…

cs.DS2016★ 2 cited

Optimal In-Place Suffix Sorting

Zhize Li, Jian Li, Hongwei Huo

The suffix array is a fundamental data structure for many applications that involve string searching and data compression. Designing time/space-efficient suffix array construction…

cs.LG2016★ 9 cited

Pure Exploration of Multi-armed Bandit Under Matroid Constraints

Lijie Chen, Anupam Gupta, Jian Li

We study the pure exploration problem subject to a matroid constraint (Best-Basis) in a stochastic multi-armed bandit game. In a Best-Basis instance, we are given stochastic ar…

cs.LG2015★ 2 cited

Learning Arbitrary Statistical Mixtures of Discrete Distributions

Jian Li, Yuval Rabani, Leonard J. Schulman +1

We study the problem of learning from unlabeled samples very general statistical mixture models on large finite sets. Specifically, the model to be learned, , is a proba…

cs.DS2013

Ranking with Diverse Intents and Correlated Contents

Jian Li, Zeyu Zhang

We consider the following document ranking problem: We have a collection of documents, each containing some topics (e.g. sports, politics, economics). We also have a set of users w…

cs.DS2012

Stochastic Combinatorial Optimization via Poisson Approximation

Jian Li, Wen Yuan

We study several stochastic combinatorial problems, including the expected utility maximization problem, the stochastic knapsack problem and the stochastic bin packing problem. A c…