Proportional-asymptotic inference for nonconvex penalties

Extend the proportional-asymptotic theory for sparse support vector machine inference from the L1 penalty to nonconvex penalties such as SCAD and MCP, with formal inferential guarantees.

Background

The paper analyzes only the L1-penalized SVM. Although nonconvex penalties can reduce regularization bias, the corresponding proportional-asymptotic inferential theory is not developed here. The authors specifically name SCAD and MCP as candidate penalties for future extension.

References

Several directions remain open. First, the present theory is restricted to balanced, linearly separable data; extending it to class-imbalanced designs \citep{Loffredo2024RestoringBalance} or to the nonseparable perceptron regime \citep{Franz2019CriticalJammed} is a natural next step. Second, the theoretical framework is based on a replica-symmetric characterization and does not provide a rigorous proof of the RS ansatz or its stability; establishing such results, or identifying conditions under which the RS solution can be justified rigorously, is an important theoretical problem. Third, the framework assumes a Gaussian-mixture model for the class-conditional distributions, and extending the theory to broader distributional classes would increase its applicability. Fourth, the current analysis is restricted to the $L_1$ penalty; extending the proportional-asymptotic theory to nonconvex penalties such as SCAD \citep{fan2001variable} or MCP could combine reduced regularization bias with formal inferential guarantees.

— High-Dimensional Statistical Inference for Sparse Support Vector Machines  (2610.08345 - Zeng et al., 6 Oct 2026) in Conclusion, Section 5