mlsanityData to 7 Oct 2026

T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data

arXiv 2410.05016 ↗First posted 7 Oct 2024cs.LG stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

Self-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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 43 of its 56 references that are in the map. First posted on arXiv 7 Oct 2024.

Builds on

43 of 56 references.

References · 43

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  4. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  5. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  6. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  7. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  8. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  9. 2019Contrastive Multiview Codingcited by 1,297
  10. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  11. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
  12. 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 982
31 more
  1. 2023Vision Transformers Need Registerscited by 844
  2. 2021Revisiting Deep Learning Models for Tabular Datacited by 725
  3. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
  4. 2021Tabular Data: Deep Learning is Not All You Needcited by 530
  5. 2014OpenML: networked science in machine learningcited by 523
  6. 2019Using Self-Supervised Learning Can Improve Model Robustness and Uncertaintycited by 511
  7. 2024Revisiting Feature Prediction for Learning Visual Representations from Videocited by 490
  8. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
  9. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
  10. 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 310
  11. 2018Cooperative Learning of Audio and Video Models from Self-Supervised Synchronizationcited by 246
  12. 2020Space-Time Correspondence as a Contrastive Random Walkcited by 239
  13. 2020Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualizationcited by 170
  14. 2021Well-tuned Simple Nets Excel on Tabular Datasetscited by 151
  15. 2021SCARF: Self-Supervised Contrastive Learning using Random Feature Corruptioncited by 151
  16. 2022TransTab: Learning Transferable Tabular Transformers Across Tablescited by 132
  17. 2021Self-Attention Between Datapoints: Going Beyond Individual Input-Output Pairs in Deep Learningcited by 112
  18. 2021BYOL for Audio: Self-Supervised Learning for General-Purpose Audio Representationcited by 106
  19. 2021SubTab: Subsetting Features of Tabular Data for Self-Supervised Representation Learningcited by 101
  20. 2023XTab: Cross-table Pretraining for Tabular Transformerscited by 81
  21. 2023TabR: Tabular Deep Learning Meets Nearest Neighbors in 2023cited by 73
  22. 2020Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphscited by 38
  23. 2024SwitchTab: Switched Autoencoders Are Effective Tabular Learnerscited by 37
  24. 2023UniTabE: A Universal Pretraining Protocol for Tabular Foundation Model in Data Sciencecited by 28
  25. 2024PTaRL: Prototype-based Tabular Representation Learning via Space Calibrationcited by 27
  26. 2022Learning State-Aware Visual Representations from Audible Interactionscited by 23
  27. 2023Graph-level Representation Learning with Joint-Embedding Predictive Architecturescited by 21
  28. 2023Beyond Individual Input for Deep Anomaly Detection on Tabular Datacited by 14
  29. 2023Self-supervised Representation Learning From Random Data Projectorscited by 14
  30. 2020Hierarchically Decoupled Spatial-Temporal Contrast for Self-supervised Video Representation Learningcited by 12
  31. 2024Binning as a Pretext Task: Improving Self-Supervised Learning in Tabular Domainscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 6; 2026: 7.

13 papers.

Sort:

By area: