Q4638095 (Q4638095): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: General bounds on statistical query learning and PAC learning with noise via hypothesis boosting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical active learning algorithms for noise tolerance and differential privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with restricted focus of attention / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning by distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / 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: Noise-tolerant learning, the parity problem, and the statistical query model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate resilience, monotonicity, and the complexity of agnostic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from satisfying assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fourier transform of poisson multinomial distributions and its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple polynomial-time rescaling algorithm for solving linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving Statistical Validity in Adaptive Data Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4645673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical algorithms and a lower bound for detecting planted cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Random Satisfiability Problems with Planted Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Candidate One-Way Functions Based on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can We Learn Privately? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive privacy via the median mechanism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449118 / rank
 
Normal rank

Revision as of 15:05, 15 July 2024

scientific article; zbMATH DE number 6866331
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 6866331

    Statements

    0 references
    0 references
    3 May 2018
    0 references
    statistical queries
    0 references
    PAC learning
    0 references
    differential privacy
    0 references
    lower bounds
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references