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

Trend · papers per month

54108162216 · Jun 202019922001200920172026
48 results for causal sequence decoding

A framework to explain decoder-only sequence classification models using intermediate predictions.

problem Explaining predictions of decoder-only sequence classification models.
method Progressive Inference framework with Single Pass-Progressive Inference and Multi Pass-Progressive Inference methods.
result Significantly better attributions compared to prior work on text classification tasks.

Pattern recognition in neuroimaging distinguishes between two types of models: encoding- and decoding models. This distinction is based on the insight that brain state features, that are found to be relevant in an experimental paradigm, carry a different meaning in encoding- than in decoding models. In this paper, we a…

2015-12-15abs ↗pdf ↗

New study finds best language model architecture and pretraining objective for zero-shot tasks.

problem Evaluating which language model architectures and pretraining objectives best enable zero-shot generalization.
method Compared three model architectures and two pretraining objectives across 170 billion tokens, with and without finetuning.
result Causal decoder-only models trained on autoregressive language modeling exhibit strongest zero-shot generalization.

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …

2018-09-06abs ↗pdf ↗

New insights into how encoder-decoder networks generate attention matrices.

problem Understanding how encoder-decoder networks use attention matrices.
method Decomposing hidden states into temporal and input-driven components.
result Attention matrices are formed based on task requirements, not architecture type.

A model learns causal representations from high-dimensional data.

problem Challenges in learning causal representations from high-dimensional data.
method Formulated a latent variable decoder model, Decoder BCD, for Bayesian causal discovery.
result Shows that using known intervention targets as labels helps in unsupervised Bayesian inference over structure and parameters.

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

A model learns stock trading rules from raw prices using encoder-decoder neural network.

problem Extracting features from long price sequences for profitable trading rules.
method Neural encoder-decoder framework combined with DRL.
result The model outperforms state-of-the-art models in dynamic environments.

Timer-XL predicts multidimensional time series using a unified Transformer approach.

problem Unified time series forecasting across various tasks and contexts.
method Decoder-only Transformers with a universal TimeAttention mechanism and deft position embedding.
result State-of-the-art performance across multiple forecasting benchmarks.

CAUSE learns Granger causality from event sequences, outperforming existing methods.

problem Learning Granger causality from complex, interdependent event sequences.
method CAUSE uses a neural point process to capture interdependency and an attribution method to extract Granger causality.
result CAUSE outperforms state-of-the-art methods in inferring inter-type Granger causality.

Training-free method improves large language model sequence quality via reward-guided sampling.

problem Optimizing large language model sequence quality over token likelihood.
method Reward-augmented target distribution combined with Sequential Monte Carlo sampling.
result Significant gains in sequence generation and mathematical reasoning tasks.

Generating logical form equivalents of human language is a fresh way to employ neural architectures where long short-term memory effectively captures dependencies in both encoder and decoder units. The logical form of the sequence usually preserves information from the natural language side in the form of similar token…

2018-07-19abs ↗pdf ↗

A framework infers causal direction from symbolic sequences using compression measures.

problem Inferring causal direction from two observed discrete symbolic sequences.
method Lossless compressors for inferring context-free grammars (CFGs) and quantifying compression extent.
result Grammar inferred from one sequence better compresses the other sequence, indicating causal direction.

Conformer encoder reverses sequence in time dimension, affecting decoder training.

problem Reversal of sequence in Conformer encoder impacts decoder training.
method Analyzed initial behavior of decoder cross-attention and proposed methods to avoid flipping.
result Self-attention module of Conformer starts dominating, allowing only reversed information to pass.

In this paper, we compare different types of Recurrent Neural Network (RNN) Encoder-Decoders in anomaly detection viewpoint. We focused on finding the model that can learn the same data more effectively. We compared multiple models under the same conditions, such as the number of parameters, optimizer, and learning rat…

2018-07-17abs ↗pdf ↗

A simple model explains phase transition in large language models.

problem Understanding the emergence of abilities in large language models.
method Modeling LLM as a sequence-to-sequence random function and using a list decoder.
result A critical threshold exists where the expected number of erroneous sequences grows exponentially.

This paper examines how different decoding algorithms for LLMs align with various goals.

problem Consistency of decoding algorithms with different goals in LLMs.
method Analysis of greedy, lookahead, random sampling, and temperature-scaled random sampling algorithms.
result Random sampling is consistent with the true probability distribution, but other goals require optimal algorithms for specific probability distributions.

GPT learns a causal world model from token predictions, validated in game sequences.

problem Does GPT implicitly learn a causal world model from token predictions?
method Derived a causal interpretation of GPT's attention mechanism and proposed zero-shot causal structure learning.
result GPT can generate legal next moves with high confidence for sequences with encoded causal structures, but fails for illegal moves.

Study reveals issues with neural autoregressive models and proposes mode recovery cost.

problem Unreasonable affinity of neural autoregressive models to short and long sequences.
method Investigates modes of ground-truth, empirical, and decoding-induced distributions via mode recovery cost.
result Mode recovery cost varies depending on ground-truth distribution and impacts decoding-induced distribution.

TIMeSynC combines financial service interactions for intent prediction.

problem Aligning and learning from multi-domain, multi-resolution sequences for accurate intent prediction.
method An encoder-decoder transformer model addressing sequence alignment, temporal dynamics, and dynamic/static sequence combination.
result Significant improvement in intent prediction over existing methods.

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 ↗

A latent-variable model is introduced for text matching, inferring sentence representations by jointly optimizing generative and discriminative objectives. To alleviate typical optimization challenges in latent-variable models for text, we employ deconvolutional networks as the sequence decoder (generator), providing l…

2017-09-21abs ↗pdf ↗

QATS efficiently decodes HMMs with polylogarithmic complexity.

problem Efficiently decoding hidden Markov models from noisy observations.
method Divide-and-conquer procedure with polylogarithmic sequence complexity and cubic state space complexity.
result QATS outperforms Viterbi and PMAP in speed and accuracy.

Steady progress has been made in abstractive summarization with attention-based sequence-to-sequence learning models. In this paper, we propose a new decoder where the output summary is generated by conditioning on both the input text and the latent topics of the document. The latent topics, identified by a topic model…

2019-08-19abs ↗pdf ↗

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

We present Piano Genie, an intelligent controller which allows non-musicians to improvise on the piano. With Piano Genie, a user performs on a simple interface with eight buttons, and their performance is decoded into the space of plausible piano music in real time. To learn a suitable mapping procedure for this proble…

2018-10-11abs ↗pdf ↗

Proposes TNCM-VAE for generating causal financial time series.

problem Lack of causal reasoning in market generators.
method Combines VAE with structural causal models, enforcing causal constraints through DAGs and using causal Wasserstein distance.
result Superior performance in counterfactual probability estimation, L1 distances as low as 0.03-0.10.