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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920182026
48 results for parallel corpora

We develop the multilingual topic model for unaligned text (MuTo), a probabilistic model of text that is designed to analyze corpora composed of documents in two languages. From these documents, MuTo uses stochastic EM to simultaneously discover both a matching between the languages and multilingual latent topics. We d…

2012-05-09abs ↗pdf ↗

Topic models, and more specifically the class of Latent Dirichlet Allocation (LDA), are widely used for probabilistic modeling of text. MCMC sampling from the posterior distribution is typically performed using a collapsed Gibbs sampler. We propose a parallel sparse partially collapsed Gibbs sampler and compare its spe…

2015-06-11abs ↗pdf ↗

Framework converts singer identity and vocal technique from non-parallel corpora.

problem Converts singer identity and vocal technique from non-parallel corpora.
method Uses variational autoencoders with separate encoders for singer identity and vocal technique.
result Successfully disentangles and converts singer identity and vocal technique.

This research explores the effects of various training settings on a Polish to English Statistical Machine Translation system for spoken language. Various elements of the TED, Europarl, and OPUS parallel text corpora were used as the basis for training of language models, for development, tuning and testing of the tran…

2015-09-30abs ↗pdf ↗

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.

Efficiently trains large corpora models without sampling.

problem Training neural network embedding models on very large corpora using SGD is expensive.
method Proposes new methods to train models without sampling unobserved pairs, using Gramian estimation and variance reduction schemes.
result Significant improvement in training time and generalization quality compared to traditional methods.

Ultra-fast search algorithm for trillion-scale corpora with semantic flexibility.

problem Efficiently searching over large natural language corpora with semantic variations.
method String matching based on suffix arrays, vector representation of words, dynamic corpus-aware pruning, fast exact lookup.
result Substantially lower search latency compared to existing methods on FineWeb-Edu corpus.

Paper proposes continual learning for sentence encoders.

problem Optimize sentence encoders for new corpora while maintaining old corpus accuracy.
method Initialize encoders with corpus-independent features, update using Boolean operations of conceptor matrices.
result Proposed sentence encoder can continually learn features from new corpora.

New method uses sequential statistics for classifier parameter estimation without paired data.

problem Removing need for paired input-output data in classification problems.
method Introduces Caesar Cipher analogy and novel loss function for unsupervised learning.
result Estimates classifier parameters using sequential statistics without paired data.

This new research explores the effects of various training methods on a Polish to English Statistical Machine Translation system for medical texts. Various elements of the EMEA parallel text corpora from the OPUS project were used as the basis for training of phrase tables and language models and for development, tunin…

2015-09-29abs ↗pdf ↗

This paper proposes an efficient method to train word embeddings for large corpora without synchronization.

problem Training word embeddings for large text corpora is computationally expensive and requires synchronization.
method Partition the input space instead of the vocabulary size, using asynchronous training without parameter synchronization.
result Comparable and up to 45% performance improvement in NLP benchmarks with 1/10 the training time.

BERT model improves cross-lingual document retrieval.

problem Improving cross-lingual information retrieval between English queries and foreign documents.
method Introduced a deep relevance matching model based on BERT, trained with weak supervision using CLIR data.
result Model outperforms competitive baseline approaches in retrieving Lithuanian documents against short English queries.

This research investigates the Statistical Machine Translation approaches to translate speech in real time automatically. Such systems can be used in a pipeline with speech recognition and synthesis software in order to produce a real-time voice communication system between foreigners. We obtained three main data sets …

2015-09-30abs ↗pdf ↗

The majority of medical documents and electronic health records (EHRs) are in text format that poses a challenge for data processing and finding relevant documents. Looking for ways to automatically retrieve the enormous amount of health and medical knowledge has always been an intriguing topic. Powerful methods have b…

2017-05-02abs ↗pdf ↗

This work tackles domain shift in speech emotion recognition by proposing class-wise adversarial domain adaptation.

problem Domain shift between corpora poses a challenge for speech emotion recognition, especially for positive/negative emotions.
method Class-wise adversarial domain adaptation to reduce shift between different corpora.
result Our method is effective even with limited target labeled examples, as demonstrated on EMODB and Aibo corpora.

Non-negative matrix factorization (NMF) is a technique for finding latent representations of data. The method has been applied to corpora to construct topic models. However, NMF has likelihood assumptions which are often violated by real document corpora. We present a double parametric bootstrap test for evaluating the…

2017-11-19abs ↗pdf ↗

The paper creates a language evolution tree using word vectors from historical novels.

problem Exploring the evolution of language through historical texts.
method Constructed word vectors from novels, combined them, and used hierarchical clustering.
result Discovered a specific language evolution tree that reflects the year of the corpus.

We study the problem of topic modeling in corpora whose documents are organized in a multi-level hierarchy. We explore a parametric approach to this problem, assuming that the number of topics is known or can be estimated by cross-validation. The models we consider can be viewed as special (finite-dimensional) instance…

2014-09-11abs ↗pdf ↗

When building large-scale machine learning (ML) programs, such as big topic models or deep neural nets, one usually assumes such tasks can only be attempted with industrial-sized clusters with thousands of nodes, which are out of reach for most practitioners or academic researchers. We consider this challenge in the co…

2014-12-04abs ↗pdf ↗

Paper proposes set-valued prediction for historical POS tagging.

problem Difficult POS tagging in historical corpora due to lack of native speakers and sparse data.
method Set-valued prediction approach to allow uncertainty in tagging.
result Set-valued prediction improves POS tagging precision and robustness.

Neural model improves text normalization for non-English languages.

problem Improving text normalization in non-English languages with limited data.
method Sequence-to-sequence model with character and word embeddings, using pre-trained word embeddings with subword information.
result Achieved state-of-the-art F1 score on Arabic language correction dataset.

QA-Token improves tokenization for noisy data, boosting model performance.

problem Tokenization ignores data quality, limiting model effectiveness on noisy corpora.
method QA-Token combines signal quality with vocabulary construction through bilevel optimization and reinforcement learning.
result QA-Token achieves state-of-the-art performance on genomic and financial datasets.

Unsupervised segmentation learns features without labels, improving accuracy.

problem Discover and localize semantically meaningful categories in images without annotations.
method Separates feature learning from cluster compactification; distills unsupervised features into discrete semantic labels using a contrastive loss function.
result Significant improvement over prior state of the art on semantic segmentation challenges.

CGMH uses Metropolis-Hastings sampling to generate sentences with complex constraints.

problem Generating sentences with specific constraints while maintaining fluency and naturalness.
method CGMH employs Metropolis-Hastings sampling for constrained sentence generation.
result CGMH outperforms previous methods in various constrained sentence generation tasks.