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

336699132 · Oct 202419922001200920172026
48 results for enhanced GloVe

The Global Vectors for word representation (GloVe), introduced by Jeffrey Pennington et al. is reported to be an efficient and effective method for learning vector representations of words. State-of-the-art performance is also provided by skip-gram with negative-sampling (SGNS) implemented in the word2vec tool. In this…

2014-11-20abs ↗pdf ↗

Word embedding models have become a fundamental component in a wide range of Natural Language Processing (NLP) applications. However, embeddings trained on human-generated corpora have been demonstrated to inherit strong gender stereotypes that reflect social constructs. To address this concern, in this paper, we propo…

2018-08-29abs ↗pdf ↗

Word2Vec (W2V) and GloVe are popular, fast and efficient word embedding algorithms. Their embeddings are widely used and perform well on a variety of natural language processing tasks. Moreover, W2V has recently been adopted in the field of graph embedding, where it underpins several leading algorithms. However, despit…

2018-05-30abs ↗pdf ↗

Gesture recognition and hand motion tracking are important tasks in advanced gesture based interaction systems. In this paper, we propose to apply a sliding windows filtering approach to sample the incoming streams of data from data gloves and a decision tree model to recognize the gestures in real time for a manual gr…

2019-11-10abs ↗pdf ↗

We develop a family of techniques to align word embeddings which are derived from different source datasets or created using different mechanisms (e.g., GloVe or word2vec). Our methods are simple and have a closed form to optimally rotate, translate, and scale to minimize root mean squared errors or maximize the averag…

2018-06-04abs ↗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.

Continuous representation of words is a standard component in deep learning-based NLP models. However, representing a large vocabulary requires significant memory, which can cause problems, particularly on resource-constrained platforms. Therefore, in this paper we propose an isotropic iterative quantization (IIQ) appr…

2020-01-11abs ↗pdf ↗

The abstract explains how word and relation representations capture semantic meaning.

problem Understanding how word and relation representations capture semantic meaning.
method Theoretical justification and extension of geometric relationships between word embeddings and knowledge graph representations.
result The geometric relationships between word embeddings correspond to semantic relations between words and entities in knowledge graphs.

Paper tackles zero-shot activity recognition using video features and text embeddings.

problem Zero-shot activity recognition with videos.
method Auto-encoder model for multimodal joint embedding, 3D convolutional action recognition for visual features, GloVe word embeddings for textual features.
result Improved zero-shot recognition results with top-n accuracy and mean Nearest Neighbor Overlap.

Semantic word embeddings represent the meaning of a word via a vector, and are created by diverse methods. Many use nonlinear operations on co-occurrence statistics, and have hand-tuned hyperparameters and reweighting methods. This paper proposes a new generative model, a dynamic version of the log-linear topic model o…

2015-02-12abs ↗pdf ↗

Modern datasets and models are notoriously difficult to explore and analyze due to their inherent high dimensionality and massive numbers of samples. Existing visualization methods which employ dimensionality reduction to two or three dimensions are often inefficient and/or ineffective for these datasets. This paper in…

2018-07-31abs ↗pdf ↗

Learning an embedding for a large collection of items is a popular approach to overcome the computational limitations associated to one-hot encodings. The aim of item embedding is to learn a low dimensional space for the representations, able to capture with its geometry relevant features or relationships for the data …

2019-12-04abs ↗pdf ↗

Neural models for NLP typically use large numbers of parameters to reach state-of-the-art performance, which can lead to excessive memory usage and increased runtime. We present a structure learning method for learning sparse, parameter-efficient NLP models. Our method applies group lasso to rational RNNs (Peng et al.,…

2019-09-06abs ↗pdf ↗

This paper evaluates debiasing methods on word embeddings to reduce religious bias.

problem Social biases persist in word embeddings, potentially amplifying them in AI applications.
method Investigates and evaluates three multiclass debiasing techniques on three word embeddings.
result ConceptorDebiasing is the most effective method, reducing religious bias by 82-96%.

Islamophobic hate speech on social media inflicts considerable harm on both targeted individuals and wider society, and also risks reputational damage for the host platforms. Accordingly, there is a pressing need for robust tools to detect and classify Islamophobic hate speech at scale. Previous research has largely ap…

2018-12-12abs ↗pdf ↗

Improved NER performance on imbalanced data.

problem Highly unbalanced training data in NER tasks.
method Adapted a neural architecture with CRF and BI-LSTM layers, using pre-trained embeddings. Introduced a two-class split to optimize performance.
result Significant improvement in performance for weak classes with minimal training data.

Paper uses JIVE to decompose word embeddings, improving sentiment analysis performance.

problem Improving sentiment analysis performance on word embeddings.
method Joint and individual variance explained (JIVE) method for decomposition.
result Mapping word embeddings into joint components improves sentiment analysis performance.

Automatic understanding of domain specific texts in order to extract useful relationships for later use is a non-trivial task. One such relationship would be between railroad accidents' causes and their correspondent descriptions in reports. From 2001 to 2016 rail accidents in the U.S. cost more than $4.6B. Railroads i…

2018-10-17abs ↗pdf ↗

Word embeddings, i.e., low-dimensional vector representations such as GloVe and SGNS, encode word "meaning" in the sense that distances between words' vectors correspond to their semantic proximity. This enables transfer learning of semantics for a variety of natural language processing tasks. Word embeddings are typic…

2020-01-14abs ↗pdf ↗

Enhancement attacks can falsely improve machine learning model performance in biomedical research.

problem The trustworthiness of machine learning in biomedical research is threatened by enhancement attacks.
method Developed two techniques to enhance prediction performance with minimal changes to features.
result Falsely improved classifiers' accuracy from 50% to almost 100% while maintaining high feature similarities.

Generative adversarial networks (GAN) have recently been shown to be efficient for speech enhancement. However, most, if not all, existing speech enhancement GANs (SEGAN) make use of a single generator to perform one-stage enhancement mapping. In this work, we propose to use multiple generators that are chained to perf…

2020-01-15abs ↗pdf ↗

An enhanced trivalent tangle is a trivalent tangle with some of its edges labeled. We use enhanced trivalent tangles and classical knot theory to provide a recipe for constructing invariants for trivalent tangles, and in particular, for knotted trivalent graphs. Our method also yields invariants of, what we refer to as…

2018-06-17abs ↗pdf ↗

We address the problem of speech enhancement generalisation to unseen environments by performing two manipulations. First, we embed an additional recording from the environment alone, and use this embedding to alter activations in the main enhancement subnetwork. Second, we scale the number of noise environments presen…

2018-10-26abs ↗pdf ↗

Enhanced Teichmüller space for surfaces with decorations and enhancements.

problem Parameterizing and understanding Teichmüller spaces with enhancements and decorations.
method Introduced a new variation of Teichmüller space, constructed parameterization, and introduced lamination space.
result Compatibility of shear coordinates and λ-length coordinates in the new deformation space.

In this paper we demonstrate spoken speech enhancement using electroencephalography (EEG) signals using a generative adversarial network (GAN) based model, gated recurrent unit (GRU) regression based model, temporal convolutional network (TCN) regression model and finally using a mixed TCN GRU regression model. We comp…

2019-09-13abs ↗pdf ↗

We enhance the biquandle counting invariant using elements of truncated biquandle-labeled Polyak algebras. These finite type enhancements reduce to the finite type enhancements defined by Goussarov, Polyak and Viro for the trivial biquandle of one element and determine (but are not determined by) the biquandle counting…

2015-06-02abs ↗pdf ↗

Enhanced indexation uses equity and index options for better performance.

problem Improving portfolio performance through enhanced indexation.
method Integrating index options into an enhanced indexation strategy based on second-order stochastic dominance.
result Introducing option strategies in enhanced indexation leads to improved out-of-sample performance.

Quantum polynomials are derived from a specific tribracket structure.

problem Quantum enhancement polynomials for oriented links.
method Defined using a canonical two-element tribracket, proving polynomials can be derived from five specific ones.
result Universal quantum enhancement polynomials are strictly stronger than the Jones polynomial.

Enhances neural networks' robustness against adversarial samples without sacrificing clean sample generalization.

problem Limited generalization and time complexity of adversarial training.
method Feature Pyramid Decoder (FPD) framework that integrates denoising and image restoration modules into CNNs and constrains the Lipschitz constant.
result FPD-enhanced CNNs achieve sufficient robustness against general adversarial samples on various datasets.

We consider involutory virtual biracks with good involutions, also known as symmetric involutory virtual biracks. Any good involution on an involutory virtual birack defines an enhancement of the counting invariant. We provide examples demonstrating that the enhancement is stronger than the unenhanced counting invarian…

2014-10-16abs ↗pdf ↗