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

13253850 · Jun 202019922001200920172026
48 results for tabular synthesis

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.

GACTGAN synthesizes tabular data better with less computational overhead.

problem Synthesizing mixed tabular data while balancing risk and utility.
method Integrates Bayesian posterior approximation with Stochastic Weight Averaging-Gaussian (SWAG) in CTGAN.
result GACTGAN produces better synthetic data with reduced privacy risk.

DP-FedTabDiff generates private synthetic tabular data using diffusion models and differential privacy.

problem Privacy-preserving synthetic data generation for tabular data in regulated domains.
method Combines Differential Privacy, Federated Learning, and Denoising Diffusion Probabilistic Models.
result Achieves significant privacy improvements without compromising data quality.

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.

CTGAN synthesizes population data for travel behavior simulation.

problem Synthesizing population data for agent-based transportation modeling.
method Composite Travel Generative Adversarial Network (CTGAN).
result Consistent and accurate generation of synthetic populations with tabular and sequential mobility data.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

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.

Novel unsupervised random forests improve density estimation and data synthesis.

problem Density estimation and data synthesis for complex tabular data.
method Recursive unsupervised random forests with alternating generation and discrimination rounds.
result Provable consistency and smooth densities with fast execution.

ReTabSyn synthesizes realistic tabular data efficiently by focusing on conditional distribution.

problem Synthesizing realistic tabular data in low-data, imbalanced settings.
method ReTabSyn uses reinforcement learning to prioritize feature correlation preservation during training.
result ReTabSyn consistently outperforms state-of-the-art baselines across various benchmarks.

Synthetic tabular data synthesis models balance utility and risk.

problem Generating synthetic tabular data for regulated domains.
method Latent flow models with various learning targets, paths, and sampling methods.
result Velocity and posterior matching objectives yield higher utility, while score and noise matching achieve lower risk.

Generative synthetic data can preserve predictive accuracy but distort causal inference.

problem Distortion of average treatment effect estimates in synthetic data.
method Hybrid synthetic-data framework that generates covariates while modeling treatment and outcome mechanisms separately.
result Hybrid synthesis improves causal fidelity compared to fully generative baselines.

Foundation models leak sensitive data in synthetic tabular data generation, especially LLaMA 3.3 70B.

problem Privacy leakage in synthetic tabular data generation using foundation models.
method Benchmarked three foundation models (GPT-4o-mini, LLaMA 3.3 70B, TabPFN v2) against four baselines on 35 real-world tables.
result Foundation models, especially LLaMA 3.3 70B, have the highest privacy risk in synthetic tabular data generation.

One of the impediments in advancing actuarial research and developing open source assets for insurance analytics is the lack of realistic publicly available datasets. In this work, we develop a workflow for synthesizing insurance datasets leveraging CTGAN, a recently proposed neural network architecture for generating …

2019-12-05abs ↗pdf ↗

Long horizon reinforcement learning is as hard as short horizon learning.

problem Understanding the difficulty of long horizon reinforcement learning problems.
method Introduced new concepts: ε-net for optimal policies and Online Trajectory Synthesis algorithm.
result Proved that sample complexity scales logarithmically with the planning horizon, refuting the conjecture.

Generative AI improves stock selection by synthesizing features from diverse data sources.

problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.

PrAda-GAN improves synthetic data generation under differential privacy.

problem Generating synthetic data under differential privacy with marginal-based methods.
method Sequential generator architecture integrating GAN and marginal-based approaches, with adaptive regularization of Bayes network structure.
result PrAda-GAN outperforms existing methods in privacy-utility trade-off on synthetic and real-world datasets.

PyTorch Frame simplifies multi-modal tabular learning with modular data and model handling.

problem Handling complex multi-modal tabular data in deep learning.
method A PyTorch-based framework that provides a data structure, model abstraction, and integration with external models.
result Demonstrated the effectiveness of PyTorch Frame in implementing and applying diverse tabular models to complex multi-modal tabular data.

ARF synthesizes epidemiological data to match original findings.

problem Synthetic data quality and privacy in epidemiology.
method Adversarial Random Forests (ARF) for efficient data synthesis.
result ARF-generated synthetic data consistently matches original epidemiological findings.

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.

The recent success of raw audio waveform synthesis models like WaveNet motivates a new approach for music synthesis, in which the entire process --- creating audio samples from a score and instrument information --- is modeled using generative neural networks. This paper describes a neural music synthesis model with fl…

2018-11-01abs ↗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.

GOTabPFN improves tabular model performance with compact tokenization for HDLSS data.

problem Making tabular models effective for high-dimensional, low-sample size data without retraining.
method Introducing Graph-guided Ordering with Local Refinement (GO-LR) and Neuro-Inspired Subunit Compression (NSC) to create compact meta-features.
result GOTabPFN improves stability and accuracy in tabular benchmarks with compact tokenization.

Orion-Bix combines biaxial attention and meta-learning for tabular few-shot learning.

problem Scaling and generalizing tabular models with mixed numeric and categorical fields, weak feature structure, and limited labeled data.
method Orion-Bix uses biaxial attention and meta-learned in-context reasoning to efficiently capture local and global dependencies.
result Orion-Bix outperforms gradient-boosting baselines and state-of-the-art tabular models on public benchmarks.

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.

DNF-Net tackles tabular data challenges with neural architecture.

problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.

JoLT uses LLMs to make probabilistic predictions on tabular data.

problem Making probabilistic predictions on tabular data efficiently and without preprocessing.
method JoLT leverages LLMs' in-context learning to define joint distributions over tabular data.
result JoLT outperforms other methods on tabular classification and regression tasks.

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.

SAINT improves neural networks for tabular data with row attention and contrastive pre-training.

problem Tabular data challenges in machine learning applications.
method SAINT combines row and column attention with contrastive self-supervised pre-training.
result SAINT outperforms previous deep learning methods and even gradient boosting methods on benchmark tasks.

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.

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.