arXiv subjects

Jiahao Cheng

Publications and source records attributed to Jiahao Cheng.

14 recordsLinked to original sources

arXiv2026

Gated Spatial Redundancy Projection for Pathology Transformer Attentions

Transformer models are increasingly used for whole-slide image analysis in computational pathology. Yet, WSIs differ fundamentally from natural images: neighbouring patches often contain highly similar tissue type, stain, texture, and cellular composition. We identify this local spatial redundancy as a pathology-specific failure mode of self-attention, where dominant neighbourhood features can be repeatedly mixed into patch-tokens and weaken subtle diagnostic or prognostic deviations. We propose Gated Spatial Redundancy Projection (Gated SRP), a lightweight drop-in correction module for self-attention layers. For each patch token and attention head, Gated SRP estimates a local redundancy axis from neighbouring value vectors, projects the attention output onto this axis, and applies a learned signed gate to correct the redundancy-aligned component geometrically. Across five TCGA survival cohorts, Gated SRP obtains the highest mean C-index among the compared attention variants in all cohorts, with an average improvement over the base attention, while adding only +0.02% parameters. Across five slide-level classification datasets, it improves the base attention on 12 of 16 reported metrics and achieves the best AUC on three datasets. Code is publicly available at https://github.com/AtlasAnalyticsLab/GatedSRP.

cs.CV↗

arXiv2026

Internalizing Academic Writing Workflows for Introduction Generation via Struct-Aware Policy Learning

Generating a rigorous paper introduction with large language models (LLMs) remains challenging, since it requires coordinating background, gap identification, method and contribution within a coherent narrative. Existing solutions externalize this process as multi-stage prompts or agent workflows which are expensive and vulnerable to cross-stage drift. We propose StructPO, a struct-aware policy learning framework that internalizes the entire multi-stage writing workflow into a single-pass policy controlled by explicit stage tokens. StructPO introduces struct-aware credit assignment to decouple local stage quality from global coherence and refinement-guided optimization to internalize revision behavior into the first-pass policy. Experiments show that StructPO improves semantic alignment, structural rationality and inference efficiency over workflow-based baselines, generalizes to out-of-domain settings, and remains competitive with GPT-5.1 in human evaluation when scaled to Qwen3-32B. These results show that internalizing academic writing workflows through fine-grained policy optimization offers a viable alternative to costly external orchestration.

cs.CL↗

arXiv2026

Simple Token-Efficient Vision-Language Model for Case-level Pathology Synoptic Report Generation

Generating clinically useful pathology reports for pathology cases from whole-slide images (WSIs) is challenging due to gigapixel resolution, long visual-token sequences, and the complexity of case-level reasoning, where a single case may contain multiple WSIs with heterogeneous tissues and ambiguous findings. We present a simple token-efficient vision--language model for case-level synoptic report generation that remains practical under constrained GPU memory. Our architecture follows a minimal three-component design: a frozen pathology patch encoder, a lightweight two-layer MLP vision-language aligner, and a large language model decoder, with an explicit WSI marker token to separate slides within a case. Training proceeds in two supervised stages: (1) aligner-only WSI captioning using heterogeneous WSI-text pairs, and (2) case-level supervised fine-tuning on case-report pairs for structured report generation. To reduce sequence length, we represent each slide using $512 \times 512$ patches at $5\times$ magnification, which reduces the average sequence length by up to $64\times$ times compared to the commonly used $20\times$ patches. Combined with efficient training techniques, we enable practical training with only half a NVIDIA H100 GPU. Across both training stages, our approach achieves high ROUGE-L/METEOR/BLEU-4 scores while being substantially more efficient in memory and runtime. In AI-based evaluations, our model is consistently preferred over strong baselines. Extensive ablations characterize performance-efficiency trade-offs and identify simple choices that improve robustness in multi-WSI settings. Overall, this work provides a strong, reproducible baseline for efficient pathology report generation, lowering the barrier to multi-WSI VLM research under limited compute. Code is available at https://github.com/AtlasAnalyticsLab/PathoSynVLM.

cs.CV↗

arXiv2026

MoRI: Learning Motivation-Grounded Reasoning for Scientific Ideation in Large Language Models

Scientific ideation aims to propose novel solutions within a given scientific context. Existing LLM-based agentic approaches emulate human research workflows, yet inadequately model scientific reasoning, resulting in surface-level conceptual recombinations that lack technical depth and scientific grounding. To address this issue, we propose \textbf{MoRI} (\textbf{Mo}tivation-grounded \textbf{R}easoning for Scientific \textbf{I}deation), a framework that enables LLMs to explicitly learn the reasoning process from research motivations to methodologies. The base LLM is initialized via supervised fine-tuning to generate a research motivation from a given context, and is subsequently trained under a composite reinforcement learning reward that approximates scientific rigor: (1) entropy-aware information gain encourages the model to uncover and elaborate high-complexity technical details grounded in ground-truth methodologies, and (2) contrastive semantic gain constrains the reasoning trajectory to remain conceptually aligned with scientifically valid solutions. Empirical results show that MoRI consistently outperforms strong commercial LLMs and complex agentic baselines across multiple dimensions, including novelty, technical rigor, and feasibility. The code is available on \href{https://github.com/ECNU-Text-Computing/IdeaGeneration}{GitHub}.

cs.CL↗

arXiv2026

SD4R: Sparse-to-Dense Learning for 3D Object Detection with 4D Radar

4D radar measurements offer an affordable and weather-robust solution for 3D perception. However, the inherent sparsity and noise of radar point clouds present significant challenges for accurate 3D object detection, underscoring the need for effective and robust point clouds densification. Despite recent progress, existing densification methods often fail to address the extreme sparsity of 4D radar point clouds and exhibit limited robustness when processing scenes with a small number of points. In this paper, we propose SD4R, a novel framework that transforms sparse radar point clouds into dense representations. SD4R begins by utilizing a foreground point generator (FPG) to mitigate noise propagation and produce densified point clouds. Subsequently, a logit-query encoder (LQE) enhances conventional pillarization, resulting in robust feature representations. Through these innovations, our SD4R demonstrates strong capability in both noise reduction and foreground point densification. Extensive experiments conducted on the publicly available View-of-Delft dataset demonstrate that SD4R achieves state-of-the-art performance. Source code is available at https://github.com/lancelot0805/SD4R.

cs.CV↗

arXiv2025

Brace $B_{\infty}$ algebras associated with Hopf algebroids

We apply the operadic modeling of brace $B_{\infty}$ algebras, as developed by Gerstenhaber and Voronov, to the context of Hopf algebroids in the sense of Xu. Specifically, we construct a strict $B_{\infty}$ isomorphism between the type I and type II twisted brace $B_{\infty}$ algebras arising from any twistor of a Hopf algebroid. As an application of this framework, we examine two specific brace $B_{\infty}$ algebras derived from Lie algebra pairs, and reveal previously obscured relationships between them. One of these is the dg Lie algebra governing deformations of algebraic dynamical twists, while the other arises from the quantum groupoid comprised of particular invariant differential operators.

math.QA↗

arXiv2025

Boosting Vulnerability Detection with Inter-function Multilateral Association Insights

Vulnerability detection is a crucial yet challenging technique for ensuring the security of software systems. Currently, most deep learning-based vulnerability detection methods focus on stand-alone functions, neglecting the complex inter-function interrelations, particularly the multilateral associations. This oversight can fail to detect vulnerabilities in these interrelations. To address this gap, we present an Inter-Function Multilateral Association analysis framework for Vulnerability Detection (IFMA-VD). The cornerstone of the IFMA-VD lies in constructing a code behavior hypergraph and utilizing hyperedge convolution to extract multilateral association features. Specifically, we first parse functions into a code property graph to generate intra-function features. Following this, we construct a code behavior hypergraph by segmenting the program dependency graph to isolate and encode behavioral features into hyperedges. Finally, we utilize a hypergraph network to capture the multilateral association knowledge for augmenting vulnerability detection. We evaluate IFMA-VD on three widely used vulnerability datasets and demonstrate improvements in F-measure and Recall compared to baseline methods. Additionally, we illustrate that multilateral association features can boost code feature representation and validate the effectiveness of IFMA-VD on real-world datasets.

cs.SE↗

arXiv2025

Chain-of-Thought Prompting Obscures Hallucination Cues in Large Language Models: An Empirical Evaluation

Large Language Models (LLMs) often exhibit \textit{hallucinations}, generating factually incorrect or semantically irrelevant content in response to prompts. Chain-of-Thought (CoT) prompting can mitigate hallucinations by encouraging step-by-step reasoning, but its impact on hallucination detection remains underexplored. To bridge this gap, we conduct a systematic empirical evaluation. We begin with a pilot experiment, revealing that CoT reasoning significantly affects the LLM's internal states and token probability distributions. Building on this, we evaluate the impact of various CoT prompting methods on mainstream hallucination detection methods across both instruction-tuned and reasoning-oriented LLMs. Specifically, we examine three key dimensions: changes in hallucination score distributions, variations in detection accuracy, and shifts in detection confidence. Our findings show that while CoT prompting helps reduce hallucination frequency, it also tends to obscure critical signals used for detection, impairing the effectiveness of various detection methods. Our study highlights an overlooked trade-off in the use of reasoning. Code is publicly available at: https://github.com/ECNU-Text-Computing/cot-hallu-detect .

cs.CL↗

arXiv2024

From smooth dynamical twists to twistors of quantum groupoids

Consider a Lie subalgebra $\mathfrak{l} \subset \mathfrak{g}$ and an $\mathfrak{l}$-invariant open submanifold $V \subset \mathfrak{l}^{\ast}$. We demonstrate that any smooth dynamical twist on $V$, valued in $U(\mathfrak{g}) \otimes U(\mathfrak{g})\llbracket \hbar \rrbracket$, establishes a twistor on the associated quantum groupoid when combined with the Gutt star product on the cotangent bundle $T^\ast L$ of a Lie group $L$ that integrates $\mathfrak{l}$. This result provides a framework for constructing equivariant star products from smooth dynamical twists on those Poisson homogeneous spaces arising from nondegenerate polarized Lie algebras, leveraging the structure of twistors of quantum groupoids.

math.QA↗

arXiv2024

Self-supervised feature distillation and design of experiments for efficient training of micromechanical deep learning surrogates

Machine learning surrogate emulators are needed in engineering design and optimization tasks to rapidly emulate computationally expensive physics-based models. In micromechanics problems the local full-field response variables are desired at microstructural length scales. While there has been a great deal of work on establishing architectures for these tasks there has been relatively little work on establishing microstructural experimental design strategies. This work demonstrates that intelligent selection of microstructural volume elements for subsequent physics simulations enables the establishment of more accurate surrogate models. There exist two key challenges towards establishing a suitable framework: (1) microstructural feature quantification and (2) establishment of a criteria which encourages construction of a diverse training data set. Three feature extraction strategies are used as well as three design criteria. A novel contrastive feature extraction approach is established for automated self-supervised extraction of microstructural summary statistics. Results indicate that for the problem considered up to a 8\% improvement in surrogate performance may be achieved using the proposed design and training strategy. Trends indicate this approach may be even more beneficial when scaled towards larger problems. These results demonstrate that the selection of an efficient experimental design is an important consideration when establishing machine learning based surrogate models.

cs.CE↗

arXiv2023

Real-Time Construction Algorithm of Co-Occurrence Network Based on Inverted Index

Co-occurrence networks are an important method in the field of natural language processing and text mining for discovering semantic relationships within texts. However, the traditional traversal algorithm for constructing co-occurrence networks has high time complexity and space complexity when dealing with large-scale text data. In this paper, we propose an optimized algorithm based on inverted indexing and breadth-first search to improve the efficiency of co-occurrence network construction and reduce memory consumption. Firstly, the traditional traversal algorithm is analyzed, and its performance issues in constructing co-occurrence networks are identified. Then, the detailed implementation process of the optimized algorithm is presented. Subsequently, the CSL large-scale Chinese scientific literature dataset is used for experimental validation, comparing the performance of the traditional traversal algorithm and the optimized algorithm in terms of running time and memory usage. Finally, using non-parametric test methods, the optimized algorithm is proven to have significantly better performance than the traditional traversal algorithm. The research in this paper provides an effective method for the rapid construction of co-occurrence networks, contributing to the further development of the Information Organization fields.

cs.IR↗

arXiv2023

On the fluid slip along a solid surface

It is commonly assumed that fluid cannot slip along a solid surface. The experimental evidence generally supports this assumption. We demonstrate that when the change of the relative velocity of a fluid and a solid wall is sufficiently rapid, the slip does occur; the fluid is unable to adjust if acceleration is large enough, and it slips. We use droplet impact on a moving surface to demonstrate and estimate the slip length. We also estimate fluid acceleration, which is required to cause an observable slip.

physics.flu-dyn↗

arXiv2022

Internal symmetry of the $L_{\leqslant 3}$ algebra arising from a Lie pair

A Lie pair is an inclusion $A$ to $L$ of Lie algebroids over the same base manifold. In an earlier work, the third author with Bandiera, Stiénon, and Xu introduced a canonical $L_{\leqslant 3}$ algebra $Γ(\wedge^\bullet A^\vee \otimes L/A)$ whose unary bracket is the Chevalley-Eilenberg differential arising from every Lie pair $(L,A)$. In this note, we prove that to such a Lie pair there is an associated Lie algebra action by $\mathrm{Der}(L)$ on the $L_{\leqslant 3}$ algebra $Γ(\wedge^\bullet A^\vee \otimes L/A)$. Here $\mathrm{Der}(L)$ is the space of derivations on the Lie algebroid $L$, or infinitesimal automorphisms of $L$. The said action gives rise to a larger scope of gauge equivalences of Maurer-Cartan elements in $Γ(\wedge^\bullet A^\vee \otimes L/A)$, and for this reason we elect to call the $\mathrm{Der}(L)$-action internal symmetry of $Γ(\wedge^\bullet A^\vee \otimes L/A)$.

math.DG↗

arXiv2021

Hopf algebras arising from dg manifolds

Let $(\mathcal{M}, Q)$ be a dg manifold. The space of vector fields with shifted degrees $(\mathcal{X}(\mathcal{M})[-1], L_Q)$ is a Lie algebra object in the homology category $\mathrm{H}((C^{\infty}_{\mathcal{M}},Q)\mathrm{-}\mathbf{mod})$ of dg modules over $(\mathcal{M},Q)$, the Atiyah class $α_{\mathcal{M}}$ being its Lie bracket. The triple $(\mathcal{X}(\mathcal{M})[-1], L_Q; α_{\mathcal{M}})$ is also a Lie algebra object in the Gabriel-Zisman homotopy category $Π((C^{\infty}_{\mathcal{M}},Q)\mathrm{-}\mathbf{mod})$. In this paper, we describe the universal enveloping algebra of $(\mathcal{X}(\mathcal{M})[-1], L_Q; α_{\mathcal{M}})$ and prove that it is a Hopf algebra object in $Π((C^{\infty}_{\mathcal{M}},Q)\mathrm{-}\mathbf{mod})$. As an application, we study Fedosov dg Lie algebroids and recover a result of Stiénon, Xu, and the second author on the Hopf algebra arising from a Lie pair.

math.DG↗