Hernando Ombao’s contribution to the Discussion of ‘the Discussion Meeting on Probabilistic and statistical aspects of machine learning’
Hernando Ombao 对机器学习概率与统计讨论会论文的评论AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:评论明确讨论非平稳时间序列的局部表示、时间分割与变点定位。
Hernando Ombao 对机器学习概率与统计讨论会论文的评论AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
I congratulate the authors for their fundamental contribution that demonstrates how the existing tests for change-points can be represented by a neural network. The major consequence is that with sufficient data, the performance of these neural networks should be at par with these existing tests. This formulation is very insightful and inspired me to revisit the previous work on models for non-stationary time series that use time-localized representations such as wavelets, wavelet packets (WP), and the smooth localized complex exponentials (SLEXs). Orthonormal representations are mathematically elegant and they generalize the Cramer representation for stationary time series which use the Fourier basis functions. One advantage of the WP and SLEX is that they form a library of many bases and thus provide a collection of candidate representations. The best representation is selected data-adaptively to be the one that minimizes the penalized Kullback–Leibler criterion. Due to the localized nature of the basis functions, the best model gives a specific segmentation of the time series data (in the case of SLEX, this is the segmentation of time). Thus, selecting the best model implicitly provides the estimated change-points in the tine series data. The current implementation limits the choice of the model to have a dyadic segmentation of time (in the case of SLEX) or frequency (in the case of WPs). This dyadic constraint is necessary to take advantage of the best basis algorithm of Coifman and Wickerhauser which requires the magnitude of O(T) operations (where T is the number of time points). The dyadic nature is a primary limitation of these methods because the change-points are constrained to lie on dyadic time points. This is where the current work of Li et al. can provide a major improvement. The dyadic change-points could serve as the initial values of these change-points but could be refined and made more precise by taking advantage of the neural networks.