← Search

Chris Harris

7 accepted papers

2025

FAIR Universe HiggsML Uncertainty Dataset and Competition

NeurIPS 2025poster

The FAIR Universe – HiggsML Uncertainty Challenge focused on measuring the physical properties of elementary particles with imperfect simulators. Participants were required to compute and report confidence intervals for a parameter of interest regarding the Higgs boson while accounting for various s…

Cited by 0SourcecodeScholar
2022

Understanding and Leveraging Overparameterization in Recursive Value Estimation

ICLR 2022poster

The theory of function approximation in reinforcement learning (RL) typically considers low capacity representations that incur a tradeoff between approximation error, stability and generalization. Current deep architectures, however, operate in an overparameterized regime where approximation error…

Cited by 18SourcePDFScholar
2020

A Maximum-Entropy Approach to Off-Policy Evaluation in Average-Reward MDPs

NeurIPS 2020poster

This work focuses on off-policy evaluation (OPE) with function approximation in infinite-horizon undiscounted Markov decision processes (MDPs). For MDPs that are ergodic and linear (i.e. where rewards and dynamics are linear in some known features), we provide the first finite-sample OPE error bound…

Cited by 12SourcePDFScholar
2020

RL-CycleGAN: Reinforcement Learning Aware Simulation-to-Real

CVPR 2020oral

Deep neural network based reinforcement learning (RL) can learn appropriate visual representations for complex tasks like vision-based robotic grasping without the need for manually engineering or prior learning a perception system. However, data for RL is collected via running an agent in the desir…

Cited by 241PDFScholar
2019

Off-Policy Evaluation via Off-Policy Classification

NeurIPS 2019poster

In this work, we consider the problem of model selection for deep reinforcement learning (RL) in real-world environments. Typically, the performance of deep RL algorithms is evaluated via on-policy interactions with the target environment. However, comparing models in a real-world environment for th…

Cited by 67SourcePDFScholar
2019

Surrogate Objectives for Batch Policy Optimization in One-step Decision Making

NeurIPS 2019poster

We investigate batch policy optimization for cost-sensitive classification and contextual bandits---two related tasks that obviate exploration but require generalizing from observed rewards to action selections in unseen contexts. When rewards are fully observed, we show that the expected reward ob…

Cited by 34SourcePDFScholar