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

86172257343 · Jun 202019922001200920172026
48 results for Canonical target sequence

New ASR system handles multiple languages without needing language-specific encoding.

problem Joint training of data-rich and data-scarce languages in a single model.
method Transforms all languages to a single writing system through transliteration, separating modeling and rendering.
result Language-agnostic multilingual ASR system reduces WER up to 10% over language-dependent models.

While neural sequence generation models achieve initial success for many NLP applications, the canonical decoding procedure with left-to-right generation order (i.e., autoregressive) in one-pass can not reflect the true nature of human revising a sentence to obtain a refined result. In this work, we propose XL-Editor, …

2019-10-19abs ↗pdf ↗

Study the relationship between canonical polynomials and elliptic sequences for elliptic singularities.

problem Understanding the relationship between canonical polynomials and elliptic sequences for elliptic singularities.
method An inductive setup of elliptic germs and comparison of their canonical polynomials.
result The exponents of the canonical polynomial determine the elliptic sequence and vice versa under certain conditions.

AntBO optimizes antibody design using Bayesian optimization for efficient and effective CDRH3 sequence generation.

problem Designing optimal antigen-specific CDRH3 regions in antibody design due to combinatorial sequence space.
method Combinatorial Bayesian optimization framework with trust region for developability.
result AntBO designs CDRH3 regions with diverse biophysical properties and outperforms existing methods.

We prove a generalized version of Kazhdan's theorem for canonical forms on Riemann surfaces. In the classical version, one starts with an ascending sequence {SnS}\{S_n \rightarrow S\} of finite Galois covers of a hyperbolic Riemann Surface SS, converging to the universal cover. The theorem states that the sequence of for…

2018-08-01abs ↗pdf ↗

We prove that any contact metric (κ,μ)(κ,μ)-space (M,ξ,φ,η,g)(M,ξ,φ,η,g) admits a canonical paracontact metric structure which is compatible with the contact form ηη. We study such canonical paracontact structure, proving that it verifies a nullity condition and induces on the underlying contact manifold (M,η)(M,η) a sequence of com…

2010-03-06abs ↗pdf ↗

Proposes PSCCA for estimating correlations and canonical correlations in sparse count data.

problem Estimating correlations and canonical correlations in sparse count data from next-generation sequencing.
method Probabilistic approach for sparse count data sets (PSCCA).
result PSCCA outperforms other methods in estimating true correlations and canonical correlations at the natural parameter level.

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 ↗

This article studies hypoellipticity on general filtered manifolds. We extend the Rockland criterion to a pseudodifferential calculus on filtered manifolds, construct a parametrix and describe its precise analytic structure. We use this result to study Rockland sequences, a notion generalizing elliptic sequences to fil…

2017-05-03abs ↗pdf ↗

Deep generative model discovers inhibitors for unknown targets.

problem Discovering novel inhibitor molecules for unknown drug targets.
method Deep generative framework trained on protein sequences, small molecules, and interactions.
result Micromolar-level inhibition observed for two out of four synthesized candidates, including activity against SARS-CoV-2 variants.

New models improve morpheme segmentation in low-resource languages.

problem Improving morpheme segmentation in low-resource languages.
method Two new models: LSTM pointer-generator and sequence-to-sequence with hard monotonic attention.
result Novel models outperform existing ones by up to 11.4% accuracy in low-resource settings.

We construct a positive allowable Lefschetz fibration over the disk on any minimal weak symplectic filling of the canonical contact structure on a lens space. Using this construction we prove that any minimal symplectic filling of the canonical contact structure on a lens space is obtained by a sequence of rational blo…

2013-07-26abs ↗pdf ↗

Study shows volumes of knot complements are bounded by linear functions of geodesic periods.

problem Volume calculation of knot complements associated with geodesics on modular surfaces.
method Analyzes geodesics on modular surfaces, their associated knots, and their complements' volumes.
result Volumes of knot complements are bounded linearly by the period of geodesic continued fractions.

We examine Deep Canonically Correlated LSTMs as a way to learn nonlinear transformations of variable length sequences and embed them into a correlated, fixed dimensional space. We use LSTMs to transform multi-view time-series data non-linearly while learning temporal relationships within the data. We then perform corre…

2018-01-16abs ↗pdf ↗

Open problem seeks an online learning algorithm for binary classification.

problem Existence of an online learning algorithm for binary classification with sublinear mistakes.
method Assumption of sequence allowing learning algorithm's existence.
result Specific condition determines sequence's learnability.

Study SGD dynamics in sequence models, revealing training phases and influence of sequence length.

problem Understanding SGD in sequence models like attention networks.
method Derived closed-form population loss and analyzed SGD dynamics for SSI models.
result Two distinct training phases: escape from uninformative initialization and alignment with target subspace.

Given a sequential learning algorithm and a target model, sequential machine teaching aims to find the shortest training sequence to drive the learning algorithm to the target model. We present the first principled way to find such shortest training sequences. Our key insight is to formulate sequential machine teaching…

2018-10-15abs ↗pdf ↗

Introduces a reduction system for Artin-Tits groups, improving algorithms and proving periodicity results.

problem Computing reduction systems in Artin-Tits groups of spherical type.
method Introduces a canonical reduction system, proves periodicity of centralizers, and provides algorithms.
result Improved algorithms for computing reduction systems in braid groups and Artin-Tits groups.

Efficiently transforms samples from various statistical models.

problem Approximately transforming samples from one statistical model to another without knowing the source model's parameters.
method Constructs computationally efficient procedures to reduce uniform, Erlang, and Laplace models to general target families.
result Establishes nonasymptotic reductions between canonical high-dimensional problems, such as mixtures of experts, phase retrieval, and signal denoising.

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.

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.

mGENRE improves multilingual entity linking with autoregressive sequence prediction.

problem Multilingual Entity Linking (MEL) task of resolving language-specific mentions to a multilingual Knowledge Base.
method Autoregressive sequence-to-sequence system that cross-encodes mention strings and entity names.
result Over 50% improvement in average accuracy in zero-shot settings.

Study shows properties of Gromov-Hausdorff limit of frame bundles for non-collapsed manifolds.

problem Characterizing the Gromov-Hausdorff limit of orthonormal frame bundles of non-collapsed manifolds with bounded Ricci curvature.
method Analysis of the Gromov-Hausdorff limit space of orthonormal frame bundles equipped with an almost canonical metric.
result The singular set of the limit space has codimension 4\ge 4 and the complement contains an open and dense C1,αC^{1,\alpha}-Riemannian manifold.

The purpose of this short notice is to present an elementary summary of a few recent results obtained through the application of the formal theory of systems of partial differential equations and Lie pseudo groups to engineering (elasticity theory, electromagnetism, coupling phenomena) and mathematical (gauge theory, g…

2012-10-09abs ↗pdf ↗

In this paper we investigate the spectral sequence associated to a Riemannian foliation which arises naturally on a Vaisman manifold. Using the Betti numbers of the underlying manifold we establish a lower bound for the dimension of some terms of this cohomological object. This way we obtain cohomological obstructions …

2017-01-20abs ↗pdf ↗

We first study the degeneration of a sequence of Hermitian-Yang-Mills metrics with respect to a sequence of balanced metrics on a Calabi-Yau threefold X^\hat{X} that degenerates to the balanced metric constructed by Fu, Li, and Yau on the complement of finitely many (-1,-1)-curves in X^\hat{X}. Then under some assumpti…

2010-12-14abs ↗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 ↗

We prove a version of Gromov's compactness theorem for pseudo-holomorphic curves which holds locally in the target symplectic manifold. This result applies to sequences of curves with an unbounded number of free boundary components, and in families of degenerating target manifolds which have unbounded geometry (e.g. no…

2009-12-22abs ↗pdf ↗

We formulate a notion of stability for maps between polarised varieties which generalises Kontsevich's definition when the domain is a curve and Tian-Donaldson's definition of K-stability when the target is a point. We give some examples, such as Kodaira embeddings and fibrations. We prove the existence of a projective…

2017-08-31abs ↗pdf ↗

If f is a smooth function on a Hodge manifold, we construct a canonical sequence of real algebraic functions that converge to f in the smooth topology. The definition of of the approximants is inspired by Berezin-Toeplitz quantization. The proof follows quickly from known results of Fine, Liu and Ma.

2010-10-17abs ↗pdf ↗

Focusing on the grand-canonical extension of the ordinary restricted Boltzmann machine, we suggest an energy-based model for feature extraction that uses a layer of hidden units with varying size. By an appropriate choice of the chemical potential and given a sufficiently large number of hidden resources the generative…

2019-12-09abs ↗pdf ↗

A reductive structure is associated here with Lagrangian canonically defined conserved quantities on gauge-natural bundles. Parametrized transformations defined by the gauge-natural lift of infinitesimal principal automorphisms induce a variational sequence such that the generalized Jacobi morphism is naturally self-ad…

2007-12-06abs ↗pdf ↗

For every oriented surface of finite type, we construct a functorial Khovanov homology for links in a thickening of the surface, which takes values in a categorification of the corresponding gl(2) skein module. The latter is a mild refinement of the Kauffman bracket skein algebra, and its categorification is constructe…

2018-06-09abs ↗pdf ↗

In this paper we investigate fiber-wise linear complex Banach sub-Poisson structures defined canonically by the structure of a W*-algebra M. In particular we show that these structures are arranged in the short exact sequence of complex Banach sub-Poisson VB-groupoids with the groupoid of partially invertible elements …

2017-03-03abs ↗pdf ↗