pith. sign in

In: Proceedings of the Thirty-ninth Annual AC M Symposium on Theory of Computing, pp

7 Pith papers cite this work. Polarity classification is still indexing.

7 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

years

2026 6 2023 1

verdicts

UNVERDICTED 7

roles

background 1

polarities

background 1

clear filters

representative citing papers

Optimal Reconstruction from Linear Queries

cs.LG · 2026-05-19 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 3 of 3 citing papers after filters.

  • Optimal Reconstruction from Linear Queries cs.LG · 2026-05-19 · unverdicted · none · ref 47

    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.

  • Enhancing Differentially Private Mechanisms via Empirical Bayes cs.LG · 2026-06-19 · unverdicted · none · ref 56

    Empirical Bayes denoising of Gaussian mechanism outputs reduces MSE for differentially private histogram release, PCA, and linear regression.

  • Privacy Constrained Fairness Estimation for Decision Trees cs.LG · 2023-12-13 · unverdicted · none · ref 42

    PAFER estimates statistical parity for differentially private decision trees using Laplacian noise, achieving low error while preserving privacy and favoring interpretable trees.