Adversarially robust (1+ε)-approximate F_p estimation for all p∈[0,2] in polylog space is achieved via implicit isometric embeddings into Hilbert space and regularized kernel regression, plus a weak equivalence theorem between oblivious sketching and robust streaming.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.
citing papers explorer
-
Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile Streams
Adversarially robust (1+ε)-approximate F_p estimation for all p∈[0,2] in polylog space is achieved via implicit isometric embeddings into Hilbert space and regularized kernel regression, plus a weak equivalence theorem between oblivious sketching and robust streaming.
-
Submodular Maximization over Many Matroids via Ordered Local Search
A new ordered local search algorithm achieves k/2 + o(k) approximation for monotone submodular maximization over k matroids and (ln 4 k)/3 + o(k) for weighted k-set packing.