Sketching, Moment Estimation, and the LΓ©vy-Khintchine Representation Theorem
October 22, 2024 Β· Declared Dead Β· π Information Technology Convergence and Services
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Seth Pettie, Dingyu Wang
arXiv ID
2410.17426
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.PR
Citations
2
Venue
Information Technology Convergence and Services
Last Checked
4 months ago
Abstract
In the $d$-dimensional turnstile streaming model, a frequency vector $\mathbf{x}=(\mathbf{x}(1),\ldots,\mathbf{x}(n))\in (\mathbb{R}^d)^n$ is updated entry-wisely over a stream. We consider the problem of \emph{$f$-moment estimation} for which one wants to estimate $$f(\mathbf{x})=\sum_{v\in[n]}f(\mathbf{x}(v))$$ with a small-space sketch. In this work we present a simple and generic scheme to construct sketches with the novel idea of hashing indices to \emph{LΓ©vy processes}, from which one can estimate the $f$-moment $f(\mathbf{x})$ where $f$ is the \emph{characteristic exponent} of the LΓ©vy process. The fundamental \emph{LΓ©vy-Khintchine{} representation theorem} completely characterizes the space of all possible characteristic exponents, which in turn characterizes the set of $f$-moments that can be estimated by this generic scheme. The new scheme has strong explanatory power. It unifies the construction of many existing sketches ($F_0$, $L_0$, $L_2$, $L_Ξ±$, $L_{p,q}$, etc.) and it implies the tractability of many nearly periodic functions that were previously unclassified. Furthermore, the scheme can be conveniently generalized to multidimensional cases ($d\geq 2$) by considering multidimensional LΓ©vy processes and can be further generalized to estimate \emph{heterogeneous moments} by projecting different indices with different LΓ©vy processes. We conjecture that the set of tractable functions can be characterized using the LΓ©vy-Khintchine representation theorem via what we called the \emph{Fourier-Hahn-LΓ©vy} method.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted