◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jian Li

17 papers hereh-index 121k citations25 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author10
  • last author4

Across the 17 of 17 papers where every author was matched, so the position is known.

fields
  • cs.LG9
  • cs.DS3
  • cs.CL2
  • astro-ph.EP1
  • cs.DC1
  • cs.NI1
same name
  • Jian Li — 34 papers, h 17
  • Jian Li — 32 papers, h 28
  • Jian Li — 32 papers, h 13
  • Jian Li — 29 papers, h 31
  • Jian Li — 26 papers, h 19
  • Jian Li — 17 papers, h 10

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20162022
most citedNearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection

17 citations · 57 across the 11 of their papers we have counts for

collaborators
Showing 2017 · cs.LGShow all

4 papers · 2 filters

cs.LG2017★ 3 cited

Generative Adversarial Mapping Networks

Jianbo Guo, Guangxiang Zhu, Jian Li

Generative Adversarial Networks (GANs) have shown impressive performance in generating photo-realistic images. They fit generative models by minimizing certain distance measure bet…

cs.LG2017★ 8 cited

Practical Algorithms for Best-K Identification in Multi-Armed Bandits

Haotian Jiang, Jian Li, Mingda Qiao

In the Best-K identification problem (Best-K-Arm), we are given N stochastic bandit arms with unknown reward distributions. Our goal is to identify the K arms with the larg…

cs.LG2017

SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms

Yifei Jin, Lingxiao Huang, Jian Li

We study two important SVM variants: hard-margin SVM (for linearly separable cases) and ν-SVM (for linearly non-separable cases). We propose new algorithms from the perspective o…

cs.LG2017★ 17 cited

Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection

Lijie Chen, Jian Li, Mingda Qiao

In the Best-k-Arm problem, we are given n stochastic bandit arms, each associated with an unknown reward distribution. We are required to identify the k arms with the largest…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.