Demo Data from VLDB 2026 / reviewers in the wild / expert
Huai-Hong Yin
dblp:382/5465
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 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 · 33% Representation and self-supervised learning · 33% Kernel, tree and ensemble methods · 33% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
metric learning |
0.9 | 1 | 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades Later · ICLR 2025 |
Machine learning › Kernel, tree and ensemble methods
nearest neighbor methods |
0.9 | 1 | 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades Later · ICLR 2025 |
Machine learning › Deep learning architectures and training
tabular deep learning |
0.9 | 1 | 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades Later · ICLR 2025 |
Machine learning and data management
tabular data learning |
0.9 | 1 | 2025 | Talent: A Tabular Analytics and Learning Toolbox · J. Mach. Learn. Res. 2025 |
Machine learning and data management › machine learning systems
machine learning tooling |
0.3 | 1 | 2025 | Talent: A Tabular Analytics and Learning Toolbox · J. Mach. Learn. Res. 2025 |
Algorithms and data structures › similarity search › nearest neighbor search
k-nearest neighbors |
0.3 | 1 | 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades Later · ICLR 2025 |
Algorithms and data structures › similarity search
nearest neighbor search |
0.3 | 1 | 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades Later · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
stochastic gradient descent · 1.7neighborhood components analysis · 1.7deep representations · 1.7normalization · 0.9feature encoding · 0.9deep learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Revisiting Nearest Neighbor for Tabular Data: A Deep Tabular Baseline Two Decades LaterabstractThe widespread enthusiasm for deep learning has recently expanded into the domain of tabular data. Recognizing that the advancement in deep tabular methods is often inspired by classical methods, e.g., integration of nearest neighbors into neural networks, we investigate whether these classical methods can be revitalized with modern techniques.
We revisit a differentiable version of $K$-nearest neighbors (KNN) --- Neighbourhood Components Analysis (NCA) --- originally designed to learn a linear projection to capture semantic similarities between instances, and seek to gradually add modern deep learning techniques on top. Surprisingly, our implementation of NCA using SGD and without dimensionality reduction already achieves decent performance on tabular data, in contrast to the results of using existing toolboxes like scikit-learn. Further equipping NCA with deep representations and additional training stochasticity significantly enhances its capability, being on par with the leading tree-based method CatBoost and outperforming existing deep tabular models in both classification and regression tasks on 300 datasets. We conclude our paper by analyzing the factors behind these improvements, including loss functions, prediction strategies, and deep architectures.
The code is available at https://github.com/LAMDA-Tabular/TALENT. Han-Jia Ye, Huai-Hong Yin, De-Chuan Zhan, Wei-Lun Chao |
ICLR | 2 |
| 2025 | Talent: A Tabular Analytics and Learning ToolboxabstractTabular data is a prevalent source in machine learning. While classical methods have proven effective, deep learning methods for tabular data are emerging as flexible alternatives due to their capacity to uncover hidden patterns and capture complex interactions. Considering that deep tabular methods exhibit diverse design philosophies, including the ways they handle features, design learning objectives, and construct model architectures, we introduce Talent (Tabular Analytics and Learning Toolbox), a versatile toolbox for utilizing, analyzing, and comparing these methods. Talent includes over 35 deep tabular prediction methods, offering various encoding and normalization modules, all within a unified, easily extensible interface. We demonstrate its design, application, and performance evaluation in case studies. The code is available at https://github.com/LAMDA-Tabular/TALENT. Si-Yang Liu 0008, Hao-Run Cai, Qi-Le Zhou, Huai-Hong Yin, Jun-Peng Jiang, Han-Jia Ye |
J. Mach. Learn. Res. | 4 |