Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniil Shlenskii
dblp:353/2313
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-8217-7815ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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 · 33% Language models and text generation · 33% Image recognition and object detection · 33% | |
| Computer graphics and multimedia
1 paper |
Rendering · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering › non-photorealistic rendering
artistic rendering |
0.9 | 1 | 2025 | YaART: Yet Another ART Rendering Technology · KDD (1) 2025 |
Computer vision › Image recognition and object detection
nearest neighbor retrieval |
0.8 | 1 | 2024 | TabR: Tabular Deep Learning Meets Nearest Neighbors · ICLR 2024 |
Natural language and speech › Language models and text generation
retrieval-augmented model |
0.8 | 1 | 2024 | TabR: Tabular Deep Learning Meets Nearest Neighbors · ICLR 2024 |
Machine learning › Deep learning architectures and training
tabular deep learning |
0.8 | 1 | 2024 | TabR: Tabular Deep Learning Meets Nearest Neighbors · ICLR 2024 |
Methods — techniques the papers use, named apart from their topics
k-nearest neighbors · 0.8attention · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | YaART: Yet Another ART Rendering Technology
Sergey Kastryulin, Artem Konev, Alexander Shishenya, Eugene Lyapustin, Artem Khurshudov, Alexander Tselousov, Nikita Vinokurov, Denis Kuznedelev, Alexander Markovich, Grigoriy Livshits, Alexey Kirillov, Anastasiia Tabisheva, Liubov Chubarova, Marina Kaminskaia, Alexander Ustyuzhanin, Artemii Shvetsov, Daniil Shlenskii, Valerii Startsev, Dmitrii Kornilov, Mikhail Romanov, Dmitry Baranchuk, Artem Babenko, Sergei Ovcharenko, Valentin Khrulkov |
KDD (1) | 17 |
| 2024 | TabR: Tabular Deep Learning Meets Nearest NeighborsabstractDeep learning (DL) models for tabular data problems (e.g. classification, regression) are currently receiving increasingly more attention from researchers.
However, despite the recent efforts, the non-DL algorithms based on gradient-boosted decision trees (GBDT) remain a strong go-to solution for these problems.
One of the research directions aimed at improving the position of tabular DL involves designing so-called retrieval-augmented models.
For a target object, such models retrieve other objects (e.g. the nearest neighbors) from the available training data and use their features and labels to make a better prediction.
In this work, we present TabR -- essentially, a feed-forward network with a custom k-Nearest-Neighbors-like component in the middle.
On a set of public benchmarks with datasets up to several million objects, TabR marks a big step forward for tabular DL: it demonstrates the best average performance among tabular DL models, becomes the new state-of-the-art on several datasets, and even outperforms GBDT models on the recently proposed "GBDT-friendly" benchmark (see Figure 1).
Among the important findings and technical details powering TabR, the main ones lie in the attention-like mechanism that is responsible for retrieving the nearest neighbors and extracting valuable signal from them.
In addition to the higher performance, TabR is simple and significantly more efficient compared to prior retrieval-based tabular DL models. Yury Gorishniy, Ivan Rubachev, Nikolay Kartashev, Daniil Shlenskii, Akim Kotelnikov, Artem Babenko |
ICLR | 4 |