Piecewise convex function estimation: pilot estimators
分段凸函数估计：初步估计量AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要研究通用形状约束函数估计，未给出宏观时间序列结构变化的应用依据。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
分段凸函数估计：初步估计量
- 研究问题
- 当未知函数仅在少数区间内保持凸或凹、且区间数未知时，如何识别凸性变化点并兼顾函数估计的积分均方误差？
- 方法与思路
- 作者提出两阶段方法：先用较强平滑估计变化点数量和位置，再在各初步变化点邻域施加单一变化点约束进行平滑样条拟合。
- 材料陈述的贡献
- 摘要称，消除虚假凸性变化点需要强于通常误差最优水平的平滑，而两阶段估计仍可达到积分均方误差的最优收敛率。
- 阅读关注点
- 应核对变化点间隔与局部光滑条件、第一阶段邻域选取、第二阶段约束的实现，以及最优收敛率适用的函数类别。
- 阅读边界
- 仅据版本未注明的 OpenAlex 摘要；文字存在不完整句，具体条件和约束需查原文。此处凸性变化不能直接解释为时间序列结构突变。
原文摘要
Given noisy data, function estimation is considered when the unknown function is known a priori to be either convex or concave on each of a small number of regions where the function. When the number of regions is unknown, the model selection problem is to determine the number of convexity change points. For kernel estimates in Gaussian noise, the number of false change points is evaluated as a function of the smoothing parameter. To insure that the number of false convexity change points tends to zero, the smoothing level must be larger than is generically optimal for minimizing the mean integrated square error (MISE). A two-stage estimator is proposed and shown to achieve the optimal rate of convergence of the MISE. In the first stage, the number and location of the change points is estimated using strong smoothing. In the second stage, a constrained smoothing spline fit is performed with the smoothing level chosen to minimize the MISE. The imposed constraint is that a single change point occur in a region about each empirical change point from the first-stage estimate. This constraint is equivalent to the requirement that the third derivative of the second-stage estimate has a single sign in a small neighborhood about each first-stage change point. The change points from the second stage are first-stage change points, but need not be at the identical locations.