Two-Way Truncated Linear Regression Models with Extremely Thresholding Penalization
采用极端阈值惩罚的双向截断线性回归AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要描述协变量阈值回归,未说明时间上的结构变化,故不归入结构变化方向。
采用极端阈值惩罚的双向截断线性回归AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This article introduces a new type of linear regression model with regularization. Each predictor is conditionally truncated through the presence of unknown thresholds. The new model, called the two-way truncated linear regression model (TWT-LR), is not only viewed as a nonlinear generalization of a linear model but is also a much more flexible model with greatly enhanced interpretability and applicability. The TWT-LR model performs classifications through thresholds similar to the tree-based methods and conducts inferences that are the same as the classical linear model on different segments. In addition, the innovative penalization, called the extremely thresholding penalty (ETP), is applied to thresholds. The ETP is independent of the values of regression coefficients and does not require any normalizations of regressors. The TWT-LR-ETP model detects thresholds at a wide range, including the two extreme ends where data are sparse. Under suitable conditions, both the estimators for coefficients and thresholds are consistent, with the convergence rate for threshold estimators being faster than n. Furthermore, the estimators for coefficients are asymptotically normal for fixed dimension p. It is demonstrated in simulations and real data analyses that the TWT-LR-ETP model illustrates various threshold features and provides better estimation and prediction results than existing models. Supplementary materials for this article are available online.
凸正则化的谱依赖:右旋转不变设计下的基本极限
We study the fundamental limits of convex-regularized estimation in high-dimensional linear regression with right-rotationally invariant design matrices. We show that the asymptotic risks of convex-penalized least squares estimators are lower bounded by the risk of an approximate message passing algorithm known as Bayes VAMP, and we further characterize when the lower bound is attainable. As a technical ingredient in the proof of our lower bound theorem, we characterize the…
从图套索到原子范数:高维模式恢复
We study high-dimensional precision-matrix estimation with polyhedral atomic-norm penalties on the off-diagonal entries. This framework covers the graphical lasso, $\ell_\infty$-type penalties, SLOPE/OWL penalties, and penalties motivated by colored graphical models. We define the target pattern through the subdifferential face of the dual ball and derive sufficient conditions for exact pattern recovery from the sample covariance matrix. Our analysis introduces two geometric…
高维线性回归的统一谱分析:去偏与阈值化
We use spectral analysis to establish a unified theory of debiasing, thresholding, and simultaneous inference for high-dimensional linear regression with ill-conditioned designs. The methods include Ridge regression, spectral cut-off, and iterative and dynamical regression procedures. A common debiasing procedure uses two applications of the original linear algorithm with fixed parameters. Spectral analysis shows that debiasing squares the residual, while implementations…
高维线性模型的诚实推断
We propose a heteroskedasticity-robust and dimention-adaptive test for multiple linear restric- tions in sparse high-dimensional linear regression models. It combines desparsified LASSO estimation with a ridge-regularized quadratic form statistic and critical values that adapt to the restriction dimension. Under stated regularity conditions, our approach is asymptotically valid under a fixed or diverging number of restrictions without specifying the asymptotic regime in…
基于相容性的贝叶斯推断:渐近极限、变分原理与 Wasserstein 几何
Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We develop a measure-theoretic formulation of discrepancy-based Bayesian inference in which compatibility is encoded through nonnegative weights. For vanishing thresholds, we establish convergence of the corresponding posterior distributions in total variation. In the large-sample regime, we identify conditions under which the posterior…
协整回归变量:折叠凹惩罚何时超越 LASSO
LASSO is one of the most popular regularization methods for high-dimensional regression models. While cointegration is common in practical applications of predictive regressions with many regressors, the convex penalty of LASSO overly suppresses the coefficients of cointegrated regressors and therefore fails to deliver consistent parameter estimation. We employ folded concave penalties (FCP), including the well-known SCAD and MCP, to address this issue. Using FCP, we…