ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2106.01723
  4. Cited By
Risk Minimization from Adaptively Collected Data: Guarantees for
  Supervised and Policy Learning

Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning

3 June 2021
Aurélien F. Bibaut
Antoine Chambaz
Maria Dimakopoulou
Nathan Kallus
Mark van der Laan
    OffRL
ArXivPDFHTML

Papers citing "Risk Minimization from Adaptively Collected Data: Guarantees for Supervised and Policy Learning"

25 / 25 papers shown
Title
Fast Rates for the Regret of Offline Reinforcement Learning
Fast Rates for the Regret of Offline Reinforcement Learning
Yichun Hu
Nathan Kallus
Masatoshi Uehara
OffRL
61
30
0
31 Jan 2021
Fast Rates for Contextual Linear Optimization
Fast Rates for Contextual Linear Optimization
Yichun Hu
Nathan Kallus
Xiaojie Mao
OffRL
53
41
0
05 Nov 2020
Optimal Off-Policy Evaluation from Multiple Logging Policies
Optimal Off-Policy Evaluation from Multiple Logging Policies
Nathan Kallus
Yuta Saito
Masatoshi Uehara
OffRL
53
40
0
21 Oct 2020
Towards optimal doubly robust estimation of heterogeneous causal effects
Towards optimal doubly robust estimation of heterogeneous causal effects
Edward H. Kennedy
CML
146
322
0
29 Apr 2020
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for
  Contextual Bandits under Realizability
Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability
D. Simchi-Levi
Yunzong Xu
OffRL
332
109
0
28 Mar 2020
Generalized Policy Elimination: an efficient algorithm for Nonparametric
  Contextual Bandits
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
OffRL
87
3
0
05 Mar 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression
  Oracles
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles
Dylan J. Foster
Alexander Rakhlin
328
207
0
12 Feb 2020
Confidence Intervals for Policy Evaluation in Adaptive Experiments
Confidence Intervals for Policy Evaluation in Adaptive Experiments
Vitor Hadad
David A. Hirshberg
Ruohan Zhan
Stefan Wager
Susan Athey
54
145
0
07 Nov 2019
Smooth Contextual Bandits: Bridging the Parametric and
  Non-differentiable Regret Regimes
Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes
Yichun Hu
Nathan Kallus
Xiaojie Mao
53
34
0
05 Sep 2019
Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for
  Reinforcement Learning
Intrinsically Efficient, Stable, and Bounded Off-Policy Evaluation for Reinforcement Learning
Nathan Kallus
Masatoshi Uehara
OffRL
70
54
0
09 Jun 2019
Orthogonal Statistical Learning
Orthogonal Statistical Learning
Dylan J. Foster
Vasilis Syrgkanis
98
171
0
25 Jan 2019
Contextual bandits with surrogate losses: Margin bounds and efficient
  algorithms
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
Dylan J. Foster
A. Krishnamurthy
126
18
0
28 Jun 2018
More Robust Doubly Robust Off-policy Evaluation
More Robust Doubly Robust Off-policy Evaluation
Mehrdad Farajtabar
Yinlam Chow
Mohammad Ghavamzadeh
OffRL
70
267
0
10 Feb 2018
Estimation Considerations in Contextual Bandits
Estimation Considerations in Contextual Bandits
Maria Dimakopoulou
Zhengyuan Zhou
Susan Athey
Guido Imbens
224
69
0
19 Nov 2017
OpenML Benchmarking Suites
OpenML Benchmarking Suites
B. Bischl
Giuseppe Casalicchio
Matthias Feurer
Pieter Gijsbers
Frank Hutter
Michel Lang
R. G. Mantovani
Jan N. van Rijn
Joaquin Vanschoren
VLM
ELM
66
161
0
11 Aug 2017
Dynamic Assortment Personalization in High Dimensions
Dynamic Assortment Personalization in High Dimensions
Nathan Kallus
Madeleine Udell
136
67
0
18 Oct 2016
Dynamic Pricing with Demand Covariates
Dynamic Pricing with Demand Covariates
Sheng Qiang
Mohsen Bayati
112
116
0
25 Apr 2016
Statistical inference for the mean outcome under a possibly non-unique
  optimal treatment strategy
Statistical inference for the mean outcome under a possibly non-unique optimal treatment strategy
Alexander Luedtke
M. J. van der Laan
214
222
0
24 Mar 2016
Doubly Robust Policy Evaluation and Optimization
Doubly Robust Policy Evaluation and Optimization
Miroslav Dudík
D. Erhan
John Langford
Lihong Li
OffRL
170
285
0
10 Mar 2015
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Alekh Agarwal
Daniel J. Hsu
Satyen Kale
John Langford
Lihong Li
Robert Schapire
OffRL
348
507
0
04 Feb 2014
The multi-armed bandit problem with covariates
The multi-armed bandit problem with covariates
Vianney Perchet
Philippe Rigollet
396
173
0
27 Oct 2011
Efficient Optimal Learning for Contextual Bandits
Efficient Optimal Learning for Contextual Bandits
Miroslav Dudík
Daniel J. Hsu
Satyen Kale
Nikos Karampatziakis
John Langford
L. Reyzin
Tong Zhang
179
301
0
13 Jun 2011
Nonparametric Bandits with Covariates
Nonparametric Bandits with Covariates
Philippe Rigollet
A. Zeevi
195
109
0
08 Mar 2010
A Contextual-Bandit Approach to Personalized News Article Recommendation
A Contextual-Bandit Approach to Personalized News Article Recommendation
Lihong Li
Wei Chu
John Langford
Robert Schapire
417
2,944
0
28 Feb 2010
On the minimal penalty for Markov order estimation
On the minimal penalty for Markov order estimation
R. Handel
94
34
0
25 Aug 2009
1