Unrestrained Simplex Denoising for Discrete Data. A Non-Markovian Approach Applied to Graph Generation

arXiv:2603.28572 · cs.LG · Submitted 2026-03-30 · Read on arXiv

cs.LG

Submitted: 2026-03-30

Updated: 2026-10-22

Terminology

• Generative Modeling — 2× in this paper · explained in 3 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Flow Matching — 1× in this paper · explained in 20 episodes
• Generative Model — 1× in this paper · explained in 2 episodes
• Generative Models — 1× in this paper · explained in 3 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks