paper-with-me

Papers

Modern Neighborhood Components Analysis: A Deep Tabular Baseline Two Decades Later

2024-07-03 · Han-Jia Ye, Huai-Hong Yin, De-Chuan Zhan

The growing success of deep learning in various domains has prompted investigations into its application to tabular data, where deep models have shown promising results compared to traditional tree-based methods. In this paper, we revisit Neighborhood Component Analysis (NCA), a classic tabular prediction method introduced in 2004, designed to learn a linear projection that captures semantic similarities between instances. We find that minor modifications, such as adjustments to the learning objectives and the integration of deep learning architectures, significantly enhance NCA's performance, enabling it to surpass most modern deep tabular models. Additionally, we introduce a stochastic neighbor sampling strategy that improves both the efficiency and predictive accuracy of our proposed ModernNCA -- sampling only a subset of neighbors during training, while utilizing the entire neighborhood during inference. Extensive experiments demonstrate that our ModernNCA achieves state-of-the-art results in both classification and regression tasks across various tabular datasets, outperforming both tree-based and other deep tabular models, while also reducing training time and model size.

📄 PDF Abstract BibTeX arXiv:2407.03257

Code (1)

qile2000/LAMDA-TALENT 공식 구현 pytorch

Similar Papers 제목 키워드 기반

TabSurv: Adapting Modern Tabular Neural Networks to Survival Analysis

2026-05-05 · Stanislav Kirpichenko, Andrei Konstantinov, Lev Utkin arxiv

Survival analysis on tabular data is a well-studied problem. However, existing deep learning methods are often highly task-specific, which can limit the transfer of new approaches from other domains and introduce constra…

Learning Enhanced Representations for Tabular Data via Neighborhood Propagation

2022-06-14 · Kounianhua Du, Weinan Zhang, Ruiwen Zhou, Yangkun Wang 외

Prediction over tabular data is an essential and fundamental problem in many important downstream tasks. However, existing methods either take a data instance of the table independently as input or do not fully utilize t…

PredictionRetrieval

Fixed Aggregation Features Can Rival GNNs

2026-01-27 · Celia Rubio-Madrigal, Rebekka Burkholz arxiv

Graph neural networks (GNNs) are widely believed to excel at node representation learning through trainable neighborhood aggregations. We challenge this view by introducing Fixed Aggregation Features (FAFs), a training-f…

Representation LearningGraph Learning

Convex space learning for tabular synthetic data generation

2024-07-13 · Manjunath Mahendra, Chaithra Umesh, Saptarshi Bej, Kristian Schultz 외

Generating synthetic samples from the convex space of the minority class is a popular oversampling approach for imbalanced classification problems. Recently, deep-learning approaches have been successfully applied to mod…

Deep Learningimbalanced classificationSynthetic Data Generation

Edge-Selector Model Applied for Local Search Neighborhood for Solving Vehicle Routing Problems

2025-08-12 · Bachtiar Herdianto, Romain Billot, Flavien Lucas, Marc Sevaux 외 arxiv

This research proposes a hybrid Machine Learning and metaheuristic mechanism that is designed to solve Vehicle Routing Problems (VRPs). The main of our method is an edge solution selector model, which classifies solution…

Graph Neural Network