Convex regression in multidimensions: Suboptimality of least squares estimators
多维凸回归:最小二乘估计量的次优性AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用形状约束回归的风险理论,未明确涉及所列计量细分方向。
多维凸回归:最小二乘估计量的次优性AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Under the usual nonparametric regression model with Gaussian errors, Least Squares Estimators (LSEs) over natural subclasses of convex functions are shown to be suboptimal for estimating a d-dimensional convex function in squared error loss when the dimension d is 5 or larger. The specific function classes considered include: (i) bounded convex functions supported on a polytope (in random design), (ii) Lipschitz convex functions supported on any convex domain (in random design) and (iii) convex functions supported on a polytope (in fixed design). For each of these classes, the risk of the LSE is proved to be of the order n−2/d (up to logarithmic factors) while the minimax risk is n−4/(d+4), when d≥5. In addition, the first rate of convergence results (worst case and adaptive) for the unrestricted convex LSE are established in fixed design for polytopal domains for all d≥1. Some new metric entropy results for convex functions are also proved, which are of independent interest.