Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hongcan Guo

dblp:338/2173 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
6since 2021 · last 2026
0009-0001-6490-9630ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Computer networks · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Efficient and distributed learning · 24% Reinforcement learning · 23% Vision and language · 13%
Computer networks
2 papers
Network management and operations · 44% Cellular and mobile networks · 44% Edge and fog computing · 13%

Topics — the 18 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
policy optimization
1.322026
A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models · AAAI 2026
VideoMiner: Iteratively Grounding Key Frames of Hour-Long Videos via Tree-Based Group Relative Policy Optimization · ICCV 2025
Computer vision › Vision and language › visual grounding › instruction grounding
GUI grounding
1.012026
Measure Twice, Click Once: Co-evolving Proposer and Visual Critic via Reinforcement Learning for GUI Grounding · ACL (1) 2026
Machine learning › Reinforcement learning
multi-agent reinforcement learning
1.012026
Measure Twice, Click Once: Co-evolving Proposer and Visual Critic via Reinforcement Learning for GUI Grounding · ACL (1) 2026
Machine learning › Reinforcement learning › reward design
reward hacking mitigation
1.012026
A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models · AAAI 2026
Natural language and speech › Language models and text generation › large language model evaluation › automatic evaluation
self-evaluation
1.012026
A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models · AAAI 2026
Machine learning › Efficient and distributed learning › model compression › sparsity
activation sparsity
0.912025
Advancing Expert Specialization for Better MoE · NeurIPS 2025
Computer vision › Vision and language › multimodal reasoning
compositional reasoning
0.912025
Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications · IEEE J. Sel. Areas Commun. 2025
Machine learning › Deep learning architectures and training › mixture of experts
expert specialization
0.912025
Advancing Expert Specialization for Better MoE · NeurIPS 2025
Computer vision › Video understanding and tracking
long video understanding
0.912025
VideoMiner: Iteratively Grounding Key Frames of Hour-Long Videos via Tree-Based Group Relative Policy Optimization · ICCV 2025
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
LoRA composition
0.912025
Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications · IEEE J. Sel. Areas Commun. 2025
Machine learning › Deep learning architectures and training
mixture of experts
0.912025
Advancing Expert Specialization for Better MoE · NeurIPS 2025
Machine learning › Efficient and distributed learning › large-scale learning
model scaling
0.912025
Advancing Expert Specialization for Better MoE · NeurIPS 2025
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.912025
Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications · IEEE J. Sel. Areas Commun. 2025
Machine learning › Learning paradigms › multi-task learning
task relationship modeling
0.912025
Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications · IEEE J. Sel. Areas Commun. 2025
Network management and operations
situation awareness
0.912025
Exploring LLM-Based Multi-Agent Situation Awareness for Zero-Trust Space-Air-Ground Integrated Network · IEEE J. Sel. Areas Commun. 2025
Cellular and mobile networks › 6g
space-air-ground integrated network
0.912025
Exploring LLM-Based Multi-Agent Situation Awareness for Zero-Trust Space-Air-Ground Integrated Network · IEEE J. Sel. Areas Commun. 2025
Natural language and speech › Language models and text generation
large language model training
0.312025
Advancing Expert Specialization for Better MoE · NeurIPS 2025
Edge and fog computing
resource-constrained inference
0.312025
Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications · IEEE J. Sel. Areas Commun. 2025

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 3.7multi-agent system · 1.7large language model · 1.7co-evolution · 1.0adaptive reward model · 1.0KL regularization · 1.0variance loss · 0.9tree-based group relative policy optimization · 0.9orthogonality loss · 0.9multimodal large language model · 0.9mixture of experts · 0.9load-balancing loss · 0.9hierarchical clustering · 0.9chain-of-thought · 0.9chain of thought · 0.9
YearPublicationVenuePosition
2026 A Rolling Stone Gathers No Moss: Adaptive Policy Optimization for Stable Self-Evaluation in Large Multimodal Models
abstract
Self-evaluation, a model's ability to assess the correctness of its own output, is crucial for Large Multimodal Models (LMMs) to achieve self-improvement in multi-turn conversations, yet largely absent in foundation models. Recent work has employed reinforcement learning (RL) to enhance self-evaluation; however, its fixed reward mechanism suffers from reward hacking when optimizing multiple training objectives, leading to model collapse. In this paper we propose AdaPO, an online reinforcement learning framework capable of adaptively adjusting training objective in real time according to the current training state for each task. Specifically, to mitigate reward hacking , AdaPO introduces an Adaptive Reward Model (ARM) and a Reward Aware Dynamic KL Regularization mechanism. ARM assesses the task's training state from the distribution of model generated multi-turn trajectories' performance. Reward Aware Dynamic KL replaces a fixed penalty with dynamic coefficients which is modulated by the reward gap between different multi-turn situations. Notably, our method automatically and smoothly adjusts its learning focus based on sub-tasks' training progress without manual intervention. Extensive experiments over 8 benchmarks and various models show that our method significantly enhances both direct reasoning and self-evaluation capability.
Hongcan Guo, Zheqi Lv, Shengyu Zhang 0001
AAAI2
2026 Measure Twice, Click Once: Co-evolving Proposer and Visual Critic via Reinforcement Learning for GUI Grounding
abstract
Wenkai Wang, Xiyun Li, Hongcan Guo, Wenhao Yu, Tianqing Fang, Haitao Mi, Dong Yu, Shengyu Zhang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026.
Xiyun Li, Hongcan Guo, Tianqing Fang, Haitao Mi, Shengyu Zhang 0001
ACL (1)3
2025 VideoMiner: Iteratively Grounding Key Frames of Hour-Long Videos via Tree-Based Group Relative Policy Optimization
abstract
Understanding hour-long videos with multi-modal large language models (MM-LLMs) enriches the landscape of human-centered AI applications. However, for end-to-end video understanding with LLMs, uniformly sampling video frames results in LLMs being overwhelmed by a vast amount of irrelevant information as video length increases. Existing hierarchical key frame extraction methods improve the accuracy of video understanding but still face two critical challenges. 1) How can the interference of extensive redundant information in long videos be mitigated? 2) How can a model dynamically adapt to complex hierarchical structures while accurately identifying key frames? To address these issues, we propose VideoMiner, which iteratively segments, captions, and clusters long videos, forming a hierarchical tree structure. The proposed VideoMiner progresses from long videos to events to frames while preserving temporal coherence, effectively addressing the first challenge. To precisely locate key frames, we introduce T-GRPO, a tree-based group relative policy optimization in reinforcement learning method that guides the exploration of the VideoMiner. The proposed T-GRPO is specifically designed for tree structures, integrating spatiotemporal information at the event level while being guided by the question, thus solving the second challenge. We achieve superior performance in all long-video understanding tasks and uncover several interesting insights. Our proposed T-GRPO surprisingly incentivizes the model to spontaneously generate a reasoning chain. Additionally, the designed tree growth auxin dynamically adjusts the expansion depth, obtaining accuracy and efficiency gains. The code is publicly available at https://github.com/caoxinye/VideoMiner.
Xinye Cao, Hongcan Guo, Jiawen Qian, Guoshun Nan, Yuqi Pan, Tianhao Hou, Yutong Gao 0001
ICCV2
2025 Advancing Expert Specialization for Better MoE
abstract
Mixture-of-Experts (MoE) models enable efficient scaling of large language models (LLMs) by activating only a subset of experts per input. However, we observe that the commonly used auxiliary load balancing loss often leads to expert overlap and overly uniform routing, which hinders expert specialization and degrades overall performance during post-training. To address this, we propose a simple yet effective solution that introduces two complementary objectives: (1) an orthogonality loss to encourage experts to process distinct types of tokens, and (2) a variance loss to encourage more discriminative routing decisions. Gradient-level analysis demonstrates that these objectives are compatible with the existing auxiliary loss and contribute to optimizing the training process. Experimental results over various model architectures and across multiple benchmarks show that our method significantly enhances expert specialization. Notably, our method improves classic MoE baselines with auxiliary loss by up to 23.79\%, while also maintaining load balancing in downstream tasks, without any architectural modifications or additional components. We will release our code to contribute to the community.
Hongcan Guo, Haolang Lu, Guoshun Nan, Bolun Chu, Jialin Zhuang, Wenhao Che, Xinye Cao, Sicong Leng, Qimei Cui
NeurIPS1
2025 Advancing Compositional LLM Reasoning With Structured Task Relations in Interactive Multimodal Communications
abstract
Interactive multimodal applications (IMAs), such as route planning in the Internet of Vehicles, enrich users’ personalized experiences by integrating various forms of data over wireless networks. Recent advances in large language models (LLMs) utilize mixture-of-experts (MoE) mechanisms to empower multiple IMAs, with each LLM trained individually for a specific task that presents different business workflows. In contrast to existing approaches that rely on multiple LLMs for IMAs, this paper presents a novel paradigm that accomplishes various IMAs using a single compositional LLM over wireless networks. The two primary challenges include 1) guiding a single LLM to adapt to diverse IMA objectives and 2) ensuring the flexibility and efficiency of the LLM in resource-constrained mobile environments. To tackle the first challenge, we propose ContextLoRA, a novel method that guides an LLM to learn the rich structured context among IMAs by constructing a task dependency graph. We partition the learnable parameter matrix of neural layers for each IMA to facilitate LLM composition. Then, we develop a step-by-step fine-tuning procedure guided by task relations, including training, freezing, and masking phases. This allows the LLM to learn to reason among tasks for better adaptation, capturing the latent dependencies between tasks. For the second challenge, we introduce ContextGear, a scheduling strategy to optimize the training procedure of ContextLoRA, aiming to minimize computational and communication costs through a strategic grouping mechanism. Experiments on three benchmarks show the superiority of the proposed ContextLoRA and ContextGear. Furthermore, we prototype our proposed paradigm on a real-world wireless testbed, demonstrating its practical applicability for various IMAs. We will release our code to the community.
Xinye Cao, Hongcan Guo, Guoshun Nan, Jiaoyang Cui, Haoting Qian, Yihan Lin 0001, Yilin Peng, Diyang Zhang, Yan-Zhao Hou, Huici Wu, Xiaofeng Tao 0001, Tony Q. S. Quek
IEEE J. Sel. Areas Commun.2
2025 Exploring LLM-Based Multi-Agent Situation Awareness for Zero-Trust Space-Air-Ground Integrated Network
abstract
Space-air-ground integrated network (SAGIN), which integrates satellite systems, aerial networks, and terrestrial communications, offers ubiquitous coverage for a multitude of applications. Nevertheless, the highly dynamic and open nature of SAGIN increases the network’s vulnerability. Hence, zero-trust security, operating on the principle of “never trust, always verify”, holds the significant potential of securing SAGIN. However, implementing zero-trust SAGIN in practice presents three primary challenges: 1) understanding massive unstructured threat information across diverse domains, 2) performing adaptive security assessments, and 3) making in-depth security decisions. This motivates us to propose SAG-Attack and LLM-SA to enhance zero-trust SAGIN. SAG-Attack serves as a simulator that aims to mimic various attacks in SAGIN. Our LLM-SA is a novel situation awareness method that explores the multiple agents of large language model (LLM). Specifically, the output logs of SAG-Attack will be fed into LLM-SA, and LLM-SA fuses vast amounts of heterogeneous threat information from various domains, thus tackling the first challenge. Then, our LLM-SA relies on multiple LLM-based agents to perform adaptive security assessments, utilizing the chain-of-thought capabilities of LLMs to automatically generate in-depth defense strategies, thereby addressing the second and third challenges. Experiments on five benchmarks demonstrate the superiority of the proposed SAG-Attack and LLM-SA. Notably, our method based on open-sourced Llama3-8B even outperforms ChatGPT-4 under the same setting, despite involving significantly fewer parameters. To foster further research in this area, we will release our platform to the community, facilitating the advancement of zero-trust SAGIN.
Xinye Cao, Guoshun Nan, Hongcan Guo, Hanqing Mu, Yihan Lin 0001, Qinchuan Zhou, Baohua Qin, Qimei Cui, Xiaofeng Tao 0001, He Fang, Haitao Du, Tony Q. S. Quek
IEEE J. Sel. Areas Commun.3