Assessing linearity in high dimensions
高维函数线性程度的评估AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用高维函数的线性程度与计算成本,未明确涉及预测或其他所列经济领域。
反馈分类问题高维函数线性程度的评估AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Some standard numerical problems become intractable in high dimensions. Yet successes are often achieved in practice. This may be explained in terms of the underlying target function being somehow simpler than assumed in the intractability arguments. A prototypical form of simplicity is approximate linearity. In moderate dimensions, linearity can be investigated by linear regression. In very high dimensions, this becomes computationally inefficient and eventually infeasible, as the cost of regression for $n$ observations in $d$ dimensions grows as $nd^2$. This paper presents a quasi-regression method for determining the degree of linearity in a function, where the cost grows only as $nd$. A bias-corrected version of quasi-regression is able to estimate the degree of linearity with a sample size of order $d^{2 /3}$. An example is given of a function on $[0,1]^ {1,000,000}$, for which the amount of linear variability is accurately estimated from only 100,000 observations.