AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Optimal Query Complexities for Dynamic Trace Estimation

David Woodruff, Fred Zhang, Qiuyi Zhang

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use the binary tree summation algorithm instead of DiffSum and DeltaShiftdynamic Hutch++ trace estimation · Triangle counting on ca-GrQc and ca-HepTh with growing cliques, budget 8,000relative errorImproved
use the proposed algorithm instead of DiffSum and DeltaShift on neural network weight matricesdynamic trace estimation · MNIST three-layer network weights, first 1,000 SGD steps, budget 50,000trace estimation errorImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy