ERM scheme for quantile regression (Q369725): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / review text
 
Summary: This paper considers the ERM scheme for quantile regression. We conduct error analysis for this learning algorithm by means of a variance-expectation bound when a noise condition is satisfied for the underlying probability measure. The learning rates are derived by applying concentration techniques involving the \(\ell^2\)-empirical covering numbers.
Property / review text: Summary: This paper considers the ERM scheme for quantile regression. We conduct error analysis for this learning algorithm by means of a variance-expectation bound when a noise condition is satisfied for the underlying probability measure. The learning rates are derived by applying concentration techniques involving the \(\ell^2\)-empirical covering numbers. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 62G08 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6209180 / rank
 
Normal rank
Property / zbMATH Keywords
 
quantile regression
Property / zbMATH Keywords: quantile regression / rank
 
Normal rank
Property / zbMATH Keywords
 
ERM scheme
Property / zbMATH Keywords: ERM scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
error analysis
Property / zbMATH Keywords: error analysis / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58915365 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/148490 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977311439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional quantiles with varying Gaussians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with varying insensitive loss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation analysis of learning algorithms for support vector regression and quantile regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Reproducing Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering number in learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning gradients on manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complexity Issues of Online Learning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE LEARNING WITH MARKOV SAMPLING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification with non-i.i.d. sampling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:56, 6 July 2024

scientific article
Language Label Description Also known as
English
ERM scheme for quantile regression
scientific article

    Statements

    ERM scheme for quantile regression (English)
    0 references
    0 references
    19 September 2013
    0 references
    Summary: This paper considers the ERM scheme for quantile regression. We conduct error analysis for this learning algorithm by means of a variance-expectation bound when a noise condition is satisfied for the underlying probability measure. The learning rates are derived by applying concentration techniques involving the \(\ell^2\)-empirical covering numbers.
    0 references
    quantile regression
    0 references
    ERM scheme
    0 references
    error analysis
    0 references

    Identifiers