Researcher profile

Yuanqing Cai

Yuanqing Cai contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 17 - UnverifiedVerification L1Unclaimed author
4works
0followers
4topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

4 published item(s)

preprint2026arXiv

MixRea: Benchmarking Explicit-Implicit Reasoning in Large Language Models

Large language models (LLMs) are increasingly integrated into high-stakes decision-making. Inspired by the theory of \emph{inattentional blindness} in human cognition, we investigate whether LLMs, trained on human-preferred corpora that embed attentional biases, exhibit a similar limitation: \emph{failing to attend to subtle yet important contextual cues under explicit task instructions}. To evaluate this, we introduce the task of \textbf{explicit-implicit reasoning} and present \textbf{MixRea}, a benchmark of 2,246 multiple-choice questions across 9 reasoning types with varying distributions of explicit and implicit information. Evaluation of 21 advanced LLMs shows that even the best-performing reasoning model (Gemini 2.5 Pro) achieves only 42.8\% consistency, revealing widespread inattentional blindness. To mitigate this, we propose \textbf{Potential Relation Completion Prompting (PRCP)}, a prompting method that improves reasoning by recovering overlooked causal relations. Further analysis shows that this limitation persists across diverse multi-source reasoning tasks, highlighting the need for more cognitively aligned models.

preprint2017arXiv

Fourier Coefficients for Theta Representations on Covers of General Linear Groups

We show that the theta representations on certain covers of general linear groups support certain types of unique functionals. The proof involves two types of Fourier coefficients. The first are semi-Whittaker coefficients, which generalize coefficients introduced by Bump and Ginzburg for the double cover. The covers for which these coefficients vanish identically (resp. do not vanish for some choice of data) are determined in full. The second are the Fourier coefficients associated with general unipotent orbits. In particular, we determine the unipotent orbit attached, in the sense of Ginzburg, to the theta representations.

preprint2016arXiv

Fourier Coefficients for Degenerate Eisenstein Series and the Descending Decomposition

We determine the unipotent orbits attached to degenerate Eisenstein series on general linear groups. This confirms a conjecture of David Ginzburg. This also shows that any unipotent orbit of general linear groups does occur as the unipotent orbit attached to a specific automorphic representation. The key ingredient is a root-theoretic result. To prove it, we introduce the notion of the descending decomposition, which expresses every Weyl group element as a product of simple reflections in a certain way. It is suitable for induction and allows us to translate the question into a combinatorial statement.