Prediction sets for high-dimensional mixture of experts models
高维混合专家模型的预测集AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要涉及一般高维预测与材料应用,未明确涉及宏观预测、收益预测或所列其他方向。
高维混合专家模型的预测集AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Abstract Large datasets make it possible to build predictive models that can capture heterogenous relationships between the response variable and features. The mixture of high-dimensional linear experts model posits that observations come from a mixture of high-dimensional linear regression models, where the mixture weights are themselves feature-dependent. In this article, we show how to construct valid prediction sets for an ℓ1-penalized mixture of experts model in the high-dimensional setting. We make use of a debiasing procedure to account for the bias induced by the penalization and propose a novel strategy for combining intervals to form a prediction set with coverage guarantees in the mixture setting. Synthetic examples and an application to the prediction of critical temperatures of superconducting materials show our method to have reliable practical performance.
Understanding associations between paired high-dimensional longitudinal datasets is a fundamental yet challenging problem arising across scientific domains, including longitudinal multi-omic studies. The difficulty stems from the complex, time-varying cross-covariance structure coupled with high dimensionality, which complicates both model formulation and statistical estimation for association discovery. To address these challenges, we propose a new framework called…
结合 model-X knockoffs 与 p 值的高维线性模型 FDR 控制
We propose a novel multiple testing methodology for controlling the false discovery rate (FDR) in high-dimensional linear models that integrates model-X knockoff techniques with debiased penalized regression estimators. At the foundation of our methodology, we construct and study two sets of naturally paired high-dimensional test statistics and the associated $p$-values for evaluating the same null hypotheses. The first set is shown to be asymptotically mutually independent,…
基于广义逆距离权重的GNAR模型改进多元时间序列预测
Many multivariate time series arise on networks where relationships between variables depend on physical or more general distances. Standard vector autoregressive models struggle in such settings due to their quadratic parameter growth, while generalised network autoregressive (GNAR) models offer a parsimonious alternative by explicitly incorporating network structures. Existing GNAR formulations assume fixed weights, typically uniform or reciprocal distances, which may not…
Schmelzer and Hastie prove that Markowitz's Critical Line Algorithm and the LASSO path trace the same curve. This companion note checks that result numerically with a stock LASSO solver, \texttt{lars\_path} from \texttt{scikit-learn}, and no portfolio software. It covers long--short portfolios under a leverage cap, fixed leverage with varying risk appetite, and the classical long-only, fully invested frontier. Every corner the path returns meets its own optimality conditions…
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…