Demo Data from EDBT 2026 / reviewers in the wild / expert
Ruichen Qiu
dblp:369/5526
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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% Efficient and distributed learning · 33% |
Topics — the 2 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 › feedforward neural network
kolmogorov-arnold networks |
0.9 | 1 | 2025 | PowerMLP: An Efficient Version of KAN · AAAI 2025 |
Machine learning › Deep learning architectures and training › feedforward neural network
multilayer perceptron |
0.9 | 1 | 2025 | PowerMLP: An Efficient Version of KAN · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
spline function representation · 0.9kolmogorov-arnold representation theorem · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PowerMLP: An Efficient Version of KANabstractThe Kolmogorov-Arnold Network (KAN) is a new network architecture known for its high accuracy in several tasks such as function fitting and PDE solving. The superior expressive capability of KAN arises from the Kolmogorov-Arnold representation theorem and learnable spline functions. However, the computation of spline functions involves multiple iterations, which renders KAN significantly slower than MLP, thereby increasing the cost associated with model training and deployment. The authors of KAN also noted that "the biggest bottleneck of KANs lies in their slow training. KANs are usually 10x slower than MLPs, given the same number of parameters." To address this issue, we propose a novel MLP-type neural network PowerMLP that employs simpler non-iterative spline function representation, offering approximately the same training time as MLP while theoretically demonstrating stronger expressive power than KAN. Furthermore, we compare the FLOPs of KAN and PowerMLP, quantifying the faster computation speed of PowerMLP. Our comprehensive experiments demonstrate that PowerMLP generally achieves higher accuracy and a training speed about 40 times faster than KAN in various tasks. Ruichen Qiu, Yibo Miao, Lijia Yu, Xiao-Shan Gao |
AAAI | 1 |