Research map / Probabilistic and scientific modeling / Variational and generative sampling
High-dimensional Mean-Field Games by Particle-based Flow Matching
Jiajia Yu, Junghwan Lee, Yao Xie, Xiuyuan Cheng
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use particle-based flow matching MFG solver instead of OT-CFM / SB-CFM / Rectified Flow / SI for image translation | Particle-based FM MFG · CelebA Male to Female (VAE latent) | FID: 12.88 -> 9.68 vs OT-CFM | Improved |
| use particle-based flow matching MFG solver instead of Q-Flow | Particle-based FM MFG · Handbag to Shoes (VAE latent) | FID: 12.34 -> 12.44 | No clear effect |
| use particle-based flow matching MFG solver instead of GAN baselines (Cycle GAN) | Particle-based FM MFG · Handbag to Shoes (VAE latent) | FID: 16.00 -> 12.44 | Improved |
Closest papers by meaning
- Bench-MFG: A Benchmark Suite for Learning in Stationary Mean Field Games (NeurIPS 2026 · similarity 0.87)
- Symmetric Mean-field Langevin Dynamics for Distributional Minimax Problems (ICLR 2024 · similarity 0.86)
- Stochastic Semi-Gradient Descent for Learning Mean Field Games with Population-Aware Function Approximation (ICLR 2025 · similarity 0.86)
- Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL (ICML 2024 · similarity 0.86)
- Solving Continuous Mean Field Games: Deep Reinforcement Learning for Non-Stationary Dynamics (NeurIPS 2025 · similarity 0.85)
- Learning Discrete-Time Major-Minor Mean Field Games (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
