Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AdaBoost.MH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135781605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing agreements and coagnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision-theoretic generalization of on-line learning and an application to boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on learning decision lists and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust trainability of single neurons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very simple classification rules perform well on most commonly used datasets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward efficient agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity in the case against accuracy estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of proper learnability of subclasses of DNF formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved boosting algorithms using confidence-rated predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Latest revision as of 20:43, 25 June 2024

scientific article
Language Label Description Also known as
English
Self-improved gaps almost everywhere for the agnostic approximation of monomials
scientific article

    Statements

    Self-improved gaps almost everywhere for the agnostic approximation of monomials (English)
    0 references
    0 references
    0 references
    6 June 2007
    0 references
    0 references
    agnostic learning
    0 references
    self-improving reductions
    0 references
    monomials
    0 references
    0 references