arXiv Machine Learning By Bar Mahpud, Or Sheffet

A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input

Read the original on arXiv Machine Learning →

arXiv:2505. 14251v2 Announce Type: replace Abstract: We study the problem of differentially private second moment estimation and present a new algorithm that achieve strong privacy-utility trade-offs even for worst-case inputs under subsamplability assumptions on the data.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 12

Information Bottleneck under Perfect Privacy

arXiv:2608. 11003v1 Announce Type: cross Abstract: In this work, we study the information bottleneck under perfect privacy, with particular emphasis on the active-rate regime, where the representation-rate constraint is binding and directly limits the achievable utility.

By Junle Zhong, Mohamad Assaad, Sreejith Sreekumar