Fast Bayesian Updates via Harmonic Representations
Di Zhang

TL;DR
This paper presents a fast, spectral convolution-based framework for Bayesian updates using harmonic analysis, significantly improving computational efficiency and enabling real-time probabilistic inference.
Contribution
It introduces a novel spectral approach to Bayesian inference that transforms updates into FFT-based convolutions, reducing complexity and broadening applicability.
Findings
Spectral convolution simplifies Bayesian updates.
FFT accelerates computations to O(N log N).
Method is effective for smooth functions with spectral decay.
Abstract
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov Chain Monte Carlo (MCMC) and Variational Inference (VI) face significant scalability and efficiency limitations. This paper introduces a novel, unifying framework for fast Bayesian updates by leveraging harmonic analysis. We demonstrate that representing the prior and likelihood in a suitable orthogonal basis transforms the Bayesian update rule into a spectral convolution. Specifically, the Fourier coefficients of the posterior are shown to be the normalized convolution of the prior and likelihood coefficients. To achieve computational feasibility, we introduce a spectral truncation scheme, which, for smooth functions, yields an exceptionally…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Markov Chains and Monte Carlo Methods · Generative Adversarial Networks and Image Synthesis
