Yanhui Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yanhui Chen has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yang Shi
Guangdong University of Technology, Guangzhou, China
3 shared publications - Jingchao Wang
Peking University, Beijing, China
2 shared publications - Liangsi Lu
Guangdong University of Technology, Guangzhou, China
2 shared publications - Lixian Chen
Guangdong University of Technology, Guangzhou, China
2 shared publications - Mingxuan Huang
Sun Yat-Sen University, Guangzhou, China
2 shared publications - Minzhe Guo
Guangdong University of Technology, Guangzhou, China
2 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 8887-8895
Diffusion Image Editing via Asynchronous Token Decoding
Text-guided diffusion image editing aims to modify semantic attributes of an image while preserving its identity, layout, and background. However, na\''ively switching the text condition during sampling often causes global drift, as denoising dynamics propagate changes across tokens and can disrupt unedited regions. To address this issue, we propose Asynchronous Token Decoding Edit (ATDEdit), an inference-time framework that views each sampler step as a parallel update of a globally coupled token matrix and enables token-indexed condition switching with differentiated update policies. Instead of applying synchronous target-conditioned updates to all tokens, ATDEdit estimates editable locations using token-wise conditional surprisal and applies target-conditioned corrections to the selected token set. It supplies source key/value memory at keep-token positions and projects selected keep-token latent rows back to their source values; these operations promote background preservation but do not constitute a pixel-level invariance guarantee. This approach combines local editing and background preservation without external or user-provided spatial masks and without model fine-tuning. On PIE-Bench, ATDEdit achieves the strongest reported preservation metrics, including 27.44~dB PSNR and 0.055 LPIPS, while retaining competitive semantic alignment.
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 8887-8895
Open AccessDiffusion Image Editing via Asynchronous Token Decoding
Text-guided diffusion image editing aims to modify semantic attributes of an image while preserving its identity, layout, and background. However, na\''ively switching the text condition during sampling often causes global drift, as denoising dynamics propagate changes across tokens and can disrupt unedited regions. To address this issue, we propose Asynchronous Token Decoding Edit (ATDEdit), an inference-time framework that views each sampler step as a parallel update of a globally coupled token matrix and enables token-indexed condition switching with differentiated update policies. Instead of applying synchronous target-conditioned updates to all tokens, ATDEdit estimates editable locations using token-wise conditional surprisal and applies target-conditioned corrections to the selected token set. It supplies source key/value memory at keep-token positions and projects selected keep-token latent rows back to their source values; these operations promote background preservation but do not constitute a pixel-level invariance guarantee. This approach combines local editing and background preservation without external or user-provided spatial masks and without model fine-tuning. On PIE-Bench, ATDEdit achieves the strongest reported preservation metrics, including 27.44~dB PSNR and 0.055 LPIPS, while retaining competitive semantic alignment.
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 555-563
Majorization Guided Test Time Adaptation for Vision Language Models under Modality Specific Shift
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 555-563
Open AccessMajorization Guided Test Time Adaptation for Vision Language Models under Modality Specific Shift
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4264-4275
Over-squashing as Transport Congestion: A Sandpile Dynamics Perspective
Message-passing graph neural networks (MP-GNNs) are widely used for learning on relational data. However, their performance drops on tasks requiring long-range interactions due to over-squashing, where exponential information compression overwhelms fixed-width embeddings. While existing analyses often attribute this to geometric bottlenecks under linear diffusion assumptions, thresholded nonlinearities in GNNs motivate a load-release view akin to Abelian sandpiles. Using the discrete sandpile model as a structural proxy, we show that graph bottlenecks force large stabilization cost, effectively creating zones of high transport congestion. We characterize stabilization-invariant equivalence classes induced by the reduced Laplacian and derive cut-based lower bounds linking bottlenecks to unavoidable stabilization effort. The resulting theory is discrete, whereas our implementation is a continuous vector-valued surrogate. The theory identifies the relevant design factors, namely capacity and cut size. Guided by these insights, we propose a differentiable Sandpile Stabilization Layer (SSL) and congestion-aware objectives designed to redistribute excess load and manage stabilization costs. Experiments on long-range benchmarks, together with congestion and collision diagnostics, show that targeting sandpile-identified bottlenecks mitigates representation collapse and improves over standard baselines. Project Page: https://sandpile-gnn.github.io/
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4264-4275
Open AccessOver-squashing as Transport Congestion: A Sandpile Dynamics Perspective
Message-passing graph neural networks (MP-GNNs) are widely used for learning on relational data. However, their performance drops on tasks requiring long-range interactions due to over-squashing, where exponential information compression overwhelms fixed-width embeddings. While existing analyses often attribute this to geometric bottlenecks under linear diffusion assumptions, thresholded nonlinearities in GNNs motivate a load-release view akin to Abelian sandpiles. Using the discrete sandpile model as a structural proxy, we show that graph bottlenecks force large stabilization cost, effectively creating zones of high transport congestion. We characterize stabilization-invariant equivalence classes induced by the reduced Laplacian and derive cut-based lower bounds linking bottlenecks to unavoidable stabilization effort. The resulting theory is discrete, whereas our implementation is a continuous vector-valued surrogate. The theory identifies the relevant design factors, namely capacity and cut size. Guided by these insights, we propose a differentiable Sandpile Stabilization Layer (SSL) and congestion-aware objectives designed to redistribute excess load and manage stabilization costs. Experiments on long-range benchmarks, together with congestion and collision diagnostics, show that targeting sandpile-identified bottlenecks mitigates representation collapse and improves over standard baselines. Project Page: https://sandpile-gnn.github.io/