Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521)

From MaRDI portal
Revision as of 03:48, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
scientific article

    Statements

    title
    Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (English)
    0 references
    DOI
    10.1137/140991844
    0 references
    author
    Vitaly Feldman
    0 references
    David Xiao
    0 references
    publication date
    25 November 2015
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68T05
    0 references
    94A60
    0 references
    94A62
    0 references
    zbMATH DE Number
    6513532
    0 references
    zbMATH Keywords
    sample complexity
    0 references
    differentially private learning
    0 references
    covering number
    0 references
    lower bounds
    0 references
    communication complexity
    0 references
    OpenAlex ID
    W3023250268
    0 references
    arXiv ID
    1402.6278
    0 references
    cites work
    Theory of Cryptography
    0 references
    Q3549600
    0 references
    Q5655273
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3454521&oldid=36215364"
    Powered by MediaWiki