← Search

Matthew Schlegel

4 accepted papers

2026

Laplacian Representations for Decision-Time Planning

ICML 2026poster

Planning with a learned model remains a key challenge in model-based reinforcement learning~(RL). In decision-time planning, state representations are critical as they must support local cost computation while preserving long-horizon structure. In this paper, we show that the Laplacian representatio…

Cited by 0SourceScholar
2019

Importance Resampling for Off-policy Prediction

NeurIPS 2019poster

Importance sampling (IS) is a common reweighting strategy for off-policy prediction in reinforcement learning. While it is consistent and unbiased, it can result in high variance updates to the weights for the value function. In this work, we explore a resampling strategy as an alternative to rewei…

2018

Context-dependent upper-confidence bounds for directed exploration

NeurIPS 2018poster

Directed exploration strategies for reinforcement learning are critical for learning an optimal policy in a minimal number of interactions with the environment. Many algorithms use optimism to direct exploration, either through visitation estimates or upper confidence bounds, as opposed to data-inef…

Cited by 21SourcePDFScholar
2017

Adapting Kernel Representations Online Using Submodular Maximization

ICML 2017poster

Kernel representations provide a nonlinear representation, through similarities to prototypes, but require only simple linear learning algorithms given those prototypes. In a continual learning setting, with a constant stream of observations, it is critical to have an efficient mechanism for sub-sel…

Cited by 12SourcePDFScholar