Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.05016 v3 pith:OKGL5N6G submitted 2024-10-07 cs.LG stat.ML

classification cs.LGstat.ML
keywords datat-jepalatentlearningmethodrepresentationrepresentationstabular
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bar-JEPA: Extracting Values from Bar Chart with Joint-Embedding Predictive Architecture

    cs.CV 2026-08 conditional novelty 6.0 of 10

    A JEPA encoder finetuned on synthetic bar charts enables a lightweight decoder to recover bar values from chart images, but the method remains behind state-of-the-art supervised systems.

  2. Cluster and Predict Latent Patches for Improved Masked Image Modeling

    cs.CV 2025-02 conditional novelty 6.0 of 10

    A masked image modeling method that predicts latent cluster assignments from an EMA teacher reaches 83.8% ImageNet accuracy and 32.1 ADE20K mIoU, outperforming prior MIM methods and approaching DINOv2.

Pith tools