Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

150299449598 · Jun 202019922001200920172026
48 results for Tabular Datasets

MET learns tabular data representations without data augmentations.

problem Lack of effective self-supervised learning methods for tabular data.
method Reconstruction-based approach using masked encoding, with separate representations for each coordinate and adversarial reconstruction loss.
result MET achieves state-of-the-art performance on five diverse tabular datasets, improving up to 9% over current methods.

TabNAS improves neural architecture search for tabular datasets by rejecting suboptimal architectures.

problem Finding optimal neural architectures for tabular datasets with resource constraints.
method Develops a reinforcement learning controller motivated by rejection sampling to handle resource constraints.
result TabNAS finds better models that obey resource constraints compared to previous methods.

A new large-scale tabular benchmark for Learning from Label Proportions.

problem Lack of a large-scale open benchmark for tabular Learning from Label Proportions.
method Proposed LLP-Bench, a suite of 70 datasets (62 feature bag and 8 random bag) from real-world tabular data.
result Demonstrated the effectiveness of 9 SOTA and popular tabular LLP techniques on 62 feature bag datasets.

This paper improves credit scoring models using a novel dataset distillation technique.

problem Limited scalability of pretrained models for tabular credit scoring datasets.
method Integrates class imbalance-aware dataset distillation with pretrained models.
result Improved AUC by 2.5% in financial datasets.

Tabular foundation models outperform other methods in conditional density estimation across various datasets.

problem Estimating the full conditional distribution of a response given tabular covariates, especially in settings with heteroscedasticity, multimodality, or asymmetric uncertainty.
method Benchmarked three tabular foundation model variants (TabPFN and TabICL) against six CDE baselines on 39 real-world datasets.
result Tabular foundation models achieve the best CDE loss, log-likelihood, and CRPS across all sample sizes, outperforming other methods.

This study benchmarks tabular data generation models, optimizing hyperparameters and feature encodings.

problem Generating realistic tabular data is challenging due to heterogeneity, non-smooth distributions, and complex dependencies.
method Comprehensive evaluation of five model families on 16 datasets, considering hyperparameters, feature encodings, and architectures.
result Large-scale dataset-specific tuning significantly improves model performance, especially for diffusion-based models.

New algorithms for clustering and synthetic data generation of heterogeneous tabular datasets.

problem Clustering and generating synthetic data from heterogeneous tabular datasets with hidden cluster structure.
method Developed MMM and MMMsynth algorithms for clustering and synthetic data generation.
result MMMsynth algorithm outperforms other literature tabular-data generators and approaches real data performance.

Tree-based models outperform deep learning on tabular data, especially for medium-sized datasets.

problem Understanding why tree-based models outperform deep learning on tabular data.
method Extensive benchmarks of tree-based and deep learning models on 45 datasets, accounting for hyperparameters.
result Tree-based models remain state-of-the-art on medium-sized tabular data, even without hyperparameter optimization.

Paper proposes a new autoencoder metric for balanced learning in imbalanced tabular datasets.

problem Challenges of imbalanced self-supervised learning in tabular data.
method Developed a Multi-Supervised Balanced MSE metric to balance learning.
result The new metric outperforms standard MSE in imbalanced datasets.

Generative adversarial networks (GANs) implicitly learn the probability distribution of a dataset and can draw samples from the distribution. This paper presents, Tabular GAN (TGAN), a generative adversarial network which can generate tabular data like medical or educational records. Using the power of deep neural netw…

2018-11-27abs ↗pdf ↗

Proposes a proportional masking strategy for better tabular data imputation.

problem Heterogeneity of tabular data disrupts uniform random masking in MAEs.
method Computes missingness statistics, generates proportional masks, uses MLP token mixing.
result Proportional masking preserves missingness distribution, improves imputation performance.

Transformers fine-tuned on synthetic data boost tabular data classification performance.

problem Improving tabular data classification accuracy.
method Fine-tuning ICL-transformers on synthetic datasets with complex decision boundaries.
result Fine-tuned ICL-transformers outperform regular neural networks on real-world datasets.

Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.

problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.

Unified diffusion model tackles missing data in tabular datasets.

problem Training diffusion models on tabular data with missing values.
method Proposes a masked regression loss for Denoising Score Matching to learn from incomplete data.
result Demonstrates superior performance on tabular datasets with missing values compared to state-of-the-art methods.

CardiCat generates synthetic data for high-cardinality tabular datasets.

problem Learning complexities of high-cardinality categorical features in tabular data.
method Substitutes one-hot encoding with regularized dual encoder-decoder embedding layers.
result Generates high-quality synthetic data with a smaller parameter space.

Synthetic tabular data improves privacy while maintaining model performance.

problem Protecting privacy in synthetic data generation for machine learning.
method Deep generative models for tabular data, emphasizing privacy and model performance.
result Deep generative models enhance synthetic data generation for tabular datasets.

FinDiff generates synthetic financial data for regulatory tasks.

problem Sharing microdata for research due to privacy regulations.
method Diffusion model using embedding encodings for mixed modality financial data.
result FinDiff excels in generating high-fidelity, privacy-preserving synthetic financial data.

SurvFM-RMST converts survival outcomes into pseudo-observation targets for tabular models.

problem Right-censored follow-up prevents direct use of survival labels in tabular patient data.
method SurvFM-RMST framework that converts survival outcomes into jackknife pseudo-observation targets for restricted mean survival time.
result SurvFM-RMST accurately recovered restricted event-free time in simulations and outperformed naive targets in static datasets.

Tab-Shapley identifies top-k anomalies in tabular data quality insights.

problem Challenges in identifying anomalies in unlabeled tabular datasets.
method Cooperative game theory using Shapley values to quantify attribute contributions.
result Efficiently identifies top-k tabular data quality insights using closed-form Shapley values.

AutoDiff combines auto-encoder and diffusion model for realistic tabular data synthesis.

problem Generating realistic synthetic tabular data with heterogeneous features.
method Employing auto-encoder architecture to handle tabular data's complexity.
result Synthetic tables from AutoDiff show good statistical fidelity and perform well in machine learning tasks.

xRFM improves tabular data inference with better accuracy and scalability.

problem Inference from tabular data remains challenging and underdeveloped compared to other AI areas.
method Combines feature learning kernel machines with a tree structure.
result xRFM outperforms other methods across 100 regression and 200 classification datasets.

SubTab turns tabular data into a multi-view problem for better representation learning.

problem Lack of structure in tabular data makes it hard to apply effective self-supervised learning methods.
method Divides tabular features into subsets and uses autoencoder-like reconstruction for collaborative inference.
result SubTab achieves state-of-the-art performance on tabular datasets, matching or surpassing CNN-based methods.

Locally sparse neural networks improve interpretability for biomedical tabular data.

problem Overfitting and lack of interpretability in neural networks for tabular biomedical data.
method Locally sparse neural network with a gating network to select relevant features.
result The method outperforms state-of-the-art models in synthetic and real-world biomedical datasets.

Despite their impressive performance, Deep Neural Networks (DNNs) typically underperform Gradient Boosting Trees (GBTs) on many tabular-dataset learning tasks. We propose that applying a different regularization coefficient to each weight might boost the performance of DNNs by allowing them to make more use of the more…

2018-05-16abs ↗pdf ↗

GTDL methods fail to accurately model feature interactions in tabular data.

problem Accurate modeling of feature interactions in tabular data.
method Graph-based tabular deep learning methods using attention mechanisms and message-passing schemes.
result Current GTDL methods fail to recover meaningful feature interactions due to poor edge recovery.

SYNTHONY selects tabular synthesizers based on stress profiling and user intent.

problem Non-uniform performance of tabular generative models across datasets.
method Stress profiling and intent-conditioned tabular synthesis selection.
result Meta-features predict synthesizer performance, improving selection accuracy.

MIRRAMS framework tackles robust tabular learning under unseen missingness shifts.

problem Challenges in achieving robust predictive performance due to shifts in missingness distribution between training and test inputs.
method Introduces MI robustness conditions and MIRRAMS framework to enforce these conditions without specific missingness assumptions.
result Consistently outperforms existing state-of-the-art baselines and maintains stable performance under diverse missingness conditions.

Modeling the probability distribution of rows in tabular data and generating realistic synthetic data is a non-trivial task. Tabular data usually contains a mix of discrete and continuous columns. Continuous columns may have multiple modes whereas discrete columns are sometimes imbalanced making the modeling difficult.…

2019-07-01abs ↗pdf ↗

TabPFN model shows strong robustness to noisy data.

problem TabPFN tackles robustness to noisy and imperfect tabular data.
method Empirical robustness analysis of TabPFN's attention mechanisms under various perturbations.
result TabPFN maintains high predictive performance and coherent internal behavior under noisy and imperfect data.

We propose a novel high-performance and interpretable canonical deep tabular data learning architecture, TabNet. TabNet uses sequential attention to choose which features to reason from at each decision step, enabling interpretability and more efficient learning as the learning capacity is used for the most salient fea…

2019-08-20abs ↗pdf ↗

AdapTable adapts tabular models to shifts without source data, improving HELOC performance.

problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.

BiSHop tackles tabular data challenges with sparse Hopfield layers.

problem Non-rotationally invariant data structure and feature sparsity in tabular data.
method Sequential column-wise and row-wise processing through interconnected directional learning modules with generalized sparse modern Hopfield layers.
result BiSHop surpasses current SOTA methods with significantly less hyperparameter tuning.

A framework evaluates synthetic tabular data quality objectively.

problem Lack of an objective interpretation of tabular data metrics.
method Proposes a single mathematical objective for synthetic tabular data distribution, structurally decomposes it, and unifies existing metrics.
result Synthesizers that represent tabular structure outperform other methods, especially on smaller datasets.

CACTI improves tabular data imputation by leveraging missingness patterns and contextual information.

problem Tabular data imputation with improved accuracy and robustness.
method Masked autoencoding approach with median truncated copy masking and contextual information.
result Average R2R^2 gain of 7.8% over the next best method across various datasets and missingness conditions.

UnmaskingTrees improves tabular data imputation and generation using gradient-boosted decision trees.

problem Traditional methods outperform advanced deep learning techniques on tabular data imputation benchmarks.
method UnmaskingTrees employs gradient-boosted decision trees to incrementally unmask features for imputation and generation.
result UnmaskingTrees outperforms state-of-the-art methods on tabular imputation and generation benchmarks.