Online Quantile Regression for Nonparametric Additive Models

arXiv:2604.08969v1 Announce Type: cross Abstract: This paper introduces a projected functional gradient descent algorithm (P-FGD) for training nonparametric additive quantile regression models in online settings. This algorithm extends the functional stochastic gradient descent framework to the pinball loss. An advantage of P-FGD is that it does not need to store historical data while maintaining O(J_tln J_t) computational complexity per step where J_t denotes the number of basis functions. Besides, we only need O(J_t) computational time for quantile function prediction at time t. These properties show that P-FGD is much better than the commonly used RKHS in online learning. By leveraging a novel Hilbert space projection identity, we also prove that the proposed online quantile function estimator (P-FGD) achieves the minimax optimal consistency rate O(t^{-frac{2s}{2s+1}}) where t is the current time and s denotes the smoothness degree of the quantile function. Extensions to mini-batch learning are also established.

Related

• Nonparametric Instrumental Regression via Kernel Methods is Minimax Optimal
• Fisher-Geometric Diffusion in Stochastic Gradient Descent: Optimal Rates, Oracle Complexity, and Information-Theoretic Limits
• Stochastic Gradient Descent in the Saddle-to-Saddle Regime of Deep Linear Networks
• Gaussian Approximation for Asynchronous Q-learning

Source: arXiv cs.LG | 2026-04-13