4 papers
Computing over Data Streams using Catalytic Space
Ripley Becker, Sourav Chakraborty, Debarshi Chanda +2
We introduce a streaming model with \emph{catalytic memory}, an auxiliary workspace that must be returned to its initial state at the end of the computation. We show that catalytic…
List Replicable Reinforcement Learning
Bohan Zhang, Michael Chen, A. Pavan +3
Replicability is a fundamental challenge in reinforcement learning (RL), as RL algorithms are empirically observed to be unstable and sensitive to variations in training conditions…
Algorithms and Hardness for Estimating Statistical Similarity
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel +3
We introduce and study the computational problem of determining statistical similarity between probability distributions. For distributions and over a finite sample space,…
Computational Explorations of Total Variation Distance
Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel +3
We investigate some previously unexplored (or underexplored) computational aspects of total variation (TV) distance. First, we give a simple deterministic polynomial-time algorithm…