Let (W,S) be a finite rank Coxeter system with W infinite. We prove that the limit weak order on the blocks of infinite reduced words of W is encoded by the topology of the Tits boundary of the Davis complex X of W. We consider many special cases, including W word hyperbolic, and X with isolated flats. We establish tha…
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,932 papers · 148 categories
Trend · papers per month
48 results for “word order preservation”
Proposes a novel framework for multi-label text classification.
problem Lack of coherent consideration of non-consecutive and long-distance semantics and hierarchical relations among labels.
method Hierarchical taxonomy-aware and attentional graph capsule recurrent CNNs framework.
result Significantly improves multi-label text classification performance.
The paper presents a method to preserve privacy in text analysis using calibrated noise.
problem Accurately learning from user data while maintaining privacy.
method Calibrated multivariate perturbations applied to word embeddings to achieve geo-indistinguishability.
result The method provides better privacy guarantees than baseline models with minimal utility loss.
Proposes BU-SPO method to improve text classification robustness.
problem Vulnerability of deep models in text classification.
method Bigram and unigram based adaptive Semantic Preservation Optimization (BU-SPO) method.
result Achieves highest attack success rates and semantic similarity by changing the smallest number of words.
The goal of homomorphic encryption is to encrypt data such that another party can operate on it without being explicitly exposed to the content of the original data. We introduce an idea for a privacy-preserving transformation on natural language data, inspired by homomorphic encryption. Our primary tool is {\em obfusc…
Sequence-to-Sequence (seq2seq) modeling has rapidly become an important general-purpose NLP tool that has proven effective for many text-generation and sequence-labeling tasks. Seq2seq builds on deep neural language modeling and inherits its remarkable accuracy in estimating local, next-word distributions. In this work…
Models of bags of words typically assume topic mixing so that the words in a single bag come from a limited number of topics. We show here that many sets of bag of words exhibit a very different pattern of variation than the patterns that are efficiently captured by topic mixing. In many cases, from one bag of words to…
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…
Building competitive direct acoustics-to-word models for English conversational speech recognitioncs.CL
Direct acoustics-to-word (A2W) models in the end-to-end paradigm have received increasing attention compared to conventional sub-word based automatic speech recognition models using phones, characters, or context-dependent hidden Markov model states. This is because A2W models recognize words from speech without any de…
Text corpora are widely used resources for measuring societal biases and stereotypes. The common approach to measuring such biases using a corpus is by calculating the similarities between the embedding vector of a word (like nurse) and the vectors of the representative words of the concepts of interest (such as gender…
Neutralizing Gender Bias in Word Embedding with Latent Disentanglement and Counterfactual Generationcs.CL
New method neutralizes gender bias in word embeddings without losing semantic information.
problem Gender biases in word embeddings trained on human-generated corpora.
method Latent Disentanglement and Counterfactual Generation with siamese auto-encoder and gradient reversal layer.
result Our method outperforms existing debiasing methods in preserving semantic information and neutralizing gender biases.
Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that operate in non-monotonic orders; the model directly learns good orders, without any ad…
LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.
problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.
We show that the Goldman flows preserve the holomorphic structure on the moduli space of homomorphisms of the fundamental group of a Riemann surface into U(1), in other words the Jacobian.
For text analysis, one often resorts to a lossy representation that either completely ignores word order or embeds each word as a low-dimensional dense feature vector. In this paper, we propose convolutional Poisson factor analysis (CPFA) that directly operates on a lossless representation that processes the words in e…
Top2Vec finds topic vectors from documents and words without needing stop words or custom settings.
problem Topic modeling weaknesses, including needing known topics, stop words, and custom settings.
method Joint document and word semantic embedding to find topic vectors automatically.
result Top2Vec finds more informative and representative topics than probabilistic models.
The paper studies automorphisms of RAAGs and RACGs, proving properties of their fixed subgroups.
problem Fixed subgroups of automorphisms of RAAGs and RACGs.
method Introducing coarse-median preserving automorphisms and proving properties of fixed subgroups.
result Fixed subgroups of RAAGs and RACGs are finitely generated, undistorted, and quasi-convex.
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…
Capturing the compositional process which maps the meaning of words to that of documents is a central challenge for researchers in Natural Language Processing and Information Retrieval. We introduce a model that is able to represent the meaning of documents by embedding them in a low dimensional vector space, while pre…
Algorithm confirms non-order-preserving braids, proving infinite family not order-preserving.
problem Determining if a braid is non-order-preserving.
method Algorithm that checks non-order-preserving property of braids.
result Infinite family of simple 3-braids are not order-preserving.
The blind application of machine learning runs the risk of amplifying biases present in data. Such a danger is facing us with word embedding, a popular framework to represent text data as vectors which has been used in many machine learning and natural language processing tasks. We show that even word embeddings traine…
A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.
problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.
Recent work on learning multilingual word representations usually relies on the use of word-level alignements (e.g. infered with the help of GIZA++) between translated sentences, in order to align the word embeddings in different languages. In this workshop paper, we investigate an autoencoder model for learning multil…
We propose an unsupervised object matching method for relational data, which finds matchings between objects in different relational datasets without correspondence information. For example, the proposed method matches documents in different languages in multi-lingual document-word networks without dictionaries nor ali…
By representing words with probability densities rather than point vectors, probabilistic word embeddings can capture rich and interpretable semantic information and uncertainty. The uncertainty information can be particularly meaningful in capturing entailment relationships -- whereby general words such as "entity" co…
We create interpretable word embeddings through sparse coding.
problem Difficult to interpret word embeddings in natural language processing.
method Transform pretrained dense word embeddings into sparse embeddings through sparse coding.
result Sparse embeddings are more interpretable and achieve good performance.
Improves dialogue response model interpretability using attention and regularization.
problem Improving interpretability of dual encoder models for dialogue response suggestions.
method Integrates attention mechanism and novel regularization loss to emphasize important words.
result Improves model accuracy and interpretability compared to existing methods.
Paper reproduces and enhances a method for cross-lingual word embeddings.
problem Creating robust cross-lingual mappings of word embeddings without supervision.
method Reproduces and enhances a self-learning method with grid search for hyperparameters.
result Model's robustness is demonstrated across four new languages.
Convolutional neural network (CNN) is a neural network that can make use of the internal structure of data such as the 2D structure of image data. This paper studies CNN on text categorization to exploit the 1D structure (namely, word order) of text data for accurate prediction. Instead of using low-dimensional word ve…
A method for authorship attribution based on function word adjacency networks (WANs) is introduced. Function words are parts of speech that express grammatical relationships between other words but do not carry lexical meaning on their own. In the WANs in this paper, nodes are function words and directed edges stand in…
The paper proposes a privacy-preserving method for text data using Hyperbolic space.
problem Preserving user privacy in text data while maintaining utility for machine learning.
method Word representations in Hyperbolic space to provide privacy, sampling from a probability distribution.
result Demonstrates significant privacy guarantees (20x greater) compared to Euclidean space.
In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has resorted to three or higher-order statistics of the data corpus to relax the an…
In the field of Natural Language Processing (NLP), we revisit the well-known word embedding algorithm word2vec. Word embeddings identify words by vectors such that the words' distributional similarity is captured. Unexpectedly, besides semantic similarity even relational similarity has been shown to be captured in word…
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…
Paper proposes AXE loss for non-autoregressive machine translation, improving performance.
problem Challenges in training non-autoregressive models due to lack of autoregressive factors and cross entropy loss penalties.
method Proposes aligned cross entropy (AXE) loss function using a differentiable dynamic program for better word order alignment.
result AXE-based training improves performance on major WMT benchmarks and sets a new state of the art for non-autoregressive models.
In this article we introduce order preserving representations of fundamental groups of surfaces into Lie groups with bi-invariant orders. By relating order preserving representations to weakly maximal representations, introduced in arXiv:1305.2620, we show that order preserving representations into Lie groups of Hermit…
NNLMs optimize poorly for word probabilities due to embedding space structure.
problem NNLMs assign suboptimal probabilities to some words.
method Analyzed the inductive bias of NNLMs and the structure of word embeddings.
result Words on the convex hull have bounded probability, affecting others.
Scl in free productsmath.GT
We study stable commutator length (scl) in free products via surface maps into a wedge of spaces. We prove that scl is piecewise rational linear if it vanishes on each factor of the free product, generalizing the main result in Danny Calegari's paper "Scl, sails and surgery". We further prove that the property of isome…
In this paper we prove that an isometry between orbit spaces of two proper isometric actions is smooth if it preserves the codimension of the orbits or if the orbit spaces have no boundary. In other words, we generalize Myers-Steenrod's theorem for orbit spaces. These results are proved in the more general context of s…
This paper tackles rare word problem in low-resource language pairs using NMT.
problem Rare word problem in neural machine translation, especially for low-resource languages.
method Three solutions: enhanced source context, morphology learning, and wordnet synonyms.
result Significant improvements in BLEU scores (+1.0 points) on English-Vietnamese and Japanese-Vietnamese.
A new algorithm optimizes softmax units in large language models.
problem Efficiently computing gradients for large-scale language models.
method Zero-th Order method for approximating gradients.
result The algorithm converges and efficiently computes gradients.
Recent work on end-to-end automatic speech recognition (ASR) has shown that the connectionist temporal classification (CTC) loss can be used to convert acoustics to phone or character sequences. Such systems are used with a dictionary and separately-trained Language Model (LM) to produce word sequences. However, they a…
Many loss functions in representation learning are invariant under a continuous symmetry transformation. For example, the loss function of word embeddings (Mikolov et al., 2013) remains unchanged if we simultaneously rotate all word and context embedding vectors. We show that representation learning models for time ser…
A scalable framework preserves personalized higher-order network proximities.
problem Lack of expressive methods to preserve personalized higher-order network proximities.
method Incorporates random walk into a sound objective to preserve arbitrary higher-order proximities and introduces random walk with restart for personalized-weighted preservation.
result Consistently and substantially outperforms state-of-the-art methods on real-world networks.
The problem of topic modeling can be seen as a generalization of the clustering problem, in that it posits that observations are generated due to multiple latent factors (e.g., the words in each document are generated as a mixture of several active topics, as opposed to just one). This increased representational power …
This research explores using kernels in the softmax layer for better contextual word classification.
problem Improving contextual word classification accuracy.
method Replacing the inner product in the softmax layer with various kernel functions and comparing their performance.
result Different kernel settings yield varying performance in contextual word classification tasks.
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.
We prove that any regular Casimir in 3D magnetohydrodynamics is a function of the magnetic helicity and cross-helicity. In other words, these two helicities are the only independent regular integral invariants of the coadjoint action of the MHD group , which is the semidirect pro…