{"slug": "midpoint-generative-models", "title": "Midpoint Generative Models", "summary": "Daniil Shlenskii submitted an arXiv paper on 28 May 2026 introducing Midpoint Generative Models (MGM), a framework for training one-step generative models that exploits a symmetry of Flow Matching with linear interpolation: when the two endpoint distributions coincide, the velocity field vanishes at midpoint time t=1/2. The paper defines the norm of that field as the Midpoint Divergence, extends it via randomly flipped interpolations and symmetric stochastic interpolants into a generalized Midpoint Divergence, and derives a tractable variational objective for training a one-step generator. The resulting MGM algorithm is reported to achieve competitive performance against existing one-step generative modeling methods; the paper was last revised on 14 Nov 2026 (v3).", "body_md": "# Computer Science > Machine Learning\n\n  [Submitted on 28 May 2026 (\n\n[v1](https://arxiv.org/abs/2605.29920v1)), last revised 14 Nov 2026 (this version, v3)]\n# Title:Midpoint Generative Models\n\n[View PDF](https://arxiv.org/pdf/2605.29920)\n\n[HTML (experimental)](https://arxiv.org/html/2605.29920v3)\n\nAbstract:We introduce Midpoint Generative Models (MGM), a principled framework for training one-step generative models. MGM is based on a simple symmetry of Flow Matching with linear interpolation: when the two endpoint distributions coincide, the corresponding velocity field vanishes at the midpoint time, $t=1/2$. We show that the norm of this field defines a valid discrepancy between distributions, which we call the Midpoint Divergence. We extend this discrepancy beyond the midpoint by introducing randomly flipped interpolations and further generalize it by replacing deterministic linear Flow Matching interpolations with symmetric stochastic interpolants, yielding a generalized Midpoint Divergence. Finally, we derive a variational formulation of our generalized divergence, yielding a tractable objective for training a one-step generator. The resulting MGM algorithm offers an effective and theoretically grounded approach to generative modeling, achieving competitive performance against existing one-step generative modeling methods.\n    \n\n## Submission history\n\nFrom: Daniil Shlenskii [\n[view email](https://arxiv.org/show-email/0a219f73/2605.29920)]\n\n**Thu, 28 May 2026 13:31:53 UTC (10,451 KB)**\n\n[\\[v1\\]](https://arxiv.org/abs/2605.29920v1)\n**Mon, 8 Jun 2026 13:31:50 UTC (10,593 KB)**\n\n[\\[v2\\]](https://arxiv.org/abs/2605.29920v2)\n**[v3]** Sat, 14 Nov 2026 10:39:31 UTC (20,693 KB)\n\n### Additional Features\n\n### References & Citations\n\nLoading...\n\n# Bibliographic and Citation Tools\n\nBibliographic Explorer \n\n*(*[What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer))\nConnected Papers \n\n*(*[What is Connected Papers?](https://www.connectedpapers.com/about))\nLitmaps \n\n*(*[What is Litmaps?](https://www.litmaps.co/))\nscite Smart Citations \n\n*(*[What are Smart Citations?](https://www.scite.ai/))\n# Code, Data and Media Associated with this Article\n\nalphaXiv \n\n*(*[What is alphaXiv?](https://alphaxiv.org/))\nCatalyzeX Code Finder for Papers \n\n*(*[What is CatalyzeX?](https://www.catalyzex.com))\nDagsHub \n\n*(*[What is DagsHub?](https://dagshub.com/))\nGotit.pub \n\n*(*[What is GotitPub?](http://gotit.pub/faq))\nHugging Face \n\n*(*[What is Huggingface?](https://huggingface.co/huggingface))\nScienceCast \n\n*(*[What is ScienceCast?](https://sciencecast.org/welcome))\n# Demos\n\n# Recommenders and Search Tools\n\nInfluence Flower \n\n*(*[What are Influence Flowers?](https://influencemap.cmlab.dev/))\nCORE Recommender \n\n*(*[What is CORE?](https://core.ac.uk/services/recommender))\nIArxiv Recommender\n\n*(*[What is IArxiv?](https://iarxiv.org/about))\n# arXivLabs: experimental projects with community collaborators\n\narXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.\n\nBoth individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.\n\nHave an idea for a project that will add value for arXiv's community? [**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html).", "url": "https://wpnews.pro/news/midpoint-generative-models", "canonical_source": "https://arxiv.org/abs/2605.29920", "published_at": "2026-11-21 02:16:14+00:00", "updated_at": "2026-11-21 02:43:14.740559+00:00", "lang": "en", "topics": ["machine-learning", "generative-ai", "ai-research"], "entities": ["Daniil Shlenskii", "arXiv", "Midpoint Generative Models", "Flow Matching", "Midpoint Divergence"], "also_reported_by": [], "takeaway": "MGM trains a one-step generator by minimizing a variational objective built on the Midpoint Divergence — the norm of the Flow Matching velocity field at t=1/2, where it vanishes when endpoint distributions coincide — and reports competitive performance against existing one-step methods.", "recommendation": null, "alternates": {"html": "https://wpnews.pro/news/midpoint-generative-models", "markdown": "https://wpnews.pro/news/midpoint-generative-models.md", "text": "https://wpnews.pro/news/midpoint-generative-models.txt", "jsonld": "https://wpnews.pro/news/midpoint-generative-models.jsonld"}}