Math 2.0

Resources / preprint

Efficient Agnostic Learning of Univariate Densities Under Local Differential Privacy A8C1M9BSWH

URIm2://res/A8C1M9BSWH
Kindpreprint
CreatorsMohammad Afzali, Hassan Ashtiani, Sivan Sabato
Date2026-10-15
Subjectsarxiv stat.ML, arxiv cs.CR, arxiv cs.DS, arxiv cs.IT, arxiv cs.LG, arxiv math.IT
Scopeborder

Expressions

e1: version, preprint

Date2026-10-15
IdsarXiv 2610.21033

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Mixture classdefinitiondefinition 8.1arxiv
2JPYFYZZXAstatementtheorem 3.4arxiv
$\cA_k$-distance from CDF errorstatementlemma B.2arxiv
LDP Agnostic Proper Learning of GMMsstatementcorollary H.3arxiv
Discretization and polynomial approximation of mixturesstatementlemma 8.2arxiv
GMM Lower Boundstatementtheorem G.1arxiv
Discretization of Bounded-Parameter Log-concave Distributionsstatementlemma 8.7arxiv
Canonical dyadic decomposition of a prefixstatementlemma 5.2arxiv
Uniform discretizationdefinitiondefinition 6.2arxiv
Efficient LDP Agnostic Learning of GMMsstatementtheorem F.2arxiv
Local randomizerdefinitiondefinition 2.1arxiv
LDP synthetic datasetstatementtheorem 6.3arxiv
9ZVZZP35EXstatementlemma H.4arxiv
B4R12VFT9Bstatementlemma H.2arxiv
$L_1$ Stability of Discretizationstatementlemma C.2arxiv
Discretization errordefinitiondefinition 2.3arxiv
Orthogonality of Hadamard characters, Theorem 1.5statementlemma C.1arxiv
Bounded-Parameter Log-concave Distributionsdefinitiondefinition 8.4arxiv
Discretization of Bounded-Parameter Gaussiansstatementlemma F.3arxiv
Piece-wise polynomial approximation of Gaussians, Lemma 36statementlemma F.4arxiv
HDAS600J7Qstatementtheorem 3.3arxiv
Piece-wise polynomial approximation of log-concave distributions, Lemma 27statementlemma E.1arxiv
Non-interactive local differential privacydefinitiondefinition 2.2arxiv
JY1TGKX4K7statementtheorem 3.5arxiv
Piece-wise polynomial approximation errordefinitiondefinition 2.5arxiv
Piecewise polynomialsdefinitiondefinition 2.4arxiv
Deterministic post-sampling General--Mergingstatementproposition 5.4arxiv
Bounded Gaussiansdefinitiondefinition F.1arxiv
Sparse distribution estimation lower boundstatementtheorem G.2arxiv
QK1HHGMBCCstatementtheorem 3.1arxiv
Log-concave functionsdefinitiondefinition 8.3arxiv
Dyadic tree representationdefinitiondefinition 5.1arxiv
non-proper to proper learningstatementlemma H.1arxiv
S7XYQNYX1Dstatementtheorem 7.1arxiv
TCAVKRCB54statementtheorem 3.2arxiv
$\cA_k$-normdefinitiondefinition B.1arxiv
Hadamard charactersdefinitiondefinition 5.3arxiv
Piece-wise polynomial approximation of log-concave distributionsstatementlemma 8.6arxiv
Piece-wise polynomial approximation of Gaussiansstatementlemma F.5arxiv
Non-interactive LDP prefix oraclestatementtheorem 6.1arxiv
Efficient LDP Agnostic Learning of Log-concave Mixturesstatementtheorem 8.5arxiv

Catalogue records