使用混合整数规划的时间序列变点检测
Change-Point Detection in Time Series Using Mixed Integer Programming
AI总结:
本文提出基于混合整数优化(MIO)的时间序列结构断裂检测框架,将 $l_0$-惩罚回归转化为二次规划问题,可同时估计断裂点数量、位置及回归系数,并通过数值实验和实证应用验证其优于 LASSO 等传统方法的准确性。
摘要:
我们使用前沿的混合整数优化(MIO)方法来开发一个用于检测和估计时间序列回归模型中结构断裂的框架。该框架基于受断裂点数量惩罚约束的最小二乘问题构建。我们将 $l_0$-惩罚回归问题重新表述为具有整数和实数参数的二次规划问题,并证明 MIO 能够使用知名的优化求解器找到可证明的最优解。与流行的 $l_1$-惩罚回归(LASSO)和其他经典方法相比,MIO 框架允许同时估计结构断裂的数量和位置以及回归系数,同时支持指定给定或最小断裂数量的选项。我们推导了该估计量的渐近性质,并通过大量数值实验证明了其有效性,证实了与流行的非 MIO 替代方法相比,对多重断裂的估计更为准确。两个实证例子展示了该框架在商业和经济统计应用中的实用性。
英文摘要:
We use cutting-edge mixed integer optimization (MIO) methods to develop a framework for detection and estimation of structural breaks in time series regression models. The framework is constructed based on the least squares problem subject to a penalty on the number of breakpoints. We restate the $l_0$-penalized regression problem as a quadratic programming problem with integer- and real-valued arguments and show that MIO is capable of finding provably optimal solutions using a well-known optimization solver. Compared to the popular $l_1$-penalized regression (LASSO) and other classical methods, the MIO framework permits simultaneous estimation of the number and location of structural breaks as well as regression coefficients, while accommodating the option of specifying a given or minimal number of breaks. We derive the asymptotic properties of the estimator and demonstrate its effectiveness through extensive numerical experiments, confirming a more accurate estimation of multiple breaks as compared to popular non-MIO alternatives. Two empirical examples demonstrate usefulness of the framework in applications from business and economic statistics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。