Methods › General › Deep Tabular Learning › GANDALF

Gated Adaptive Network for Deep Automated Learning of Features

GANDALF

4 papers tagged archive 2025-07-28

Introduced by Manu Joseph et al. in GANDALF: Gated Adaptive Network for Deep Automated Learning of Features

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

We propose a novel high-performance, interpretable, and parameter \& computationally efficient deep learning architecture for tabular data, Gated Adaptive Network for Deep Automated Learning of Features (GANDALF). GANDALF relies on a new tabular processing unit with a gating mechanism and in-built feature selection called Gated Feature Learning Unit (GFLU) as a feature representation learning unit. We demonstrate that GANDALF outperforms or stays at-par with SOTA approaches like XGBoost, SAINT, FT-Transformers, etc. by experiments on multiple established public benchmarks. We have made available the code at github.com/manujosephv/pytorch_tabular under MIT License.

PaperSource

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 4 entries in Syntology's graph carry it; the most cited is the paper “GANDALF: Gated Adaptive Network for Deep Automated Learning of Features” (arXiv:2207.08548, 28 citations). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute. For arXiv:2207.08548: 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: 4 · with a code link: 1 · where Syntology ran a sample: 1 (1 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 (1 of 4 tagged: 1 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 4 of 4, 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

16 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
feature selection2
Denoising1
Dimensionality Reduction1
Extreme Multi-Label Classification1
MUlTI-LABEL-ClASSIFICATION1
Multi Label Text Classification1
Multi-Label Classification1
Multi-Label Text Classification1
Product Recommendation1
Representation Learning1
Survey1
Text Classification1
Transfer Learning1
regression1
tabular-classification1
text-classification1

Usage over time archive 2025-07-28

Papers per year tagged with GANDALF: 2022 to 2025, peak 2 2 0 2022: 1 paper 2022 2023: 0 papers 2023 2024: 2 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (4 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