62 citations · 82 across the 3 of their papers we have counts for
3 papers
stat.ML2019★ 62 cited
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits
Yingkai Li, Yining Wang, Yuan Zhou
We study the linear contextual bandit problem with finite action sets. When the problem dimension is , the time horizon is , and there are candidate actions…
stat.ML2018★ 7 cited
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
Yining Wang, Sivaraman Balakrishnan, Aarti Singh
We consider the problem of global optimization of an unknown non-convex smooth function with zeroth-order feedback. In this setup, an algorithm is allowed to adaptively query the u…
stat.ML2016★ 13 cited
A Theoretical Analysis of Noisy Sparse Subspace Clustering on Dimensionality-Reduced Data
Yining Wang, Yu-Xiang Wang, Aarti Singh
Subspace clustering is the problem of partitioning unlabeled data points into a number of clusters so that data points within one cluster lie approximately on a low-dimensional lin…