paper-with-me

Papers

Efficient Private Algorithms for Learning Large-Margin Halfspaces

2019-02-24 · Huy L. Nguyen, Jonathan Ullman, Lydia Zakynthinou

We present new differentially private algorithms for learning a large-margin halfspace. In contrast to previous algorithms, which are based on either differentially private simulations of the statistical query model or on private convex optimization, the sample complexity of our algorithms depends only on the margin of the data, and not on the dimension. We complement our results with a lower bound, showing that the dependence of our upper bounds on the margin is optimal.

📄 PDF Abstract BibTeX arXiv:1902.09009

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Privately Learning Decision Lists and a Differentially Private Winnow

2026-02-07 · Mark Bun, William Fang arxiv

We give new differentially private algorithms for the classic problems of learning decision lists and large-margin halfspaces in the PAC and online models. In the PAC model, we give a computationally efficient algorithm …

Efficient, Noise-Tolerant, and Private Learning via Boosting

2020-02-04 · Mark Bun, Marco Leandro Carmosino, Jessica Sorrell

We introduce a simple framework for designing private boosting algorithms. We give natural conditions under which these algorithms are differentially private, efficient, and noise-tolerant PAC learners. To demonstrate ou…

Robust and Private Learning of Halfspaces

2020-11-30 · Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Thao Nguyen

In this work, we study the trade-off between differential privacy and adversarial robustness under L2-perturbations in the context of learning halfspaces. We prove nearly tight bounds on the sample complexity of robust p…

Adversarial Robustness

Replicable Learning of Large-Margin Halfspaces

2024-02-21 · Alkis Kalavasis, Amin Karbasi, Kasper Green Larsen, Grigoris Velegkas 외

We provide efficient replicable algorithms for the problem of learning large-margin halfspaces. Our results improve upon the algorithms provided by Impagliazzo, Lei, Pitassi, and Sorrell [STOC, 2022]. We design the first…

On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data

2022-09-17 · Jinyan Su, Jinhui Xu, Di Wang

In this paper, we study the problem of PAC learning halfspaces in the non-interactive local differential privacy model (NLDP). To breach the barrier of exponential sample complexity, previous results studied a relaxed se…

PAC learningSelf-Supervised Learning