On the hardness of learning intersections of two halfspaces (Q619909): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Subhash A. Khot / rank
Normal rank
 
Property / author
 
Property / author: Subhash A. Khot / 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.jcss.2010.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072331102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of properly learning simple concept classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic theory of learning: Robust concepts and random projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise sensitivity of Boolean functions and applications to percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for learning noisy linear threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning an intersection of a constant number of halfspaces over a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Agnostic Learning of Parities, Monomials, and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostic Learning of Monomials by Halfspaces Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Reconstructing Multivariate Polynomials over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Learning Halfspaces with Noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new PCP outer verifier with applications to homogeneous linear equations and max-bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostically Learning Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections and thresholds of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning intersections of halfspaces with a margin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness for learning intersections of halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4459552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Repetition Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:48, 3 July 2024

scientific article
Language Label Description Also known as
English
On the hardness of learning intersections of two halfspaces
scientific article

    Statements

    On the hardness of learning intersections of two halfspaces (English)
    0 references
    0 references
    0 references
    18 January 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    learning
    0 references
    hardness
    0 references
    approximation
    0 references
    halfspaces
    0 references
    0 references