Sitemap
A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.
Pages
Posts
Future Blog Post
Published:
This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Blog Post number 4
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 3
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 2
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
Blog Post number 1
Published:
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
portfolio
Portfolio item number 1
Short description of portfolio item number 1
Portfolio item number 2
Short description of portfolio item number 2
publications
Differentially Private Learning of Exponential Distributions: Adaptive Algorithms and Tight Bounds
Published in (under review)
We develop two complementary pure-DP methods for learning Exponential Distributions—a clipped-noisy MLE and a quantile estimator—combine them adaptively to attain near-optimal sample complexity; extend via a logarithmic reduction to Pareto; prove nearly matching lower bounds (packing & group privacy); and show that approximate-DP removes the need for external bounds.
Recommended citation: Mahpud, Bar; Sheffet, Or. (2025). "Differentially Private Learning of Exponential Distributions: Adaptive Algorithms and Tight Bounds." (under review).
Download Paper | Download Bibtex
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem
Published in NeurIPS 2022
We present the first differentially private FPTAS for the Minimum Enclosing Ball with near-linear runtime, near-optimal radius, and few uncovered points; we also introduce a local-privacy version that improves prior results and show strong empirical performance.
Recommended citation: Mahpud, Bar; Sheffet, Or. (2022). "A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem." NeurIPS 2022.
Download Paper | Download Slides | Download Bibtex
Differentially Private Approximation of the John Ellipsoid
Published in (under review)
We develop the first differentially private algorithm for approximating the John ellipsoid under the standard privacy model, using a projected multiplicative-weights framework with rigorous privacy–utility guarantees.
Recommended citation: Mahpud, Bar; Sheffet, Or; Omer, Daniel. (2026). "Differentially Private Approximation of the John Ellipsoid." (under review).
Download Paper | Download Bibtex
Privacy-Preserving Conformal Prediction Under Local Differential Privacy
Published in COPA 2025
We propose two LDP conformal prediction frameworks that compute thresholds from privatized data without true labels—(i) users send features and a k-ary randomized-response label (no model access) and (ii) users privatize conformity via binary-search responses (requires model access, stricter privacy)—and prove finite-sample coverage with robust performance under strong randomization for sensitive applications.
Recommended citation: Penso, Coby; Mahpud, Bar; Goldberger, Jacob; Sheffet, Or. (2025). "Privacy-Preserving Conformal Prediction Under Local Differential Privacy." COPA 2025.
Download Paper | Download Slides | Download Bibtex
A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input
Published in NeurIPS 2025
We present a zCDP-compliant recursive algorithm for differentially private second-moment estimation that exploits subsamplability assumptions to achieve practical spectral accuracy on worst-case data and remain robust to outliers.
Recommended citation: Mahpud, Bar; Sheffet, Or. (2025). "A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input." NeurIPS 2025.
Download Paper | Download Slides | Download Bibtex
talks
Talk 1 on Relevant Topic in Your Field
Published:
This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!
Conference Proceeding talk 3 on Relevant Topic in Your Field
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
teaching
Operating Systems
Undergraduate course, Bar-Ilan University, Faculty of Engineering, Fall 2018
This course covers the principles of operating systems, focusing on process management, memory allocation, synchronization, and file systems.
Software Engineering
Undergraduate course, Bar-Ilan University, Faculty of Engineering, Fall 2018
This course provides theoretical and practical foundations for software design, development processes, and large-scale project management.
Computer Networks and Internet
Undergraduate course, Bar-Ilan University, Faculty of Engineering, Fall 2021-2025
This undergraduate course introduces the principles and design of modern computer networks, including protocols, architectures, and practical systems.