Richong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Richong Zhang has a total of 156 co-authors. Here are the top co-authors by number of shared publications:
- Yongyi Mao
School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada
36 shared publications - Junfan Chen
Beihang University
30 shared publications - Chunming Hu
Beihang University, Beijing, China
14 shared publications Zhijie Nie
Beihang University China
14 shared publicationsYongyi Mao
School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, ON, Canada
9 shared publications- Samuel Mensah
University of Sheffield
7 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1883-1895
ExeCRE: Execution-Consistency Guided Reliability Estimation for Self-Correcting Code Generation
- 7 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1883-1895
Open AccessExeCRE: Execution-Consistency Guided Reliability Estimation for Self-Correcting Code Generation
- 26 September 2026
- Published by Springer Nature
- p. 639-654
Improving Multimodal Entity Linking by Cross-Modality Semantic Consistency
- 26 September 2026
- Published by Springer Nature
- p. 639-654
Improving Multimodal Entity Linking by Cross-Modality Semantic Consistency
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2366-2376
inversedMixup: Data Augmentation via Inverting Mixed Embeddings
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2366-2376
Open AccessinversedMixup: Data Augmentation via Inverting Mixed Embeddings
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2005-2014
Constructing Hard-Positive Query–Document Pairs for Dense Retrieval via Phrase Representativeness
Dense retrieval usually fails in two ways: ranking non-relevant documents too high, or ranking relevant documents too low. We focus on the second case from the query side: documents that are genuinely relevant but receive low retrieval scores under certain query formulations, forming hard-positive query–document pairs. To study this failure mode systematically, we build on recent token-alignment work, which analyzes vocabulary logits obtained by projecting retriever representations through an architecture-specific token prediction head and shows that low overlap among top-ranked logit tokens can cause relevant documents to be scored low. This suggests a practical route to hard positives: generate relevant queries that rely on document phrases that receive low ranks under these logits. We therefore define model-specific Token and Phrase Representativeness Scores (TRS/PRS) to discover tokens and key phrases that appear in a document but are poorly expressed by its embedding. Using high-PRS phrases as anchors, we automatically construct challenging yet relevant queries, yielding hard-positive query–document pairs. Experiments across multiple retrievers and datasets show that PRS-anchored queries induce substantially larger drops for dense retrievers than other query construction strategies, revealing a dense-specific weakness. Moreover, when mixed with standard hard negatives during contrastive fine-tuning, these hard positives improve retrieval on our constructed hard-positive benchmark and can also improve standard in-domain retrieval benchmarks. Our code is publicly available at https://github.com/wzy2001wzy/HardPositive.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2005-2014
Open AccessConstructing Hard-Positive Query–Document Pairs for Dense Retrieval via Phrase Representativeness
Dense retrieval usually fails in two ways: ranking non-relevant documents too high, or ranking relevant documents too low. We focus on the second case from the query side: documents that are genuinely relevant but receive low retrieval scores under certain query formulations, forming hard-positive query–document pairs. To study this failure mode systematically, we build on recent token-alignment work, which analyzes vocabulary logits obtained by projecting retriever representations through an architecture-specific token prediction head and shows that low overlap among top-ranked logit tokens can cause relevant documents to be scored low. This suggests a practical route to hard positives: generate relevant queries that rely on document phrases that receive low ranks under these logits. We therefore define model-specific Token and Phrase Representativeness Scores (TRS/PRS) to discover tokens and key phrases that appear in a document but are poorly expressed by its embedding. Using high-PRS phrases as anchors, we automatically construct challenging yet relevant queries, yielding hard-positive query–document pairs. Experiments across multiple retrievers and datasets show that PRS-anchored queries induce substantially larger drops for dense retrievers than other query construction strategies, revealing a dense-specific weakness. Moreover, when mixed with standard hard negatives during contrastive fine-tuning, these hard positives improve retrieval on our constructed hard-positive benchmark and can also improve standard in-domain retrieval benchmarks. Our code is publicly available at https://github.com/wzy2001wzy/HardPositive.
- 12 July 2026
- Published by Springer Nature
- p. 223-233
Adaptive Utterance-Level Teacher Selection for Multi-teacher Knowledge Distillation in Low-resource Pashto ASR
- 12 July 2026
- Published by Springer Nature
- p. 223-233
Adaptive Utterance-Level Teacher Selection for Multi-teacher Knowledge Distillation in Low-resource Pashto ASR
- 19 June 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 349
Modeling latent cross-modal interaction for reliability-aware entity alignment in multimodal relation extraction
- 19 June 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 349
Modeling latent cross-modal interaction for reliability-aware entity alignment in multimodal relation extraction
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7058-7067
Expectation-Maximization Driven Contrastive Disentanglement for Generalized Category Discovery
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 7058-7067
Open AccessExpectation-Maximization Driven Contrastive Disentanglement for Generalized Category Discovery
- 1 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 322
Revealing multimodal information trade-off in multimodal knowledge graph completion
- 1 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 322
Revealing multimodal information trade-off in multimodal knowledge graph completion
- Open Access
CoRect: Context-Aware Logit Contrast for Hidden State Rectification to Resolve Knowledge Conflicts
Retrieval-Augmented Generation (RAG) often struggles with knowledge conflicts, where model-internal parametric knowledge overrides retrieved evidence, leading to unfaithful outputs. Existing approaches are often limited, relying either on superficial decoding adjustments or weight editing that necessitates ground-truth targets. Through layer-wise analysis, we attribute this failure to a parametric suppression phenomenon: specifically, in deep layers, certain FFN layers overwrite context-sensitive representations with memorized priors. To address this, we propose CoRect (Context-Aware Logit Contrast for Hidden State Rectification). By contrasting logits from contextualized and non-contextualized forward passes, CoRect identifies layers that exhibit high parametric bias without requiring ground-truth labels. It then rectifies the hidden states to preserve evidence-grounded information. Across question answering (QA) and summarization benchmarks, CoRect consistently improves faithfulness and reduces hallucinations compared to strong baselines.
Open AccessCoRect: Context-Aware Logit Contrast for Hidden State Rectification to Resolve Knowledge Conflicts
Retrieval-Augmented Generation (RAG) often struggles with knowledge conflicts, where model-internal parametric knowledge overrides retrieved evidence, leading to unfaithful outputs. Existing approaches are often limited, relying either on superficial decoding adjustments or weight editing that necessitates ground-truth targets. Through layer-wise analysis, we attribute this failure to a parametric suppression phenomenon: specifically, in deep layers, certain FFN layers overwrite context-sensitive representations with memorized priors. To address this, we propose CoRect (Context-Aware Logit Contrast for Hidden State Rectification). By contrasting logits from contextualized and non-contextualized forward passes, CoRect identifies layers that exhibit high parametric bias without requiring ground-truth labels. It then rectifies the hidden states to preserve evidence-grounded information. Across question answering (QA) and summarization benchmarks, CoRect consistently improves faithfulness and reduces hallucinations compared to strong baselines.
- 30 January 2026
- Published by Springer Nature
- p. 436-451
Retrieval-Based Knowledge Consistency Validation for Fake News Detection
- 30 January 2026
- Published by Springer Nature
- p. 436-451
Retrieval-Based Knowledge Consistency Validation for Fake News Detection