Abstract
This paper considers the regularized learning schemes based on l1-regularizer and the e-insensitive pinball loss in a data dependent hypothesis space. The target is the error analysis for the conditional quantile regression learning. Except for continuity and boundedness, the kernel function is not necessary to satisfy any further regularity conditions. The data dependent nature of the algorithm leads to an extra error term called hypothesis error. By concentration inequality with l2-empirical covering numbers and operator decomposition techniques, satisfied error bounds and convergence rates are explicitly derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
