Model predicts variable length time series outputs.
problem Fixed-length prediction in recurrent networks.
method Sequence to sequence model with dynamic output length.
result Model balances prediction accuracy and length.
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.
169,181 papers · 148 categories
Trend · papers per month
48 results for “Sequence predictability”
Predicting Sequences of Traversed Nodes in Graphs using Network Models with Multiple Higher Orderscs.LG
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.
Study Thompson Sampling in adversarial bit prediction, finding regret bounds and optimal sequences.
problem Adversarial bit prediction with varying error weights.
method Thompson Sampling, analyzing sequences with largest and smallest regret.
result Regret bounds for adversarial bit prediction sequences, including optimal and worst-case scenarios.
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.
Our model improves sequence prediction accuracy and diversity.
problem Predicting future sequences with uncertainty and diversity.
method Gaussian Latent Variable model with 'Best of Many' sample objective.
result Empirically outperforms prior work on diverse tasks.
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.
From Credit Assignment to Entropy Regularization: Two New Algorithms for Neural Sequence Predictioncs.CL
Two new algorithms improve neural sequence prediction.
problem Credit assignment problem in reward augmented maximum likelihood learning.
method Proposes two sequence prediction algorithms: one with fine-grained credit assignment and the other with entropy regularization.
result Proposed algorithms outperform existing methods on benchmark datasets.
As high-throughput biological sequencing becomes faster and cheaper, the need to extract useful information from sequencing becomes ever more paramount, often limited by low-throughput experimental characterizations. For proteins, accurate prediction of their functions directly from their primary amino-acid sequences h…
Meta-learning improves event prediction from short sequences.
problem Predicting events from short sequences is challenging.
method Meta-learning approach using recurrent neural networks and monotonic neural networks.
result Meta-learning enhances long-term prediction performance.
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.
CF-VAE models capture multi-modal distributions for better structured sequence prediction.
problem Challenges in capturing multi-modality of future states in latent variable models.
method Conditional Flow Variational Autoencoders (CF-VAE) with conditional normalizing flows.
result CF-VAE achieves state-of-the-art results on multi-modal structured sequence prediction datasets.
Seq2seq models predict complex multi-physics systems' time evolution.
problem Predicting the time-evolution of complex multi-physics systems.
method Sequence-to-sequence models applied to multi-physics simulations.
result Seq2seq models accurately emulate complex systems and predict their evolution.
Generalized Earley Parser: Bridging Symbolic Grammars and Sequence Data for Future Predictionstat.ML
Generalized Earley parser predicts future events from sequence data.
problem Predicting future events from unsegmented, unlabeled sequence data.
method Integrates grammar parsing and classification for optimal segmentation and labels.
result Significantly outperforms other approaches in future human activity prediction.
Improved PSTs learn from approximate string matching.
problem Exact matching in PSTs limits predictive performance.
method Approximate suffix matching and self-bounded PST.
result Approximate matching PSTs outperform other variants.
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.
Bayesian model predicts sequences better than LSTMs by identifying underlying rules.
problem Current RNNs struggle to generalize from limited training data and identify underlying rules in sequences.
method Bayesian model that learns underlying concepts from sequences and generalizes to new data.
result Bayesian model predicts sequences better than traditional LSTMs.
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.
Improves NMT by sampling context from predicted sequence during training.
problem Error accumulation and overcorrection in NMT due to mismatched training and inference contexts.
method Samples context words from both ground truth and predicted sequences during training.
result Significant improvements on multiple datasets, including Chinese->English and WMT'14 English->German.
Generative models learn useful representations for complex sequential data.
problem Sequence prediction for high-dimensional input sequences.
method Three models based on Generative Stochastic Networks (GSN) for unsupervised sequence learning.
result GSNs provide evidence as a viable framework for complex sequential data.
WideDTA predicts drug-target binding affinity using text-based information.
problem Predicting drug-target binding affinity is a major challenge in drug discovery.
method WideDTA uses chemical and biological textual sequence information, including protein sequence, ligand SMILES, protein domains and motifs, and maximum common substructure words.
result WideDTA outperformed DeepDTA on the KIBA dataset, indicating the word-based sequence representation is a promising alternative.
Paper compares RNN models for anomaly detection, finding better performance in restoring current sequences.
problem Improving anomaly detection models in neural networks.
method Comparison of RNN Encoder-Decoder models focusing on future sequence prediction vs. current sequence restoration.
result Current sequence restoration outperforms future sequence prediction in anomaly detection models.
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…
A deep learning model predicts traffic conditions over multiple steps.
problem Multistep traffic forecasting on road networks.
method Attention Graph Convolutional Sequence-to-Sequence model (AGC-Seq2Seq) with attention mechanism.
result AGC-Seq2Seq model outperforms other models in multistep traffic prediction.
Generative Link Sequence Modeling predicts future links in evolving networks.
problem Predicting future links in networks with evolving structures.
method Sequence modeling framework with self-tokenization to capture temporal link formation patterns.
result GLSM achieves best performance on AUC metrics compared to existing methods.
A novel sequence-to-sequence model predicts missing sensor data.
problem Missing sensor data in sequences.
method Formulated a novel sequence-to-sequence model using forward and backward RNNs.
result The model produces the lowest errors in 12% more cases than the current state-of-the-art.
We develop a method to predict the average of a binary sequence with bounded error.
problem Predicting the average of a binary sequence with selective prediction.
method Online prediction algorithm with adaptive window selection.
result Expected squared error of for predicting the average.
Interdisciplinary comparison of sequence modeling methods for next-element prediction.
problem Comparing sequence modeling methods across different fields.
method Experimental evaluation of four real-life sequence datasets using machine learning, process mining, and grammar inference techniques.
result Machine learning techniques outperform interpretability-focused methods in next-element prediction accuracy.
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.
Convolutional network predicts DNA chromatin structure from sequence images.
problem Predicting chromatin structure from DNA sequences.
method Developed a convolutional neural network using image-representation of DNA sequences.
result The method outperforms existing methods in prediction accuracy and training time.
MTDS improves sequence generation adaptability via latent code control.
problem Lack of adaptability in sequence generation models like RNNs.
method Hierarchical multi-task dynamical systems (MTDS) with latent code control.
result MTDS enables style transfer, interpolation, and morphing in generated sequences.
Model predicts diverse chemical reactions for target compounds.
problem Making generalizable and diverse retrosynthetic reaction predictions.
method Transformer architecture with novel pre-training methods and a latent variable model.
result Improves performance on USPTO-50k dataset, generating more diverse predictions.
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.
CGAN fails to improve deterministic sequence predictions, revealing a theoretical limitation.
problem Improving deterministic sequence predictions with CGAN.
method Developed an adversarial content loss approach.
result CGAN does not improve deterministic sequence predictions.
We describe a fully data driven model that learns to perform a retrosynthetic reaction prediction task, which is treated as a sequence-to-sequence mapping problem. The end-to-end trained model has an encoder-decoder architecture that consists of two recurrent neural networks, which has previously shown great success in…
Deep learning models predict solar irradiance for short-term forecasts.
problem Accurate prediction of solar irradiance for renewable energy integration.
method Sequence-to-sequence LSTM models for GHI forecasting, incorporating spatial-temporal features.
result LSTM models outperform traditional techniques in short-term GHI forecasting.
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…
PANDA: Predicting the change in proteins binding affinity upon mutations using sequence informationq-bio.BM
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.
Model predicts multi-modal sequences using N-curves.
problem Capturing multi-modal data in sequential data.
method Neural network model based on Mixture Density Networks with Bézier curves.
result Smooth multi-mode predictions without Monte Carlo simulation.
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…
A new method predicts protein functions using variable-length sequences.
problem Computational methods for protein function prediction are slow and inaccurate for long sequences.
method Two feature sets: single fixed-sized segments and multi-sized segments, using bi-directional LSTM. Combined with MLDA features.
result Significant improvement in accuracy for long protein sequences.
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 , using a two-step strategy.
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.
CTCModel extends Keras for transparent CTC classification.
problem Handling unsegmented input sequences with labels related to subsets of frames.
method Combines Keras and CTC implementation in Tensorflow backend.
result CTCModel predicts sequences of labels from unsegmented input.
ChemBoost predicts protein-ligand binding affinity using SMILES syntax.
problem Predicting high affinity drug-target interactions from sequence similarity alone.
method ChemBoost uses SMILES syntax to represent ligands as documents and proteins as sequences or ligand-centric features. It learns chemical word embeddings and predicts affinities using eXtreme Gradient Boosting.
result ChemBoost outperforms state-of-the-art systems in predicting protein-ligand affinities.
A new neural sequence prediction method using error-correcting codes improves accuracy and convergence.
problem Improving neural sequence prediction accuracy and speed.
method Error-correcting output codes, separable code maximization, latent variable mixture sampling.
result Consistent improvements on language modeling datasets and text generation tasks.
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.