Estimating Precision Matrices for High-Dimensional Interval-Valued Data
高维区间值数据的精度矩阵估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要主题为高维区间值数据的精度矩阵估计与图模型方法,属于统计学习方法论,未涉及所给微观、宏观或金融领域细分的具体经济问题,故不选择任何领域细分。
高维区间值数据的精度矩阵估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
In the field of statistical learning and data analysis, estimating precision matrices (i.e., the inverse of covariance matrices) is a critical task, particularly for understanding dependency structures among variables. However, traditional methods often fall short when dealing with high-dimensional interval-valued data, where each observation is represented as an interval rather than a single point. This paper proposes a novel framework for estimating precision matrices in such contexts, addressing the unique challenges posed by the interval nature of the data. Specifically, we assume that the upper and lower bounds of the intervals share the same conditional dependency structure, and then formulate the interval graphical lasso optimization objective to estimate the precision matrix. At the optimization level, we provide an efficient computational approach, while at the theoretical level, we prove the sparsity and consistency of the estimator. Experimental results on simulated studies and real data applications demonstrate the superiority of the proposed method in terms of estimation precision and interpretability.
We consider the joint estimation of change-point locations and the sparsity pattern of the variance-covariance matrix, which is assumed to evolve in a piecewise constant manner. By applying Group Fused LASSO and LASSO penalties to the squared Frobenius norm, we estimate both the covariance structure and the change points. Adaptive weights are incorporated into the penalty terms to enhance change-point detection and covariance estimation accuracy. We establish the conditions…
近端估计与推断
Abstract We develop a convex-analytic framework for constructing and analyzing a broad class of penalized estimators. Our method defines penalized estimators by applying proximal operators to benchmark estimators, rather than by penalizing the benchmark criterion itself. We establish general finite-sample properties, derive unified asymptotic distribution results, and provide tractable conditions for oracle selection and oracle asymptotic efficiency. We then apply the…
组间不平衡下的风险异质性稳健推断
Population-level heterogeneity is ubiquitous in biomedical data, where differences across demographic or clinical subgroups can substantially alter risk patterns. For example, in intensive care unit (ICU) studies, the mortality risk associated with specific admission diagnoses can vary across ethnic groups. Existing approaches for detecting risk heterogeneity are often sensitive to baseline model misspecification and regularization bias, both of which commonly arise in…
高维稀疏组卷积平滑分位数回归
In many applications, covariates are naturally organized into groups, yet conventional group-selection methods often retain all variables within selected groups, failing to achieve within-group sparsity. To address this limitation, we propose an adaptive two-stage sparse-group selection procedure for high-dimensional quantile regression. The proposed method integrates convolution-smoothed quantile loss with $\ell_{2,0}$ and $\ell_0$ penalties to identify important groups and…
凸正则化的谱依赖:右旋转不变设计下的基本极限
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…