<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Publications | Jiaying He</title><link>https://y-tarl.github.io/publication/</link><atom:link href="https://y-tarl.github.io/publication/index.xml" rel="self" type="application/rss+xml"/><description>Publications</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 01 May 2025 00:00:00 +0000</lastBuildDate><image><url>https://y-tarl.github.io/media/icon_hu_982c5d63a71b2961.png</url><title>Publications</title><link>https://y-tarl.github.io/publication/</link></image><item><title>Mitigating Hallucination of Large Vision-Language Models via Dynamic Logits Calibration</title><link>https://y-tarl.github.io/publication/dlc/</link><pubDate>Thu, 01 May 2025 00:00:00 +0000</pubDate><guid>https://y-tarl.github.io/publication/dlc/</guid><description>&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: This collaborative work was completed during my undergraduate studies at ZJUT, focusing on addressing hallucination issues in vision-language models.&lt;/p&gt;
&lt;h2 id="overview"&gt;Overview&lt;/h2&gt;
&lt;p&gt;Dynamic Logits Calibration (DLC) is a novel framework designed to mitigate hallucination in Large Vision-Language Models (LVLMs) by dynamically aligning text generation with visual evidence during inference. By leveraging CLIP to evaluate semantic associations between input images and generated text sequences, DLC adaptively adjusts output token probability distributions, ensuring a more accurate and contextually grounded generation process.&lt;/p&gt;
&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
&lt;p&gt;Large Vision-Language Models (LVLMs) have demonstrated significant advancements in multimodal understanding, yet they are frequently hampered by hallucination-the generation of text that contradicts visual input. Existing training-free decoding strategies exhibit critical limitations, including the use of static constraints that do not adapt to semantic drift during generation, inefficiency stemming from the need for multiple forward passes, and degradation of detail due to overly rigid intervention rules.&lt;/p&gt;
&lt;p&gt;To overcome these challenges, this paper introduces &lt;strong&gt;Dynamic Logits Calibration (DLC)&lt;/strong&gt;, a novel training-free decoding framework designed to dynamically align text generation with visual evidence at inference time. At the decoding phase, DLC step-wise employs CLIP to assess the semantic alignment between the input image and the generated text sequence. Then, the Relative Visual Advantage (RVA) of candidate tokens is evaluated against a dynamically updated contextual baseline, adaptively adjusting output logits to favor tokens that are visually grounded.&lt;/p&gt;
&lt;p&gt;Furthermore, an adaptive weighting mechanism, informed by a real-time context alignment score, carefully balances the visual guidance while ensuring the overall quality of the textual output. Extensive experiments conducted across diverse benchmarks and various LVLM architectures (such as LLaVA, InstructBLIP, and MiniGPT-4) demonstrate that DLC significantly reduces hallucinations, outperforming current methods while maintaining high inference efficiency by avoiding multiple forward passes.&lt;/p&gt;
&lt;h2 id="key-innovations"&gt;Key Innovations&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Dynamic Visual Alignment&lt;/strong&gt;: Unlike prior methods that rely on static constraints, DLC continuously evaluates the semantic alignment between the image and the generated text at each decoding step. This dynamic approach allows for real-time adjustments that better reflect the evolving context of the generated sequence.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Relative Visual Advantage (RVA)&lt;/strong&gt;: DLC introduces the concept of RVA, which measures the visual relevance of candidate tokens relative to a dynamically updated contextual baseline. This ensures that token adjustments are context-sensitive, enhancing the model&amp;rsquo;s ability to generate visually grounded text.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Adaptive Weighting Mechanism&lt;/strong&gt;: To balance visual grounding with overall text quality, DLC employs an adaptive weighting strategy based on a context alignment score. This mechanism ensures that the influence of visual evidence is modulated according to the confidence in the current textual context, preventing over-reliance on visual cues that could compromise fluency.&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="citation"&gt;Citation&lt;/h2&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-bibtex" data-lang="bibtex"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="nc"&gt;@article&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="nl"&gt;chen2025mitigating&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;title&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{Mitigating Hallucination of Large Vision-Language Models via Dynamic Logits Calibration}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;author&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{Chen, Jiahe and He, Jiaying and Shao, Qian and Chen, Qiyuan and Ying, Jiahe and Xu, Hongxia and Chen, Jintai and Zheng, Jianwei and Wu, Jian}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;journal&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{arXiv preprint arXiv:2506.21509}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{2025}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;</description></item><item><title>BioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning</title><link>https://y-tarl.github.io/publication/biographfusion/</link><pubDate>Sat, 01 Mar 2025 00:00:00 +0000</pubDate><guid>https://y-tarl.github.io/publication/biographfusion/</guid><description>&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: This work was completed during my undergraduate studies and represents my early research experience in graph neural networks and biological knowledge graphs.&lt;/p&gt;
&lt;h2 id="overview"&gt;Overview&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Motivation:&lt;/strong&gt; Biomedical knowledge graphs (KGs) are crucial for drug discovery and disease understanding, yet their completion and reasoning are challenging. Knowledge Embedding (KE) methods capture global semantics but struggle with dynamic structural integration, while Graph Neural Networks (GNNs) excel locally but often lack semantic understanding.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Results:&lt;/strong&gt; We introduce BioGraphFusion, a novel framework for deeply synergistic semantic and structural learning. BioGraphFusion establishes a global semantic foundation via tensor decomposition, guiding an LSTM-driven mechanism to dynamically refine relation embeddings during graph propagation. Experiments across three key biomedical tasks demonstrate BioGraphFusion&amp;rsquo;s superior performance over state-of-the-art KE, GNN, and ensemble models.&lt;/p&gt;
&lt;h2 id="key-contributions"&gt;Key Contributions&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;&lt;strong&gt;CP decomposition-based global semantic modeling&lt;/strong&gt; that establishes a semantic foundation to guide subsequent dynamic structural reasoning&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;LSTM-driven context-aware relation refinement mechanism&lt;/strong&gt; that dynamically fuses entity contexts through gating systems&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Query-guided subgraph construction&lt;/strong&gt; with biological relevance filtering for precise and efficient reasoning&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id="citation"&gt;Citation&lt;/h2&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-bibtex" data-lang="bibtex"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="nc"&gt;@article&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="nl"&gt;lin2025biographfusion&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;title&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{BioGraphFusion: Graph Knowledge Embedding for Biological Completion and Reasoning}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;author&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{Lin, Yitong and He, Jiaying and Chen, Jiahe and Zhu, Xinnan and Zheng, Jianwei and Tao, Bo}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;journal&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{Bioinformatics}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;pages&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{btaf408}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{2025}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;publisher&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{Oxford University Press}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;</description></item><item><title>C3S3: Complementary Competition and Contrastive Selection for Semi-Supervised Medical Image Segmentation</title><link>https://y-tarl.github.io/publication/c3s3/</link><pubDate>Sun, 01 Dec 2024 00:00:00 +0000</pubDate><guid>https://y-tarl.github.io/publication/c3s3/</guid><description>&lt;p&gt;&lt;strong&gt;Note&lt;/strong&gt;: This work was completed during my undergraduate studies and represents my early research experience in medical image processing and semi-supervised learning.&lt;/p&gt;
&lt;h2 id="overview"&gt;Overview&lt;/h2&gt;
&lt;p&gt;Semi-supervised medical image segmentation (SSMIS) offers a promising solution for the challenge of insufficiently annotated samples in the medical field. Despite achieving impressive results in delineating primary target areas, most current methodologies struggle to precisely capture the subtle details of boundaries, often leading to significant diagnostic inaccuracies.&lt;/p&gt;
&lt;h2 id="abstract"&gt;Abstract&lt;/h2&gt;
&lt;p&gt;For the immanent challenge of insufficiently annotated samples in the medical field, semi-supervised medical image segmentation (SSMIS) offers a promising solution.
Despite achieving impressive results in delineating primary target areas, most current methodologies struggle to precisely capture the subtle details of boundaries.
This deficiency often leads to significant diagnostic inaccuracies. To tackle this issue, we introduce C3S3, a novel semi-supervised segmentation model that synergistically integrates complementary competition and contrastive selection. This design significantly sharpens boundary delineation and enhances overall precision. Specifically, we develop an &lt;em&gt;Outcome-Driven Contrastive Learning&lt;/em&gt; module dedicated to refining boundary localization. Additionally, we incorporate a &lt;em&gt;Dynamic Complementary Competition&lt;/em&gt; module that leverages two high-performing sub-networks to generate pseudo-labels, thereby further improving segmentation quality. The proposed C3S3 undergoes rigorous validation on two publicly accessible datasets, encompassing the practices of both MRI and CT scans. The results demonstrate that our method achieves superior performance compared to previous cutting-edge competitors. Especially, on the 95HD and ASD metrics, our approach achieves a notable improvement of at least 6%, highlighting the significant advancements.&lt;/p&gt;
&lt;h2 id="key-innovations"&gt;Key Innovations&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;&lt;strong&gt;Dynamic Complementary Competition (DCC)&lt;/strong&gt;: A dual-network dynamic game mechanism that generates high-confidence pseudo-labels, breaking dependency on single-model teacher frameworks&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Outcome-Driven Contrastive Learning (ODCL)&lt;/strong&gt;: Combined with dual-space intersection-union contrastive loss functions to precisely enhance target boundary representation capabilities&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Superior Performance&lt;/strong&gt;: 6%+ improvement in boundary-sensitive metrics (95HD, ASD) on left atrial MRI and pancreatic CT datasets compared to SOTA methods&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id="citation"&gt;Citation&lt;/h2&gt;
&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-bibtex" data-lang="bibtex"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="nc"&gt;@article&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="nl"&gt;he2025c3s3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;title&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{C3S3: Complementary Competition and Contrastive Selection for Semi-Supervised Medical Image Segmentation}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;author&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{He, Jiaying and Lin, Yitong and Chen, Jiahe and Xu, Honghui and Zheng, Jianwei}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;journal&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{arXiv preprint arXiv:2506.07368}&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;=&lt;/span&gt;&lt;span class="s"&gt;{2025}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;</description></item></channel></rss>