atlas

Research map / Federated learning and privacy / Differential privacy

Multiclass versus Binary Differentially Private PAC Learning

NeurIPS 2021 · Federated learning and privacy › Differential privacy · approach: Private online and user-level learning · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Reduce multiclass learning to learning its binary label-bit restrictionsPrivate PAC learning of a [k]-valued class · Multiclass private PAC learningsample complexity upper bound: 2^{O(k^d)} -> O\Big(\frac{d^6 (\log(k+1))^8 \log^4(\frac{d \log^3(k+1)}{\epsilon \delta \alpha \beta})}{\epsilon \alpha}Helped
Use binary learners with sample complexity polynomial in Littlestone dimensionBinary restrictions of the multiclass class · Multiclass private PAC learningsample complexity upper bound: O\left(\frac{d_L^6 \log^2(\frac{d_L}{\alpha \beta \epsilon \delta})}{\epsilon \alpha^2}\right) -> O\Big(\frac{d^6 (\log(Helped
Control binary restriction dimensions by the multiclass Littlestone dimensionA [k]-valued hypothesis class · Binary restrictions of a multiclass classmaximum Littlestone dimension: \max_{i=1, \dots, \log(k+1)} d_i \leq 6 d \ln(k+1)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy