Graph generative models are essential across diverse scientific domains by capturing complex distributions over relational data. Among them, graph diffusion models achieve superior performance but face inefficient sampling and limited flexibility due to the tight coupling between training and sampling stages. We introduce DeFoG, a novel graph generative framework that disentangles sampling from training, enabling a broader design space for more effective and efficient model optimization. DeFoG employs a discrete flow-matching formulation that respects the inherent symmetries of graphs. We theoretically ground this disentangled formulation by explicitly relating the training loss to the sampling algorithm and showing that DeFoG faithfully replicates the ground truth graph distribution. Building on these foundations, we thoroughly investigate DeFoG's design space and propose novel sampling methods that significantly enhance performance and reduce the required number of refinement steps. Extensive experiments demonstrate state-of-the-art performance across synthetic, molecular, and digital pathology datasets, covering both unconditional and conditional generation settings. It also outperforms most diffusion-based models with just 5-10% of their sampling steps.
Hierarchical Discrete Flow Matching for Graph Generation
Department of Computer Science, University of Geneva, Switzerland(瑞士日内瓦大学计算机科学系);DMML Group, Geneva School for Business administration HES-SO, Switzerland(瑞士日内瓦高等商学院DMML研究组)
Flow Matching for Offline Reinforcement Learning with Discrete Actions
Department of Computer Science, University of Kentucky(计算机科学系,肯塔基大学);Department of Computing and Information Sciences, Rochester Institute of Technology(计算与信息科学系,罗切斯特理工学院)
Discrete Guidance Matching: Exact Guidance for Discrete Flow Matching
School of Statistics, East China Normal University(华东师范大学统计学院);Department of Statistics, University of California, Los Angeles(加州大学洛杉矶分校统计系);Department of Industrial and Systems Engineering, University of Minnesota(明尼苏达大学工业与系统工程系);School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院)
Multi-Objective-Guided Discrete Flow Matching for Controllable Biological Sequence Design
Department of Biomedical Engineering, Duke University(杜克大学生物医学工程系);Department of Computer Science, Fudan University(复旦大学计算机科学系);Center of Computational Biology, Duke-NUS Medical School(杜克-新加坡国立大学医学学校计算生物学中心);Management and Technology Program, University of Pennsylvania(宾夕法尼亚大学管理与技术项目);Department of Computer Science, Duke University(杜克大学计算机科学系);Department of Biostatistics and Bioinformatics, Duke University(杜克大学生物统计与生物信息学系)
提出 MOG-DFM 框架,通过混合秩方向分数和自适应超锥滤波引导预训练离散流匹配模型,实现多目标帕累托高效的肽与增强子 DNA 序列设计。
Binomial flows: Denoising and flow matching for discrete ordinal data
Division of Applied Mathematics, Brown University, Providence, RI, USA 02912(应用数学系,布朗大学,普罗维德恩,罗德岛州,美国 02912);Department of Statistical Sciences, University of Toronto, Toronto, ON, Canada M5G 1X6(统计科学系,多伦多大学,多伦多,安大略省,加拿大 M5G 1X6)
Simplex-to-Euclidean Bijections for Categorical Flow Matching
Department of Computer Science, University of Helsinki(赫尔辛基大学计算机科学系);Department of Computer Science, Aalto University(阿莱大学计算机科学系);ELLIS Institute Finland(芬兰ELLIS研究所)
Error Analysis of Discrete Flow with Generator Matching
School of Statistics, East China Normal University(东华大学统计学院);Department of Statistics and Data Science, University of California, Los Angeles(加州大学洛杉矶分校统计与数据科学系);Department of Industrial and Systems Engineering, University of Minnesota(明尼苏达大学工业与系统工程系);School of Data Science, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院)
Generative Modeling of Discrete Data Using Geometric Latent Subspaces
Institute for Mathematics, Heidelberg University(海德堡大学数学研究所);Mannheim Institute for Intelligent Systems in Medicine, Heidelberg University(海德堡大学曼海姆智能医学系统研究所);IWR, Heidelberg University(海德堡大学IWR研究所);Research Station Geometry and Dynamics, Heidelberg University(海德堡大学几何与动力学研究站)
Flexible Inverse Design of Optical Multilayer Coatings Using Discrete-Continuous Flow Matching
School of Electronic Science and Engineering (National Model Microelectronics College)(电子科学与技术学院(国家级微电子学院));Fujian Key Laboratory of Ultrafast Laser Technology and Applications(福建省超快激光技术与应用重点实验室)
A Theoretical Analysis of Discrete Flow Matching Generative Models
Center for Foundation Models and Generative AI, Northwestern University, Evanston, IL 60208, USA(基础模型与生成式人工智能中心,西北大学,伊利诺伊州埃文斯顿,60208,美国);Department of Computer Science, Northwestern University, Evanston, IL 60208, USA(计算机科学系,西北大学,伊利诺伊州埃文斯顿,60208,美国);University of California, Berkeley, Berkeley, CA 94720, USA(加州大学伯克利分校,伯克利,加利福尼亚州,94720,美国);Ensemble AI, San Francisco, CA 94133, USA(Ensemble AI,旧金山,加利福尼亚州,94133,美国);Department of Statistics and Data Science, Northwestern University, Evanston, IL 60208, USA(统计与数据科学系,西北大学,伊利诺伊州埃文斯顿,60208,美国)
MIRRA: Fast, High-Fidelity Molecular Generation with Chemistry-Informed Discrete Flow Matching
Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所);Tandon School of Engineering, New York University(纽约大学坦登工程学院);Department of Physics, New York University(纽约大学物理系)
FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching
Department of Chemistry, KAIST(韩国科学技术院化学系);InnoCORE AI-CRED Institute, KAIST(韩国科学技术院InnoCORE AI-CRED研究所);College of Pharmacy, Dongguk University(东国大学药学院);Department of Data Science, KAIST(韩国科学技术院数据科学系)