Methods › General › Deep Tabular Learning › TabNet

TabNet

29 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

TabNet is a deep tabular data learning architecture that uses sequential attention to choose which features to reason from at each decision step.

The TabNet encoder is composed of a feature transformer, an attentive transformer and feature masking. A split block divides the processed representation to be used by the attentive transformer of the subsequent step as well as for the overall output. For each step, the feature selection mask provides interpretable information about the model’s functionality, and the masks can be aggregated to obtain global feature important attribution. The TabNet decoder is composed of a feature transformer block at each step.

In the feature transformer block, a 4-layer network is used, where 2 are shared across all decision steps and 2 are decision step-dependent. Each layer is composed of a fully-connected (FC) layer, BN and GLU nonlinearity. An attentive transformer block example – a single layer mapping is modulated with a prior scale information which aggregates how much each feature has been used before the current decision step. sparsemax is used for normalization of the coefficients, resulting in sparse selection of the salient features.

Source: TabNet: Attentive Interpretable Tabular Learning

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 3 entries in Syntology's graph carry it; the most cited is the paper “TabNet: Attentive Interpretable Tabular Learning” (arXiv:1908.07442, 2,573 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach. For arXiv:1908.07442: its page on this site · ask the lookup about it.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 29 · with a code link: 11 · where Syntology ran a sample: 3 (3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (3 of 29 tagged: 3 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 29 of 29, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 49 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Representation Learning4
feature selection4
Classification3
Decision Making2
Deep Learning2
Federated Learning2
Graph Neural Network2
Anomaly Detection1
BIG-bench Machine Learning1
Benchmarking1
Binary Classification1
Computational Efficiency1
Credit score1
Denoising1
Dimensionality Reduction1
Disease Prediction1
Edge-computing1
Explainable Models1
Fairness1
Fault Detection1

Usage over time archive 2025-07-28

Papers per year tagged with TabNet: 2019 to 2025, peak 10 10 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 4 papers 2021 2022: 1 paper 2022 2023: 7 papers 2023 2024: 10 papers 2024 2025: 6 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (29 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Deep Tabular Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections