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

Zihao Mao

dblp:252/0105 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · unresolved

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

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

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
1 paper
Reinforcement learning · 25% Trustworthy machine learning · 25% Multi-agent systems · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
hyperparameter optimization
0.912025
Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning · NeurIPS 2025
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.912025
Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning · NeurIPS 2025
Knowledge, reasoning and agents › Multi-agent systems
resilience
0.912025
Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning · NeurIPS 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning · NeurIPS 2025

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

popart · 0.9empirical study · 0.9Leaky ReLU · 0.9GAE · 0.9
YearPublicationVenuePosition
2025 Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning
abstract
In cooperative Multi-Agent Reinforcement Learning (MARL), it is a common practice to tune hyperparameters in ideal simulated environments to maximize cooperative performance. However, policies tuned for cooperation often fail to maintain robustness and resilience under real-world uncertainties. Building trustworthy MARL systems requires a deep understanding of \emph{robustness}, which ensures stability under uncertainties, and \emph{resilience}, the ability to recover from disruptions—a concept extensively studied in control systems but largely overlooked in MARL. In this paper, we present a large-scale empirical study comprising over 82,620 experiments to evaluate cooperation, robustness, and resilience in MARL across 4 real-world environments, 13 uncertainty types, and 15 hyperparameters. Our key findings are: (1) Under mild uncertainty, optimizing cooperation improves robustness and resilience, but this link weakens as perturbations intensify. Robustness and resilience also varies by algorithm and uncertainty type. (2) Robustness and resilience do not generalize across uncertainty modalities or agent scopes: policies robust to action noise for all agents may fail under observation noise on a single agent. (3) Hyperparameter tuning is critical for trustworthy MARL: surprisingly, standard practices like parameter sharing, GAE, and PopArt can hurt robustness, while early stopping, high critic learning rates, and Leaky ReLU consistently help. By optimizing hyperparameters only, we observe substantial improvement in cooperation, robustness and resilience across all MARL backbones, with the phenomenon also generalizing to robust MARL methods across these backbones.
Zihao Mao, Zonglei Jing, Zhuohang bian, Jun Guo 0009, Li Wang 0170, Zhuoran Han, Ruixiao Xu, Xin Yu 0009, Chengdong Ma, Yuqing Ma, Bo An 0001, Yaodong Yang 0001, Weifeng Lv, Xianglong Liu 0001
NeurIPS2
2025 Accident Anticipation via Temporal Occurrence Prediction
abstract
Accident anticipation aims to predict potential collisions in an online manner, enabling timely alerts to enhance road safety. Existing methods typically predict frame-level risk scores as indicators of hazard. However, these approaches rely on ambiguous binary supervision—labeling all frames in accident videos as positive—despite the fact that risk varies continuously over time, leading to unreliable learning and false alarms. To address this, we propose a novel paradigm that shifts the prediction target from current-frame risk scoring to directly estimating accident scores at multiple future time steps (e.g., 0.1s–2.0s ahead), leveraging precisely annotated accident timestamps as supervision. Our method employs a snippet-level encoder to jointly model spatial and temporal dynamics, and a Transformer-based temporal decoder that predicts accident scores for all future horizons simultaneously using dedicated temporal queries. Furthermore, we introduce a refined evaluation protocol that reports Time-to-Accident (TTA) and recall—evaluated at multiple pre-accident intervals (0.5s, 1.0s, and 1.5s)—only when the false alarm rate (FAR) remains within an acceptable range, ensuring practical relevance. Experiments show that our method achieves superior performance in both recall and TTA under realistic FAR constraints. Project page: https://happytianhao.github.io/TOP/
Yiyang Zou, Zihao Mao, Peilun Xiao, Hongda Yang, Tracy Li, Yutian Lin
NeurIPS3
2025 MvDDI: A Multi-view Interaction Framework for Few-Shot Drug-Drug Interaction
Zihao Mao, Qiguang Chen, Yongheng Zhang 0001, Ruoxi Zhou, Peng Wang 0168, Libo Qin 0001
NLPCC (2)1
2019 Multi-branch Structure for Hierarchical Classification in Plant Disease Recognition
Zihao Mao, Jiaming Chen 0008, Meng Yang 0001
PRCV (3)1