paper-with-me

홈 › Papers

$K$-Nearest-Neighbor Resampling for Off-Policy Evaluation in Stochastic Control

2023-06-07 · Michael Giegrich, Roel Oomen, Christoph Reisinger

In this paper, we propose a novel $K$-nearest neighbor resampling procedure for estimating the performance of a policy from historical data containing realized episodes of a decision process generated under a different policy. We provide statistical consistency results under weak conditions. In particular, we avoid the common assumption of identically and independently distributed transitions and rewards. Instead, our analysis allows for the sampling of entire episodes, as is common practice in most applications. To establish the consistency in this setting, we generalize Stone's Theorem, a well-known result in nonparametric statistics on local averaging, to include episodic data and the counterfactual estimation underlying off-policy evaluation (OPE). By focusing on feedback policies that depend deterministically on the current state in environments with continuous state-action spaces and system-inherent stochasticity effected by chosen actions, and relying on trajectory simulation similar to Monte Carlo methods, the proposed method is particularly well suited for stochastic control environments. Compared to other OPE methods, our algorithm does not require optimization, can be efficiently implemented via tree-based nearest neighbor search and parallelization, and does not explicitly assume a parametric model for the environment's dynamics. Numerical experiments demonstrate the effectiveness of the algorithm compared to existing baselines in a variety of stochastic control settings, including a linear quadratic regulator, trade execution in limit order books, and online stochastic bin packing.

📄 PDF Abstract BibTeX arXiv:2306.04836

Code (1)

anonymconference/knnr 공식 구현

Tasks

counterfactualOff-policy evaluation

Methods 이 논문이 사용한 방법론

Focus 설명 없음

Similar Papers 제목 키워드 기반

Limit Order Book Simulation and Trade Evaluation with $K$-Nearest-Neighbor Resampling

2024-09-10 · Michael Giegrich, Roel Oomen, Christoph Reisinger

In this paper, we show how $K$-nearest neighbor ($K$-NN) resampling, an off-policy evaluation method proposed in \cite{giegrich2023k}, can be applied to simulate limit order book (LOB) markets and how it can be used to e…

Off-policy evaluation

Improving Spherical Image Resampling through Viewport-Adaptivity

2023-06-23 · Andy Regensky, Viktoria Heimann, Ruoyu Zhang, André Kaup

The conversion between different spherical image and video projection formats requires highly accurate resampling techniques in order to minimize the inevitable loss of information. Suitable resampling algorithms such as…

SSIM

pNNCLR: Stochastic Pseudo Neighborhoods for Contrastive Learning based Unsupervised Representation Learning Problems

2023-08-14 · Momojit Biswas, Himanshu Buckchash, Dilip K. Prasad

Nearest neighbor (NN) sampling provides more semantic variations than pre-defined transformations for self-supervised learning (SSL) based image recognition problems. However, its performance is restricted by the quality…

Contrastive LearningRepresentation LearningSelf-Supervised Learning

A Kernel-Based Conditional Two-Sample Test Using Nearest Neighbors (with Applications to Calibration, Regression Curves, and Simulation-Based Inference)

2024-07-23 · Anirban Chatterjee, Ziang Niu, Bhaswar B. Bhattacharya

In this paper we introduce a kernel-based measure for detecting differences between two conditional distributions. Using the `kernel trick' and nearest-neighbor graphs, we propose a consistent estimate of this measure wh…

$k$-Neighbor Based Curriculum Sampling for Sequence Prediction

2021-01-22 · James O' Neill, Danushka Bollegala

Multi-step ahead prediction in language models is challenging due to the discrepancy between training and test time processes. At test time, a sequence predictor is required to make predictions given past predictions as …

Language ModellingPrediction