most citedA note on the approximate admissibility of regularized estimators in the Gaussian sequence model

5 citations · 12 across the 4 of their papers we have counts for

collaborators

5 papers

math.OC20173 cited

The discrete moment problem with nonconvex shape constraints

Xi Chen, Simai He, Bo Jiang +2

The discrete moment problem is a foundational problem in distribution-free robust optimization, where the goal is to find a worst-case distribution that satisfies a given set of mo…

cs.DS20174 cited

A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model

Xi Chen, Yuanzhi Li, Jieming Mao

We study the active learning problem of top- ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top- items with high p…

math.ST2017

Testing independence with high-dimensional correlated samples

Xi Chen, Weidong Liu

Testing independence among a number of (ultra) high-dimensional random samples is a fundamental and challenging problem. By arranging identically distributed -dimensional ra…

math.ST20175 cited

A note on the approximate admissibility of regularized estimators in the Gaussian sequence model

Xi Chen, Adityanand Guntuboyina, Yuchen Zhang

We study the problem of estimating an unknown vector from an observation drawn according to the normal distribution with mean and identity covariance matrix under the k…

cs.DS2016

Competitive analysis of the top-K ranking problem

Xi Chen, Sivakanth Gopi, Jieming Mao +1

Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top items from noisy pairwise c…