The Adjoint Projection Pursuit Regression
伴随投影寻踪回归AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究未知单调链接下的通用回归方向估计,没有离散响应、经济行为结构或因果识别的明确设定。
伴随投影寻踪回归AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Consider a projection pursuit regression model y = g(α + β x) + ε, with an arbitrary monotonic link function g. We assume the link function is unknown; thus we can only estimate the direction of β, that is, the ratios among the components of β, say, β 1/β 2. The direction of β is a useful estimand that measures, say, how many units of x 2 is equivalent to one unit of x 1 in terms of potency in affecting the outcome y. Projection pursuit regression usually solves the equation cov(x, y − E(y | β x)) = 0. As an alternative, we propose to solve the adjoint equation cov(x − E(x | β x), y) = 0. The adjoint equation has the advantage that E(x | β x) might be easier to estimate than E(y | β x). We establish two main results for the population case. First, β is the unique solution (up to a multiplicative scalar) to the adjoint equation. Second, β satisfies a fixed-point property based on a modified least squares regression derived from the adjoint equation. We apply the population results to two important empirical problems: diagnosis and estimation. For diagnosis, we check whether the linear least squares estimate for β is valid for the direction of β. In particular, we test whether the estimate agrees with either the adjoint equation or the fixed-point property. The tests are analogous to Tukey's 1 df test. For estimation, we propose the adjoint projection pursuit regression estimate, which solves the empirical adjoint equation. The estimate is √n-consistent for β up to a multiplicative scalar. The rate of convergence is insensitive to the choice of the smoothing parameter in estimating E(x | β x); any window size of order O(1/√n) or smaller achieves the optimal convergence rate. The estimate can be implemented numerically by iterating the modified least squares regression; a simulation study is given to illustrate this procedure.