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

Trend · papers per month

1.8%3.7%5.5%7.3% · Jun 202019922001200920172026
48 results for code synthesis

PATOIS synthesizes code from natural language using learned code idioms.

problem Synthesizing general-purpose source code from natural language specifications is challenging.
method PATOIS uses a neural synthesizer that interleaves high-level and low-level reasoning, incorporating learned code idioms from a corpus.
result Using learned code idioms improves the synthesizer's accuracy on semantic parsing datasets.

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.

Auto-decoder synthesizes graphs from latent codes.

problem Creating new graph structures from specified distributions.
method Generative model learns latent codes from empirical distribution. Self-attention identifies likely connectivity patterns. Graph-based normalizing flows sample latent codes.
result Model outperforms state of the art by 1.5x in accuracy and 2x in speed.

System uses machine learning and automated reasoning to speed up PBE synthesis.

problem Slow synthesis in PBE due to domain-specific knowledge and large training datasets.
method Preprocess SyGuS PBE problems with a neural network to reduce search space, then use automated reasoning for faster solution.
result System outperforms all competing tools in the 2019 SyGuS Competition for the PBE Strings track by 47.65%.

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.

Flow-based generative models (Dinh et al., 2014) are conceptually attractive due to tractability of the exact log-likelihood, tractability of exact latent-variable inference, and parallelizability of both training and synthesis. In this paper we propose Glow, a simple type of generative flow using an invertible 1x1 con…

2018-07-09abs ↗pdf ↗

MEGAN models chemical reactions as graph edits, improving synthesis planning.

problem Generating and predicting chemical reactions under constraints.
method End-to-end encoder-decoder neural model inspired by arrow pushing formalism.
result State-of-the-art accuracy in standard benchmarks for retrosynthesis prediction.

In this paper we propose WaveGlow: a flow-based network capable of generating high quality speech from mel-spectrograms. WaveGlow combines insights from Glow and WaveNet in order to provide fast, efficient and high-quality audio synthesis, without the need for auto-regression. WaveGlow is implemented using only a singl…

2018-10-31abs ↗pdf ↗

Worldsheet wraps a 3D mesh sheet onto a single image to synthesize novel views.

problem Synthesizing novel views from a single image with large viewpoint changes.
method Shrink-wrapping a planar mesh sheet onto the input image, consistent with learned depth.
result Worldsheet consistently outperforms prior methods on single-image view synthesis.

Neural network synthesizes percussive sounds with adjustable timbral features.

problem Control over high-level timbral characteristics of percussive sounds.
method Feedforward convolutional neural network mapping input parameters to waveform.
result Changing input parameters produces a waveform congruent with desired characteristics.

Develops a new model for synthesizing and analyzing probability measures.

problem Synthesis and analysis of probability measures.
method Linear barycentric coding model (LBCM) using linear optimal transport (LOT) metric.
result Closed-form solution to 2-Wasserstein barycenters for compatible measures.

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.

Graph-based approach repairs programs from diagnostic feedback.

problem Learning to repair programs from limited labeled data and compiler error messages.
method Introduces program-feedback graph and graph neural network for reasoning, and self-supervised learning with unlabeled programs.
result DrRepair significantly outperforms prior work, achieving high repair rates.

Private method measures nonlinear correlations between data hosted across two entities.

problem Measuring nonlinear correlations between sensitive data hosted across multiple parties while preserving privacy.
method Differentially private estimator of distance correlation.
result First private estimator of nonlinear correlations in a multi-party setup.

Devign uses graph neural networks to identify vulnerabilities efficiently.

problem Challenging and tedious process of identifying vulnerabilities in software systems.
method Devign employs a graph neural network to classify graph-level vulnerabilities using comprehensive code semantic representations.
result Devign significantly outperforms state-of-the-art models in vulnerability identification.

This paper proposes learning priors for adversarial autoencoders to improve model expressiveness.

problem The choice of priors in deep latent factor models can significantly affect model expressiveness, especially for models with limited capacity.
method The authors introduce code generators to transform simple priors into ones that better characterize the data distribution for adversarial autoencoders.
result The proposed model generates better image quality and learns better disentangled representations than standard AAEs in supervised and unsupervised settings.

There is a widespread need for techniques that can discover structure from time series data. Recently introduced techniques such as Automatic Bayesian Covariance Discovery (ABCD) provide a way to find structure within a single time series by searching through a space of covariance kernels that is generated using a simp…

2016-11-21abs ↗pdf ↗

LION generates high-quality 3D shapes using hierarchical latent diffusion models.

problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.

Paper explores how non-neural simulators can enhance DP synthetic data generation.

problem Generating differentially private synthetic data without access to foundation models.
method Private Evolution (PE) framework using inference APIs and simulators.
result Sim-PE framework improves downstream classification accuracy and FID scores.

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 ↗

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.