43 citations · 247 across the 30 of their papers we have counts for
4 papers · 1 filter
Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks
Jianqing Fan, Zhaoran Wang, Zhuoran Yang +1
We study high-dimensional multi-armed contextual bandits with batched feedback where the steps of online interactions are divided into batches. In specific, each batch coll…
Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
Yining Wang, Yi Chen, Ethan X. Fang +2
We consider the stochastic contextual bandit problem under the high dimensional linear model. We focus on the case where the action space is finite and random, with each action ass…
Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees
Sen Na, Yuwei Luo, Zhuoran Yang +2
Graph representation learning is a ubiquitous task in machine learning where the goal is to embed each vertex into a low-dimensional vector space. We consider the bipartite graph a…
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
Ming Yu, Varun Gupta, Mladen Kolar
We study the problem of recovery of matrices that are simultaneously low rank and row and/or column sparse. Such matrices appear in recent applications in cognitive neuroscience, i…