AI Paper Atlas

Research map / Probabilistic and scientific modeling / Bayesian optimization

Counterfactual Data-Fusion for Online Reinforcement Learners

ICML 2017 · Probabilistic and scientific modeling › Bayesian optimization · approach: Regret bounds for Bayesian optimization · 41 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Fuse observational and experimental data with counterfactual data (TSRDC* vs TSRDC+) (ablation)TSRDC+ · Greedy Casinocumulative regret: 65.04 -> 42.23Helped
Fuse observational and experimental data with counterfactual data (TSRDC* vs TSRDC+) (ablation)TSRDC+ · Paradoxical Switchingcumulative regret: 64.70 -> 36.91Helped
Replace intent-agnostic TS with RDC-based playersTS · Greedy Casinooptimal arm convergenceHelped
Vary reward parameterization across a wide rangeTSRDC* · Appendix B parameterizationscumulative regretHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy