Derives non-asymptotic error bounds for standard, defensive, and self-normalized importance sampling with random KDE proposals from geometrically ergodic Markov chains, separating n^{-1/2} Monte Carlo error from MIAE/MISE proposal error.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
PRADAS derives a Bayes-optimal mirror statistic for any splitting scheme, establishes asymptotic FDR control under weak dependence, and optimizes the split ratio as a stopping time to improve power over standard equal-split methods.
GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
Generalized Rank Regression extends rank methods to non-monotonic scores, derives Bahadur representation and asymptotic normality, proposes a two-stage sub-gradient algorithm, and shows variance equivalence to composite quantile regression.
citing papers explorer
-
Error Bounds for Importance Sampling with Estimated Proposal Distributions
Derives non-asymptotic error bounds for standard, defensive, and self-normalized importance sampling with random KDE proposals from geometrically ergodic Markov chains, separating n^{-1/2} Monte Carlo error from MIAE/MISE proposal error.
-
PRADAS: PRior-Assisted DAta Splitting for False Discovery Rate Control
PRADAS derives a Bayes-optimal mirror statistic for any splitting scheme, establishes asymptotic FDR control under weak dependence, and optimizes the split ratio as a stopping time to improve power over standard equal-split methods.
-
Group-Aware Matrix Estimation and Latent Subspace Recovery
GAME is a convex estimator using overlapping nuclear-norm penalties on subgroup submatrices for low-rank matrix completion with known overlapping groups, providing finite-sample guarantees on reconstruction error and subgroup subspace recovery.
-
Generalized Rank Regression
Generalized Rank Regression extends rank methods to non-monotonic scores, derives Bahadur representation and asymptotic normality, proposes a two-stage sub-gradient algorithm, and shows variance equivalence to composite quantile regression.