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.
This paper improves neural network explanations by quantifying and visualizing semantic compositions.
Paper analyzes word embedding composition using tensor decomposition.
We introduce a graphical calculus for computing morphism spaces between the categorified spin networks of Cooper and Krushkal. The calculus, phrased in terms of planar compositions of categorified Jones-Wenzl projectors and their duals, is then used to study the module structure of spin networks over the colored unknot…
System learns to combine multiple model components for personalized text generation.
In this paper, we propose Neural Phrase-to-Phrase Machine Translation (NPMT). Our model uses a phrase attention mechanism to discover relevant input (source) segments that are used by a decoder to generate output (target) phrases. We also design an efficient dynamic programming algorithm to decode segments that all…
Transformer improves pop piano composition by incorporating beat-based structure.
Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.
In this paper, we present Neural Phrase-based Machine Translation (NPMT). Our method explicitly models the phrase structures in output sequences using Sleep-WAke Networks (SWAN), a recently proposed segmentation-based sequence modeling method. To mitigate the monotonic alignment requirement of SWAN, we introduce a new …
In 2005 V. Turaev introduced the theory of topology of words and phrases. Turaev defined an equivalence relation on generalized words and phrases which is called homotopy. This is suggested by the Reidemeister moves in the knot theory. Then Turaev gave the homotopy classification of generalized words with less than or …
Music relies heavily on repetition to build structure and meaning. Self-reference occurs on multiple timescales, from motifs to phrases to reusing of entire sections of music, such as in pieces with ABA structure. The Transformer (Vaswani et al., 2017), a sequence model based on self-attention, has achieved compelling …
Model learns image-word associations from captions using contrastive learning.
V. Turaev introduced the theory of topology of words and phrases in 2005. This is a combinatorialy extension of the theory of virtual knots and links. In this paper we generalize the notion of homotopy of words and phrases and we give geometric meanings of the generalized homotopy of words. Moreover using the generaliz…
Generative model improves image realism with word phrase attention.
Automated melodic phrase detection and segmentation is a classical task in content-based music information retrieval and also the key towards automated music structure analysis. However, traditional methods still cannot satisfy practical requirements. In this paper, we explore and adapt various neural network architect…
Employers actively look for talents having not only specific hard skills but also various soft skills. To analyze the soft skill demands on the job market, it is important to be able to detect soft skill phrases from job advertisements automatically. However, a naive matching of soft skill phrases can lead to false pos…
The recently introduced continuous Skip-gram model is an efficient method for learning high-quality distributed vector representations that capture a large number of precise syntactic and semantic word relationships. In this paper we present several extensions that improve both the quality of the vectors and the traini…
This paper describes an approach for automatic construction of dictionaries for Named Entity Recognition (NER) using large amounts of unlabeled data and a few seed examples. We use Canonical Correlation Analysis (CCA) to obtain lower dimensional embeddings (representations) for candidate phrases and classify these phra…
In this paper, we propose a new differentiable neural network alignment mechanism for text-dependent speaker verification which uses alignment models to produce a supervector representation of an utterance. Unlike previous works with similar approaches, we do not extract the embedding of an utterance from the mean redu…
Unsupervised scheme ranks sentences in text documents based on semantic importance.
Text2Node maps medical phrases to a taxonomy, overcoming coding standard limitations.
Improved voice trigger detection in noisy environments.
In this paper, we propose a novel neural network model called RNN Encoder-Decoder that consists of two recurrent neural networks (RNN). One RNN encodes a sequence of symbols into a fixed-length vector representation, and the other decodes the representation into another sequence of symbols. The encoder and decoder of t…
CPGBN analyzes text sequences, capturing word order for better topic extraction.
In an effort to better understand meaning from natural language texts, we explore methods aimed at organizing lexical objects into contexts. A number of these methods for organization fall into a family defined by word ordering. Unlike demographic or spatial partitions of data, these collocation models are of special i…
The authors of (Cho et al., 2014a) have shown that the recently introduced neural network translation systems suffer from a significant drop in translation quality when translating long sentences, unlike existing phrase-based translation systems. In this paper, we propose a way to address this issue by automatically se…
Lagrangian formalism on graded manifolds is phrased in terms of the Grassmann-graded variational bicomplex, generalizing the familiar variational bicomplex for even Lagrangian systems on fiber bundles.
This new research explores the effects of various training methods on a Polish to English Statistical Machine Translation system for medical texts. Various elements of the EMEA parallel text corpora from the OPUS project were used as the basis for training of phrase tables and language models and for development, tunin…
We prove a criterion of convergence in the augmented Teichmueller space that can be phrased in terms of convergence of the hyperbolic metrics or of quasiconformal convergence away from the nodes.
Although deep learning models have proven effective at solving problems in natural language processing, the mechanism by which they come to their conclusions is often unclear. As a result, these models are generally treated as black boxes, yielding no insight of the underlying learned patterns. In this paper we conside…
Paper detects important sub-events in disaster tweets.
Study shows mutual information can reward structure learning agents without expert systems.
We investigate cobordisms of free knots. Free knots and links are also called homotopy classes of Gauss words and phrases. We define a new strong invariant of free knots which allows to detect free knots not cobordant to the trivial one.
The use of robo-readers to analyze news texts is an emerging technology trend in computational finance. In recent research, a substantial effort has been invested to develop sophisticated financial polarity-lexicons that can be used to investigate how financial sentiments relate to future company performance. However, …
APAC-Net solves high-dimensional stochastic MFGs using neural networks.
Objective: We investigate whether deep learning techniques for natural language processing (NLP) can be used efficiently for patient phenotyping. Patient phenotyping is a classification task for determining whether a patient has a medical condition, and is a crucial part of secondary analysis of healthcare data. We ass…
Associating image regions with text queries has been recently explored as a new way to bridge visual and linguistic representations. A few pioneering approaches have been proposed based on recurrent neural language models trained generatively (e.g., generating captions), but achieving somewhat limited localization accu…
The driving force behind the recent success of LSTMs has been their ability to learn complex and non-linear relationships. Consequently, our inability to describe these relationships has led to LSTMs being characterized as black boxes. To this end, we introduce contextual decomposition (CD), an interpretation algorithm…
A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …
A new algorithm optimizes softmax units in large language models.
This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with segments of equal size, the composite dimension can be expressed as a function …
RIG extends IG to Riemannian manifolds for explainable AI.
New geometric approach for analyzing compositional data like gut microbiomes.
We introduce a Maximum Entropy model able to capture the statistics of melodies in music. The model can be used to generate new melodies that emulate the style of the musical corpus which was used to train it. Instead of using the body interactions of order Markov models, traditionally used in automatic mus…
Study on deep neural networks using branching processes and Mehler's formula.
With the aid of concrete examples, we consider the question of whether, in the presence of conformal curvature, a conformal geodesic can become trapped in smaller and smaller sets, or phrased informally: are spirals possible? We do not arrive at a definitive answer, but we are able to find situations where this behavio…
We establish conditions for compositional generalization in machine learning.
Paper proposes a new method for finding sparse mean reverting portfolios efficiently.
This paper proves hyperbolicity of virtual knot compositions.