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,742 papers · 148 categories

Trend · papers per month

7.7%15.5%23.2%30.9% · Jun 202019922001200920172026
48 results for Synthetic benchmark datasets

In this paper, we propose a novel method for generating a synthetic dataset obeying Gaussian distribution. Compared to the commonly used benchmark datasets with unknown distribution, the synthetic dataset has an explicit distribution, i.e., Gaussian distribution. Meanwhile, it has the same characteristics as the benchm…

2019-06-01abs ↗pdf ↗

DIGEN benchmark provides synthetic datasets for ML algorithm evaluation.

problem Understanding and comparing machine learning algorithms' performance.
method Synthetic datasets generated using 40 mathematical functions to evaluate machine learning algorithms.
result DIGEN resource facilitates understanding why algorithms perform poorly and provides ideas for improvement.

TimeGraph creates synthetic datasets for robust time-series causal discovery.

problem Lack of reliable synthetic benchmark datasets for robust time-series causal discovery.
method Developed comprehensive synthetic datasets with temporal properties, including trends, seasonality, and noise.
result Demonstrated significant variations in algorithm performance under realistic temporal conditions.

SurvHTE-Bench benchmarks HTE estimation in survival analysis with diverse datasets.

problem Challenges in estimating HTEs from right-censored survival data.
method Modular synthetic datasets, semi-synthetic datasets, and real-world datasets.
result First rigorous comparison of survival HTE methods under diverse conditions.

DSLOB creates synthetic LOB data for benchmarking forecasting algorithms under distributional shifts.

problem Challenges in dealing with out-of-distribution limit order book data.
method Multi-agent market simulator to create labeled synthetic LOB dataset with and without market stress.
result Demonstrates the need for robust forecasting algorithms to handle distributional shifts.

MNIST-Nd offers synthetic datasets to benchmark clustering across dimensions.

problem Clustering performance degrades with high-dimensional data.
method Training mixture variational autoencoders on MNIST to create synthetic datasets with varying latent dimensions.
result Leiden clustering algorithm is most robust as dimensionality grows.

New benchmarks improve model performance by accounting for isomorphism classes in multi-relational datasets.

problem Synthetic multi-relational datasets lack isomorphism class awareness, leading to overestimation of model performance.
method Proposed isomorphism-aware synthetic benchmarks and a prioritisation scheme to improve model performance and stability.
result Isomorphism classes can be utilised to improve model performance, stability during training, and reduce training time.

Performing controlled experiments on noisy data is essential in understanding deep learning across noise levels. Due to the lack of suitable datasets, previous research has only examined deep learning on controlled synthetic label noise, and real-world label noise has never been studied in a controlled setting. This pa…

2019-11-21abs ↗pdf ↗

privGAN protects synthetic data from membership inference attacks.

problem Membership inference attacks on synthetic data generated by GANs.
method Developed a new GAN architecture (privGAN) that not only generates synthetic data but also defends against membership inference attacks.
result privGAN provides protection against membership inference attacks without significantly compromising downstream performance.

Graph learning is often unnecessary for common benchmarks, as node features can suffice.

problem The necessity of graph learning in common graph benchmarks is often assumed.
method We compared graph learning to feature-only models on seven datasets and found that graph structure often adds little to performance.
result Node features can often suffice for common graph benchmarks, challenging the orthodoxy.

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.

Study real-world noisy labels from human annotations for better understanding.

problem Understanding and modeling real-world label noise in machine learning.
method Developed two new benchmark datasets (CIFAR-10N, CIFAR-100N) with human-annotated real-world noisy labels.
result Real-world noisy labels exhibit instance-dependent patterns, not class-dependent as previously assumed.

Scoping review and benchmarking of synthetic EHR data generation methods.

problem Creating realistic synthetic electronic health records for research and training.
method Conducted a scoping review and benchmarked seven methods on open-source EHR datasets.
result GAN-based methods excel in fidelity and utility, while rule-based methods excel in privacy protection.

Natural experiment dataset reveals inconsistent treatment effect estimators.

problem Inconsistent results from over 20 estimators on a new dataset.
method Created a benchmark to evaluate estimator accuracy, derived variance formula, introduced new estimator.
result Doubly robust estimators outperform others by orders of magnitude.

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.

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.

CausalTime generates realistic time-series for TSCD evaluation.

problem Lack of realistic synthetic datasets for TSCD performance evaluation.
method Harnessing deep neural networks and normalizing flow for dynamics, extracting causal graphs, and deriving ground truth causal graphs.
result Generated datasets accurately reflect real data and ground truth causal graphs.

Generates synthetic data for benchmarking unsupervised outlier detection.

problem Difficulty in benchmarking unsupervised outlier detection due to rare and varied outliers in real data.
method Proposes a generic process to generate synthetic data with insightful characteristics.
result Demonstrates practicality of the generic process through a benchmark with state-of-the-art detection methods.

CTBench benchmarks cryptocurrency time series generation for trading applications.

problem Lack of comprehensive benchmarks for cryptocurrency time series generation.
method Developed a comprehensive benchmark extsf{CTBench} with 13 metrics across 5 dimensions.
result Uncovered trade-offs between statistical fidelity and real-world profitability.

We study the role of latent space dimensionality in Wasserstein auto-encoders (WAEs). Through experimentation on synthetic and real datasets, we argue that random encoders should be preferred over deterministic encoders. We highlight the potential of WAEs for representation learning with promising results on a benchmar…

2018-02-11abs ↗pdf ↗

This paper uses deep generative models to create synthetic financial data for portfolio and risk modeling.

problem Challenges in empirical research due to privacy, accessibility, and reproducibility issues in financial data.
method Investigates the use of Time-series Generative Adversarial Networks (TimeGAN) and Variational Autoencoders (VAEs) to generate synthetic financial return series.
result Synthetic data from TimeGAN closely mimics real financial data in distributional shapes, volatility, and autocorrelation.

Benchmark for math reasoning models from human proofs.

problem Measuring and accelerating machine learning models in high-level mathematical reasoning.
method Built a non-synthetic dataset from theorem prover proofs, defined a task for model to fill in missing propositions, used hierarchical transformer to improve performance.
result Neural models can capture non-trivial mathematical reasoning, hierarchical transformer outperforms baseline.

Private training and synthetic data generation using DP clustering.

problem Protecting sensitive data in deep neural networks training.
method Approximate input dataset with privately generated synthetic dataset using DP clustering.
result Simple two-layer neural network achieves SOTA classification accuracy on standard benchmark datasets.

Proposes K-Fold Causal BART for improved CATE estimation.

problem Improving estimation of Conditional Average Treatment Effects (CATE).
method K-Fold Causal Bayesian Additive Regression Trees (K-Fold Causal BART).
result K-Fold Causal BART is not state-of-the-art for ATE and CATE estimation in the IHDP dataset, but provides insights into model robustness and evaluation methods.

Mobility datasets are fundamental for evaluating algorithms pertaining to geographic information systems and facilitating experimental reproducibility. But privacy implications restrict sharing such datasets, as even aggregated location-data is vulnerable to membership inference attacks. Current synthetic mobility data…

2018-11-30abs ↗pdf ↗

Frugal Flows learn complex data and infer marginal causal effects.

problem Challenges in estimating marginal causal effects from complex data.
method Frugal Flows use normalizing flows to flexibly learn data and infer causal quantities.
result Frugal Flows can generate synthetic data that closely matches real-world data and exactly parameterize causal quantities.

Study benchmarks label noise detection methods, identifying best practices.

problem Label noise in real-world datasets affects model performance and evaluation reliability.
method Decomposed detection methods into label agreement, aggregation, and information gathering components; introduced a unified benchmark task and novel metric.
result In-sample probability aggregation with logit margin label agreement function achieves best results across scenarios.

We study the effect of structural variation in graph data on the predictive performance of graph kernels. To this end, we introduce a novel, noise-robust adaptation of the GraphHopper kernel and validate it on benchmark data, obtaining modestly improved predictive performance on a range of datasets. Next, we investigat…

2018-06-29abs ↗pdf ↗

Researchers compute Bayes error for classification models using normalizing flows.

problem Evaluating the inherent difficulty of classification problems.
method Invertible transformations and Gaussian base distributions to compute Bayes error.
result State-of-the-art models can achieve near-optimal accuracy but not always.

TabPFN doesn't outperform GLM and XGBoost for motor insurance pricing.

problem Improving insurance pricing models using Tabular Foundation Models (TFMs).
method Pre-training on synthetic datasets and in-context learning for inference.
result TabPFN does not consistently outperform established baselines, has longer inference times, and is sensitive to training set size.

A Python tool generates synthetic data for cluster analysis from high-level descriptions.

problem Creating synthetic data for cluster analysis is laborious and requires detailed geometric parameters.
method Proposes natural language-based synthetic data generation and implements it in a Python package.
result Makes it easy to set up interpretable and reproducible benchmarks for cluster analysis.