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

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for parallel decoding

This work proposes an efficient autoregressive model for text generation.

problem The challenge of generating high-quality text with autoregressive models.
method Introduces a cascaded decoding approach using Markov transformers to achieve sub-linear parallel time generation.
result Shows competitive accuracy/speed tradeoff compared to existing methods on five machine translation datasets.

We introduce a new sampling method for large language models that balances diversity and parallelism.

problem Balancing diversity and parallelism in decoding for large language models.
method Arithmetic sampling framework compatible with various sampling variations.
result Improves estimation of expected BLEU score reward and reduces the gap with beam search.

Deep autoregressive sequence-to-sequence models have demonstrated impressive performance across a wide variety of tasks in recent years. While common architecture classes such as recurrent, convolutional, and self-attention networks make different trade-offs between the amount of computation needed per layer and the le…

2018-11-07abs ↗pdf ↗

We present RL-VAE, a graph-to-graph variational autoencoder that uses reinforcement learning to decode molecular graphs from latent embeddings. Methods have been described previously for graph-to-graph autoencoding, but these approaches require sophisticated decoders that increase the complexity of training and evaluat…

2019-04-18abs ↗pdf ↗

Most machine translation systems generate text autoregressively from left to right. We, instead, use a masked language modeling objective to train a model to predict any subset of the target words, conditioned on both the input text and a partially masked target translation. This approach allows for efficient iterative…

2019-04-19abs ↗pdf ↗

DOS improves language model generation by considering inter-token dependencies.

problem Lack of sequence-level information and inter-token dependencies in existing decoding strategies.
method Dependency-Oriented Sampler (DOS) that uses attention matrices to approximate inter-token dependencies.
result DOS consistently achieves superior performance on code generation and mathematical reasoning tasks.

This study presents a new lossy image compression method that utilizes the multi-scale features of natural images. Our model consists of two networks: multi-scale lossy autoencoder and parallel multi-scale lossless coder. The multi-scale lossy autoencoder extracts the multi-scale image features to quantized variables a…

2018-05-16abs ↗pdf ↗

Efficient autoregressive entity linking with correction for faster, more accurate results.

problem High computational cost and non-parallelizable decoding in autoregressive entity linking.
method Parallelizes autoregressive linking across all mentions, uses a shallow decoder, and adds a discriminative correction term.
result 70 times faster and more accurate than previous methods, outperforming state-of-the-art approaches.

A high-parallelism SNN improves feature learning efficiency and robustness.

problem Slow learning speed and limited learning capability in existing SNNs.
method Inspired by Inception modules, high-parallelism architecture, Vote-for-All decoding, adaptive repolarization mechanism.
result Superior performance and competitive accuracy compared to state-of-the-art unsupervised SNNs.

Inspired by recent advances in deep learning, we propose a novel iterative BP-CNN architecture for channel decoding under correlated noise. This architecture concatenates a trained convolutional neural network (CNN) with a standard belief-propagation (BP) decoder. The standard BP decoder is used to estimate the coded b…

2017-07-18abs ↗pdf ↗

Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product alg…

2014-05-25abs ↗pdf ↗

A machine learning method predicts rock permeability from 3D images.

problem Efficiently predict permeability of heterogeneous rocks for planetary and robotic applications.
method Machine learning guided 3D properties recognition of rock morphology from 3D micro CT and MRI images.
result The morphology decoder method accurately predicts permeability from 3D images.

The process of translation is ambiguous, in that there are typically many valid trans- lations for a given sentence. This gives rise to significant variation in parallel cor- pora, however, most current models of machine translation do not account for this variation, instead treating the prob- lem as a deterministic pr…

2018-05-28abs ↗pdf ↗

Singing voice conversion is a task to convert a song sang by a source singer to the voice of a target singer. In this paper, we propose using a parallel data free, many-to-one voice conversion technique on singing voices. A phonetic posterior feature is first generated by decoding singing voices through a robust Automa…

2019-03-11abs ↗pdf ↗

Enhanced transformer converts whispered speech to natural speech.

problem Machine recognition of whispered speech is challenging.
method Proposes an enhanced transformer architecture trained end-to-end using supervised learning.
result Similar formant distributions of converted speech to groundtruth.

Grammatical Error Correction (GEC) has been recently modeled using the sequence-to-sequence framework. However, unlike sequence transduction problems such as machine translation, GEC suffers from the lack of plentiful parallel data. We describe two approaches for generating large parallel datasets for GEC using publicl…

2019-04-10abs ↗pdf ↗

Framework converts singer identity and vocal technique from non-parallel corpora.

problem Converts singer identity and vocal technique from non-parallel corpora.
method Uses variational autoencoders with separate encoders for singer identity and vocal technique.
result Successfully disentangles and converts singer identity and vocal technique.

Power-SMC reduces inference latency for training-free LLM reasoning.

problem Training-free LLM reasoning with low latency.
method Power-SMC, a training-free Sequential Monte Carlo scheme targeting sequence-level power distribution.
result Power-SMC reduces inference latency from 16-28× to 1.4-3.3× over baseline decoding.

New method ensures consistent inference across different tensor parallel sizes for large language models.

problem Non-deterministic inference in large language models due to inconsistent reduction orders across GPUs.
method Tree-Based Invariant Kernels (TBIK) that align intra- and inter-GPU reduction orders through a unified hierarchical binary tree structure.
result Bit-wise identical results across different tensor parallel sizes for RL training.

We present KERMIT, a simple insertion-based approach to generative modeling for sequences and sequence pairs. KERMIT models the joint distribution and its decompositions (i.e., marginals and conditionals) using a single neural network and, unlike much prior work, does not rely on a prespecified factorization of the dat…

2019-06-04abs ↗pdf ↗

Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs. We introduce abstract syntax networks, a modeling framework for these problems. The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with …

2017-04-25abs ↗pdf ↗

Develops a braid-theoretic framework to analyze chirality in molecular knots.

problem Analyzing chirality in molecular knots constructed using circuit topology.
method Translated circuit topology approach to knot engineering into braid-theoretic framework, calculating Jones polynomial for binary combinations.
result Jones polynomial provides a powerful tool for analyzing chirality of molecular knots.

Study examines how decoding algorithms affect fairness in language generation models.

problem Impact of decoding algorithms on fairness in open-ended language generation.
method Systematic analysis of top-pp, top-kk, and temperature decoding algorithms.
result Decoding algorithms significantly impact fairness across demographic groups.