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

93186279372 · Jun 202019922001200920182026
48 results for spelling accuracy

Chatbot uses BERT to handle financial investment questions, improving accuracy and decision-making.

problem Improving accuracy and decision-making in financial investment customer service.
method Deep Bidirectional Transformer (BERT) model, uncertainty measure comparison, mixed-integer programming, automatic spelling correction.
result Chatbot can recognize 381 intents and decide when to escalate questions.

We further study the incidence relations that arise from the various subtowers, known as Baby Monster, which exist within the R3\mathbb{R}^{3}-Monster Tower. This allows us to complete the RVTRVT class spelling rules. We also present a method of calculating the various Baby Monster that appear within the Monster Tower.

2014-07-07abs ↗pdf ↗

Synthetic noise training improves machine translation robustness to spelling mistakes.

problem Making machine translation robust to spelling mistakes and natural noise.
method Training on synthetic noise to improve robustness to natural noise.
result Training on synthetic noise improves robustness to natural noise without diminishing performance on clean text.

A new transformer model corrects diacritics and typos in multiple languages.

problem Restoring diacritics and correcting typos in online communications.
method Employing a universal ByT5 transformer model trained on 12 languages, including Lithuanian.
result Achieves > 98% accuracy in diacritics restoration and typos correction.

In many recent applications, data is plentiful. By now, we have a rather clear understanding of how more data can be used to improve the accuracy of learning algorithms. Recently, there has been a growing interest in understanding how more data can be leveraged to reduce the required training runtime. In this paper, we…

2011-06-06abs ↗pdf ↗

We present Listen, Attend and Spell (LAS), a neural network that learns to transcribe speech utterances to characters. Unlike traditional DNN-HMM models, this model learns all the components of a speech recognizer jointly. Our system has two components: a listener and a speller. The listener is a pyramidal recurrent ne…

2015-08-05abs ↗pdf ↗

Winterization of Texas power system profitable but risky, estimated at $11.74bn over 30 years.

problem Profitability and risk of winterizing Texas power system infrastructure.
method Combined temperature-dependent load and outage estimates over 71 years of climate data.
result Large-scale winterization of gas infrastructure and power plants is profitable, but risks are high due to low-frequency of cold spells.

The Monster tower, also known as the Semple tower, is a sequence of manifolds with distributions of interest to both differential and algebraic geometers. Each manifold is a projective bundle over the previous. Moreover, each level is a fiber compactified jet bundle equipped with an action of finite jets of the diffeom…

2015-12-01abs ↗pdf ↗

In automatic speech recognition (ASR) what a user says depends on the particular context she is in. Typically, this context is represented as a set of word n-grams. In this work, we present a novel, all-neural, end-to-end (E2E) ASR sys- tem that utilizes such context. Our approach, which we re- fer to as Contextual Lis…

2018-08-07abs ↗pdf ↗

We review (non-abelian) extensions of a given Lie algebra, identify a 3-dimensional cohomological obstruction to the existence of extensions. A striking analogy to the setting of covariant exterior derivatives, curvature, and the Bianchi identity in differential geometry is spelled out. In the new version references ad…

2000-05-04abs ↗pdf ↗

Neural network optimizes learning sequence for reading words.

problem Children struggle with learning to read words due to inconsistent spelling-sound correspondences.
method Used a neural network to structure learning trials to optimize generalization accuracy.
result Significant improvement in generalization accuracy compared to random or frequency-based sequences.

System solves author name ambiguity in e-commerce catalogs.

problem Finding correct author names in e-commerce catalogs with abbreviations and spelling variants.
method Composite system using open data sources and machine learning techniques for natural language processing.
result Top proposal of the system is the normalized author name with 72% accuracy.

Attention-based encoder-decoder architectures such as Listen, Attend, and Spell (LAS), subsume the acoustic, pronunciation and language model components of a traditional automatic speech recognition (ASR) system into a single neural network. In previous work, we have shown that such architectures are comparable to stat…

2017-12-05abs ↗pdf ↗

The paper defines and studies the category of Z-graded manifolds, including their intrinsic structure and formal properties.

problem Understanding the categorical properties and intrinsic structure of Z-graded manifolds.
method Describing local models, explaining formality, and formulating analogues of theorems.
result Proper definitions of objects and morphisms in the category of Z-graded manifolds, and formulation of Batchelor's theorem.

Having a sequence-to-sequence model which can operate in an online fashion is important for streaming applications such as Voice Search. Neural transducer is a streaming sequence-to-sequence model, but has shown a significant degradation in performance compared to non-streaming models such as Listen, Attend and Spell (…

2017-12-05abs ↗pdf ↗

We propose SEARNN, a novel training algorithm for recurrent neural networks (RNNs) inspired by the "learning to search" (L2S) approach to structured prediction. RNNs have been widely successful in structured prediction applications such as machine translation or parsing, and are commonly trained using maximum likelihoo…

2017-06-14abs ↗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.

Diffusion models can memorize training data, limiting their creativity and privacy.

problem Memorization in diffusion models that reproduces training data instead of generating novel outputs.
method Dual-separation approach via statistical estimation and network approximation.
result Pruning-based method reduces memorization while maintaining generation quality.

In the probabilistic topic models, the quantity of interest---a low-rank matrix consisting of topic vectors---is hidden in the text corpus matrix, masked by noise, and the Singular Value Decomposition (SVD) is a potentially useful tool for learning such a low-rank matrix. However, the connection between this low-rank m…

2016-08-16abs ↗pdf ↗

There are two themes in the present paper. The first one is spelled out in the title, and is inspired by an attempt to find an analogue of Hersch-Yang-Yau estimate for lambda1lambda_1 of surfaces in symplectic category. In particular we prove that every split symplectic manifold T4timesMT^4 times M admits a compatible Riemannian …

1997-05-04abs ↗pdf ↗

Model shows how banks' fears of future defaults can cause immediate financial stress.

problem How banks' future default worries cause immediate financial stress.
method Dynamic interbank model with endogenous distress contagion, mark-to-market valuation adjustment, forward-backward approach.
result Distress contagion acts as a stochastic volatility term leading to clustering and down-market spikes.

We develop a Chern character map for twisted equivariant non-abelian cohomology.

problem Understanding non-abelian cohomology theories and their applications.
method General construction of the Chern character map for twisted equivariant non-abelian cohomology.
result Illustrated the construction by computing the equivariant Sullivan model of Cohomotopy.

Paper analyzes convergence of ODE samplers in Wasserstein distances.

problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.

Automated generation of medical reports from chest x-rays using expert annotations.

problem Generating long, unstructured text from medical images with context and consistency.
method First learn visually-informative medical concepts from raw reports, then use these concepts to auto-generate structured reports from images.
result Validation on OpenI dataset shows auto-generated reports are consistent with manual annotations.

SpecAugment improves speech recognition with simple feature augmentation.

problem Improving automatic speech recognition accuracy.
method Applying warping, frequency channel masking, and time step masking to feature inputs of neural networks.
result Achieved state-of-the-art performance on LibriSpeech and Switchboard tasks.

Seq2seq ASR adapts to speakers, improving performance by 25%.

problem Speaker adaptation for seq2seq ASR systems to match conventional methods.
method Applied Kullback-Leibler divergence and Linear Hidden Network adaptation to seq2seq models.
result 25% relative word error rate improvement with seq2seq model adaptation.

The generalization of Frobenius' theorem to foliations with singularities is usually attributed to Stefan and Sussmann, for their simultaneous discovery around 1973. However, their result is often referred to without caring much on the precise statement, as some sort of magic spell. This may be explained by the fact th…

2017-10-04abs ↗pdf ↗

BCI system improves word selection efficiency using sequential best-arm identification.

problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.

TeLeS improves ASR confidence estimation by considering temporal alignment and lexical errors.

problem Inaccurate confidence scores from E2E ASR models, especially for overconfident predictions.
method Proposes TeLeS, a novel confidence score that considers temporal alignment and lexical errors, and uses shrinkage loss to handle data imbalance.
result TeLeS generalizes well across different languages and ASR models, leading to significant WER reduction.

Survival analysis models predict loan write-off risk under IFRS 9.

problem Estimating loan write-off probabilities in credit risk modeling.
method Discrete-time hazard model and conditional inference survival tree compared to cross-sectional logistic regression.
result Discrete-time hazard model outperforms other two-stage LGD-models.