Learning from regularized regression algorithms with \(p\)-order Markov chain sampling (Q423185): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: New approaches to statistical learning theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best choices for regularization parameters in learning theory: on the bias-variance problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mathematical foundations of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum complexity regression estimation with weakly dependent observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shannon sampling and function reconstruction from point values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from dependent observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least square regression with indefinite kernels and coefficient regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized least square regression with dependent samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hoeffding-type inequality for ergodic time series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rates of convergence for empirical processes of stationary mixing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity of reproducing kernel spaces in 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: The performance bounds of learning machines based on exponentially strongly mixing sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from uniformly ergodic Markov chains / rank
 
Normal rank

Latest revision as of 07:44, 5 July 2024

scientific article
Language Label Description Also known as
English
Learning from regularized regression algorithms with \(p\)-order Markov chain sampling
scientific article

    Statements

    Learning from regularized regression algorithms with \(p\)-order Markov chain sampling (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2012
    0 references
    0 references
    \(p\)-order Markov chain
    0 references
    uniformly ergodic
    0 references
    learning rate
    0 references
    0 references