Pub-AI.AI in Science
Search Pub-AIStart Here

Publication Radar · Source metadata

Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition

Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrović, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu

Publication record

Bibliographic evidence describes where and when a record appeared. It does not validate scientific claims.

First public release: 2025-10-06 · Indexed by Pub-AI: 2026-10-25 UTC

conferenceInternational Conference on Machine Learning2025 · main

Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition

Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrović, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu

Published online: 2025-10-06 · Original record ↗

  1. Proceedings published

    Source date: 2025-10-06 · First detected: 2026-10-25 UTC · Historical baseline

    Source evidence (1)

Browse publicationsSource coverageMatching and dates

Breaking the $n^1.5$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition | Pub-AI Radar