Michael Oluwole, Ruiyao Liu, Aleksander Stevens, Chenxi Qiu · 2026 · arXiv (Cornell University)
DOI: 10.48550/arxiv.2610.27615 · cited by 0 works (OpenAlex) · open-access PDF
Les mécanismes de programmation linéaire (LP) pour la confidentialité différentielle métrique (mDP) permettent des contrôles d'utilité sensibles et conscients des tâches, mais ils sont coûteux de calcul et deviennent vulnérables à la confidentialité dans les paramètres distribués: le téléchargement de matrices de coefficient LP spécifiques à l'utilisateur (par exemple, blocs de paramètres distants et perturbés) sur un résolveur central peut lui-même fuir des informations sensibles. Nous présentons DISTA-LP, un cadre d'optimisation de mDP distribué qui préserve la confidentialité et qui remplace les téléchargements de coefficients bruts par des paramétrages de substitution compacts et ne libère que des vecteurs de param
Machine translation (Meta M2M100); the English original follows.
Linear-programming (LP) mechanisms for metric differential privacy (mDP) enable fine-grained, task-aware utility control, but they are computationally expensive and become privacy-fragile in distributed settings: uploading user-specific LP coefficient matrices (e.g., distance and loss blocks) to a central solver can itself leak sensitive information. We present DISTA-LP, a privacy-preserving distributed mDP optimization framework that replaces raw coefficient uploads with compact surrogate parameterizations and releases only calibrated, perturbed parameter vectors, thereby reducing both upload-stage leakage and problem dimensionality. On the server side, DISTA-LP reconstructs approximate coefficients and solves a scalable mastersubproblem formulation via Benders decomposition. To certify end-to-end privacy, we introduce a probabilistic mDP (PmDP) auditor that empirically quantifies the privacy loss induced by parameter release, allocates the required privacy budget prior to optimization, and composes it with the downstream mechanism to obtain an end-to-end mDP guarantee. Experiments on large realworld road-network datasets (Rome, New York City, and London) show that DISTA-LP achieves near-zero mDP violation rates, substantially reduces computation time compared to monolithic and hybrid baselines, and matches or improves utility, thereby demonstrating stronger upload privacy and significantly improved scalability.
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
Topics: Differential privacy, Computer science, Scalability, Upload, Probabilistic logic, Linear programming
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.27615, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange