Fast filtering of non-Gaussian models using Amortized Optimal Transport Maps
원문 초록
In this paper, we present the amortized optimal transport filter (A-OTF) designed to mitigate the computational burden associated with the real-time training of optimal transport filters (OTFs). OTFs can perform accurate non-Gaussian Bayesian updates in the filtering procedure, but they require training at every time step, which makes them expensive. The proposed A-OTF framework exploits the similarity between OTF maps during an initial/offline training stage in order to reduce the cost of inference during online calculations. More precisely, we use clustering algorithms to select relevant subsets of pre-trained maps whose weighted average is used to compute the A-OTF model akin to a mixture of experts. A series of numerical experiments validate that A-OTF achieves substantial computational savings during online inference while preserving the inherent flexibility and accuracy of OTF.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MoFE-Time: Mixture of Frequency Domain Experts for Time-Series Forecasting Models
A Survey on Prompt Tuning
Growing Transformers: Modular Composition and Layer-wise Expansion on a Frozen Substrate
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
Learning to Skip the Middle Layers of Transformers
Latent Prototype Routing: Achieving Near-Perfect Load Balancing in Mixture-of-Experts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.