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,657 papers · 148 categories

Trend · papers per month

121242362483 · Jun 202019922001200920172026
48 results for character error rate

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 ↗

Paper proposes a method to maintain ASR performance on new tasks without forgetting old ones.

problem Mitigating forgetting in ASR models when learning new tasks.
method A novel explainability-based knowledge distillation combined with response-based knowledge distillation.
result Our method outperforms existing ones in mitigating forgetting on multi-stage sequential training tasks.

A tailored HTR system improves CER to 0.015 for medieval Latin.

problem Digitizing handwritten medieval Latin records for a low-resource language.
method End-to-end pipeline using image segmentation and transformer-based models with extensive data augmentation.
result Best-performing setup achieved CER of 0.015, superior to commercial models.

Bayesian method improves neural net convergence for character recognition.

problem Improving convergence rate of neural network training algorithms.
method Customization of Kalman filter into Bayesian statistics for initialization of weights.
result Improved convergence rate for backpropagation training algorithm.

In this paper, we address the task of Optical Character Recognition(OCR) for the Telugu script. We present an end-to-end framework that segments the text image, classifies the characters and extracts lines using a language model. The segmentation is based on mathematical morphology. The classification module, which is …

2015-09-20abs ↗pdf ↗

Predicting the click-through rate of an advertisement is a critical component of online advertising platforms. In sponsored search, the click-through rate estimates the probability that a displayed advertisement is clicked by a user after she submits a query to the search engine. Commercial search engines typically rel…

2017-07-07abs ↗pdf ↗

Paper introduces new bounds linking data compressibility to generalization error.

problem Establishing data-dependent generalization bounds.
method Variable-size compressibility framework linking generalization error to compression rate of input data.
result New bounds depend on empirical data measure, subsuming existing PAC-Bayes and intrinsic dimension bounds.

Charmer improves character-level adversarial attacks for language models.

problem Efficiency and effectiveness of character-level adversarial attacks for language models.
method Query-based adversarial attack method that maintains semantic similarity.
result Charmer achieves high attack success rate and similar adversarial examples.

This paper tackles worst-class error rate in classification tasks.

problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

Character scheme of small Seifert 3-manifolds is reduced if and only if no exceptional abelian character exists.

problem Character scheme of small Seifert 3-manifolds and its reduction condition.
method Complete description of the SL2(C)-character scheme of small Seifert 3-manifolds.
result Character scheme is reduced if and only if no exceptional abelian character exists, and exceptional abelian character has multiplicity 2.

This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.

problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.

In this paper, we give a quantum interpretation of the Bismut-Chern character form (the loop space lifting of the Chern character form) as well as the Chern character form associated to a complex vector bundle with connection over a smooth manifold in the framework of supersymmetric quantum field theories developed by …

2007-11-24abs ↗pdf ↗

Study shows how certain knots and tori are detected by ideal points in character varieties.

problem Detecting essential twice-punctured tori in character varieties.
method Extending Tillmann's limiting character method to new families of knots and tori.
result Explicit determination of limiting characters at ideal points for specific knots and tori.

Background elimination for noisy character images or character images from real scene is still a challenging problem, due to the bewildering backgrounds, uneven illumination, low resolution and different distortions. We propose a stroke-based character reconstruction(SCR) method that use a weighted quadratic Bezier cur…

2018-06-23abs ↗pdf ↗

RoyalFlush system improves multi-speaker ASR in M2MeT challenge.

problem Improving multi-speaker automatic speech recognition in noisy environments.
method Front-end processing with WPE and beamforming, data augmentation, and fusion of two ASR models.
result 12.22% absolute CER reduction on validation set and 12.11% on test set compared to baseline.

Grapheme-based acoustic modeling has recently been shown to outperform phoneme-based approaches in both hybrid and end-to-end automatic speech recognition (ASR), even on non-phonemic languages like English. However, graphemic ASR still has problems with rare long-tail words that do not follow the standard spelling conv…

2019-10-22abs ↗pdf ↗

Computes dimensions of representation and character varieties for 2 and 3-dimensional orbifolds.

problem Computing dimensions of representation and character varieties for orbifolds.
method Analyzes varieties of representations and characters of hyperbolic and non-hyperbolic orbifolds, provides tools for computation.
result Shows that the dimension of a specific component of characters equals half the dimension of the variety of characters of the boundary.

Paper generates personalized fonts from a few characters.

problem Creating personalized fonts from a limited set of characters.
method Designs a network framework to extract and recombine character content and style using various neural networks.
result Generated characters are structurally similar to real characters.

We study some basic properties of the variety of characters in PSL(2,C) of a finitely generated group. In particular we give an interpretation of its points as characters of representations. We construct 3-manifolds whose variety of characters has arbitrarily many components that do not lift to SL(2,C). We also study t…

2003-02-07abs ↗pdf ↗

Study of quantum decorated character stacks and their quantizations.

problem Quantization of decorated character stacks and their compatibility with cutting and gluing.
method Using stratified factorization homology, extend Fock and Goncharov's construction to include stacky points.
result Construction of categorical charts and flips on quantum decorated character stacks.

Overrides of credit ratings are important correctives of ratings that are determined by statistical rating models. Financial institutions and banking regulators agree on this because on the one hand errors with ratings of corporates or banks can have fatal consequences for the lending institutions and on the other hand…

2012-03-10abs ↗pdf ↗

Study character varieties of hyperbolic 3-manifolds using bundle methods.

problem Character varieties of hyperbolic 3-manifolds in once-punctured torus bundles.
method Restrict characters to the fibre and analyze branched covering maps.
result Infinite family of hyperbolic once-punctured bundles with unbounded genus.

Researchers describe character varieties for Hopf links, proving geometric properties.

problem Character variety geometry of Hopf links with nn twists.
method Geometric descriptions of irreducible and totally reducible representations.
result Complete geometric description of SU(2)\mathrm{SU}(2)-character variety for r=2r=2.

Study of SU(2,1) character varieties on one-holed torus.

problem Characterize representations of mapping class group on SU(2,1) character variety.
method Explicit description of SU(2,1) character variety, use of Farey graph adaptation, and mapping class group action analysis.
result Description of an open domain of discontinuity for mapping class group action.