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

Sihao Wu

dblp:347/9514 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2025
0009-0005-7032-8903ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
2 papers
Trustworthy machine learning · 62% Reinforcement learning · 14% Representation and self-supervised learning · 14%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
certified robustness
0.912025
Enhancing Robust Fairness via Confusional Spectral Regularization · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
robust fairness
0.912025
Enhancing Robust Fairness via Confusional Spectral Regularization · ICLR 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
Enhancing Robust Fairness via Confusional Spectral Regularization · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.812024
Representation-Based Robustness in Goal-Conditioned Reinforcement Learning · AAAI 2024
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
0.812024
Representation-Based Robustness in Goal-Conditioned Reinforcement Learning · AAAI 2024
Machine learning › Representation and self-supervised learning › representation learning
robust representation learning
0.812024
Representation-Based Robustness in Goal-Conditioned Reinforcement Learning · AAAI 2024
Machine learning › Learning theory
generalization bounds
0.312025
Enhancing Robust Fairness via Confusional Spectral Regularization · ICLR 2025
Machine learning › Learning theory › generalization bounds
PAC-Bayes bounds
0.312025
Enhancing Robust Fairness via Confusional Spectral Regularization · ICLR 2025

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

spectral regularization · 0.9class reweighting · 0.9PAC-Bayesian analysis · 0.9sensitivity-aware regularization · 0.8contrastive attack · 0.8adversarial training · 0.8
YearPublicationVenuePosition
2025 Enhancing Robust Fairness via Confusional Spectral Regularization
abstract
Recent research has highlighted a critical issue known as ``robust fairness", where robust accuracy varies significantly across different classes, undermining the reliability of deep neural networks (DNNs). A common approach to address this has been to dynamically reweight classes during training, giving more weight to those with lower empirical robust performance. However, we find there is a divergence of class-wise robust performance between training set and testing set, which limits the effectiveness of these explicit reweighting methods, indicating the need for a principled alternative. In this work, we derive a robust generalization bound for the worst-class robust error within the PAC-Bayesian framework, accounting for unknown data distributions. Our analysis shows that the worst-class robust error is influenced by two main factors: the spectral norm of the empirical robust confusion matrix and the information embedded in the model and training set. While the latter has been extensively studied, we propose a novel regularization technique targeting the spectral norm of the robust confusion matrix to improve worst-class robust accuracy and enhance robust fairness. We validate our approach through comprehensive experiments on various datasets and models, demonstrating its effectiveness in enhancing robust fairness.
Gaojie Jin, Sihao Wu, Jiaxu Liu 0001, Tianjin Huang, Ronghui Mu
ICLR2
2024 Representation-Based Robustness in Goal-Conditioned Reinforcement Learning
abstract
While Goal-Conditioned Reinforcement Learning (GCRL) has gained attention, its algorithmic robustness against adversarial perturbations remains unexplored. The attacks and robust representation training methods that are designed for traditional RL become less effective when applied to GCRL. To address this challenge, we first propose the Semi-Contrastive Representation attack, a novel approach inspired by the adversarial contrastive attack. Unlike existing attacks in RL, it only necessitates information from the policy function and can be seamlessly implemented during deployment. Then, to mitigate the vulnerability of existing GCRL algorithms, we introduce Adversarial Representation Tactics, which combines Semi-Contrastive Adversarial Augmentation with Sensitivity-Aware Regularizer to improve the adversarial robustness of the underlying RL agent against various types of perturbations. Extensive experiments validate the superior performance of our attack and defence methods across multiple state-of-the-art GCRL algorithms. Our code is available at https://github.com/TrustAI/ReRoGCRL.
Xiangyu Yin 0001, Sihao Wu, Jiaxu Liu 0001, Xingyu Zhao 0001, Xiaowei Huang 0001, Wenjie Ruan
AAAI2
2024 Data Augmentation for Continual RL via Adversarial Gradient Episodic Memory
Sihao Wu, Xingyu Zhao 0001, Xiaowei Huang 0001
ICONIP (4)1
2024 Continuous Geometry-Aware Graph Diffusion via Hyperbolic Neural PDE
Jiaxu Liu 0001, Xinping Yi, Sihao Wu, Xiangyu Yin 0001, Xiaowei Huang 0001, Shi Jin 0002
ECML/PKDD (3)3