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

25497498 · Oct 201919922001200920172026
48 results for short words

A deep learning approach generates math word problems in multiple languages.

problem Template-based mechanisms for generating mathematical word problems lack customizability and creativity.
method Character Level Long Short Term Memory Network (LSTM) and POS tags are used to generate and resolve constraints in generated problems.
result The approach generates accurate math word problems in English and Sinhala with over 90% accuracy.

Unified framework for word embedding models using noise examples.

problem Improving word embedding models with negative sampling.
method Formulated a Word-Context Classification (WCC) framework that generalizes SkipGram word embedding models.
result The best noise distribution is the data distribution, improving both performance and training speed.

While the celebrated Word2Vec technique yields semantically rich representations for individual words, there has been relatively less success in extending to generate unsupervised sentences or documents embeddings. Recent work has demonstrated that a distance measure between documents called \emph{Word Mover's Distance…

2018-10-30abs ↗pdf ↗

We simplify word embeddings by removing sigmoid in SGNS, revealing connections to hyperbolic spaces.

problem Improving word embeddings quality and understanding their relationship with hyperbolic spaces.
method Analyzing squashed shifted PMI matrix and its relation to graph properties and hyperbolic geometry.
result Word embeddings can be connected to hyperbolic spaces through squashed shifted PMI matrix.

As the emergence and the thriving development of social networks, a huge number of short texts are accumulated and need to be processed. Inferring latent topics of collected short texts is useful for understanding its hidden structure and predicting new contents. Unlike conventional topic models such as latent Dirichle…

2017-05-01abs ↗pdf ↗

Given any generating set of any pseudo-Anosov-containing subgroup of the mapping class group of a surface, we construct a pseudo-Anosov with word length bounded by a constant depending only on the surface. More generally, in any subgroup G we find an element f with the property that the minimal subsurface supporting a …

2010-08-12abs ↗pdf ↗

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in the corresponding group if and only if they can be carried to the same tame word b…

2011-03-03abs ↗pdf ↗

In text mining, information retrieval, and machine learning, text documents are commonly represented through variants of sparse Bag of Words (sBoW) vectors (e.g. TF-IDF). Although simple and intuitive, sBoW style representations suffer from their inherent over-sparsity and fail to capture word-level synonymy and polyse…

2013-01-28abs ↗pdf ↗

In this paper we use theory of embedded graphs on oriented and compact PLPL-surfaces to construct minimal realizations of signed Gauss paragraphs. We prove that the genus of the ambient surface of these minimal realizations can be seen as a function of the maximum number of Carter's circles. For the case of signed Gaus…

2015-11-24abs ↗pdf ↗

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive current research. We look at the braid group from a topological point of view (rather …

2001-01-07abs ↗pdf ↗

This paper improves topic modeling by embedding words and topics together.

problem Topic models struggle with short documents and approximate inference.
method Model each document as a mixture of word embeddings and each topic as a mixture of topic embeddings.
result The method optimizes topic embeddings to minimize semantic differences between words and topics.

We use a first-order energy quantity to prove a strengthened statement of uniqueness for the Ricci flow. One consequence of this statement is that if a complete solution on a noncompact manifold has uniformly bounded Ricci curvature, then its sectional curvature will remain bounded for a short time if it is bounded ini…

2015-07-29abs ↗pdf ↗

A new neural topic model using optimal transport improves document representation and topic coherence.

problem Challenges in achieving good document representation and coherent/diverse topics in existing NTMs.
method Proposes a neural topic model via optimal transport, learning topic distribution by minimising OT distance to document word distributions.
result Significantly outperforms state-of-the-art NTMs on discovering coherent and diverse topics.

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary va…

2016-05-21abs ↗pdf ↗

WEEND uses a neural network to recognize speech and assign speakers to words.

problem End-to-end neural diarization without additional ASR and orchestration.
method Multi-task learning with an auxiliary network for ASR and speaker diarization.
result WEEND outperforms turn-based diarization and can handle 5-minute audio.

Using Quillen's superconnection formalism we give a new "twisted" approach to the rational Gromov-Lawson-Rosenberg (GLR) conjecture on topological obstructions to the existence of Riemannian metrics of positive scalar curvature on compact spin manifolds. In particular, we present a short proof of the rational GLR conje…

1999-06-21abs ↗pdf ↗

We describe a simple neural language model that relies only on character-level inputs. Predictions are still made at the word-level. Our model employs a convolutional neural network (CNN) and a highway network over characters, whose output is given to a long short-term memory (LSTM) recurrent neural network language mo…

2015-08-26abs ↗pdf ↗

The Generative Adversarial Network (GAN) has recently been applied to generate synthetic images from text. Despite significant advances, most current state-of-the-art algorithms are regular-grid region based; when attention is used, it is mainly applied between individual regular-grid regions and a word. These approach…

2019-02-04abs ↗pdf ↗

In this paper we consider the problem of clustering collections of very short texts using subspace clustering. This problem arises in many applications such as product categorisation, fraud detection, and sentiment analysis. The main challenge lies in the fact that the vectorial representation of short texts is both hi…

2019-01-25abs ↗pdf ↗

This paper addresses the robust speech recognition problem as an adaptation task. Specifically, we investigate the cumulative application of adaptation methods. A bidirectional Long Short-Term Memory (BLSTM) based neural network, capable of learning temporal relationships and translation invariant representations, is u…

2019-06-14abs ↗pdf ↗

We introduce multiplicative LSTM (mLSTM), a recurrent neural network architecture for sequence modelling that combines the long short-term memory (LSTM) and multiplicative recurrent neural network architectures. mLSTM is characterised by its ability to have different recurrent transition functions for each possible inp…

2016-09-26abs ↗pdf ↗

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…

2017-02-08abs ↗pdf ↗

Random groups prove length constraints on product of conjugates.

problem Quantify products of conjugates in random groups.
method Sharp van Kampen diagram argument and boundary block-counting.
result Prove a sharp inequality for products of conjugates in random groups.

Study examines how cluster number affects short-text clustering, introducing a stability metric.

problem Challenges in finding meaningful clusters in short-text data.
method Introduces a stability metric to determine cluster robustness and visualizes cluster subdivisions.
result Choosing a cluster number involves balancing informativeness and complexity, not seeking a single 'optimal' solution.

Survey of geometry developments, including complex structures on surfaces.

problem Enumerative geometry and complex structures on surfaces.
method Differential and algebraic geometry, nonlinear elliptic PDEs.
result Extensions to 4-manifolds and complex structures on surfaces of general type.

In this short note, we prove that a bi-invariant Riemannian metric on Sp(n)\mathrm{Sp}(n) is uniquely determined by the spectrum of its Laplace-Beltrami operator within the class of left-invariant metrics on Sp(n)\mathrm{Sp}(n). In other words, on any of these compact simple Lie groups, every left-invariant metric which is n…

2017-06-27abs ↗pdf ↗

GCTM integrates GCN into topic models for better topic learning from data streams.

problem Learning hidden topics from short and noisy data streams with concept drift.
method Proposes a graph convolutional topic model (GCTM) that learns from a knowledge graph and old data.
result Significantly better performance in probabilistic predictive measures and topic coherence.