A local Fourier analysis algorithm computes the exact singular values of a periodic-boundary convolution in O(N) time, improving on the FFT-based O(N log N) approach.
Gradient-based learning applied to document recognition,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
LFA applied to CNNs: Efficient Singular Value Decomposition of Convolutional Mappings by Local Fourier Analysis
A local Fourier analysis algorithm computes the exact singular values of a periodic-boundary convolution in O(N) time, improving on the FFT-based O(N log N) approach.