Tag
一篇技术评论文章，批评 OpenAI 在数学论文集中声称的更快快速傅里叶变换（FFT）算法，指出其改进微乎其微，更像是利用理论模型在硬件上并不实际可行的“恶意利用”，而非真正的突破。
This article provides detailed notes on discrete-time Fourier series (DTFS) and discrete-time Fourier transform (DTFT), covering their theoretical foundations and examples for signal processing applications.
An introduction to an interactive website that explains the Discrete Fourier Transform and digital signal processing concepts using visualizations and animations.
This article explains the Fourier transform of power-law functions, focusing on the interesting case of 1/f noise and the symmetry between time and frequency domains.
This paper characterizes the error that arises when substituting the Hadamard transform (which diagonalizes dyadic convolution) for the DFT (which diagonalizes circular convolution), identifying universal zero-error positions, a nearly full-rank error operator, and a closed-form expression for expected error magnitude governed by a single alignment scalar.
An in-depth exploration of the Fourier transform, starting from Fourier series and extending to non-periodic functions, with interactive visualizations and mathematical derivation.
This paper presents Accelerated Fourier SAT (AFSAT), a GPU-accelerated solver for pseudo-Boolean satisfiability based on continuous local search. It improves upon prior proof-of-concept implementations by supporting heterogeneous constraints and leveraging JAX for parallel computation.
Mix-MoE proposes a mixed Mixture-of-Experts framework with specialized expert groups and Fourier-transform-enhanced routing to mitigate parameter interference in multilingual machine translation, achieving significant improvements over baselines.