Efficient private algorithms for learning large-margin halfspaces

MaRDI QIDQ7025117zbMATH OpenFDO

Authors Huy Le Nguyen, Jonathan Ullman, Lydia Zakynthinou

Publication date 19 February 2025

Full work available at URL https://proceedings.mlr.press/v117/nguy-en20a.html

zbMATH Keywords

differential privacylarge-margin halfspacesPAC learning

Mathematics Subject Classification ID

Privacy of data (68P27) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A theory of the learnable
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Differentially private data analysis of social networks via restricted sensitivity
• Differentially private empirical risk minimization
• Efficient noise-tolerant learning from statistical queries
• Fingerprinting codes and the price of approximate differential privacy
• scientific article; zbMATH DE number 5602305 (Why is no real title available?)
• scientific article; zbMATH DE number 2109363 (Why is no real title available?)
• scientific article; zbMATH DE number 5485574 (Why is no real title available?)
• Private empirical risk minimization: efficient algorithms and tight error bounds
• Statistical query algorithms for mean vector estimation and stochastic convex optimization
• Theory of Cryptography

This page was built for publication: Efficient private algorithms for learning large-margin halfspaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025117)