← Search

Michael Gimelfarb

7 accepted papers

2025

ModelDiff: Symbolic Dynamic Programming for Model-Aware Policy Transfer in Deep Q-Learning

AAAI 2025technical

Despite significant recent advances in the field of Deep Reinforcement Learning (DRL), such methods typically incur high cost of training to learn effective policies, thus posing cost and safety challenges in many practical applications. To improve the learning efficiency of (D)RL methods, transfer…

Cited by 0SourcePDFScholar
2025

STITCH-OPE: Trajectory Stitching with Guided Diffusion for Off-Policy Evaluation

NeurIPS 2025spotlight

Off-policy evaluation (OPE) estimates the performance of a target policy using offline data collected from a behavior policy, and is crucial in domains such as robotics or healthcare where direct interaction with the environment is costly or unsafe. Existing OPE methods are ineffective for high-dime…

Cited by 0SourceScholar
2023

Conservative Bayesian Model-Based Value Expansion for Offline Policy Optimization

ICLR 2023poster

Offline reinforcement learning (RL) addresses the problem of learning a performant policy from a fixed batch of data collected by following some behavior policy. Model-based approaches are particularly appealing in the offline setting since they can extract more learning signals from the logged data…

2021

Contextual policy transfer in reinforcement learning domains via deep mixtures-of-experts

UAI 2021poster

In reinforcement learning, agents that consider the context or current state when transferring source policies have been shown to outperform context-free approaches. However, existing approaches suffer from limitations, including sensitivity to sparse or delayed rewards and estimation errors in valu…

Cited by 10SourcePDFScholar
2021

Risk-Aware Transfer in Reinforcement Learning using Successor Features

NeurIPS 2021poster

Sample efficiency and risk-awareness are central to the development of practical reinforcement learning (RL) for complex decision-making. The former can be addressed by transfer learning, while the latter by optimizing some utility function of the return. However, the problem of transferring skills…

Cited by 26SourcePDFScholar
2019

Epsilon-BMC: A Bayesian Ensemble Approach to Epsilon-Greedy Exploration in Model-Free Reinforcement Learning

UAI 2019poster

Resolving the exploration-exploitation trade-off remains a fundamental problem in the design and implementation of reinforcement learning (RL) algorithms. In this paper, we focus on model-free RL using the epsilon-greedy exploration policy, which despite its simplicity, remains one of the most frequ…

Cited by 28SourcePDFScholar
2018

Reinforcement Learning with Multiple Experts: A Bayesian Model Combination Approach

NeurIPS 2018poster

Potential based reward shaping is a powerful technique for accelerating convergence of reinforcement learning algorithms. Typically, such information includes an estimate of the optimal value function and is often provided by a human expert or other sources of domain knowledge. However, this informa…

Cited by 32SourcePDFScholar