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

Trend · papers per month

81162242323 · Jun 202019922001200920172026
48 results for Sequence Classifiers

Study on the structure of classifier boundaries in DNA sequencing.

problem Understanding the structure of boundaries in a Bayes classifier for DNA sequencing.
method Examined the structure of the boundary in a Bayes classifier applied to DNA sequencing data. Introduced a new measure of uncertainty, Neighbor Similarity.
result The boundary is large and complex, and Neighbor Similarity effectively measures classifier uncertainty.

Classifies intrinsically linked tournaments by their score sequences.

problem Classifying intrinsically linked tournaments using their score sequences.
method Examining the score sequences of tournaments and identifying linkless sequences.
result The vast majority of score sequences for 8-vertex tournaments are linkless.

RS-Del provides robustness for sequence classifiers against edit distance attacks.

problem Certifying robustness of discrete sequence classifiers against edit distance attacks.
method Randomized deletion (RS-Del) for discrete sequence classifiers, focusing on edit distance-bounded adversaries.
result Achieved a certified accuracy of 91% at an edit distance radius of 128 bytes on malware detection.

Differentiable language model attacks improve adversarial examples for categorical sequence classifiers.

problem Challenges in adversarial attacks for categorical sequence models due to non-differentiability.
method Fine-tuning a language model as a generator of adversarial examples, using a differentiable loss function that combines a surrogate classifier score and approximate edit distance.
result Semantically better and more resistant adversarial examples.

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.

When analyzing the genome, researchers have discovered that proteins bind to DNA based on certain patterns of the DNA sequence known as "motifs". However, it is difficult to manually construct motifs due to their complexity. Recently, externally learned memory models have proven to be effective methods for reasoning ov…

2017-02-22abs ↗pdf ↗

Proves a conjecture for a specific group using spectral sequences and homology.

problem Proves the Gromov-Lawson-Rosenberg Conjecture for the group Z/4xZ/4.
method Used the Adams spectral sequence and detection theorems to compute connective real k-homology.
result Determines differentials of the Adams spectral sequence and studies the cap structure of relevant sub-hopf algebras.

New algorithm classifies and generates genomic sequences using RG-flow categorifier.

problem Classifying and generating genomic sequences for disease prediction.
method RG-flow based categorifier combining quantum field theory, holographic duality, and neural ODEs.
result RG categorifier can classify and generate new sequences from genomic data.

Machine learning accurately diagnoses cancer from whole genome sequencing data.

problem Accurate cancer diagnosis at all stages.
method Novel MLAC (Machine Learning Against Cancer) method using next-gen RNA sequencing.
result Perfect precision, sensitivity, and specificity achieved for most tumor types.

Bayesian classifiers converge under certain exchangeability conditions with more data.

problem Predictive accuracy of marginal classifiers under varying data conditions.
method Introduced and compared mBpc and sBpc, provided computational scheme for PE sequences, and developed parameter estimation and testing methods.
result mBpc and sBpc converge under PE conditions with increasing data, validating mBpc's use.

We construct and analyse models of equivariant cohomology for differentiable stacks with Lie group actions extending classical results for smooth manifolds due to Borel, Cartan and Getzler. We also derive various spectral sequences for the equivariant cohomology of a differentiable stack generalising among others Bott'…

2019-12-01abs ↗pdf ↗

Non-coding RNA (ncRNA) are RNA sequences which don't code for a gene but instead carry important biological functions. The task of ncRNA classification consists in classifying a given ncRNA sequence into its family. While it has been shown that the graph structure of an ncRNA sequence folding is of great importance for…

2019-05-16abs ↗pdf ↗

The curve graph and related graphs are hyperbolic and have quasi-tree fibers.

problem Understanding the structure of the curve graph and related graphs.
method Analyzing a sequence of graphs with Lipschitz maps and proving hyperbolicity and quasi-tree properties.
result The graphs in the sequence are hyperbolic and have quasi-tree fibers, leading to bounds on asymptotic dimension and acylindrical actions.

Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.

problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.

Auto-regressive sequence-to-sequence models with attention mechanism have achieved state-of-the-art performance in many tasks such as machine translation and speech synthesis. These models can be difficult to train. The standard approach, teacher forcing, guides a model with reference output history during training. Th…

2019-09-26abs ↗pdf ↗

The study classifies tilings of the sphere by congruent quadrilaterals.

problem Classifying edge-to-edge tilings of the sphere by congruent quadrilaterals.
method Classification of tilings into three classes based on geometric data and parameters.
result Three classes of tilings are identified: 2-layer earth map tilings, quadrilateral subdivisions of the octahedron, and 3-layer earth map tilings.

Paper presents IMRCs for evolving tasks with forward and backward learning.

problem Incremental learning of evolving tasks with few samples per task.
method Incremental minimax risk classifiers (IMRCs) that exploit forward and backward learning.
result IMRCs provide significant performance improvement, especially with reduced sample sizes.

The standard approach to supervised classification involves the minimization of a log-loss as an upper bound to the classification error. While this is a tight bound early on in the optimization, it overemphasizes the influence of incorrectly classified examples far from the decision boundary. Updating the upper bound …

2016-06-29abs ↗pdf ↗

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.

Classifies colored links and spatial graphs up to colored link-homotopy.

problem Classifying colored links and spatial graphs up to colored link-homotopy.
method Using Habegger-Lin theory for colored string links, and extending to colored links and spatial graphs.
result Classification of colored links and spatial graphs up to colored link-homotopy.

Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using …

2014-06-03abs ↗pdf ↗

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.

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of empirically sampled sequences are available to a decision maker. The decision maker…

2019-12-03abs ↗pdf ↗