Obtaining fast error rates in nonconvex situations (Q933417): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2007.09.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989007039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-sensitive dimensions, uniform convergence, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural Network Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Classification: a Survey of Some Recent Advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Central Limit Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniform convexity of \(L^p\) and \(l^p\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity of Chebyshev sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The importance of convexity in learning with squared loss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Empirical Minimization Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal aggregation of classifiers in statistical learning. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and empirical processes. With applications to statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3278544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATIVE PROPERTIES OF SETS IN NORMED LINEAR SPACES / rank
 
Normal rank

Latest revision as of 12:36, 28 June 2024

scientific article
Language Label Description Also known as
English
Obtaining fast error rates in nonconvex situations
scientific article

    Statements

    Obtaining fast error rates in nonconvex situations (English)
    0 references
    0 references
    21 July 2008
    0 references
    nearest point map
    0 references
    nonconvex classes
    0 references
    Bernstein condition
    0 references

    Identifiers