Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hanchen Xia
dblp:334/3927
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 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 |
Multi-agent systems · 33% Learning theory · 28% Language models and text generation · 16% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 9 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
LLM agents |
0.9 | 1 | 2025 | Scaling Large Language Model-based Multi-Agent Collaboration · ICLR 2025 |
Knowledge, reasoning and agents › Multi-agent systems › multi-agent collaboration
LLM-based multi-agent collaboration |
0.9 | 1 | 2025 | Scaling Large Language Model-based Multi-Agent Collaboration · ICLR 2025 |
Knowledge, reasoning and agents › Multi-agent systems
multi-agent collaboration |
0.9 | 1 | 2025 | Scaling Large Language Model-based Multi-Agent Collaboration · ICLR 2025 |
Machine learning › Learning theory › loss function
average top-k aggregate loss |
0.8 | 1 | 2024 | ST$_k$: A Scalable Module for Solving Top-k Problems · NeurIPS 2024 |
Machine learning › Learning theory
loss function |
0.8 | 1 | 2024 | ST$_k$: A Scalable Module for Solving Top-k Problems · NeurIPS 2024 |
Visualization and visual analytics › dimensionality reduction
dimensionality reduction visualization |
0.8 | 1 | 2024 | DMT-EV: An Explainable Deep Network for Dimension Reduction · IEEE Trans. Vis. Comput. Graph. 2024 |
Visualization and visual analytics
visual analytics |
0.8 | 1 | 2024 | DMT-EV: An Explainable Deep Network for Dimension Reduction · IEEE Trans. Vis. Comput. Graph. 2024 |
Machine learning › Representation and self-supervised learning › representation learning
dimensionality reduction |
0.2 | 1 | 2024 | DMT-EV: An Explainable Deep Network for Dimension Reduction · IEEE Trans. Vis. Comput. Graph. 2024 |
Machine learning › Learning paradigms
long-tailed recognition |
0.2 | 1 | 2024 | ST$_k$: A Scalable Module for Solving Top-k Problems · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
saliency map · 1.5manifold-based loss · 1.5data augmentation · 1.5scaling laws · 0.9directed acyclic graph · 0.9end-to-end optimization · 0.8differentiable relaxation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Scaling Large Language Model-based Multi-Agent CollaborationabstractRecent breakthroughs in large language model-driven autonomous agents have revealed that multi-agent collaboration often surpasses each individual through collective reasoning. Inspired by the neural scaling law—increasing neurons enhances performance, this study explores whether the continuous addition of collaborative agents can yield similar benefits. Technically, we utilize directed acyclic graphs to organize agents into a multi-agent collaboration network (MacNet), upon which their interactive reasoning is topologically orchestrated for autonomous task solving. Extensive evaluations reveal that it effectively supports collaboration among over a thousand agents, with irregular topologies outperforming regular ones. We also identify a collaborative scaling law—the overall performance follows a logistic growth pattern as agents scale, with collaborative emergence occurring earlier than traditional neural emergence. We speculate this may be because scaling agents catalyzes their multidimensional considerations during interactive reflection and refinement, thereby producing more comprehensive artifacts. The code is available at https://github.com/OpenBMB/ChatDev/tree/macnet. Zihao Xie, Wei Liu 0161, Kunlun Zhu, Hanchen Xia, Yufan Dang, Zhuoyun Du, Weize Chen, Cheng Yang 0002, Zhiyuan Liu 0001, Maosong Sun 0001 |
ICLR | 6 |
| 2024 | ST$_k$: A Scalable Module for Solving Top-k ProblemsabstractThe cost of ranking becomes significant in the new stage of deep learning. We propose ST$_k$, a fully differentiable module with a single trainable parameter, designed to solve the Top-k problem without requiring additional time or GPU memory. Due to its fully differentiable nature, ST$_k$ can be embedded end-to-end into neural networks and optimize the Top-k problems within a unified computational graph. We apply ST$_k$ to the Average Top-k Loss (AT$_k$), which inherently faces a Top-k problem. The proposed ST$_k$ Loss outperforms AT$_k$ Loss and achieves the best average performance on multiple benchmarks, with the lowest standard deviation. With the assistance of ST$_k$ Loss, we surpass the state-of-the-art (SOTA) on both CIFAR-100-LT and Places-LT leaderboards. Hanchen Xia, Weidong Liu 0005, Xiaojun Mao |
NeurIPS | 1 |
| 2024 | DMT-EV: An Explainable Deep Network for Dimension ReductionabstractDimension reduction (DR) is commonly utilized to capture the intrinsic structure and transform high-dimensional data into low-dimensional space while retaining meaningful properties of the original data. It is used in various applications, such as image recognition, single-cell sequencing analysis, and biomarker discovery. However, contemporary parametric-free and parametric DR techniques suffer from several significant shortcomings, such as the inability to preserve global and local features and the poor generalisation performance. On the other hand, regarding explainability, it is crucial to comprehend the embedding process, especially the contribution of each part to the embedding process, while understanding how each feature affects the embedding results that identify critical components and help diagnose the embedding process. To address these problems, we have developed a deep neural network method called DMT-EV, which provides not only excellent performance in structural maintainability but also explainability to the DR therein. DMT-EV starts with data augmentation and a manifold-based loss function to improve embedding performance. The explanation is based on saliency maps and aims to examine the trained DMT-EV parameters and contributions of components during the embedding process. The proposed techniques are integrated with a visual interface to help the user to adjust DMT-EV to achieve better DR performance and explainability. The interactive visual interface makes it easier to illustrate the data features, compare different DR techniques, and investigate DR. An in-depth experimental comparison shows that DMT-EV consistently outperforms the state-of-the-art methods in both performance measures and explainability. Zelin Zang, Shenghui Cheng, Hanchen Xia, Yaoting Sun, Yongjie Xu 0001, Baigui Sun, Stan Z. Li |
IEEE Trans. Vis. Comput. Graph. | 3 |