Demo Data from EDBT 2026 / reviewers in the wild / expert
Yuanlin Chu
dblp:408/2276
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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
1 paper |
Deep learning architectures and training · 67% Trustworthy machine learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
mixture of experts |
1.0 | 1 | 2026 | Deconstructing Pre-training: Knowledge Attribution Analysis in MoE and Dense Models · AAAI 2026 |
Machine learning › Trustworthy machine learning › interpretability › attribution methods
neuron attribution |
1.0 | 1 | 2026 | Deconstructing Pre-training: Knowledge Attribution Analysis in MoE and Dense Models · AAAI 2026 |
Machine learning › Deep learning architectures and training
training dynamics |
1.0 | 1 | 2026 | Deconstructing Pre-training: Knowledge Attribution Analysis in MoE and Dense Models · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
masking · 1.0log-probability increase attribution · 1.0checkpoint analysis · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Deconstructing Pre-training: Knowledge Attribution Analysis in MoE and Dense ModelsabstractMixture-of-Experts (MoE) architectures decouple model capacity from per-token computation, enabling scaling beyond the computational limits imposed by dense scaling laws. Yet how MoE architectures shape knowledge acquisition during pre-training—and how this process differs from dense architectures—remains unknown. To address this issue, we introduce Gated-LPI (Log-Probability Increase), a neuron-level attribution metric that decomposes log-probability increase across neurons. We present a time-resolved comparison of knowledge acquisition dynamics in MoE and dense architectures, tracking checkpoints over 1.2M (~ 5.0T tokens) and 600K (~ 2.5T tokens) training steps, respectively. Our experiments uncover three patterns: (1) Low-entropy backbone. The top approximately 1% of MoE neurons capture over 45% of positive updates, forming a high-utility core, which is absent in the dense baseline. (2) Early consolidation. The MoE model locks into a stable importance profile within < 100K steps, whereas the dense model remains volatile throughout training. (3) Functional robustness. Masking the ten most important MoE attention heads reduces relational HIT@10 by < 10%, compared with > 50% for the dense model, showing that sparsity fosters distributed—rather than brittle—knowledge storage. These patterns collectively demonstrate that sparsity fosters an intrinsically stable and distributed computational backbone from early in training, helping bridge the gap between sparse architectures and training-time interpretability. Junzhuo Li, Yuanlin Chu, Yuxuan Fan, Xuming Hu |
AAAI | 4 |