Huawei Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Huawei Shen has a total of 261 co-authors. Here are the top co-authors by number of shared publications:
- Xueqi Cheng
Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China
65 shared publications - Qi Cao
State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
34 shared publications Xueqi Cheng
Institute of Computing Technology State Key Laboratory of AI Safety Chinese Academy of Sciences ♡ University of Chinese Academy of Sciences
34 shared publications- Liang Pang
State Key Lab of AI Safety, Institute of Computing Technology, CAS, Beijing, China
25 shared publications - Bingbing Xu
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
19 shared publications - Fei Sun
State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
14 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2605-2614
Enhancing Geometry Reasoning with Cross-Modal Rewards for Auxiliary Line Construction
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2605-2614
Open AccessEnhancing Geometry Reasoning with Cross-Modal Rewards for Auxiliary Line Construction
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5281-5292
From Interactions to Embeddings: A New Perspective for Poisoning Recommender Systems
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 5281-5292
Open AccessFrom Interactions to Embeddings: A New Perspective for Poisoning Recommender Systems
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3293-3304
Rethinking Community Consistency in Heterogeneous Networks
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3293-3304
Open AccessRethinking Community Consistency in Heterogeneous Networks
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2297-2307
AsarRec: Adaptive Sequential Augmentation for Robust Self-supervised Sequential Recommendation
Real-world user behaviors are often noisy due to factors such as human errors, uncertainty, and behavioral ambiguity, which can lead to degraded recommendation performance. To address this issue, recent approaches widely adopt self-supervised learning (SSL), particularly contrastive learning, by generating perturbed views of user interaction sequences and maximizing their mutual information to improve model robustness. However, these methods heavily rely on their pre-defined static augmentation strategies~(where the augmentation type remains fixed once chosen) to construct augmented views, leading to two critical challenges: (1) the optimal augmentation type can vary significantly across different scenarios; (2) inappropriate augmentations may even degrade recommendation performance, limiting the effectiveness of SSL. To overcome these limitations, we propose an adaptive augmentation framework. We first unify existing basic augmentation operations into a unified formulation via structured transformation matrices. Building on this formulation, we introduce AsarRec, an Adaptive Sequential Augmentation for Robust Sequential Recommendation. To enable stable end-to-end optimization of discrete and strongly constrained augmentations, AsarRec learns to generate transformation matrices by encoding user sequences into probabilistic transition matrices and projecting them into hard semi-doubly stochastic matrices via a differentiable Semi-Sinkhorn algorithm. To ensure that the learned augmentations benefit downstream performance, we jointly optimize three objectives: diversity (encouraging distinct views), semantic invariance (preserving semantic consistency among views), and informativeness (identifying augmentations most beneficial to recommendation). Extensive experiments on four benchmarks under varying noise levels validate the effectiveness of AsarRec, demonstrating its superior robustness and consistent improvements.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2297-2307
Open AccessAsarRec: Adaptive Sequential Augmentation for Robust Self-supervised Sequential Recommendation
Real-world user behaviors are often noisy due to factors such as human errors, uncertainty, and behavioral ambiguity, which can lead to degraded recommendation performance. To address this issue, recent approaches widely adopt self-supervised learning (SSL), particularly contrastive learning, by generating perturbed views of user interaction sequences and maximizing their mutual information to improve model robustness. However, these methods heavily rely on their pre-defined static augmentation strategies~(where the augmentation type remains fixed once chosen) to construct augmented views, leading to two critical challenges: (1) the optimal augmentation type can vary significantly across different scenarios; (2) inappropriate augmentations may even degrade recommendation performance, limiting the effectiveness of SSL. To overcome these limitations, we propose an adaptive augmentation framework. We first unify existing basic augmentation operations into a unified formulation via structured transformation matrices. Building on this formulation, we introduce AsarRec, an Adaptive Sequential Augmentation for Robust Sequential Recommendation. To enable stable end-to-end optimization of discrete and strongly constrained augmentations, AsarRec learns to generate transformation matrices by encoding user sequences into probabilistic transition matrices and projecting them into hard semi-doubly stochastic matrices via a differentiable Semi-Sinkhorn algorithm. To ensure that the learned augmentations benefit downstream performance, we jointly optimize three objectives: diversity (encouraging distinct views), semantic invariance (preserving semantic consistency among views), and informativeness (identifying augmentations most beneficial to recommendation). Extensive experiments on four benchmarks under varying noise levels validate the effectiveness of AsarRec, demonstrating its superior robustness and consistent improvements.
- 1 July 2026
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 41 (4) , 1120-1131
StableME: Stable Model Editing via Knowledge Augmentation for Large Language Models
- 1 July 2026
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 41 (4) , 1120-1131
StableME: Stable Model Editing via Knowledge Augmentation for Large Language Models
- Open Access
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 672-676
Fairness at a Glance: Can We Audit Model Fairness Before Training Completes?
- 28 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 672-676
Open AccessFairness at a Glance: Can We Audit Model Fairness Before Training Completes?
- 9 May 2026
- Published by Springer Nature
- p. 367-383
Skyline Community Search over Edge-Attributed Bipartite Graphs
- 9 May 2026
- Published by Springer Nature
- p. 367-383
Skyline Community Search over Edge-Attributed Bipartite Graphs
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 58-68
Multi-Personality Generation of LLMs at Decoding-time
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 58-68
Open AccessMulti-Personality Generation of LLMs at Decoding-time
- Open Access
Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems
Multi-Agent Systems (MAS) built on large language models typically solve complex tasks by coordinating multiple agents through workflows. Existing approaches generates workflows either at task level or query level, but their relative costs and benefits remain unclear. After rethinking and empirical analyses, we show that query-level workflow generation is not always necessary, since a small set of top-K best task-level workflows together already covers equivalent or even more queries. We further find that exhaustive execution-based task-level evaluation is both extremely token-costly and frequently unreliable. Inspired by the idea of self-evolution and generative reward modeling, we propose a low-cost task-level generation framework \textbf{SCALE}, which means \underline{\textbf{S}}elf prediction of the optimizer with few shot \underline{\textbf{CAL}}ibration for \underline{\textbf{E}}valuation instead of full validation execution. Extensive experiments demonstrate that \textbf{SCALE} maintains competitive performance, with an average degradation of just 0.61\% compared to existing approach across multiple datasets, while cutting overall token usage by up to 83\%.
Open AccessDo We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems
Multi-Agent Systems (MAS) built on large language models typically solve complex tasks by coordinating multiple agents through workflows. Existing approaches generates workflows either at task level or query level, but their relative costs and benefits remain unclear. After rethinking and empirical analyses, we show that query-level workflow generation is not always necessary, since a small set of top-K best task-level workflows together already covers equivalent or even more queries. We further find that exhaustive execution-based task-level evaluation is both extremely token-costly and frequently unreliable. Inspired by the idea of self-evolution and generative reward modeling, we propose a low-cost task-level generation framework \textbf{SCALE}, which means \underline{\textbf{S}}elf prediction of the optimizer with few shot \underline{\textbf{CAL}}ibration for \underline{\textbf{E}}valuation instead of full validation execution. Extensive experiments demonstrate that \textbf{SCALE} maintains competitive performance, with an average degradation of just 0.61\% compared to existing approach across multiple datasets, while cutting overall token usage by up to 83\%.
- Open Access
ROMA: Real-time Omni-Multimodal Assistant with Interactive Streaming Understanding
Recent Omni-multimodal Large Language Models show promise in unified audio, vision, and text modeling. However, streaming audio-video understanding remains challenging, as existing approaches suffer from disjointed capabilities: they typically exhibit incomplete modality support or lack autonomous proactive monitoring. To address this, we present ROMA, a real-time omni-multimodal assistant for unified reactive and proactive interaction. ROMA processes continuous inputs as synchronized multimodal units, aligning dense audio with discrete video frames to handle granularity mismatches. For online decision-making, we introduce a lightweight speak head that decouples response initiation from generation to ensure precise triggering without task conflict. We train ROMA with a curated streaming dataset and a two-stage curriculum that progressively optimizes for streaming format adaptation and proactive responsiveness. To standardize the fragmented evaluation landscape, we reorganize diverse benchmarks into a unified suite covering both proactive (alert, narration) and reactive (QA) settings. Extensive experiments across 12 benchmarks demonstrate ROMA achieves state-of-the-art performance on proactive tasks while competitive in reactive settings, validating its robustness in unified real-time omni-multimodal understanding.
Open AccessROMA: Real-time Omni-Multimodal Assistant with Interactive Streaming Understanding
Recent Omni-multimodal Large Language Models show promise in unified audio, vision, and text modeling. However, streaming audio-video understanding remains challenging, as existing approaches suffer from disjointed capabilities: they typically exhibit incomplete modality support or lack autonomous proactive monitoring. To address this, we present ROMA, a real-time omni-multimodal assistant for unified reactive and proactive interaction. ROMA processes continuous inputs as synchronized multimodal units, aligning dense audio with discrete video frames to handle granularity mismatches. For online decision-making, we introduce a lightweight speak head that decouples response initiation from generation to ensure precise triggering without task conflict. We train ROMA with a curated streaming dataset and a two-stage curriculum that progressively optimizes for streaming format adaptation and proactive responsiveness. To standardize the fragmented evaluation landscape, we reorganize diverse benchmarks into a unified suite covering both proactive (alert, narration) and reactive (QA) settings. Extensive experiments across 12 benchmarks demonstrate ROMA achieves state-of-the-art performance on proactive tasks while competitive in reactive settings, validating its robustness in unified real-time omni-multimodal understanding.