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

4549081,3611,815 · Jun 202019922001200920172026
48 results for General data distributions

New method ensures generated data statistics match real data distributions.

problem Ensuring generated data statistics match real data distributions in GANs.
method Added a new loss term to the generator loss function using f-divergences and kernel density estimation.
result Improved performance on synthetic and real-world datasets.

New polynomial convergence guarantees for SGM on general data distributions.

problem Efficient guarantees for multimodal and non-smooth distributions in SGM.
method Polynomial convergence guarantees for denoising diffusion models on general data distributions, with no assumptions on functional inequalities or smoothness.
result Wasserstein distance guarantees for distributions of bounded support or decaying tails, and TV guarantees for further smoothness assumptions.

Paper introduces CWDAE for better synthetic data generation.

problem Measuring discrepancy between generative and ground-truth distributions.
method Introduces mixture Cramer-Wold distance for joint and marginal distributional learning.
result CWDAE shows remarkable performance in generating synthetic data.

Federated learning studies separate client data and distribution gaps.

problem Understanding performance differences in federated learning across different datasets.
method Proposed a framework to disentangle out-of-sample and participation gaps.
result Dataset synthesis strategy is crucial for realistic simulations of federated learning generalization.

Paper proposes a new method for designing materials using deep learning.

problem Designing high-performance material distributions from given distributions.
method Iterative process of selecting, generating, and merging material distributions using a deep generative model.
result The method improves material performance through iterative refinement.

A new method generates synthetic data with realistic marginal distributions.

problem Generating synthetic data with bimodal and skewed marginal distributions.
method Pre-transformation variational autoencoders (PTVAEs) with separate parameter optimization for each variable.
result PTVAEs outperform other methods in generating synthetic data with bimodal and skewed distributions.

Study on distributed linear regression performance, focusing on generalization error.

problem Performance of distributed learning in large-scale linear regression.
method Statistical learning approach, focusing on generalization error.
result Generalization error of distributed solution can be higher than centralized solution.

Improved likelihood estimation for singular distributions using deep models.

problem Estimating singular distributions using deep generative models.
method Data perturbation to avoid singularity issues in likelihood estimation.
result Consistent estimation of target distribution with desirable rates.

We improve generative models for heavy-tailed multivariate data using an invariant statistical loss.

problem Traditional generative models struggle with heavy-tailed and multivariate data, leading to unstable training and mode dropping.
method We extend the invariant statistical loss method to handle heavy-tailed and multivariate data using a Pareto-ISL generator trained with input noise from a generalised Pareto distribution.
result Pareto-ISL accurately models the tails of heavy-tailed distributions while capturing central characteristics.

Study shows data heterogeneity affects distributed learning's generalization error.

problem Effect of data heterogeneity on distributed learning performance.
method Established bounds on generalization error using information-theoretic rate-distortion theory.
result Data heterogeneity improves generalization error for distributed learning.

LSDM uses unpaired data to match latent space distributions for generative modeling.

problem Generating high-quality images with limited paired data.
method Two-stage approach: latent space learning from paired and unpaired data, followed by joint distribution matching.
result LSDM enhances geometric fidelity in generated outputs and provides theoretical insights into LDMs.

Generative models learn complex data from low-dimensional manifolds.

problem Theoretical justification for generative models on manifold structures.
method Prove statistical guarantees of generative networks under Wasserstein-1 loss, considering intrinsic dimensionality.
result Generative networks converge to zero at a fast rate depending on intrinsic dimensionality, not ambient data dimension.

New VAE model improves data fitting without sacrificing computational efficiency.

problem Limitation of Gaussian assumption in VAE for continuous variable fitting.
method Infinite mixture of asymmetric Laplace distribution in decoder, nonparametric M-estimator for quantile estimation.
result Model demonstrates superior data privacy adjustment and better distribution fitting.

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.

Generative models learn distributions of continuous functions.

problem Training generative models on discretized grids limits model size and data type.
method Parameterize data points by continuous functions, learn distributions over these functions.
result Models can learn rich distributions of functions independently of data type and resolution.

Study on how kernel regression models generalize to out-of-distribution data.

problem Understanding generalization in machine learning models under distributional shifts.
method Replica method from statistical physics to derive analytical formula for generalization error.
result Identified overlap matrix as key determinant of generalization performance under distribution shift.

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.

A novel framework synthesizes treatment data across sites using optimal transport.

problem Estimating treatment effects across different sites with varying conditions.
method Distributional causal inference, Optimal Transport for alignment of control group distributions.
result Synthetic treatment group data aligns with true target distribution under general conditions.

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

Generative Distribution Embeddings learn multiscale representations of distributions.

problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.

DDG-DA predicts future data distribution to adapt models for predictable concept drift.

problem Adapting models to streaming data with predictable concept drift.
method Train a predictor to forecast future data distribution, generate training samples, and train models on them.
result Significant improvement on multiple models in real-world tasks.

Generative models help make decisions under changing data distributions.

problem Making decisions based on historical data when the actual data distribution changes.
method Flow- and score-based generative models to represent and transform distributions.
result Generative models can learn nominal uncertainty, create stressed distributions, and produce conditional distributions.

The paper addresses the selection of synthetic data for improving classifier performance, focusing on the role of covariance shift.

problem The effectiveness of synthetic data in improving classifier performance is questioned, and the specific properties affecting this performance are unclear.
method The paper uses high-dimensional regression to analyze synthetic data selection, focusing on the covariance shift between synthetic and target distributions.
result The covariance shift between synthetic and target distributions affects the generalization error of classifiers, but the mean shift does not.

We introduce DQFIM to quantify and improve generalization of quantum machine learning models.

problem Understanding and improving generalization of quantum machine learning models.
method Data quantum Fisher information metric (DQFIM) to quantify circuit parameters and training data.
result Improves generalization by breaking symmetries of training data and using a low number of training states.

This work improves SGMs' convergence guarantees for semiconvex distributions with discontinuous gradients.

problem Establishing convergence guarantees for SGMs under weak regularity conditions.
method Developed non-asymptotic Wasserstein-2 convergence analysis for SGMs targeting semiconvex distributions with discontinuous gradients.
result Achieved optimal dependence of O(d)O(\sqrt{d}) on data dimension dd and convergence rate of order one.

Study quantifies distribution shifts and uncertainties to improve machine learning model robustness.

problem Distribution shifts between training and test datasets impact model generalization and robustness.
method Synthetic data generation and quantitative measures (KL divergence, JS distance, Mahalanobis distance) to assess data similarity and model uncertainty.
result Utilizing statistical measures like Mahalanobis distance helps assess distribution shift and model uncertainty.

This paper improves diffusion models for low-dimensional data.

problem Theoretical foundations of diffusion models are lacking for low-dimensional data.
method Score approximation, estimation, and distribution recovery of diffusion models on low-dimensional data.
result Sample complexity bounds for distribution estimation using diffusion models are provided.

CAN learns conditional and interventional distributions from unlabeled data.

problem Learning conditional and interventional distributions from unlabeled data.
method CAN framework with LGN and CIGN architectures, equipped with an intervention mechanism.
result CAN generates both interventional and conditional samples without needing the causal graph.

Developments in deep generative models have allowed for tractable learning of high-dimensional data distributions. While the employed learning procedures typically assume that training data is drawn i.i.d. from the distribution of interest, it may be desirable to model distinct distributions which are observed sequenti…

2017-05-23abs ↗pdf ↗

OMASGAN generates anomalous samples on distribution boundary to improve anomaly detection.

problem Missed anomalies and low AD performance due to OoD samples in generative models.
method OMASGAN generates anomalous samples on the estimated distribution boundary using a GAN approach, refining AD models.
result OMASGAN improves AD performance by at least 0.24 and 0.07 points on average on MNIST and CIFAR-10 datasets.

Generative algorithms learn high-dimensional data efficiently and generate new samples.

problem Learning from scarce high-dimensional data.
method Lipschitz-regularized gradient flows and particle-based algorithms.
result Correctly transports gene expression data points with high dimensionality.

Paper proposes a method to estimate total variation distance for synthetic data fidelity.

problem Assessing the fidelity of synthetic data generated by AI.
method Discriminative approach to estimate total variation distance between two distributions.
result Estimation of total variation distance reduces to quantifying Bayes risk in classification.

TailGAN uses GANs to detect anomalies near data distribution tails.

problem Anomaly detection near data distribution tails with current GAN limitations.
method TailGAN leverages GANs with maximum entropy regularization to generate and detect anomalies near data distribution tails.
result TailGAN achieves competitive performance on various datasets compared to existing methods.

FedGAN trains GANs across distributed data sources with reduced communication.

problem Training GANs across non-independent data sources with privacy and communication constraints.
method FedGAN uses local generators and discriminators synced via an intermediary, proving convergence under standard assumptions.
result FedGAN converges and performs similarly to general distributed GANs with reduced communication complexity.