Quantify and characterize the efficiency gap induced by convex-loss restriction for non-log-concave errors
Sourced from the work of Oliver Y. Feng, Yu-Chun Kao, Min Xu, Richard J. Samworth
§ Problem Statement
Setup
Let be fixed, and suppose we observe i.i.d. pairs , , from the linear model
where is unknown, is independent of , is positive definite, and has density on . Assume regularity conditions ensuring standard -estimation asymptotics (e.g., for some , integrability and stochastic equicontinuity conditions, and nondegeneracy of curvature terms).
For a convex loss , write . Assume is absolutely continuous (so exists a.e.), , and . For Fisher consistency/identification, assume and that is the unique root of . Define the convex -estimator
Its asymptotic covariance matrix is
Assume is known. Let and (finite, positive Fisher information for location). The oracle maximum-likelihood estimator
has asymptotic covariance
For the class of convex losses satisfying the above conditions, define the best convex relative efficiency
which, when is twice differentiable with integrable , is equivalently
The matrix ratio is interpreted in Loewner order (equivalently here as a scalar ratio since both covariances are multiples of ).
Unsolved Problem
For non-log-concave (so is not convex), determine and characterize : compute or bound it for broad classes of such , characterize exactly when , and establish nontrivial distribution-free lower bounds on under explicit regularity assumptions on (e.g., smoothness, tail, and Fisher-information conditions).
§ Discussion
§ Significance & Implications
The abstract gives one non-log-concave example (Cauchy) with efficiency above , suggesting convex estimators can remain highly competitive. A general theory of the efficiency gap would clarify when convexity is effectively free and when it is statistically costly. This directly informs robustness-computation-efficiency tradeoffs in practice. See Feng et al. (2024) for details.
§ Known Partial Results
Feng et al. (2024): The paper derives the optimal convex loss via a score-matching/log-concave-projection principle and proves asymptotic optimality within convex -estimators. It provides the Cauchy case as evidence of high efficiency (>0.87) but does not claim a full characterization across error distributions.
§ References
Optimal Convex $M$-Estimation via Score Matching
Oliver Y. Feng, Yu-Chun Kao, Min Xu, Richard J. Samworth (2024)
arXiv preprint
📍 arXiv:2403.16688v2, Section 5 (Discussion), paragraph beginning "A particularly interesting question concerns the magnitude of $\\eta_f$", PDF p. 19.
Primary preprint source where the efficiency-gap discussion is posed.
Optimal Convex $M$-Estimation via Score Matching
Oliver Y. Feng, Yu-Chun Kao, Min Xu, Richard J. Samworth
Annals of Statistics (to appear)
📍 Cambridge Apollo metadata record (accepted version), journal field listed as Annals of Statistics.
Journal-publication metadata kept separate from preprint metadata; journal publication year to be filled once finalized.