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

90180269359 · Jun 202019922001200920172026
48 results for key word detection

Proposes RTL model for sentiment classification and key word detection in online reviews.

problem Sentiment classification and key word detection in online reviews for hospitality industry.
method Regularized Text Logistic (RTL) regression model.
result RTL model achieves satisfactory classification performance and identifies key word features.

To identify and classify toxic online commentary, the modern tools of data science transform raw text into key features from which either thresholding or learning algorithms can make predictions for monitoring offensive conversations. We systematically evaluate 62 classifiers representing 19 major algorithmic families …

2018-10-03abs ↗pdf ↗

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.

2009-04-18abs ↗pdf ↗

We present a new method for computing ASR word confidences that effectively mitigates the effect of ASR errors for diverse downstream applications, improves the word error rate of the 1-best result, and allows better comparison of scores across different models. We propose 1) a new method for modeling word confidence u…

2019-07-22abs ↗pdf ↗

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 ↗

Bidirectional attention is shown to be equivalent to a continuous bag of words model with mixture-of-experts.

problem Understanding the statistical underpinnings of bidirectional attention.
method Exploring bidirectional attention as a mixture-of-experts model and reparameterizing it.
result Bidirectional attention can be viewed as a continuous bag of words model with mixture-of-experts weights.

We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant Cayley graph of a nonabelian free group. We investigate the geometry of cyclic …

2013-10-10abs ↗pdf ↗

Analyzes word vectors and co-occurrence statistics in NLP models.

problem Understanding biases in NLP models through co-occurrence statistics.
method Developed an analytic model of statistics learned by Word2Vec and GloVe, derived the first solution to Word2Vec's algorithm, and analyzed independence in co-occurrence models.
result Demonstrated a universal property of word vectors that can reveal biases in data before they are absorbed by DL models.

Model learns image-word associations from captions using contrastive learning.

problem Phrase grounding, associating image regions to caption words.
method Optimizing word-region attention to maximize mutual information, using language model guided word substitutions for negatives.
result Model achieves 76.7% accuracy on Flickr30K Entities benchmark, a 5.7% gain from weak supervision.

Most popular word embedding techniques involve implicit or explicit factorization of a word co-occurrence based matrix into low rank factors. In this paper, we aim to generalize this trend by using numerical methods to factor higher-order word co-occurrence based arrays, or \textit{tensors}. We present four word embedd…

2017-04-10abs ↗pdf ↗

We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms based…

2013-03-15abs ↗pdf ↗

Improving the detection of relevant variables using a new bivariate measure could importantly impact variable selection and large network inference methods. In this paper, we propose a new statistical coefficient that we call the rank minrelation coefficient. We define a minrelation of X to Y (or equivalently a majrela…

2013-05-09abs ↗pdf ↗

Paper benchmarks Bengali language classification tasks using MConv-LSTM network.

problem Lack of computational resources for NLP tasks in under-resourced languages like Bengali.
method Built three datasets, BengFastText word embeddings, and MConv-LSTM network for hate speech detection, document classification, and sentiment analysis.
result BengFastText yields up to 92.30%, 82.25%, and 90.45% F1-scores in document classification, sentiment analysis, and hate speech detection respectively.

Study fixed point indices and words at infinity for graph selfmaps.

problem Estimate indices of fixed point classes for graph selfmaps.
method Extend attracting fixed words at infinity, use relative train track technique, algebraic approach.
result Upper bound for attracting fixed words of injective endomorphisms of free groups.

Word embeddings are a powerful approach for analyzing language, and exponential family embeddings (EFE) extend them to other types of data. Here we develop structured exponential family embeddings (S-EFE), a method for discovering embeddings that vary across related groups of data. We study how the word usage of U.S. C…

2017-09-28abs ↗pdf ↗

CNN predicts stock fluctuations using company news headlines.

problem Predicting next-day stock fluctuations based on company-specific news.
method Convolutional Neural Network (CNN) with reduced filter dimensions and multiple hidden layers. Fine-tuned word embeddings and various filter widths.
result 61.7% classification accuracy achieved using pre-learned embeddings.

Vector representations of words have heralded a transformational approach to classical problems in NLP; the most popular example is word2vec. However, a single vector does not suffice to model the polysemous nature of many (frequent) words, i.e., words with multiple meanings. In this paper, we propose a three-fold appr…

2016-10-24abs ↗pdf ↗

Attention layers are sensitive to single words, improving generalization over random features.

problem Understanding why attention layers are effective in NLP tasks.
method Study of word sensitivity in random features using BERT-Base word embeddings.
result Attention layers have high word sensitivity, improving generalization over random features.

Study examines biases in clinical word embeddings, revealing performance gaps across groups.

problem Biases in clinical word embeddings leading to performance differences across groups.
method Pretrained BERT models on MIMIC-III, fill-in-the-blank method, fairness evaluation on clinical tasks.
result Classifiers trained from BERT representations exhibit statistically significant differences in performance across groups.

Traditional event detection classifies a word or a phrase in a given sentence for a set of predefined event types. The limitation of such predefined set is that it prevents the adaptation of the event detection models to new event types. We study a novel formulation of event detection that describes types via several k…

2019-10-24abs ↗pdf ↗

IITK wins FinSim 2020 task on financial hypernym detection.

problem Classifying financial terms into hypernym concepts in an external ontology.
method Used context-dependent and context-independent word embeddings (Word2vec and BERT) for classification.
result Ranked 1st based on mean rank and accuracy metrics.

Detecting and aggregating sentiments toward people, organizations, and events expressed in unstructured social media have become critical text mining operations. Early systems detected sentiments over whole passages, whereas more recently, target-specific sentiments have been of greater interest. In this paper, we pres…

2019-02-08abs ↗pdf ↗

In lexicon-based classification, documents are assigned labels by comparing the number of words that appear from two opposed lexicons, such as positive and negative sentiment. Creating such words lists is often easier than labeling instances, and they can be debugged by non-experts if classification performance is unsa…

2016-11-21abs ↗pdf ↗

Enhances topic models to better handle polysemous words.

problem Lack of polysemy handling in Gaussian latent Dirichlet allocation.
method Introduces a hierarchical structure to capture polysemy in Gaussian latent Dirichlet allocation.
result Significantly improves polysemy detection and provides more parsimonious topic representations.