Optimal reconstruction error from approximate linear queries converges to sqrt(2d/(d+1)) delta as number of queries T goes to infinity, with doubly exponential excess error decay for fixed d and exp(d) queries needed for vanishing excess when d grows.
In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
A differentially private pipeline using node-level DP summaries to fit ERGMs or SBMs, generate synthetic networks, and simulate SIS disease spread on ARTNet sexual contact data produces incidence, prevalence, and intervention effect sizes close to non-private versions.
CHRONOS is a three-layer system for evolving data marketplaces that applies neural-ODE temporal decay, changepoint-aware Shapley valuation, and EXP3-IX private coordination to achieve 0.937 recall, 2.74 qps, 161 ms latency, and epsilon 4.25 at delta 10^-6.
PAFER estimates statistical parity for differentially private decision trees using Laplacian noise, achieving low error while preserving privacy and favoring interpretable trees.
citing papers explorer
-
Optimal Reconstruction from Linear Queries
Optimal reconstruction error from approximate linear queries converges to sqrt(2d/(d+1)) delta as number of queries T goes to infinity, with doubly exponential excess error decay for fixed d and exp(d) queries needed for vanishing excess when d grows.
-
Differentially Private Modeling of Disease Transmission within Human Contact Networks
A differentially private pipeline using node-level DP summaries to fit ERGMs or SBMs, generate synthetic networks, and simulate SIS disease spread on ARTNet sexual contact data produces incidence, prevalence, and intervention effect sizes close to non-private versions.
-
CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces
CHRONOS is a three-layer system for evolving data marketplaces that applies neural-ODE temporal decay, changepoint-aware Shapley valuation, and EXP3-IX private coordination to achieve 0.937 recall, 2.74 qps, 161 ms latency, and epsilon 4.25 at delta 10^-6.
-
Privacy Constrained Fairness Estimation for Decision Trees
PAFER estimates statistical parity for differentially private decision trees using Laplacian noise, achieving low error while preserving privacy and favoring interpretable trees.