Demo Data from EDBT 2026 / reviewers in the wild / expert
Benhao Huang
dblp:367/4847
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0003-5449-2813ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
3 papers |
Trustworthy machine learning · 65% Motion planning and robot control · 17% Language models and text generation · 17% | |
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness
adversarial examples |
0.9 | 1 | 2025 | Contrasting Adversarial Perturbations: The Space of Harmless Perturbations · AAAI 2025 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.9 | 1 | 2025 | Contrasting Adversarial Perturbations: The Space of Harmless Perturbations · AAAI 2025 |
Natural language and speech › Language models and text generation
LLM agents |
0.9 | 1 | 2025 | DCA-Bench: A Benchmark for Dataset Curation Agents · KDD (2) 2025 |
Robotics › Motion planning and robot control › system identification › robot dynamics identification
model identification |
0.9 | 1 | 2025 | Contrasting Adversarial Perturbations: The Space of Harmless Perturbations · AAAI 2025 |
Data integration and cleaning
data curation |
0.9 | 1 | 2025 | DCA-Bench: A Benchmark for Dataset Curation Agents · KDD (2) 2025 |
Machine learning › Trustworthy machine learning › interpretability
explainable AI |
0.8 | 1 | 2024 | Defining and extracting generalizable interaction primitives from DNNs · ICLR 2024 |
Machine learning › Trustworthy machine learning
interpretability |
0.8 | 1 | 2024 | Defining and extracting generalizable interaction primitives from DNNs · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
large language model · 1.7automatic evaluation · 1.7perturbation space · 0.9null space analysis · 0.9symbolic interaction extraction · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Contrasting Adversarial Perturbations: The Space of Harmless PerturbationsabstractExisting works have extensively studied adversarial examples, which are minimal perturbations that can mislead the output of deep neural networks (DNNs) while remaining imperceptible to humans. However, in this work, we reveal the existence of a harmless perturbation space, in which perturbations drawn from this space, regardless of their magnitudes, leave the network output unchanged when applied to inputs. Essentially, the harmless perturbation space emerges from the usage of non-injective functions (linear or non-linear layers) within DNNs, enabling multiple distinct inputs to be mapped to the same output. For linear layers with input dimensions exceeding output dimensions, any linear combination of the orthogonal bases of the nullspace of the parameter consistently yields no change in their output. For non-linear layers, the harmless perturbation space may expand, depending on the properties of the layers and input samples. Inspired by this property of DNNs, we solve for a family of general perturbation spaces that are redundant for the DNN's decision, and can be used to hide sensitive data and serve as a means of model identification. Our work highlights the distinctive robustness of DNNs (i.e., consistency under large magnitude perturbations) in contrast to adversarial examples (vulnerability for small noises). Benhao Huang |
AAAI | 3 |
| 2025 | DCA-Bench: A Benchmark for Dataset Curation AgentsabstractThe quality of datasets plays an increasingly crucial role in the research and development of modern artificial intelligence (AI). Despite the proliferation of open dataset platforms nowadays, data quality issues, such as incomplete documentation, inaccurate labels, ethical concerns, and outdated information, remain common in widely used datasets. Furthermore, these issues are often subtle and difficult to be detected by rule-based scripts, therefore requiring identification and verification by dataset users or maintainers-a process that is both time-consuming and prone to human mistakes. With the surging ability of large language models (LLM), it's promising to streamline the discovery of hidden dataset issues with LLM agents. To achieve this, one significant challenge is enabling LLM agents to detect issues in the wild rather than simply fixing known ones. In this work, we establish a benchmark to measure LLM agent's ability to tackle this challenge. We carefully curate 221 real-world test cases from eight popular dataset platforms and propose an automatic evaluation framework using GPT-4o. Our proposed framework shows strong empirical alignment with expert evaluations, validated through extensive comparisons with human annotations. Without any hints, most competitive Curator agent can only reveal ~30% of the data quality issues in the proposed dataset, highlighting the complexity of this task and indicating that applying LLM agents to real-world dataset curation still requires further in-depth exploration and innovation. The data and code is available at https://github.com/TRAIS-Lab/dca-bench. Benhao Huang, Yingzhuo Yu, Xingjian Zhang 0002, Jiaqi W. Ma |
KDD (2) | 1 |
| 2024 | Defining and extracting generalizable interaction primitives from DNNsabstractFaithfully summarizing the knowledge encoded by a deep neural network (DNN) into a few symbolic primitive patterns without losing much information represents a core challenge in explainable AI. To this end, Ren et al. (2024) have derived a series of theorems to prove that the inference score of a DNN can be explained as a small set of interactions between input variables. However, the lack of generalization power makes it still hard to consider such interactions as faithful primitive patterns encoded by the DNN. Therefore, given different DNNs trained for the same task, we develop a new method to extract interactions that are shared by these DNNs. Experiments show that the extracted interactions can better reflect common knowledge shared by different DNNs. Siyu Lou, Benhao Huang, Quanshi Zhang |
ICLR | 3 |