Establishes maximal concentration bounds for stochastic approximation under heavy-tailed Markovian noise, with tails ranging from sub-Gaussian to heavier than Weibull depending on step sizes and contractivity properties, plus a truncation argument for unbounded noise.
Journal of Computational and Graphical Statistics , volume=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
RAT reformulates regularized natural policy gradients as vanilla gradients with a transformed advantage, computed efficiently via randomized block Kaczmarz iterations on on-policy data.
Clipped least-squares importance fitting enables weighted conformal prediction to achieve dataset-conditional coverage guarantees under unbounded covariate shifts by bounding undercoverage and estimating a corrective inflation factor from data.
citing papers explorer
-
Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
Establishes maximal concentration bounds for stochastic approximation under heavy-tailed Markovian noise, with tails ranging from sub-Gaussian to heavier than Weibull depending on step sizes and contractivity properties, plus a truncation argument for unbounded noise.
-
Randomized Advantage Transformation (RAT): Computing Natural Policy Gradients via Direct Backpropagation
RAT reformulates regularized natural policy gradients as vanilla gradients with a transformed advantage, computed efficiently via randomized block Kaczmarz iterations on on-policy data.
-
Weight Clipping for Robust Conformal Inference under Unbounded Covariate Shifts
Clipped least-squares importance fitting enables weighted conformal prediction to achieve dataset-conditional coverage guarantees under unbounded covariate shifts by bounding undercoverage and estimating a corrective inflation factor from data.