Demo Data from EDBT 2026 / reviewers in the wild / expert
José Lucas De Melo Costa
dblp:389/8617
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 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 |
Representation and self-supervised learning · 67% Deep learning architectures and training · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › predictive learning
joint-embedding predictive architecture |
0.9 | 1 | 2025 | T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data · ICLR 2025 |
Machine learning › Representation and self-supervised learning
tabular data |
0.9 | 1 | 2025 | T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data · ICLR 2025 |
Machine learning › Deep learning architectures and training
tabular deep learning |
0.9 | 1 | 2025 | T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data · ICLR 2025 |
Methods — techniques the papers use, named apart from their topics
self-supervised learning · 0.9regularization tokens · 0.9joint embedding predictive architecture · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | High Performance, Low Reliability: Uncertainty Benchmarking for Tabular Foundation ModelsabstractInternational audience José Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan |
ESANN | 1 |
| 2025 | T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular DataabstractSelf-supervision is often used for pre-training to foster performance on a downstream task by constructing meaningful representations of samples. Self-supervised learning (SSL) generally involves generating different views of the same sample and thus requires data augmentations that are challenging to construct for tabular data. This constitutes one of the main challenges of self-supervision for structured data. In the present work, we propose a novel augmentation-free SSL method for tabular data. Our approach, T-JEPA, relies on a Joint Embedding Predictive Architecture (JEPA) and is akin to mask reconstruction in the latent space. It involves predicting the latent representation of one subset of features from the latent representation of a different subset within the same sample, thereby learning rich representations without augmentations. We use our method as a pre-training technique and train several deep classifiers on the obtained representation. Our experimental results demonstrate a substantial improvement in both classification and regression tasks, outperforming models trained directly on samples in their original data space. Moreover, T-JEPA enables some methods to consistently outperform or match the performance of traditional methods likes Gradient Boosted Decision Trees. To understand why, we extensively characterize the obtained representations and show that T-JEPA effectively identifies relevant features for downstream tasks without access to the labels. Additionally, we introduce regularization tokens, a novel regularization method critical for training of JEPA-based models on structured data. Hugo Thimonier, José Lucas De Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan |
ICLR | 2 |