Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection
type: Item
instance of: scholarly article
title: Approximate nonparametric quantile regression in reproducing kernel Hilbert spaces via random projection
zbMATH Open document ID: 1479.62027
author: F. Zhang
author: Rui Li
author: Heng Lian
published in: Information Sciences
publication date: 2021-12-02T00:00:00Z
Mathematics Subject Classification ID: 62G08
Mathematics Subject Classification ID: 62J07
zbMATH DE Number: 7437565
zbMATH Keywords: dimension reduction
zbMATH Keywords: kernel method
zbMATH Keywords: nonparametric quantile regression
zbMATH Keywords: random projection
describes a project that uses: gss
MaRDI profile type: Publication
full work available at URL: j.ins.2020.08.039
OpenAlex ID: W3049416365
cites work: \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
cites work: Random projections for the nonnegative least-squares problem
cites work: Randomized Algorithms for Matrices and Data
cites work: Convergence rate of b-spline estimators of nonparametric conditional quantile functions∗
cites work: Semiparametric Estimation of Regression Quantiles with Application to Standardizing Weight for Height and Age in US Children
cites work: Some results on Tchebycheffian spline functions and stochastic processes
cites work: Q3413299
cites work: Quantile smoothing splines
cites work: Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
cites work: Sparsity in multiple kernel learning
cites work: Quantile Regression in Reproducing Kernel Hilbert Spaces
cites work: Randomized sketches for kernel CCA
cites work: Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
cites work: Randomized Sketches of Convex Programs With Sharp Guarantees
cites work: Convergence of stochastic processes
cites work: Minimax-optimal rates for sparse additive models over kernel classes via convex programming
cites work: Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
cites work: Q3996207
cites work: Detecting Differential Expressions in GeneChip Microarray Studies
cites work: Sketching meets random projection in the dual: a provable recovery algorithm for big and high-dimensional data
cites work: Q4558555
cites work: Randomized sketches for kernels: fast and optimal nonparametric regression
cites work: Local Linear Quantile Regression
cites work: Random Projections for Classification: A Recovery Approach
DOI: 10.1016/J.INS.2020.08.039
description: scientific article; zbMATH DE number 7437565