Skip to content

Flat-Consensus Diffusion for Robust Data Reshaping under Noisy Evaluator

Sep 2026 · 1 citation · 36 references
Computer Science

TL;DR

The results show that robust data reshaping requires searching for flat, consensus-supported regions rather than sharp single-trajectory optima, and proposes FCDiff, a flat-consensus diffusion framework that addresses both failures through a micro-macro decomposition.

Abstract

Data shape determines how features are structured, how patterns are separated, and how distributions cover the underlying domain. Poor data shape can make models learn noise rather than generalizable structure. This paper studies robust feature-centric data reshaping: generating feature transformations that remain useful, stable, and reproducible under noisy evaluation and imperfect data conditions. We view reshaping operation sequence search as reward-guided diffusion generation, and robust reshaping as searching for regions in the latent reward landscape rather than isolated high-reward transformations. The key challenge is dual instability: noisy evaluators distort local reward guidance, while stochastic generative trajectories can converge to inconsistent solutions. We propose FCDiff, a flat-consensus diffusion framework that addresses both failures through a micro-macro decomposition. The micro layer replaces point-estimate reward guidance with Gaussian-smoothed, Monte Carlo averaged gradients, steering generation toward locally flat reward regions. The macro layer aggregates independently guided trajectories with a weighted Frechet-mean barycenter, selecting consensus-supported basins and filtering stochastic outliers. Across an 8-dataset headline cohort under heavy-tailed evaluator noise, FCDiff attains the best aggregate rank on lower-tail reliability and robustness against both search-based AutoFE and robustness-oriented generative baselines, with statistically significant accuracy gains over every generative baseline. Our results show that robust data reshaping requires searching for flat, consensus-supported regions rather than sharp single-trajectory optima.

View source

Similar papers

Preprint Aug 2026

On-Policy Self-Distillation in Diffusion Models

The results support on-policy self-distillation as an efficient and analyzable approach to diffusion post-training by converting image-level reward guidance into explicit and continually refreshed intermediate supervision, thereby opening a path toward more efficient and diagnosable alignment.

Weina Zhou, Xiongwei Zhu, Ling-Dong Kong et al. · 9 citations
#machine learning Preprint Oct 2026

DiffusionART: Efficient, Stable and Scalable Reinforcement of Diffusion Models

Online reinforcement learning (RL) fine-tunes diffusion models with black-box rewards, but reverse-process methods such as Flow-GRPO are limited in efficiency by poor credit assignment, while forward-process methods such as DiffusionNFT are efficient yet unstable without carefully tuned exponential-moving-average (EMA)...

Zheng-Lin Wan, Jia-Yu Chen, Zhengfeiyang Zhang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Opinion Leader Dynamics: How Sparse Attention Shapes Token Clustering

This work introduces opinion leader dynamics, a framework that identifies two mechanisms through which token groups converge internally while maintaining distinct limiting directions, and provides a dynamical account of how sparse attention can support alignment within groups while preserving separation between them.

Jing-Kun Liu, Yue Song · 0 citations
#artificial intelligence Preprint Sep 2026

DOHF: Online Diffusion Fine-tuning with Doob's $h$-transform Guidance

This work proposes Diffusion Online-guidance Fine-tuning (DOHF), which turns Doob's $h-transform into a practical online training algorithm and demonstrates how adapting probabilistic conditioning through inexpensive estimation and iterative distillation can improve generative learning across statistical sampling and v...

Zheng-Yi Guo, Jia-Yuan Sheng, Wen-Pin Tang et al. · 1 citation
#machine learning Preprint Oct 2026

IDRF: Inverse-Distilled Reward Fine-tuning of Masked Discrete Diffusion Models

Masked discrete diffusion models offer a promising alternative to autoregressive generation, but iterative sampling can be costly, and intractable sequence likelihoods complicate reward fine-tuning. We introduce IDRF, a framework for reward fine-tuning of few-step masked discrete diffusion generators. Starting from a s...

V. Gromadskii, David Li, Samson Gourevitch et al. · 1 citation
#artificial intelligence Preprint Oct 2026

DiffNash: Finding Nash Equilibrium in High-Dimensional Continuous Action Spaces with Diffusion Policies

Computing equilibria in high-dimensional continuous games requires learning and representing rich, multi-modal strategy distributions, something conventional neural policies struggle to achieve. Diffusion models offer a natural solution, but standard diffusion training requires direct samples from a fixed target distri...

Hai-Chuan Wang, Anagha Satish, Jia-Le Zheng et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.