1k citations
- Stanford UniversityUS33 papers
- Google (United States)US32 papers
- University of Illinois Urbana-ChampaignUS32 papers
- University of California, BerkeleyUS29 papers
- Massachusetts Institute of TechnologyUS28 papers
- Carnegie Mellon UniversityUS26 papers
- University of California San DiegoUS25 papers
- University College LondonGB22 papers
- Georgia Institute of TechnologyUS21 papers
- University of Maryland, College ParkUS21 papers
- University of MichiganUS18 papers
- University of Southern CaliforniaUS16 papers
16 papers · 1 filter
Disentangling Mixtures of Unknown Causal Interventions
Abhinav Kumar, Gaurav Sinha
In many real-world scenarios, such as gene knockout experiments, targeted interventions are often accompanied by unknown interventions at off-target sites. Moreover, different unit…
Asymptotics of Ridge Regression in Convolutional Models
Mojtaba Sahraee-Ardakan, Tung Mai, Anup Rao +3
Understanding generalization and estimation error of estimators for simple models such as linear and generalized linear models has attracted a lot of attention recently. This is in…
On Shapley Credit Allocation for Interpretability
Debraj Basu
We emphasize the importance of asking the right question when interpreting the decisions of a learning model. We discuss a natural extension of the theoretical machinery from Janzi…
Scalable Thompson Sampling via Optimal Transport
Ruiyi Zhang, Zheng Wen, Changyou Chen +1
Thompson sampling (TS) is a class of algorithms for sequential decision-making, which requires maintaining a posterior distribution over a model. However, calculating exact posteri…
Conservative Exploration using Interleaving
Sumeet Katariya, Branislav Kveton, Zheng Wen +1
In many practical problems, a learning agent may want to learn the best action in hindsight without ever taking a bad action, which is significantly worse than the default producti…
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit
Yang Cao, Zheng Wen, Branislav Kveton +1
Multi-armed bandit (MAB) is a class of online learning problems where a learning agent aims to maximize its expected cumulative reward while repeatedly selecting to pull arms with…