Search arXiv⌕ Search

arXiv subjects

Amitakshar Biswas

Publications and source records attributed to Amitakshar Biswas.

3 recordsLinked to original sources

Adaptive Budgeted Data Acquisition for Robust Off-Policy Evaluation from Multiple Loggers

We consider off-policy evaluation when additional data can be purchased from several existing logging policies (or loggers) with heterogeneous costs per observation. While existing work on multiple loggers presumes a fixed number of observations from each logger, we study how to allocate a limited budget across them sequentially to evaluate a finite class of target policies. We propose Adaptive Greedy, an algorithm that purchases observations sequentially from the affordable logger that has the most cost-normalized variance reduction across the target policies. It turns out that each such purchase is an 'approximate conditional-gradient step' for the corresponding design problem. Under mild assumptions, we establish that the empirical allocation converges almost surely to the optimal design at an explicit rate. We also derive the asymptotic normality of the final pooled estimator and show that it attains the semiparametric efficiency bound. Simulations and a semi-synthetic application based on the AIDS Clinical Trials Group Study 175 show that Adaptive Greedy outperforms standard allocation strategies, remains accurate if stopped early, and matches the final accuracy of repeated integer programming at a fraction of its computational cost.

stat.ML↗

Offline Policy Evaluation via Mixed Bellman Residuals and Adaptive Critic Representations

Evaluating a target policy using data generated by a different behavior policy remains a fundamental challenge in reinforcement learning. While most existing work relies on the standard one-step Bellman residual, we consider a convex combination of one-step and two-step residuals with a fixed mixing weight. In ideal settings, this mixed Bellman formulation can provide a natural bias--variance trade-off between approximation error under a restricted value-function class and the increased variance arising from multi-step importance weighting. To solve this mixed residual optimization, we adopt a minimax formulation involving a critic function. Unlike standard approaches that rely on a fixed functional class, we construct a data-dependent critic representation using predicted future feature directions which effectively induces a kernel adapted to the underlying transition dynamics. This allows the critic to focus on directions that are most relevant for the estimated Bellman error. To control overfitting, we use sample splitting to construct the critic and estimate the value function on separate data subsets. Simulation studies and MetaWorld tasks illustrate the effect of the mixing parameter and show that intermediate residual combinations can improve value estimation in challenging settings.

stat.ML↗

Random Invariance Testing on Quadratic Form Statistics with Application to Autocorrelation

Randomization testing with permutations is a very common nonparametric approach to hypothesis testing. However, randomization testing can be done with other group transformations including random rotations. In this work, we consider the problem of invariance in quadratic form statistics under a unified framework with closed form p-values. In particular, we propose a nonparametric variant of the classic Durbin-Watson test for testing for autocorrelation in time series data at arbitrary lags. Our test is performed by integrating over a group of invariances of the test statistic, and easy-to-compute analytic formulae for the p-value are derived from concentration inequalities on compact groups on a per-lag basis. Thus, the usual necessity of large-scale Monte Carlo simulations is rendered unnecessary. Our tests outperform the classic Breusch-Godfrey and Ljung-Box tests on simulated data with respect to statistical power to identify significant autocorrelation. They also can be used to identify the presence of autocorrelation at large lags such as in monthly solar intensity data, which follows an approximate 11 year (132 month) cycle. The general formulation of this approach can be easily adapted to other quadratic form statistics.

stat.ME↗