Sequentially-Controlled Interactive Multi-Particle Flow-Maps for Online Feedback-Driven Search

• URL: http://arxiv.org/abs/2607.01144v1
• Date: Wed, 01 Jul 2026 16:27:17 GMT
• Title: Sequentially-Controlled Interactive Multi-Particle Flow-Maps for Online Feedback-Driven Search
• Abstract summary: Sequentially-Controlled Interactive Multi-Particle Flow-Maps (IMPFM) is a framework for sample-efficient online feedback-driven search.<n>IMPFM introduces a principled and efficient posterior sample sharing mechanism across particles powered by flow maps.<n>We prove that the resulting sampling framework yields a multi-particle interaction-aware Feynman-Kac corrector.
• Score: 26.617381371184635
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: While generative models have enabled training-free reward alignment, current methods typically excel in local exploration within narrow regions of the underlying distribution. These approaches struggle when preferences are unknown a priori and only revealed through sequential feedback-a scenario demanding broad exploration to uncover high-utility regions. To address this, we propose Sequentially-Controlled Interactive Multi-Particle Flow-Maps (IMPFM), a framework for sample-efficient online feedback-driven search. IMPFM progressively transports a group of interactive particles toward the target distribution, maintaining the broad coverage essential for heterogeneous preference alignment. IMPFM introduces a principled and efficient posterior sample sharing mechanism across particles powered by flow maps. By correcting individual particle drift with the collective posterior samples of the entire ensemble at each resampling step, the framework maximizes sample utility to enable global exploration while actively mitigating reward over-optimization, typical of standard control frameworks. Paired with a principled exploration-exploitation reweighting mechanism involving multi-particle interaction, this sequentially corrected multi-particle dynamics explicitly preserves structural diversity and overcomes the weight degeneracy inherent to standard SMC samplers. Crucially, we prove that the resulting sampling framework yields a multi-particle interaction-aware Feynman-Kac corrector that progressively steers the multi-particle system toward a KL-tilted target distribution, facilitating global exploration and preventing mode collapse. Extensive empirical evaluations and rigorous ablations across diverse search and alignment tasks confirm the efficacy of IMPFM over existing baselines.

Related papers

• N-GRPO: Embedding-Level Neighbor Mixing for Enhanced Policy Optimization [55.14402862283128]
  We introduce N-GRPO, a novel exploration strategy integrated into the Group Relative Policy Optimization framework.<n>Rather than relying on token-level sampling or native embedding-level noise, our approach leverages Semantic Neighbor Mixing.<n>N-GRPO achieves consistent improvements over strong baselines on math reasoning benchmarks and also exhibits robust generalization capabilities on out-of-distribution tasks.
  arXiv  Detail & Related papers  (2026-06-09T12:21:27Z)
• To discretize continually: Mean shift interacting particle systems for Bayesian inference [9.150567695563067]
  We introduce new methods for approximating integration against a probability distribution given its unnormalized density.<n>These methods extend the classical mean shift algorithm, as well as recent algorithms for optimal quantization of empirical distributions.<n>We demonstrate their performance on a wide range of benchmark sampling problems, including multi-modal mixtures, Bayesian hierarchical models, PDE-constrained inverse problems, and beyond.
  arXiv  Detail & Related papers  (2026-05-13T21:48:00Z)
• Mixture Prototype Flow Matching for Open-Set Supervised Anomaly Detection [41.96735569500412]
  Open-set supervised anomaly detection (OSAD) aims to identify unseen anomalies using limited anomalous supervision.<n>We propose a framework that learns a continuous transformation from normal feature distributions to a structured Gaussian mixture prototype space.<n>MPFM achieves state-of-the-art performance across diverse benchmarks under both single- and multi-anomaly settings.
  arXiv  Detail & Related papers  (2026-05-04T10:36:43Z)
• Chain of Modality: From Static Fusion to Dynamic Orchestration in Omni-MLLMs [84.3271821505699]
  Chain of Modality (CoM) is an agentic framework that transitions multimodal fusion from passive concatenation to dynamic orchestration.<n> operating in either a training-free or a data-efficient SFT setting, CoM achieves robust and consistent generalization across diverse benchmarks.
  arXiv  Detail & Related papers  (2026-04-16T01:21:14Z)
• From Sparse to Dense: Multi-View GRPO for Flow Models via Augmented Condition Space [78.36537400975298]
  Group Relative Policy Optimization (GRPO) has emerged as a powerful framework for preference alignment in text-to-image (T2I) flow models.<n>We propose Multi-View GRPO, a novel approach that enhances relationship exploration by augmenting the condition space.<n>MV-GRPO achieves superior alignment performance over state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-03-13T04:35:13Z)
• Active Flow Matching [14.437387789022354]
  Active Flow Matching (AFM) reformulates variational objectives to operate on conditional endpoint distributions along the flow.<n>We derive forward and reverse Kullback-Leibler (KL) variants using self-normalised importance sampling.
  arXiv  Detail & Related papers  (2026-03-01T02:50:07Z)
• Mean-Field Path-Integral Diffusion: From Samples to Interacting Agents [0.0]
  Mean-Field Path-Integral Diffusion (MF-PID) is a framework in which samples are promoted to interacting agents whose drift depends self-consistently on the evolving population density.<n>MF-PID achieves 19--24% reductions in cumulative control energy over independent-agent baselines while matching the prescribed terminal distribution exactly.
  arXiv  Detail & Related papers  (2026-02-23T21:14:06Z)
• SetPO: Set-Level Policy Optimization for Diversity-Preserving LLM Reasoning [50.93295951454092]
  We introduce a set level diversity objective defined over sampled trajectories using kernelized similarity.<n>Our approach derives a leave-one-out marginal contribution for each sampled trajectory and integrates this objective as a plug-in advantage shaping term for policy optimization.<n>Experiments across a range of model scales demonstrate the effectiveness of our proposed algorithm, consistently outperforming strong baselines in both Pass@1 and Pass@K across various benchmarks.
  arXiv  Detail & Related papers  (2026-02-01T07:13:20Z)
• Regime-Adaptive Bayesian Optimization via Dirichlet Process Mixtures of Gaussian Processes [14.367563771141592]
  RAMBO is a Dirichlet Process Mixture of Gaussian Processes that automatically discovers latent regimes during optimization.<n>We derive collapsed Gibbs sampling that analytically marginalizes latent functions for efficient inference.<n>Our acquisition functions decompose uncertainty into intra-regime and inter-regime components.
  arXiv  Detail & Related papers  (2026-01-27T20:45:50Z)
• Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning [59.11663802446183]
  Flow and diffusion generative models can be adapted to optimize task-specific objectives while preserving prior information.<n>We introduce Flow Density Control (FDC), a simple algorithm that reduces this complex problem to a specific sequence of simpler fine-tuning tasks.<n>We derive convergence guarantees for the proposed scheme under realistic assumptions by leveraging recent understanding of mirror flows.
  arXiv  Detail & Related papers  (2025-11-27T17:19:01Z)
• G$^2$RPO: Granular GRPO for Precise Reward in Flow Models [74.21206048155669]
  We propose a novel Granular-GRPO (G$2$RPO) framework that achieves precise and comprehensive reward assessments of sampling directions.<n>We introduce a Multi-Granularity Advantage Integration module that aggregates advantages computed at multiple diffusion scales.<n>Our G$2$RPO significantly outperforms existing flow-based GRPO baselines.
  arXiv  Detail & Related papers  (2025-10-02T12:57:12Z)
• Annealing Flow Generative Models Towards Sampling High-Dimensional and Multi-Modal Distributions [6.992239210938067]
  Annealing Flow (AF) is a method built on Continuous Normalizing Flow (CNF) for sampling from high-dimensional and multi-modal distributions.
  arXiv  Detail & Related papers  (2024-09-30T17:48:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.