activity
20082023
most citedCombinatorial Multi-Armed Bandit with General Reward Functions

75 citations · 200 across the 26 of their papers we have counts for

collaborators

26 papers

cs.CV2023★ 11 cited

Toward Zero-shot Character Recognition: A Gold Standard Dataset with Radical-level Annotations

Xiaolei Diao, Daqian Shi, Jian Li +5

Optical character recognition (OCR) methods have been applied to diverse tasks, e.g., street view text recognition and document analysis. Recently, zero-shot OCR has piqued the int…

cs.LG2017★ 7 cited

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration

Lijie Chen, Anupam Gupta, Jian Li +2

We study the combinatorial pure exploration problem Best-Set in stochastic multi-armed bandits. In a Best-Set instance, we are given arms with unknown reward distributions, as…

cs.CG2017★ 2 cited

Odd Yao-Yao Graphs are Not Spanners

Yifei Jin, Jian Li, Wei Zhan

It is a long standing open problem whether Yao-Yao graphs are all spanners [li2002sparse]. Bauer and Damian [bauer2013infinite] showed that all …

cs.DS2017★ 4 cited

Capacitated Center Problems with Two-Sided Bounds and Outliers

Hu Ding, Lunjia Hu, Lingxiao Huang +1

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices , we want to find a subset of vertices , called centers, s…

cs.CG2017★ 15 cited

Linear Time Approximation Schemes for Geometric Maximum Coverage

Kai Jin, Jian Li, Haitao Wang +2

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let be a set of weighted points in the plane. Let repre…

cs.IT2017

Improved Algorithms For Structured Sparse Recovery

Lingxiao Huang, Yifei Jin, Jian Li +1

It is known that certain structures of the signal in addition to the standard notion of sparsity (called structured sparsity) can improve the sample complexity in several compressi…