Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Differentially Private Approximation of the John Ellipsoid
Bar Mahpud, Daniel Omer, Or Sheffet
We study the problem of approximating the John ellipsoid (JE) of a given (centrally symmetric) polytope of constraints in a Euclidean space under differential privacy (DP). We…
cs.DS2025
Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
Bar Mahpud, Or Sheffet
We study the problem of learning exponential distributions under differential privacy. Given i.i.d.\ samples from , the goal is to privately estimate so th…
cs.DS2022
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem
Bar Mahpud, Or Sheffet
The Minimum Enclosing Ball (MEB) problem is one of the most fundamental problems in clustering, with applications in operations research, statistics and computational geometry. In…