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

66133199265 · Jun 202019922001200920172026
48 results for fully synthetic

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.

TempoPFN models for zero-shot time series forecasting using synthetic data.

problem Efficient long-horizon prediction and reproducibility in zero-shot time series forecasting.
method Linear RNNs pre-trained on synthetic data with GatedDeltaProduct architecture and state-weaving.
result Achieves top-tier competitive performance on various benchmarks.

Developed a new method to generate synthetic data while protecting privacy.

problem Protecting privacy of human participant data while making it publicly accessible.
method A multi-step framework based on Classification and Regression Trees and an original distance-based filtering.
result Satisfactory protection against attribute disclosure attacks and formal prevention of membership disclosure attacks.

Synthetic augmentation helps but not always in imbalanced learning.

problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.

TASC improves synthetic control for time-series data with trends.

problem Inability of existing SC methods to fully utilize temporal structure in time-series data.
method TASC uses a state-space model with a constant trend and Kalman filter for counterfactual inference.
result TASC offers advantages in settings with strong temporal trends and high observation noise.

We propose the first fully-adaptive algorithm for pure exploration in linear bandits---the task to find the arm with the largest expected reward, which depends on an unknown parameter linearly. While existing methods partially or entirely fix sequences of arm selections before observing rewards, our method adaptively c…

2017-10-16abs ↗pdf ↗

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.

We show that there is a fully faithful embedding of the category of manifolds with corners into the Cahiers topos, one of the premier models for Synthetic Differential Geometry. This embedding is shown to have a number of nice properties, such as preservation of open covers and transverse fibre products. We develop a t…

2015-03-25abs ↗pdf ↗

LcGAN generates synthetic CT images for hemorrhagic lesion segmentation.

problem Scarce training data for hemorrhagic lesion segmentation.
method Lesion conditional Generative Adversarial Network (LcGAN) for synthetic image generation.
result Segmentation improved by 12.8% with synthetic data augmentation.

This paper addresses the problem of blind and fully constrained unmixing of hyperspectral images. Unmixing is performed without the use of any dictionary, and assumes that the number of constituent materials in the scene and their spectral signatures are unknown. The estimated abundances satisfy the desired sum-to-one …

2014-03-03abs ↗pdf ↗

In this paper, we consider matrix completion from non-uniformly sampled entries including fully observed and partially observed columns. Specifically, we assume that a small number of columns are randomly selected and fully observed, and each remaining column is partially observed with uniform sampling. To recover the …

2018-06-27abs ↗pdf ↗

We propose a categorical data synthesizer with a quantifiable disclosure risk. Our algorithm, named Perturbed Gibbs Sampler, can handle high-dimensional categorical data that are often intractable to represent as contingency tables. The algorithm extends a multiple imputation strategy for fully synthetic data by utiliz…

2013-12-18abs ↗pdf ↗

SrvfNet aligns multiple functional data to templates without supervision.

problem Aligning large collections of functional data to templates without labeled data.
method Generative deep learning framework using SRVF and fully-connected layers.
result Framework achieves alignment and optimal template prediction without supervision.

SMEs provide a transparent testbed for RL evaluation.

problem Lack of precise, white-box diagnostics in RL environments.
method Synthetic Monitoring Environments (SMEs) with fully configurable task characteristics and known optimal policies.
result SMEs allow for precise evaluation of RL algorithms, revealing the impact of specific environmental properties.

A variety of methods existing for generating synthetic electronic health records (EHRs), but they are not capable of generating unstructured text, like emergency department (ED) chief complaints, history of present illness or progress notes. Here, we use the encoder-decoder model, a deep learning algorithm that feature…

2018-06-01abs ↗pdf ↗

Research on style transfer and domain translation has clearly demonstrated the ability of deep learning-based algorithms to manipulate images in terms of artistic style. More recently, several attempts have been made to extend such approaches to music (both symbolic and audio) in order to enable transforming musical st…

2019-07-04abs ↗pdf ↗

Unsupervised algorithm parses CSG images into CFG without pretraining.

problem Sparse reward problem in unsupervised program synthesis for images.
method Grammar-encoded tree LSTM, entropy regularization, sampling without replacement.
result Recover meaningful programs in large search spaces (up to 3.8imes10283.8 imes 10^{28}).

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.

Paper proposes a method to generate synthetic anomalies for robust anomaly detection.

problem Anomaly detection struggles with unbalanced data and rare anomalies.
method Two-level hierarchical latent space representation for feature distillation and synthesis.
result The method creates robust synthetic anomalies for training robust binary classifiers.

AI enhances pollen recognition in veterinary imaging using holographic microscopy.

problem Challenges in recognizing pollen in holographic images due to speckle noise and artifacts.
method Training YOLOv8s and MobileNetV3L on dual-modality dataset, employing WGAN-SN for synthetic data augmentation.
result GAN-based augmentation improves object detection and classification in holographic images, closing the performance gap.

This paper proposes a method to reveal task relationships in multi-task learning models using sparse graphs.

problem Understanding the underlying task relationships in multi-task learning models.
method Proposes a bilevel formulation of multi-task learning that induces sparse graphs.
result The method improves interpretability of multi-task learning models without sacrificing generalization performance.

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 ↗

A new method for generating synthetic data using posterior distribution learning accelerates inference.

problem Generating high-quality synthetic data requires many discretization steps, which is computationally expensive.
method Learning the posterior distribution of clean data samples given noisy versions, using a scoring rule instead of regression loss.
result Consistently outperforms standard diffusion models at few discretization steps.

Integrates MRF into multimodal VAE for better complex intermodal interactions.

problem Lack of effective modeling of complex intermodal interactions in multimodal VAEs.
method Incorporates Markov Random Field into prior and posterior distributions of multimodal VAE.
result Demonstrates superior performance in managing complex intermodal dependencies.

BARK optimizes black-box functions using Bayesian Additive Regression Trees.

problem Bayesian optimization of complex, black-box functions with uncertainty quantification.
method BART Kernel using tree agreement for posterior over piecewise-constant functions, explored using MCMC.
result BARK obtains samples of Gaussian processes for function distributions, enabling acquisition functions for optimization.

Study uses synthetic data to estimate credit risk for underbanked consumers in Istanbul.

problem Estimating credit risk for underbanked consumers lacking formal credit records.
method Created synthetic dataset, used retrieval augmented generation, trained CatBoost, LightGBM, and XGBoost models.
result Alternative financial data improves credit risk estimation, raising AUC by 13%.

The study confirms that market volatility can be explained by correlated metaorders impacting prices in a square-root fashion.

problem Explaining market volatility using metaorders and their impact.
method Generated synthetic market data and analyzed the correlation between order flow and returns.
result The square-root law of market impact is confirmed and can be measured from anonymized trade data.

We present the first fully variational Bayesian inference scheme for continuous Gaussian-process-modulated Poisson processes. Such point processes are used in a variety of domains, including neuroscience, geo-statistics and astronomy, but their use is hindered by the computational cost of existing inference schemes. Ou…

2014-11-02abs ↗pdf ↗

We present an adaptive approach to the construction of Gaussian process surrogates for Bayesian inference with expensive-to-evaluate forward models. Our method relies on the fully Bayesian approach to training Gaussian process models and utilizes the expected improvement idea from Bayesian global optimization. We adapt…

2018-09-27abs ↗pdf ↗

Variable selection is one of the most important tasks in statistics and machine learning. To incorporate more prior information about the regression coefficients, the constrained Lasso model has been proposed in the literature. In this paper, we present an inexact augmented Lagrangian method to solve the Lasso problem …

2019-03-12abs ↗pdf ↗

The superposition of temporal point processes has been studied for many years, although the usefulness of such models for practical applications has not be fully developed. We investigate superposed Hawkes process as an important class of such models, with properties studied in the framework of least squares estimation…

2017-10-14abs ↗pdf ↗

Extends field theory foundations to infinitesimal spaces, simplifying complex concepts.

problem Develop rigorous foundations for field theory, especially for infinitesimal spaces.
method Formulates local Lagrangian field theory in a new category of thickened smooth sets.
result Establishes a firm foundation for field theory, including tangent bundles and perturbative considerations.

New estimators improve sparse semiparametric additive modeling.

problem Sparse semiparametric additive modeling with structured sparsity.
method Combines group subset selection with shrinkage for nonconvex optimization.
result New estimators outperform alternatives in synthetic and real-world data.