Demo Data from SIGIR 2026 / reviewers in the wild / expert
Chiao-Ya Hsu
dblp:435/4723
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 50% Representation and self-supervised learning · 50% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning and data management › tabular data learning
tabular data prediction |
1.0 | 1 | 2026 | GTab: Gradient Boosting Bipartite Graph Neural Networks for Holistic Tabular Data Predictions · IEEE Trans. Knowl. Data Eng. 2026 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.3 | 1 | 2026 | GTab: Gradient Boosting Bipartite Graph Neural Networks for Holistic Tabular Data Predictions · IEEE Trans. Knowl. Data Eng. 2026 |
Machine learning › Graph learning
graph representation learning |
0.3 | 1 | 2026 | GTab: Gradient Boosting Bipartite Graph Neural Networks for Holistic Tabular Data Predictions · IEEE Trans. Knowl. Data Eng. 2026 |
Methods — techniques the papers use, named apart from their topics
reconstruction objective · 2.0graph neural network · 2.0gradient boosting · 2.0contrastive learning · 2.0clustering objective · 2.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | GTab: Gradient Boosting Bipartite Graph Neural Networks for Holistic Tabular Data PredictionsabstractReal-world analytics hinges on tabular data, yet prevailing learners face a triple bind: tree ensembles excel on fixed schemas but cannot generalize to new columns, neural nets learn rich features yet overfit small tables, and recent transfer approaches falter when schemas diverge. We tackle these limitations with GTab, a Gradient-Boosting Bipartite Graph Neural Network that marries decision-tree residual refinement with self-supervised graph representation learning. GTab maps each table to an instance-feature bipartite graph, where a GNN, optimised jointly with contrastive, clustering, and reconstruction objectives, captures feature-feature, instance-instance, and cross-type relations. Boosted trees ingest the GNN's gradients, correcting residual errors and injecting the strong inductive bias of split-based models. Building on this backbone, we introduce three variants: E-GTab ensembles multiple overlapping feature sub-graphs for robust classic prediction; I-GTab inductively attaches unseen feature nodes, enabling feature-incremental inference without retraining; and T-GTab pre-trains on a source schema and lightly fine-tunes on a target schema to achieve zero-shot and transfer learning across heterogeneous tables. Across 20 public benchmarks and five clinical trials, GTab consistently ranks first: it outperforms tree, neural, and graph baselines on static tasks, surpasses prior art (and an oracle) when half the test-time columns are unseen, and delivers higher AUC than the leading transformer baseline in both cross-dataset and zero-shot transfer – all with a unified architecture. GTab thus offers a principled, scalable, and adaptable solution to holistic tabular data prediction, bridging the gap between classic ensembles and modern self-supervised representation learning. Chiao-Ya Hsu, Cheng-Te Li |
IEEE Trans. Knowl. Data Eng. | 1 |