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

Trend · papers per month

67135202269 · Jun 202019922001200920172026
48 results for text similarity

Unsupervised text embedding has shown great power in a wide range of NLP tasks. While text embeddings are typically learned in the Euclidean space, directional similarity is often more effective in tasks such as word similarity and document clustering, which creates a gap between the training stage and usage stage of t…

2019-11-04abs ↗pdf ↗

Automatic measurement of semantic text similarity is an important task in natural language processing. In this paper, we evaluate the performance of different vector space models to perform this task. We address the real-world problem of modeling patent-to-patent similarity and compare TFIDF (and related extensions), t…

2018-09-24abs ↗pdf ↗

A new test assesses text similarity between two groups of documents.

problem Comparing similarity between two groups of documents.
method Neural network-based language models estimate entropy, and a test statistic derived from an estimation-and-inference framework is used.
result The proposed test maintains the nominal Type one error rate while offering greater power compared to existing methods.

Model improves BERT for answering multiple-choice questions in large texts.

problem Improving machine comprehension of large text corpora for question answering.
method Developed a model using BERT with a semantic similarity attention layer to extract key sentences.
result Outperforms leading models in MovieQA challenge with 87.79% test accuracy.

RecoBERT uses a language model to recommend items from catalogs.

problem Harnessing language models for text-based item recommendations.
method RecoBERT is a BERT-based approach that learns specialized language models for item recommendations without requiring labeled data.
result RecoBERT outperforms other techniques in inferring item similarities from textual catalogs.

The paper develops a decision support system for hierarchical text classification of conference proceedings.

problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.

Text classification has become indispensable due to the rapid increase of text in digital form. Over the past three decades, efforts have been made to approach this task using various learning algorithms and statistical models based on bag-of-words (BOW) features. Despite its simple implementation, BOW features lack se…

2018-06-08abs ↗pdf ↗

Deep learning models outperform classical methods in text classification.

problem Improving text classification accuracy using deep learning.
method Comprehensive review of deep learning models and datasets for text classification.
result Deep learning models outperform classical methods on various text classification tasks.

Scene text magnifier aims to magnify text in natural scene images without recognition. It could help the special groups, who have myopia or dyslexia to better understand the scene. In this paper, we design the scene text magnifier through interacted four CNN-based networks: character erasing, character extraction, char…

2019-06-17abs ↗pdf ↗

Image captioning has demonstrated models that are capable of generating plausible text given input images or videos. Further, recent work in image generation has shown significant improvements in image quality when text is used as a prior. Our work ties these concepts together by creating an architecture that can enabl…

2018-09-27abs ↗pdf ↗

Given a closed hyperbolic 3-manifold MM, we construct a tower of covers with increasing Heegaard genus, and give an explicit lower bound on the Heegaard genus of such covers as a function of their degree. Using similar methods we prove that for any ε>0ε>0 there exist infinitely many congruence covers {Mi}\{M_i\} such tha…

2011-05-12abs ↗pdf ↗

If ΣΣ and ΣΣ' are homotopic embedded surfaces in a 44-manifold then they may be related by a regular homotopy (at the expense of introducing double points) or by a sequence of stabilisations and destabilisations (at the expense of adding genus). This naturally gives rise to two integer-valued notions of distance bet…

2019-05-02abs ↗pdf ↗

We propose a solution to the problem of estimating a Riemannian metric associated with a given differentiable manifold. The metric learning problem is based on minimizing the relative volume of a given set of points. We derive the details for a family of metrics on the multinomial simplex. The resulting metric has appl…

2012-10-19abs ↗pdf ↗

Text generation is a crucial task in NLP. Recently, several adversarial generative models have been proposed to improve the exposure bias problem in text generation. Though these models gain great success, they still suffer from the problems of reward sparsity and mode collapse. In order to address these two problems, …

2018-04-30abs ↗pdf ↗

We investigate ways in which to improve the interpretability of LDA topic models by better analyzing and visualizing their outputs. We focus on examining what we refer to as topic similarity networks: graphs in which nodes represent latent topics in text collections and links represent similarity among topics. We descr…

2014-09-26abs ↗pdf ↗

A method for disentangling text representations without supervision.

problem Challenges in learning disentangled representations of natural language.
method Information-theoretic guidance to induce independent style and content embeddings.
result High quality disentangled representations in terms of content and style preservation.

Bi-directional LSTMs are a powerful tool for text representation. On the other hand, they have been shown to suffer various limitations due to their sequential nature. We investigate an alternative LSTM structure for encoding text, which consists of a parallel state for each word. Recurrent steps are used to perform lo…

2018-05-07abs ↗pdf ↗

Study uses AI to refine loan assessments, improving credit default predictions.

problem Improving credit default prediction accuracy using AI-refined text.
method Comparative analysis of human-written and AI-refined loan assessments using deep learning techniques.
result AI-refined texts significantly enhance credit default predictions, especially when combined with structured data.

We propose a family of near-metrics based on local graph diffusion to capture similarity for a wide class of data sets. These quasi-metametrics, as their names suggest, dispense with one or two standard axioms of metric spaces, specifically distinguishability and symmetry, so that similarity between data points of arbi…

2017-07-21abs ↗pdf ↗

We introduce TextWorld, a sandbox learning environment for the training and evaluation of RL agents on text-based games. TextWorld is a Python library that handles interactive play-through of text games, as well as backend functions like state tracking and reward assignment. It comes with a curated list of games whose …

2018-06-29abs ↗pdf ↗

Survey on reproducibility and distortion issues in text clustering and topic modeling.

problem Reproducibility and misleading cluster geometry in unsupervised learning for text categorization.
method Systematic literature review of text clustering and topic modeling from 2011-2022.
result Outliers and initialization issues are significant factors in text clustering and topic modeling.

Task-specific scores are often used to optimize for and evaluate the performance of conditional text generation systems. However, such scores are non-differentiable and cannot be used in the standard supervised learning paradigm. Hence, policy gradient methods are used since the gradient can be computed without requiri…

2019-09-09abs ↗pdf ↗

Generates garden paintings from text descriptions using deep learning.

problem Lack of firsthand material for traditional Chinese garden reconstruction.
method Deep learning model trained on text and paintings of Ming Dynasty gardens.
result Model generates garden paintings in Ming Dynasty style based on textual descriptions.

Characterizes flag geometries for Hitchin representations in SL3(R).

problem Understanding flag geometries associated with Hitchin representations in SL3(R).
method Geometric characterization based on invariant foliations and refraction flows.
result Constructs refraction flows for positive roots in general sl_n(R), with highest root flows being C^1+α.

Modeling lead-lag relationship between two text corpora for improved topic modeling.

problem Recognizing the relationship between multiple text corpora for better topic modeling.
method Proposed a jointly dynamic topic model and embedding extension for large-scale text corpus.
result The proposed model can well recognize the lead-lag relationship between two text corpora and improve topic learning.

Paper tackles treatment leakage in text-based causal inference, proposing methods to mitigate bias.

problem Treatment leakage in text-as-confounder applications introduces bias in causal estimates.
method Formal definitions, four text distillation methods (passage removal, classification, salient feature removal, nullspace projection).
result Moderate distillation optimally balances bias reduction against confounder retention.

New method improves reliability of LDA topic modeling by assessing stability across replicated runs.

problem LDA's reproducibility issues due to initial values and Gibbs sampling.
method Cluster replicated LDA runs using modified Jaccard coefficient and pruning algorithm.
result New measure S-CLOP quantifies LDA topic stability, improving reproducibility.

The classifying space BDiff(Sg,n)(S_{g,n}) of the orientation-preserving diffeomorphism group of the surface Sg,nS_{g,n} of genus g>1g>1 with nn ordered marked points has a universal bundle \[ S_g \to \text{UDiff}(S_{g,n})\xrightarrowπ\text{BDiff}(S_{g,n}). \] The fixed nn points provide nn sections sis_i of ππ. In this p…

2016-11-14abs ↗pdf ↗

FRED explains text model predictions by identifying key words and providing counterfactual examples.

problem Lack of interpretable methods for text models that are complex, lack foundations, and have unguaranteed performance.
method FRED identifies minimal influential word sets, assigns token importance, and generates counterfactual examples.
result FRED provides reliable and effective explanations for text model predictions.

Entity linking is the task of mapping potentially ambiguous terms in text to their constituent entities in a knowledge base like Wikipedia. This is useful for organizing content, extracting structured data from textual documents, and in machine learning relevance applications like semantic search, knowledge graph const…

2018-07-16abs ↗pdf ↗

The paper examines the rigidity of eigenvalues in shrinking Ricci solitons.

problem Rigidity of eigenvalues in shrinking Ricci solitons.
method Analysis of the drifted Laplacian on shrinking Ricci solitons, showing eigenvalue bounds and rigidity results.
result If the nextthn^ ext{th} eigenvalue is close to a lower bound, the nn-soliton must be the trivial Gaussian soliton.

Privacy preserving networks can be modelled as decentralized networks (e.g., sensors, connected objects, smartphones), where communication between nodes of the network is not controlled by an all-knowing, central node. For this type of networks, the main issue is to gather/learn global information on the network (e.g.,…

2016-10-05abs ↗pdf ↗

This study presents a multimodal machine learning model to predict ICD-10 diagnostic codes. We developed separate machine learning models that can handle data from different modalities, including unstructured text, semi-structured text and structured tabular data. We further employed an ensemble method to integrate all…

2018-10-31abs ↗pdf ↗

In this paper, we compare various methods to compress a text using a neural model. We find that extracting tokens as latent variables significantly outperforms the state-of-the-art discrete latent variable models such as VQ-VAE. Furthermore, we compare various extractive compression schemes. There are two best-performi…

2018-11-14abs ↗pdf ↗