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.
Tim Van Erven and Peter Harremos
15 Pith papers cite this work, alongside 1,062 external citations. Polarity classification is still indexing.
representative citing papers
Polynomial-time SDP and ellipsoid-based approximation of Kolmogorov widths yields efficient robust detection boundaries matching upper bounds up to polylog factors for structured constrained signals.
Bayesian PINNs for elliptic PDEs have posteriors that contract around the true solution at near-optimal rates, with the prior adapting automatically to unknown smoothness.
Constructs a minimax-optimal adaptive test for constant volatility in the nonparametric Gaussian white noise model under infill asymptotics, measuring deviations via the ratio of sigma(t) to its L2-average.
Profile MLE for the regime-switching threshold in null-recurrent diffusion converges at rate n^{-(1+γ)/2} to the arg sup of a doubly stochastic drifted Poisson process involving local time of oscillating Brownian motion.
DP-GD achieves minimax optimal non-asymptotic risk O(γ + γ²/ρ²) for well-conditioned high-dimensional data and power-law scaling for ill-conditioned power-law spectra, with the exponent depending on the privacy parameter ρ.
Optimal rates for non-log-concave sampling and log-partition estimation are sometimes equal to or faster than optimization rates, but polynomial-time algorithms fall short of near-optimal performance.
Near-linear time algorithm for robust regression under Gaussian covariates achieves O(sqrt(ε κ)) error with Õ(d/ε⁴) samples when ε κ ≲ 1, plus SQ and low-degree lower bounds.
Out-of-distribution extrapolation is non-identifiable from in-distribution data alone; the feature map, label map, and model class supply the identifiability bias that determines whether a network succeeds or fails at OOD generalization.
MoFI-FLR recovers active covariates and identifies their true functional forms (simple or complex) in high-dimensional functional linear regressions.
A semi-supervised kernel two-sample test integrates unlabeled covariate data to achieve asymptotic normality under the null, higher power than standard kernel tests, and consistency against fixed and local alternatives.
DSL uses doubly robust pseudo-outcomes and a multi-output neural network to jointly estimate time-varying conditional average treatment effects for right-censored survival data.
A semiparametric robust estimator for population location models the dominant component parametrically and the background nonparametrically, with FFT acceleration for scalable likelihood maximization.
A post-processing algorithm achieves distribution-free finite-sample group fairness guarantees with controlled excess risk for both group-aware and group-blind settings, shown minimax-optimal up to logs via lower bound.
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.
-
Efficient Robust Constrained Signal Detection via Kolmogorov Width Approximations
Polynomial-time SDP and ellipsoid-based approximation of Kolmogorov widths yields efficient robust detection boundaries matching upper bounds up to polylog factors for structured constrained signals.
-
Posterior Concentration of Bayesian Physics-Informed Neural Networks for Elliptic PDEs
Bayesian PINNs for elliptic PDEs have posteriors that contract around the true solution at near-optimal rates, with the prior adapting automatically to unknown smoothness.
-
Sharp adaptive nonparametric testing for constant volatility
Constructs a minimax-optimal adaptive test for constant volatility in the nonparametric Gaussian white noise model under infill asymptotics, measuring deviations via the ratio of sigma(t) to its L2-average.
-
Self-organized regime switching in null-recurrent dynamics
Profile MLE for the regime-switching threshold in null-recurrent diffusion converges at rate n^{-(1+γ)/2} to the arg sup of a doubly stochastic drifted Poisson process involving local time of oscillating Brownian motion.
- Empirical Bernstein Confidence Intervals for Kernel Smoothers: A Safe and Sharp Way to Exhaust Assumed Smoothness