Prediction bounds for higher order total variation regularized least squares
高阶全变差正则化最小二乘的预测界
We establish adaptive results for trend filtering: least squares estimation with a penalty on the total variation of (k−1)th order differences. Our approach is based on combining a general oracle inequality for the ℓ1-penalized least squares estimator with “interpolating vectors” to upper bound the “effective sparsity.” This allows one to show that the ℓ1-penalty on the kth order differences leads to an estimator that can adapt to the number of jumps in the (k−1)th order…