Risk Bounds for Quantile Trend Filtering
Oscar Hernan Madrid Padilla, Sabyasachi Chatterjee

TL;DR
This paper establishes risk bounds for univariate quantile trend filtering, demonstrating near minimax optimal rates under minimal assumptions, including heavy-tailed errors, and extends the techniques to multivariate and high-dimensional settings.
Contribution
It provides the first risk bounds for quantile trend filtering that hold under minimal error assumptions and extends the analysis to multivariate and high-dimensional quantile regression.
Findings
Both penalized and constrained quantile trend filtering attain near minimax rates.
Risk bounds hold under heavy-tailed errors without moment assumptions.
Techniques are applicable to multivariate and high-dimensional quantile regression.
Abstract
We study quantile trend filtering, a recently proposed method for nonparametric quantile regression with the goal of generalizing existing risk bounds known for the usual trend filtering estimators which perform mean regression. We study both the penalized and the constrained version (of order ) of univariate quantile trend filtering. Our results show that both the constrained and the penalized version (of order ) attain the minimax rate up to log factors, when the th discrete derivative of the true vector of quantiles belongs to the class of bounded variation signals. Moreover we also show that if the true vector of quantiles is a discrete spline with a few polynomial pieces then both versions attain a near parametric rate of convergence. Corresponding results for the usual trend filtering estimators are known to hold only when the errors are sub-Gaussian. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
