Arrow Research search

Author name cluster

Yi Cao

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers
2 author rows

Possible papers

6

AAAI Conference 2026 Conference Paper

TIV: Thought Injection via Vectors for Efficient Reasoning in Large Reasoning Models

  • Yi Cao
  • Weijie Shi
  • Wei-Jie Xu
  • Yucheng Shen
  • Yue Cui
  • Hanghui Guo
  • Shimin Di
  • Ziyi Liu

Large Reasoning Models (LRMs) have recently demonstrated impressive performance across a range of reasoning tasks by generating intermediate thoughts. However, these models can suffer from overthinking—generating excessive tokens that contribute little to final accuracy while increasing inference cost. To mitigate this, we propose TIV (Thought Injection via Vectors), an innovative framework that compresses token-level reasoning into compact vectors without sacrificing performance. Rather than generating explicit thoughts, TIV injects learnable vectors into the post-attention hidden states of the final token across Transformer layers, enabling implicit and lightweight reasoning. We further introduce a two-stage reinforcement learning strategy: the first stage calibrates the model's reasoning distribution, and the second distills it into a vector-based policy optimized for both accuracy and brevity. Experiments on three reasoning benchmarks show that TIV preserves over 99% of the original accuracy while reducing output length by more than 65% on average, reaching up to 80% in some cases. Moreover, TIV consistently achieves superior trade-offs between accuracy and efficiency compared to existing methods, distinguishing itself as a state-of-the-art (SOTA) approach for efficient reasoning in LRMs.

EAAI Journal 2024 Journal Article

Skeleton-based action recognition based on multidimensional adaptive dynamic temporal graph convolutional network

  • Yu Xia
  • Qingyuan Gao
  • Weiguan Wu
  • Yi Cao

Due to the superior capability to process the topology of graphs, graph convolutional networks are gaining popularity in the field of action recognition based on skeleton data. However, it remains difficult to effectively extract features with more distinguishing information for both spatial and temporal dimension. A novel multidimensional adaptive dynamic temporal graph convolutional network (MADT-GCN) model for skeleton-based action recognition is proposed in this work. It consists of two modules, one multidimensional adaptive graph convolutional network (MD-AGCN) module and one dynamic temporal convolutional network (DY-TCN) module. Firstly, MD-AGCN has the ability to adaptively change the graph topology in accordance with varieties of the layers and multidimensional information of spatial, temporal, and channel dimensions that are contained in various action samples to capture the complex connections of each couple of joints. Then, DY-TCN is proposed in order to boost the representation capability to capture expressive temporal features. Moreover, the information of both the joints and bones, together with their motion information, are simultaneously modeled in a multi-stream framework, which shows notable improvements in recognition accuracy. Finally, extensive experiments are conducted on two standard datasets, NTU-RGB+D and NTU-RGB+D 120. The experimental results demonstrate the effectiveness of the proposed method.

AAAI Conference 2023 Conference Paper

Continual Graph Convolutional Network for Text Classification

  • Tiandeng Wu
  • Qijiong Liu
  • Yi Cao
  • Yao Huang
  • Xiao-ming Wu
  • Jiandong Ding

Graph convolutional network (GCN) has been successfully applied to capture global non-consecutive and long-distance semantic information for text classification. However, while GCN-based methods have shown promising results in offline evaluations, they commonly follow a seen-token-seen-document paradigm by constructing a fixed document-token graph and cannot make inferences on new documents. It is a challenge to deploy them in online systems to infer steaming text data. In this work, we present a continual GCN model (ContGCN) to generalize inferences from observed documents to unobserved documents. Concretely, we propose a new all-token-any-document paradigm to dynamically update the document-token graph in every batch during both the training and testing phases of an online system. Moreover, we design an occurrence memory module and a self-supervised contrastive learning objective to update ContGCN in a label-free manner. A 3-month A/B test on Huawei public opinion analysis system shows ContGCN achieves 8.86% performance gain compared with state-of-the-art methods. Offline experiments on five public datasets also show ContGCN can improve inference quality. The source code will be released at https://github.com/Jyonn/ContGCN.

TIST Journal 2019 Journal Article

Predicting Academic Performance for College Students

  • Huaxiu Yao
  • Defu Lian
  • Yi Cao
  • Yifan Wu
  • Tao Zhou

Detecting abnormal behaviors of students in time and providing personalized intervention and guidance at the early stage is important in educational management. Academic performance prediction is an important building block to enabling this pre-intervention and guidance. Most of the previous studies are based on questionnaire surveys and self-reports, which suffer from small sample size and social desirability bias. In this article, we collect longitudinal behavioral data from the smart cards of 6,597 students and propose three major types of discriminative behavioral factors, diligence, orderliness, and sleep patterns. Empirical analysis demonstrates these behavioral factors are strongly correlated with academic performance. Furthermore, motivated by the social influence theory, we analyze the correlation between each student’s academic performance with his/her behaviorally similar students’. Statistical tests indicate this correlation is significant. Based on these factors, we further build a multi-task predictive framework based on a learning-to-rank algorithm for academic performance prediction. This framework captures inter-semester correlation, inter-major correlation, and integrates student similarity to predict students’ academic performance. The experiments on a large-scale real-world dataset show the effectiveness of our methods for predicting academic performance and the effectiveness of proposed behavioral factors.

MFCS Conference 2009 Conference Paper

DP-Complete Problems Derived from Extremal NP-Complete Properties

  • Yi Cao
  • Joseph C. Culberson
  • Lorna Stewart

Abstract In contrast to the extremal variants of coNP-complete problems, which are frequently DP-complete, many extremal variants of NP-complete problems are in P. We investigate the extremal variants of two NP-complete problems, the extremal colorability problem with restricted degree and the extremal unfrozen non-implicant problem, and show that both of them are DP-complete.

TCS Journal 2008 Journal Article

Monotonicity in digraph search problems

  • Boting Yang
  • Yi Cao

In this paper, we study the monotonicity and complexity of five digraph search problems: directed searching, mixed directed searching, internal directed searching, internal strong searching, and internal weak searching. In the first three search problems, both searchers and intruder must follow the edge directions when they move along edges. In the internal strong search problem, the intruder must move in the edge directions but searchers need not. In the internal weak search problem, searchers must move in the edge directions but the intruder need not. There are three actions for searchers in the first two search problems: placing, removing and sliding, and there are only two actions for searchers in the last three internal search problems: placing and sliding. Note that the internal strong searching is a “strong” version of the internal directed searching, the internal weak searching is a “weak” version of the internal directed searching, and the internal edge searching is an analogy of the internal directed searching on undirected graphs. We prove that the first three problems are monotonic and the last two problems are non-monotonic, respectively. It is interesting that the internal directed searching is monotonic while the internal strong searching, the internal weak searching and the internal edge searching are all non-monotonic. We also show that the first four problems are NP-complete and the last problem is NP-hard. We solve the open problem on whether a non-monotonic searching problem can be NP-complete.

v2026.09.13