LAPLEX introduces exact, phased Laplace-kernel operators defined by learnable anchors with FFT scaling for trainable large-scale dense-like layers and Gram matrices in neural networks.
Database-friendly random projections: Johnson–Lindenstrauss with binary coins.Journal of Computer and System Sciences, 66(4):671–687, 2003
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
LAPLEX: The FFT of Learnable Laplace Kernels
LAPLEX introduces exact, phased Laplace-kernel operators defined by learnable anchors with FFT scaling for trainable large-scale dense-like layers and Gram matrices in neural networks.