On the difficulty of approximately maximizing agreements. (Q1401958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 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 / cites work
 
Property / cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking drifting concepts by minimizing disagreements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust trainability of single neurons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning in the Presence of Malicious Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward efficient agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational limitations on learning from examples / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(03)00038-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968934255 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
On the difficulty of approximately maximizing agreements.
scientific article

    Statements

    On the difficulty of approximately maximizing agreements. (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    Machine learning
    0 references
    Computational learning theory
    0 references
    Neural networks
    0 references
    Inapproximability
    0 references
    Hardness
    0 references
    Half-spaces
    0 references
    Axis-aligned hyper-rectangles
    0 references
    Balls
    0 references
    Monomials
    0 references

    Identifiers