Characterizing the sample complexity of private learners (Q2986862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): conf/innovations/BeimelNS13, #quickstatements; #temporary_batch_1731483406851
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2422436.2422450 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2096223017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from different teachers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On specifying Boolean functions by labelled examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring teachability using variants of the teaching dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching Randomized Learners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Developments in Algorithmic Teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of inductive inference from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching a smarter learner. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of goal-oriented communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model of interactive teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of efficient teachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teachability in computational learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396611 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/innovations/BeimelNS13 / rank
 
Normal rank

Latest revision as of 09:10, 13 November 2024

scientific article
Language Label Description Also known as
English
Characterizing the sample complexity of private learners
scientific article

    Statements

    Characterizing the sample complexity of private learners (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2017
    0 references
    differential privacy
    0 references
    PAC learning
    0 references
    probabilistic representation
    0 references
    sample complexity
    0 references

    Identifiers