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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for sequence method

P3BO optimizes biological sequence design by combining multiple methods.

problem Variability in performance of black-box optimization methods for biological sequence design.
method Population-Based Black-Box Optimization (P3BO) that samples sequences from an ensemble of methods, weighting by past performance.
result P3BO outperforms individual methods, proposing higher quality and more diverse sequences.

This research explores various sampling methods and probability distributions for hard alignment in sequence-to-sequence TTS synthesis.

problem Improving alignment accuracy in sequence-to-sequence text-to-speech synthesis.
method Investigated various sampling methods (greedy, beam, random) and probability distributions (Bernoulli, Concrete) for hard alignment.
result Deterministic search is more preferable than stochastic search for natural alignment transition.

Sequence classification is an important data mining task in many real world applications. Over the past few decades, many sequence classification methods have been proposed from different aspects. In particular, the pattern-based method is one of the most important and widely studied sequence classification methods in …

2019-05-17abs ↗pdf ↗

The study compares different scRNA sequencing methods using a high-dimensional dataset.

problem To identify unique characteristics of different scRNA sequencing methods.
method Quantitative comparison through clustering analysis of a high-dimensional dataset.
result Identifies unique characteristics associated with different scRNA sequencing methods.

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.

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

problem Challenges in applying machine learning to biological sequences, including unreliable methods.
method Theoretical analysis and development of modified kernels to ensure reliability and accuracy.
result Developed kernels that are universal, characteristic, and metrize the space of distributions for biological sequences.

This paper proposes a new meta-learning method -- named HARMLESS (HAwkes Relational Meta LEarning method for Short Sequences) for learning heterogeneous point process models from short event sequence data along with a relational network. Specifically, we propose a hierarchical Bayesian mixture Hawkes process model, whi…

2019-09-04abs ↗pdf ↗

TCT learns multimodal sequence representations by translating from related sequences.

problem Challenges in learning semantic representations from multimodalities.
method Transformer based Cross-modal Translator (TCT) combined with Multimodal Transformer Network (MTN).
result Proposed method achieves new state-of-the-art performance on video-grounded dialogue.

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.

Detects outliers in continuous-time event sequences, including unexpected absences and occurrences.

problem Identifying unexpected events in event sequences that may indicate abnormal situations.
method Developed methods based on Bayesian decision theory and hypothesis testing for context-aware outlier detection.
result Effective methods for detecting outliers in both synthetic and real-world data.

Inferring the structural properties of a protein from its amino acid sequence is a challenging yet important problem in biology. Structures are not known for the vast majority of protein sequences, but structure is critical for understanding function. Existing approaches for detecting structural similarity between prot…

2019-02-22abs ↗pdf ↗

Develops methods to create manifolds with positive scalar curvature.

problem Creating sequences of manifolds with positive scalar curvature.
method Two new methods of constructing sequences of manifolds with positive scalar curvature.
result Examples of sequences of manifolds with positive scalar curvature converge to limit spaces with pulled regions.

End-to-end transformer model improves lexical stress detection accuracy.

problem Inaccurate phoneme boundaries and limited features for stress classification.
method End-to-end sequence to sequence model using transformer trained on feature sequences and phoneme sequences with stress marks.
result End-to-end model achieves better performance and lower phoneme error rate (6.36%) compared to syllable segmentation methods.

Many real-world applications require robust algorithms to learn point processes based on a type of incomplete data --- the so-called short doubly-censored (SDC) event sequences. We study this critical problem of quantitative asynchronous event sequence analysis under the framework of Hawkes processes by leveraging the …

2017-02-22abs ↗pdf ↗

nTreeClus clusters categorical sequences using tree-based learners and k-mers.

problem Challenges in clustering categorical and sequential data.
method nTreeClus uses Tree-based Learners, k-mers, and autoregressive models for categorical time series.
result nTreeClus outperformed baseline methods in various validation metrics.

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.

New methods tackle adversarial attacks on categorical sequences, improving model security.

problem Adversarial attacks on categorical sequence models, especially for money transactions and medical fraud.
method Two black-box adversarial attacks: Monte-Carlo and continuous relaxation methods.
result Generated adversarial sequences fool machine learning models but remain close to original ones.

A faster method for optimizing DNA and protein sequences using machine learning.

problem Designing DNA and protein sequences with improved function.
method Activation maximization with a straight-through approximation and adaptive entropy variable.
result Fast SeqProp achieves up to 100-fold faster convergence and improved fitness optima.

For any prime power qq and any dimension ss, a new construction of (t,s)(t,s)-sequences in base qq using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first general construction of (t,s)(t,s)-sequences that is not based on the digital metho…

2012-10-29abs ↗pdf ↗

A new method optimizes neural sequence models for better task performance.

problem Training neural sequence models with maximum likelihood estimation ignores task losses.
method Maximum likelihood guided parameter search (MGS) in the parameter space.
result MGS optimizes sequence-level losses, reducing repetition and non-termination.

Consider a general machine learning setting where the output is a set of labels or sequences. This output set is unordered and its size varies with the input. Whereas multi-label classification methods seem a natural first resort, they are not readily applicable to set-valued outputs because of the growth rate of the o…

2019-03-12abs ↗pdf ↗

Existence of an infinite sequence of harmonic maps between spheres of certain dimensions was proven by Bizon and Chmaj. This sequence shares many features of the Bartnik-McKinnon sequence of solutions to the Einstein-Yang-Mills equations as well as sequences of solutions that have arisen in other physical models. We ap…

1999-12-01abs ↗pdf ↗

Hybridizes CEM and gradient descent for efficient model-predictive control.

problem Efficiently planning optimal action sequences in high-dimensional spaces.
method Interleaves Cross-Entropy Method (CEM) and gradient descent steps.
result Faster convergence and avoidance of local optima compared to CEM.

Spacetimeformer learns spatiotemporal relationships from data alone.

problem Forecasting multivariate time series with distinct spatial relationships.
method Transformers with dynamic graph connections learning interactions between space, time, and value.
result Competitive results on various time series prediction benchmarks.

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 ↗

LES optimizes designs by sampling descent sequences, achieving strong sample efficiency.

problem Optimizing large, complex design spaces is infeasible and unnecessary.
method LES uses Bayesian optimization to target solutions reachable by iterative optimizers.
result LES achieves strong sample efficiency compared to existing methods.

We propose a novel adversarial learning strategy for mixture models of Hawkes processes, leveraging data augmentation techniques of Hawkes process in the framework of self-paced learning. Instead of learning a mixture model directly from a set of event sequences drawn from different Hawkes processes, the proposed metho…

2019-06-20abs ↗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.

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.

Events in the world may be caused by other, unobserved events. We consider sequences of events in continuous time. Given a probability model of complete sequences, we propose particle smoothing---a form of sequential importance sampling---to impute the missing events in an incomplete sequence. We develop a trainable fa…

2019-05-14abs ↗pdf ↗

Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation methods. An alternative approach to Monte Carlo simulation is the quasi-Monte Carl…

2014-03-22abs ↗pdf ↗