arXiv (All)
open access
Differentially Private Approximation of the John Ellipsoid
We study the problem of approximating the John ellipsoid (JE) of a given (centrally symmetric) polytope of $n$ constraints in a Euclidean space under differential privacy (DP). We give the first differentially private algorithm for this problem under the standard model, where neighboring datasets ma
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds#1070005
- Towards Personalized Differentially Private Learning for Decentralized Local Graphs#343375
- Asymptotic Optimality of the High-Dimensional Gaussian Mechanism and Improved Low-Dimensional Mechanisms for Differential Privacy#267581
- Geometric Data Perturbation with Noisy-Anchor Alignment for Privacy-Preserving Collaborative Learning#467078
- Optimal Guarantees for Auditing Rényi Differentially Private Machine Learning#216730
Record · ID 1116937
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive