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

Trend · papers per month

3016029031,204 · Jun 202019922001200920172026
48 results for Discrete Data Synthesis

Paper tackles goal-directed generation of discrete structures using conditional generative models.

problem Challenges in generating structured discrete data, especially for problems like program synthesis and materials design.
method Investigates conditional generative models to directly model the distribution of discrete structures given properties of interest. Introduces a novel approach to optimize a reinforcement learning objective.
result Improvements over maximum likelihood estimation and other baselines in generating molecules and identifying short python expressions.

The study examines optimal synthesis in a radially symmetric Grushin space with conditions on the weight function.

problem Optimal synthesis in a radially symmetric Grushin space with a weight function.
method Analysis of the geometry of R3\mathbb{R}^3 with a weighted Carnot-Carathéodory metric, providing conditions for Grushin-like structure, and describing optimal synthesis.
result Sufficient conditions on the weight function ensure a Grushin-like structure, and the candidate cut time coincides with the true cut time in the integrable case.

Deep generative models have been wildly successful at learning coherent latent representations for continuous data such as video and audio. However, generative modeling of discrete data such as arithmetic expressions and molecular structures still poses significant challenges. Crucially, state-of-the-art methods often …

2017-03-06abs ↗pdf ↗

Unsupervised model generates distinct intonation codes for speech synthesis.

problem Lack of understanding of what prosodic variations are controlled in speech synthesis.
method Phrase-level variational autoencoder with multi-modal prior, using mode centres as intonation codes.
result Generated intonation codes are perceptually distinct and carry various affect-related styles.

We establish a connection between two previously unrelated topics: a particular discrete version of conformal geometry for triangulated surfaces, and the geometry of ideal polyhedra in hyperbolic three-space. Two triangulated surfaces are considered discretely conformally equivalent if the edge lengths are related by s…

2010-05-15abs ↗pdf ↗

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.

Language models predict inorganic synthesis conditions and temperatures.

problem Limited data and heuristic approaches constrain inorganic synthesis planning.
method Language models without fine-tuning predict precursor conditions and temperatures.
result Language models achieve high accuracy in predicting synthesis conditions and temperatures.

Proposes a synthesis algorithm using Conformal Prediction for improved Deep Learning performance.

problem Assessing the quality of synthesised data for high-stake domains.
method Conformal Prediction framework for generating data from high-confidence feature space regions.
result Training sets extended with confident synthesised data improved Deep Learning performance by up to 61 percentage points F1-score.

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

InVAErt networks use data-driven methods for system synthesis and identifiability analysis.

problem Model synthesis and identifiability analysis for complex systems.
method Deterministic encoder and decoder, normalizing flow, variational encoder, loss function penalty coefficients, latent space sampling.
result Validation through various system types, demonstrating effectiveness of the framework.

New method improves inference for discrete diffusion models, achieving better quality and efficiency.

problem High dimensionality of discrete diffusion models causes inference challenges.
method Developed high-order numerical inference schemes for discrete diffusion models.
result Second-order accuracy of the θθ-Trapezoidal method in KL divergence.

CADD improves generative quality by augmenting discrete diffusion with continuous latent space.

problem Loss of semantic information between denoising steps in discrete diffusion models.
method Introduces a framework that augments discrete state space with a continuous latent space, allowing for graded, informative masked tokens.
result CADD improves generative quality across text generation, image synthesis, and code modeling.

Generative adversarial networks (GANs) are a recent approach to train generative models of data, which have been shown to work particularly well on image data. In the current paper we introduce a new model for texture synthesis based on GAN learning. By extending the input noise distribution space from a single vector …

2016-11-24abs ↗pdf ↗

Inverse Drum Machine separates drum mixes using transcription and synthesis.

problem Separating individual drum tracks from mixed recordings.
method Analysis-by-synthesis framework combining deep learning and automatic transcription.
result Separation quality comparable to supervised methods requiring isolated stems.

We present a program synthesis-oriented dataset consisting of human written problem statements and solutions for these problems. The problem statements were collected via crowdsourcing and the program solutions were extracted from human-written solutions in programming competitions, accompanied by input/output examples…

2018-07-06abs ↗pdf ↗

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.

Programming-by-example (PBE) is a synthesis paradigm that allows users to generate functions by simply providing input-output examples. While a promising interaction paradigm, synthesis is still too slow for realtime interaction and more widespread adoption. Existing approaches to PBE synthesis have used automated reas…

2020-02-07abs ↗pdf ↗

CrossBeam learns to search more efficiently in program synthesis.

problem Efficiently searching through vast program spaces.
method Trains a neural model to guide program synthesis, combining previously explored programs.
result CrossBeam explores much smaller portions of the program space compared to state-of-the-art methods.

Sequence-to-sequence text-to-speech (TTS) is dominated by soft-attention-based methods. Recently, hard-attention-based methods have been proposed to prevent fatal alignment errors, but their sampling method of discrete alignment is poorly investigated. This research investigates various combinations of sampling methods…

2019-10-28abs ↗pdf ↗

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.

Many real-world applications require robust algorithms to learn point processes based on a type of incomplete data --- the so-called short doubly-censored (SDC) event sequences. We study this critical problem of quantitative asynchronous event sequence analysis under the framework of Hawkes processes by leveraging the …

2017-02-22abs ↗pdf ↗

Coupling the high-fidelity generation capabilities of label-conditional image synthesis methods with the flexibility of unconditional generative models, we propose a semantic bottleneck GAN model for unconditional synthesis of complex scenes. We assume pixel-wise segmentation labels are available during training and us…

2019-11-26abs ↗pdf ↗

WeSinger improves singing voice synthesis with data augmentation and specialized modules.

problem Improving the accuracy and naturalness of synthesized singing voices.
method Developed a multi-singer Chinese neural singing voice synthesis system with deep bi-directional LSTM, Transformer, LPCNet, and data augmentation.
result WeSinger achieves state-of-the-art performance on the Opencpop corpus.

Generative Adversarial Networks have been crucial in the developments made in unsupervised learning in recent times. Exemplars of image synthesis from text or other images, these networks have shown remarkable improvements over conventional methods in terms of performance. Trained on the adversarial training philosophy…

2019-08-30abs ↗pdf ↗

PriorGrad improves speech synthesis models by using data-dependent adaptive priors.

problem Inefficiency in denoising diffusion models due to mismatch between prior and data distributions.
method Proposes PriorGrad, an adaptive prior derived from data statistics based on conditional information.
result PriorGrad achieves faster convergence and superior performance in speech synthesis models.

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.

Improved generative models using critically-damped Langevin diffusion.

problem Current score-based generative models (SGMs) use overly simplistic diffusion processes, leading to complex denoising tasks and suboptimal performance.
method Proposed a novel critically-damped Langevin diffusion (CLD) and derived a score matching objective and sampling scheme.
result CLD-based SGMs achieve superior performance in synthesis quality compared to previous methods.

DreamFusion uses text-to-image diffusion models to create 3D images efficiently.

problem Lack of large-scale 3D datasets and efficient architectures for 3D synthesis.
method Adapting a 2D diffusion model to 3D synthesis using a loss based on probability density distillation.
result A 3D model can be optimized from a 2D diffusion model, allowing for text-to-3D synthesis.

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 ↗

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.

Unified framework for DRO and DTA using Bayesian nonparametrics.

problem Combining DRO and DTA under ambiguity.
method Unified framework using DP and HDPs, with outlier robustness.
result Favorable performance in prediction accuracy and stability.

The problem of high-dimensional and large-scale representation of visual data is addressed from an unsupervised learning perspective. The emphasis is put on discrete representations, where the description length can be measured in bits and hence the model capacity can be controlled. The algorithmic infrastructure is de…

2019-01-24abs ↗pdf ↗

Novel framework uses synthetic data to quantify uncertainty in complex data.

problem Uncertainty quantification in complex, unstructured data.
method Perturbation-Assisted Sample Synthesis (PASS) and Perturbation-Assisted Inference (PAI) framework.
result Statistically guaranteed validity in inference, enhancing reliability of synthetic data.