Defines threshold breakdown point and m-sensitivity for M-estimators, derives their properties, extends to hypothesis testing, and supplies consistency, asymptotic normality, and multiplier bootstrap results.
Theory of cryptography conference , pages=
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Constrained log-optimal e-variables are obtained by post-processing the unconstrained optimal e-variable via an appropriate transformation.
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.
Replaces determinant growth with generalized Rayleigh quotient for rare switching in private linear bandits to control worst-direction volume despite non-monotonic design matrices from noise.
citing papers explorer
-
The Threshold Breakdown Point
Defines threshold breakdown point and m-sensitivity for M-estimators, derives their properties, extends to hypothesis testing, and supplies consistency, asymptotic normality, and multiplier bootstrap results.
-
Optimal e-variables under constraints
Constrained log-optimal e-variables are obtained by post-processing the unconstrained optimal e-variable via an appropriate transformation.
-
On efficient robust regression with subquadratic samples
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.
-
When Determinants Are Not Enough: Private Rare Switching
Replaces determinant growth with generalized Rayleigh quotient for rare switching in private linear bandits to control worst-direction volume despite non-monotonic design matrices from noise.