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

8162331 · Jun 202019922001200920172026
48 results for subroutine synthesis

A new approach for specifying and synthesizing subroutines for optimizing metrics.

problem Specifying and optimizing subroutines for various metrics.
method Formalizing programming by rewards (PBR), using continuous-optimization techniques to synthesize decision functions as if-then-else programs.
result Synthesized decision functions are optimal in cases when rewards have nice properties.

This paper evaluates how well neural models can solve complex tasks by breaking them into simpler ones.

problem Measuring neural models' ability to solve complex tasks by breaking them into simpler subtasks.
method Characterized axes of compositional generalization, introduced a benchmark suite of tasks, and improved Transformer models' attention mechanisms.
result Modified Transformer models generally perform better than natural baselines in solving complex tasks, but challenges remain.

Neural networks struggle with long sequences, but a new method improves their performance.

problem Neural networks struggle to generalize to longer sequences and unseen data.
method Proposed a learned conditional masking mechanism and binary encoding for numbers.
result Models can now generalize far outside their training range with near-perfect accuracy.

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 ↗

Study shows effectiveness of offline RL in online RL tasks.

problem Improving online RL efficiency using offline RL data.
method Formalized framework for incorporating offline RL as online RL subroutines, introducing techniques to enhance effectiveness.
result Effectiveness of the framework depends on task nature, techniques greatly enhance effectiveness, and existing methods are ineffective.

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.

New algorithm achieves optimal regret in average reward MDPs without prior bias information.

problem Achieving optimal regret in average reward MDPs with computational efficiency and without prior bias information.
method Projective Mitigated Extended Value Iteration (PMEVI) to compute bias-constrained optimal policies efficiently.
result First tractable algorithm with minimax optimal regret of O~(sp(h)SAT)\widetilde{\mathrm{O}}(\sqrt{\mathrm{sp}(h^*) S A T}).

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.

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.

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.

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 ↗

Local causal structure learning aims to discover and distinguish direct causes (parents) and direct effects (children) of a variable of interest from data. While emerging successes have been made, existing methods need to search a large space to distinguish direct causes from direct effects of a target variable \emph{T…

2019-10-03abs ↗pdf ↗

Model for directed synthesis of audio textures using multi-scale RNNs.

problem Challenges in modeling complex audio textures with traditional methods.
method Combining multi-scale RNNs with a conditioning strategy for user-directed synthesis.
result Demonstrated improved performance on various audio texture datasets.

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 ↗

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.

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.

This paper explores optimising acquisition functions in Bayesian optimisation.

problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.

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 ↗

We propose a framework that directly tackles the probability distribution of the value function parameters in Deep Q Network (DQN), with powerful variational inference subroutines to approximate the posterior of the parameters. We will establish the equivalence between our proposed surrogate objective and variational i…

2017-11-30abs ↗pdf ↗

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.

Principles of financial product synthesis from a few basic financial products constitute an interesting research topic inspired by Islamic finance. We make an effort to answer general questions that should be answered before starting to investigate the main issues concerning this topic with the formalization of financi…

2010-12-20abs ↗pdf ↗

Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby incurring a possibly large representation cost because exit values refer to nonlocal a…

2012-06-27abs ↗pdf ↗

Improved texture synthesis using wavelet-based statistics with rectifier non-linearity.

problem Improving texture synthesis quality using wavelet representations.
method Proposes a family of statistics based on non-linear wavelet representations with a generalized rectifier non-linearity.
result Significantly improves visual quality of texture synthesis compared to classical wavelet-based models.

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 ↗