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

149299448597 · Jun 202019922001200920172026
48 results for sequence prediction

Predicts node sequences in graphs using multi-order network models.

problem Predicting sequences of node traversals in graphs.
method Combines multiple higher-order network models into a multi-order model, fitting and selecting the optimal maximum order.
result Outperforms state-of-the-art algorithms for next-element and full sequence prediction.

ATS2S model predicts RUL of industrial equipment using attention mechanism.

problem Accurate estimation of RUL for industrial equipment to improve maintenance schedules and reduce costs.
method ATS2S model that optimizes reconstruction and RUL prediction losses, uses attention mechanism, and integrates encoder and decoder features.
result ATS2S model achieves superior performance over 13 state-of-the-art methods on four real datasets.

New techniques improve channel prediction in noisy wireless systems.

problem Predicting channels in wireless communication systems from noisy observations.
method Adapted sequence-to-sequence models and transformers with reverse positional encoding and reversed encoder outputs.
result Improved robustness and relationship capture in channel prediction models.

New L2D framework allows deferring specific parts of a sequence prediction to experts.

problem Current L2D methods defer entire predictions, which is not ideal for long sequences.
method Proposes token-level and one-time rejectors to defer specific outputs of a model prediction to experts.
result Granular deferrals achieve better cost-accuracy tradeoffs than whole deferrals.

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.

This research tackles uncertainty estimation in autoregressive structured prediction tasks.

problem Ensuring safety and robustness of AI systems through accurate uncertainty estimation.
method Develops a unified probabilistic ensemble-based framework for token-level and sequence-level uncertainty estimation.
result Provides baselines for error and out-of-domain detection on translation and speech recognition datasets.

We present methods for online linear optimization that take advantage of benign (as opposed to worst-case) sequences. Specifically if the sequence encountered by the learner is described well by a known "predictable process", the algorithms presented enjoy tighter bounds as compared to the typical worst case bounds. Ad…

2012-08-18abs ↗pdf ↗

Prediction suffix trees (PST) provide an effective tool for sequence modelling and prediction. Current prediction techniques for PSTs rely on exact matching between the suffix of the current sequence and the previously observed sequence. We present a provably correct algorithm for learning a PST with approximate suffix…

2018-02-09abs ↗pdf ↗

Motivation: Prediction of the interaction affinity between proteins and compounds is a major challenge in the drug discovery process. WideDTA is a deep-learning based prediction model that employs chemical and biological textual sequence information to predict binding affinity. Results: WideDTA uses four text-based inf…

2019-02-04abs ↗pdf ↗

This thesis investigates unsupervised time series representation learning for sequence prediction problems, i.e. generating nice-looking input samples given a previous history, for high dimensional input sequences by decoupling the static input representation from the recurrent sequence representation. We introduce thr…

2018-04-18abs ↗pdf ↗

A new framework predicts links in time-dependent networks using Bernoulli autoregression.

problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.

Set-Sequence model learns cross-sectional dynamics directly from time series data.

problem Predicting large cross-sections of time series data with latent cross-sectional dynamics.
method A model that learns cross-sectional structure directly, enhancing expressivity and eliminating manual feature engineering.
result Significantly outperforms strong baselines in equity portfolio optimization and loan risk prediction.

Reinforcement learning after next-token prediction aids in learning from diverse sequence lengths.

problem Learning from sequences of varying lengths and complexity.
method Introducing a framework to study reinforcement learning with autoregressive transformers, focusing on next-token prediction and mixture distributions of short and long sequences.
result Reinforcement learning after next-token prediction enables autoregressive transformers to generalize from long sequences, even when they are rare.

We report an extension of a Keras Model, called CTCModel, to perform the Connectionist Temporal Classification (CTC) in a transparent way. Combined with Recurrent Neural Networks, the Connectionist Temporal Classification is the reference method for dealing with unsegmented input sequences, i.e. with data that are a co…

2019-01-23abs ↗pdf ↗

We study the Thompson sampling algorithm in an adversarial setting, specifically, for adversarial bit prediction. We characterize the bit sequences with the smallest and largest expected regret. Among sequences of length TT with k<T2k < \frac{T}{2} zeros, the sequences of largest regret consist of alternating zeros and …

2019-06-21abs ↗pdf ↗

Bayes-assisted confidence sequences improve efficiency for bounded means.

problem Efficient uncertainty quantification for bounded IID means without parametric assumptions.
method Bayesian working predictive model selects adaptive martingale updates maximizing predictive log-growth.
result Asymptotically log-optimal performance with informative priors reducing width and sampling effort.

Dynamical system models (including RNNs) often lack the ability to adapt the sequence generation or prediction to a given context, limiting their real-world application. In this paper we show that hierarchical multi-task dynamical systems (MTDSs) provide direct user control over sequence generation, via use of a latent…

2019-10-11abs ↗pdf ↗

Bandit structured prediction describes a stochastic optimization framework where learning is performed from partial feedback. This feedback is received in the form of a task loss evaluation to a predicted output structure, without having access to gold standard structures. We advance this framework by lifting linear ba…

2017-04-21abs ↗pdf ↗

PANDA predicts protein binding affinity changes from sequences, outperforming existing methods.

problem Accurately predicting changes in protein binding affinity due to mutations.
method Sequence-based machine learning approach using protein sequence information.
result PANDA achieves higher Pearson correlation coefficients than existing methods.

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state auto…

2008-12-10abs ↗pdf ↗

New algorithm improves interpretability in sequence classification.

problem Lack of human-independent interpretability metrics in sequence classification.
method Combines linear classifiers with background knowledge embeddings to create a new feature space.
result Preserves predictive power while delivering more interpretable models.

Transformers can predict pseudo-random sequences from LCGs with unseen parameters and moduli.

problem Learning pseudo-random number sequences from linear congruential generators with unknown parameters and moduli.
method Investigated the ability of Transformers to learn LCG sequences with varying complexity and moduli. Analyzed embedding layers and attention patterns.
result Transformers can predict pseudo-random sequences from LCGs with unseen parameters and moduli, up to mexttest=216m_{ ext{test}} = 2^{16}, using a two-step strategy.

The paper tackles video prediction by estimating conditional densities implicitly.

problem Temporal prediction uncertainty and high-dimensional probabilistic inference in natural scenes.
method Score-based conditional density estimation using sequence-to-image networks trained on a resilience-to-noise objective.
result The method handles occlusion boundaries and weights predictive evidence by reliability.

Improved incremental sequence classification with temporal consistency.

problem Updating predictions as new sequence elements are revealed.
method Temporal-difference learning and a temporal-consistency condition for successive predictions.
result Optimizing a novel loss function improves data efficiency and predictive accuracy.

Predicts cryptocurrency pump probability using sequence-based neural networks.

problem Detecting pump-and-dump schemes in cryptocurrency markets.
method Developed a sequence-based neural network (SNN) that encodes historical P&D events into sequences for prediction.
result SNN improves prediction accuracy by leveraging positional attention to extract useful information.

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.

In order to alleviate data sparsity and overfitting problems in maximum likelihood estimation (MLE) for sequence prediction tasks, we propose the Generative Bridging Network (GBN), in which a novel bridge module is introduced to assist the training of the sequence prediction model (the generator network). Unlike MLE di…

2017-06-28abs ↗pdf ↗

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002),…

2016-04-12abs ↗pdf ↗

CLVSA predicts financial market trends using LSTM and attention mechanisms.

problem Predicting trends in financial markets due to complex interactions.
method Hybrid model combining LSTM, sequence-to-sequence, attention, and convolutional LSTM.
result CLVSA outperforms basic models in predicting financial market trends.

Dual-CLVSA predicts financial markets using both trading data and sentiment measurements.

problem Predicting financial markets with complex interactions and emotional influences.
method Hybrid convolutional LSTM-based variational sequence-to-sequence model with attention.
result Dual-CLVSA effectively fuses trading data and sentiment measurements, improving prediction performance.