13 articles tagged with #variational-inference. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce Parallel Variational Monte Carlo (PVMC), a novel training method for deep state space models that combines strengths of variational and sequential Monte Carlo approaches. The technique achieves comparable or superior performance to existing methods while running 10x faster, addressing a critical scalability bottleneck in training complex temporal models.
Researchers introduce FAV, a novel framework for aligning few-step generative models that requires only sample access to generators and reference distributions. The method uses Stein Variational Gradient Descent to cast alignment as sampling from reward-tilted distributions, demonstrating superior performance across robotic manipulation tasks and scaling to high-resolution image synthesis.
Researchers have developed Variational Mixture-of-Experts Routing (VMoER), a Bayesian framework that enables uncertainty quantification in large-scale AI models while adding less than 1% computational overhead. The method improves routing stability by 38%, reduces calibration error by 94%, and increases out-of-distribution detection by 12%.
Researchers propose Diff-prior, a diffusion-based adaptive prior system that improves neural relational inference (NRI) methods for discovering interaction graphs from data. Rather than relying on oversimplified uniform priors that treat edges independently, the new approach uses learned denoising-style calibration to produce more reliable and decisive structural discoveries across multiple NRI architectures.
Researchers propose Variational Speculative Decoding (VSD), a novel training method that improves LLM inference speed by optimizing draft models to better align with actual decoding requirements. By reformulating draft training as variational inference and incorporating path-level utilities, VSD achieves up to 9.6% speedup improvements over existing methods like EAGLE-3.
Researchers provide a rigorous mathematical framework showing how Active Inference and Expected Free Energy (EFE) minimization can be decomposed into Variational Free Energy (VFE) minimization with explicit entropy corrections. The work clarifies the theoretical foundations of EFE-based planning by identifying which corrections are necessary for different decision-making scenarios, demonstrated through grid-world experiments.
Researchers introduce the Insertion Process (IP), a novel generative model that learns optimal insertion orders for variable-length sequence generation, moving beyond fixed-length masked diffusion approaches. The framework uses permutation-based variational inference to jointly optimize what, where, and when to insert tokens, demonstrating improvements in goal-conditioned planning and molecular generation tasks.
Researchers propose FedVPA-GP, a federated learning framework that enables privacy-preserving alignment of large language models while preserving diverse user preferences instead of averaging them into a single monolithic reward model. The approach uses a Gumbel-Softmax prior and orthogonal loss to prevent posterior collapse and successfully disentangles conflicting user intents in decentralized settings.
Researchers introduce VACSR, a variational adapter method that improves cross-modal similarity representation in vision-language models by treating annotation limitations as a variational inference problem. The approach addresses the problem of binary classification boundaries compressing continuous similarity spaces, reducing false negatives and improving generalization across image-text retrieval and domain adaptation tasks.
Researchers have developed a mathematical framework that preserves closed-form variational inference when composing multiple probabilistic models together, traditionally a challenge that breaks analytical tractability. By identifying five core factor-graph primitives and proving their composability, the work enables Bayesian mixture-of-experts models with inferred gating functions, demonstrated through improved ensemble forecasting with calibrated uncertainty.
Researchers introduce EAPO, an exploration-aware reinforcement learning framework that enables LLM agents to selectively explore uncertain scenarios before acting. The method uses fine-grained reward functions and adaptive exploration mechanisms to improve decision-making across text and GUI-based agent benchmarks.
Researchers propose improved divergence measures for training Generative Flow Networks (GFlowNets), comparing Renyi-α, Tsallis-α, and KL divergences to enhance statistical efficiency. The work introduces control variates that reduce gradient variance and achieve faster convergence than existing methods, bridging GFlowNets training with generalized variational inference frameworks.
Researchers developed a message passing approach for Expected Free Energy minimization that transforms complex combinatorial search problems into tractable inference problems. The method enables more efficient AI agent planning and exploration under uncertainty, outperforming conventional approaches in test environments.
