Oracle inequalities and optimal inference under group sparsity
组稀疏性下的预言不等式与最优统计推断AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要讨论通用组稀疏回归与多任务学习，未明确涉及面板、因果识别或所列其他细分。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
组稀疏性下的预言不等式与最优统计推断
- 研究问题
- 研究已知变量分组且仅少数组相关时，Group Lasso 的预测、估计与组选择误差能否得到最优界并优于普通 Lasso。
- 方法与思路
- 作者在高斯噪声和受限特征值条件下分析 Group Lasso，再以更强条件研究混合范数与阈值选择，并推导上下界。
- 材料陈述的贡献
- 摘要称误差上界在对数因子内达到极小极大最优，并在多任务设定量化相对 Lasso 的优势及有限四阶矩噪声扩展。
- 阅读关注点
- 阅读全文时应核对分组知识、设计矩阵条件、阈值选择要求，以及相对 Lasso 优势与非高斯扩展成立的范围。
- 阅读边界
- 仅据版本未注明的 OpenAlex 索引摘要，无法判断具体界与优势条件；多任务回归不自动等同面板模型，也不能推断刊本变化。
原文摘要
We consider the problem of estimating a sparse linear regression vector β* under a Gaussian noise model, for the purpose of both prediction and model selection. We assume that prior knowledge is available on the sparsity pattern, namely the set of variables is partitioned into prescribed groups, only few of which are relevant in the estimation process. This group sparsity assumption suggests us to consider the Group Lasso method as a means to estimate β*. We establish oracle inequalities for the prediction and ℓ2 estimation errors of this estimator. These bounds hold under a restricted eigenvalue condition on the design matrix. Under a stronger condition, we derive bounds for the estimation error for mixed (2, p)-norms with 1 ≤ p ≤ ∞. When p=∞, this result implies that a thresholded version of the Group Lasso estimator selects the sparsity pattern of β* with high probability. Next, we prove that the rate of convergence of our upper bounds is optimal in a minimax sense, up to a logarithmic factor, for all estimators over a class of group sparse vectors. Furthermore, we establish lower bounds for the prediction and ℓ2 estimation errors of the usual Lasso estimator. Using this result, we demonstrate that the Group Lasso can achieve an improvement in the prediction and estimation errors as compared to the Lasso. An important application of our results is provided by the problem of estimating multiple regression equations simultaneously or multi-task learning. In this case, we obtain refinements of the results in [In Proc. of the 22nd Annual Conference on Learning Theory (COLT) (2009)], which allow us to establish a quantitative advantage of the Group Lasso over the usual Lasso in the multi-task setting. Finally, within the same setting, we show how our results can be extended to more general noise distributions, of which we only require the fourth moment to be finite. To obtain this extension, we establish a new maximal moment inequality, which may be of independent interest.