Multivariate trend filtering for lattice data
格点数据的多元趋势滤波AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要中的趋势滤波用于多维格点函数估计，没有明确时间序列、宏观趋势或结构变化的研究设定。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
格点数据的多元趋势滤波
- 研究问题
- 对于多维格点上的异质平滑函数，如何扩展一维趋势滤波，并刻画维数、差分阶数与估计一致性之间的关系？
- 方法与思路
- 作者提出Kronecker趋势滤波，通过惩罚最小二乘累加各坐标方向的高阶差分绝对值，并给出张量积基回归的等价表述。
- 材料陈述的贡献
- 摘要称，论文给出各阶数和维数的理论结果，揭示与线性平滑器的比较及维数—平滑度相变，并支持常数时间的格点外插值。
- 阅读关注点
- 阅读全文时应核对风险比较所针对的函数类、维数相变结论的具体条件，以及格点外常数时间求值是否需要预先计算或存储。
- 阅读边界
- 仅据OpenAlex索引摘要，稿件版本未注明；摘要未给出完整风险界和计算成本，不能把特定函数类上的比较扩展为普遍优越性。
原文摘要
We study a multivariate version of trend filtering, called Kronecker trend filtering or KTF, for the case in which the design points form a lattice in d dimensions. KTF is a natural extension of univariate trend filtering (Int. J. Comput. Vis. 70 (2006) 214–255; SIAM Rev. 51 (2009) 339–360; Ann. Statist. 42 (2014) 285–323), and is defined by minimizing a penalized least squares problem whose penalty term sums the absolute (higher-order) differences of the parameter to be estimated along each of the coordinate directions. The corresponding penalty operator can be written in terms of Kronecker products of univariate trend filtering penalty operators, hence the name Kronecker trend filtering. Equivalently, one can view KTF in terms of an ℓ1-penalized basis regression problem where the basis functions are tensor products of falling factorial functions, which is a piecewise polynomial (discrete spline) basis that underlies univariate trend filtering. This paper is a unification and extension of the results in (In Advances in Neural Information Processing Systems (2016); in Advances in Neural Information Processing Systems (2017)). We develop a complete set of theoretical results that describe the behavior of kth-order Kronecker trend filtering in d dimensions, for every k≥0 and d≥1. This reveals a number of interesting phenomena, including the dominance of KTF over linear smoothers in estimating heterogeneously smooth functions, and a phase transition at d=2(k+1), a boundary past which (on the high dimension-to-smoothness side) linear smoothers fail to be consistent entirely. We also leverage recent results on discrete splines from (Tibshirani (2020)), in particular, discrete spline interpolation results that enable us to extend the KTF estimate to any off-lattice location in constant-time (independent of the size of the lattice n).