A unified non-linear regularization framework for high-dimensional $M$-estimation, encompassing both linear models and Cox's proportional hazards models, and establishes a unified oracle equivalence for both model classes under a liberated micro-penalty scaling regime.
Abstract
This paper establishes a unified non-linear regularization framework for high-dimensional $M$-estimation, encompassing both linear models and Cox's proportional hazards models. Rather than relying on traditional additive non-convex penalties, the proposed paradigm embeds sparsity directly into the transformation for the physical parameter $\theta=\phi(\beta)$ using a smooth ($C^2$) component-wise"ReParametrization map for Sparsity (RePS)"$\phi$, and the penalty term is $\lambda \Vert \beta \Vert_1$ rather than $\lambda \Vert \theta \Vert_1$. This structural formulation dynamically adapts to local parameter scales, suppressing high-dimensional noise while simultaneously recovering unbiased oracle asymptotic normality under the large-sample limit. Through the Primal-Dual Witness method, we establish a unified oracle equivalence for both model classes under a liberated micro-penalty scaling regime $\lambda \ll n^{-1/2}$, accommodating model-specific structures such as the shift-invariance in survival analysis. Extensive Monte Carlo simulations demonstrate that the proposed framework consistently achieves superior false-positive control and high 95\% confidence interval coverage in high-dimensional linear models, while also delivering performance comparable or superior in all aspects to state-of-the-art methods like SCAD and MCP in proportional hazards models.
We study estimation of a linear functional in random-design linear models when $\gamma=p/n \in (1, \infty)$ under the dense regime where the design covariance is unknown, and neither the regression vector nor the precision matrix is assumed sparse. Suppose the spectrum of the design covariance belongs to $[\ell,L]$, we...
It is proved that the extracted trend is invariant across representations, and a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector is obtained, and this divergence vanishes as $\lambda\to\infty$.
Non-negative matrix factorization (NMF) is a singular statistical model whose Bayesian asymptotics are governed by the real log canonical threshold (RLCT). We study the local geometry of the factorization map and derive an upper bound for the RLCT of NMF. Let $H$ be the model inner dimension and $H_0$ the non-negative...
We develop an accelerated stochastic method for convex $(H_0,H_1)$-smooth optimization under heavy-tailed noise. The unbiased oracle has a finite $p$-th noise moment, $1<p\le2$, with constant, gradient-dependent, and gap-dependent terms. Our method combines accelerated updates with clipping, projection, and phase resta...
The main innovation is to develop stochastic control theory within the branching OGP framework, significantly expanding the settings in which it locates an exact algorithmic threshold.
Brice Huang, Mark Sellke, Ni-Ke Sun· 3 citations· ⚡1
This work proposes the first robust estimator achieving near-optimal dimension-free statistical rates in this setting, and extends the trimmed-mean framework underlying recent advances in robust mean and covariance estimation to arbitrary tensor order.
R. Oliveira, Zoraida F. Rico, Philip Thompson· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.