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

Trend · papers per month

71142213284 · Jun 202019922001200920172026
48 results for CTC loss

We report an extension of a Keras Model, called CTCModel, to perform the Connectionist Temporal Classification (CTC) in a transparent way. Combined with Recurrent Neural Networks, the Connectionist Temporal Classification is the reference method for dealing with unsegmented input sequences, i.e. with data that are a co…

2019-01-23abs ↗pdf ↗

Because no closed timelike curve (CTC) on a Lorentzian manifold can be deformed to a point, any such manifold containing a CTC must have a topological feature, to be called a timelike wormhole, that prevents the CTC from being deformed to a point. If all wormholes have horizons, which typically seems to be the case in …

2006-07-31abs ↗pdf ↗

This paper improves speech recognition by distilling knowledge from acoustic models.

problem Improving speech recognition accuracy using ensemble models.
method Proposes multi-teacher distillation strategies for joint CTC-attention end-to-end ASR systems, integrating error rate metric for optimization.
result Reports state-of-the-art error rates on various datasets and languages.

CAT toolkit combines hybrid and E2E approaches for efficient speech recognition.

problem Improving speech recognition efficiency and latency.
method CTC-CRF based framework with contextualized soft forgetting.
result CAT achieves state-of-the-art results with simpler training and streaming ASR.

We consider the region of closed timelike curves (CTC's) in three-dimensional flat Lorentz spacetimes. The interest in this global geometrical feature goes beyond the purely mathematical. Such spacetimes may be considered lower-dimensional toy models of sourceless Einstein gravity or cosmology. In particular, our inter…

2002-01-21abs ↗pdf ↗

Paper proposes an online speech recognition model using Transformer.

problem Challenges in deploying Transformer-based E2E ASR for online speech recognition.
method Chunk self-attention encoder (chunk-SAE) and monotonic truncated attention (MTA) based self-attention decoder (SAD).
result Achieved 23.66% CER with 320 ms latency, significant improvement over offline models.

Keyword spotting--or wakeword detection--is an essential feature for hands-free operation of modern voice-controlled devices. With such devices becoming ubiquitous, users might want to choose a personalized custom wakeword. In this work, we present DONUT, a CTC-based algorithm for online query-by-example keyword spotti…

2018-11-26abs ↗pdf ↗

This study provides benchmarks for different implementations of LSTM units between the deep learning frameworks PyTorch, TensorFlow, Lasagne and Keras. The comparison includes cuDNN LSTMs, fused LSTM variants and less optimized, but more flexible LSTM implementations. The benchmarks reflect two typical scenarios for au…

2018-06-05abs ↗pdf ↗

In this paper we demonstrate continuous noisy speech recognition using connectionist temporal classification (CTC) model on limited Chinese vocabulary using electroencephalography (EEG) features with no speech signal as input and we further demonstrate single CTC model based continuous noisy speech recognition on limit…

2019-06-17abs ↗pdf ↗

In this work we explored building automatic speech recognition models for transcribing doctor patient conversation. We collected a large scale dataset of clinical conversations (14,00014,000 hr), designed the task to represent the real word scenario, and explored several alignment approaches to iteratively improve data qua…

2017-11-20abs ↗pdf ↗

Improved neural transducer model outperforms attention model on longer sequences.

problem Improving performance of neural transducer models.
method Comparison of training criteria (marginalization vs. maximum approximation), model generalization, and output label topology.
result Final transducer model outperforms attention model by over 6% relative WER on Switchboard 300h.

Causality violations are typically seen as unrealistic and undesirable features of a physical model. The following points out three reasons why causality violations, which Bonnor and Steadman identified even in solutions to the Einstein equation referring to ordinary laboratory situations, are not necessarily undesirab…

2006-09-15abs ↗pdf ↗

In this paper we demonstrate end-to-end continuous speech recognition (CSR) using electroencephalography (EEG) signals with no speech signal as input. An attention model based automatic speech recognition (ASR) and connectionist temporal classification (CTC) based ASR systems were implemented for performing recognition…

2019-06-17abs ↗pdf ↗

CL methods improve monolingual ASR models across new tasks without forgetting past data.

problem Catastrophic Forgetting in monolingual ASR models when adapting to new domains or accents.
method Implement and compare various Continual Learning methods for monolingual ASR.
result Best CL method reduces performance gap by over 40% with minimal past data.

Study combines speaker verification and voice trigger detection in a single network.

problem Separate training for speaker verification and voice trigger detection.
method Multi-task learning with a single network trained on both tasks.
result Single network achieves comparable accuracy to independent models for each task.

Connectionist temporal classification (CTC) is widely used for maximum likelihood learning in end-to-end speech recognition models. However, there is usually a disparity between the negative maximum likelihood and the performance metric used in speech recognition, e.g., word error rate (WER). This results in a mismatch…

2017-12-19abs ↗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 ↗

We study a multiclass multiple instance learning (MIL) problem where the labels only suggest whether any instance of a class exists or does not exist in a training sample or example. No further information, e.g., the number of instances of each class, relative locations or orders of all instances in a training sample, …

2018-11-29abs ↗pdf ↗

This paper presents a comparison of a traditional hybrid speech recognition system (kaldi using WFST and TDNN with lattice-free MMI) and a lexicon-free end-to-end (TensorFlow implementation of multi-layer LSTM with CTC training) models for German syllable recognition on the Verbmobil corpus. The results show that expli…

2019-09-19abs ↗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.

We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the composition of a proper loss with a link function. We characterise when margin losses can be proper composite losses, explicitly show how to determ…

2009-12-17abs ↗pdf ↗

We present the Tamed Cross Entropy (TCE) loss function, a robust derivative of the standard Cross Entropy (CE) loss used in deep learning for classification tasks. However, unlike other robust losses, the TCE loss is designed to exhibit the same training properties than the CE loss in noiseless scenarios. Therefore, th…

2018-10-11abs ↗pdf ↗

Unified surrogate loss framework for multi-label learning with strong consistency guarantees.

problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.

We present αα-loss, α[1,]α\in [1,\infty], a tunable loss function for binary classification that bridges log-loss (α=1α=1) and 00-11 loss (α=α= \infty). We prove that αα-loss has an equivalent margin-based form and is classification-calibrated, two desirable properties for a good surrogate loss function for the ideal y…

2019-02-12abs ↗pdf ↗

This work generalizes calibeating for a broader range of proper losses using Bregman divergence.

problem Calibration for a wide range of proper losses beyond Brier and log loss.
method Regret minimization based on Bregman divergence for a family of proper losses.
result U-calibration results for a family of Tsallis losses with logarithmic regret and dimension independence.

Proposes squentropy loss for improved classification accuracy and model calibration.

problem Theoretical and empirical evidence for cross-entropy loss is lacking.
method Introduces squentropy loss as the sum of cross-entropy and average square loss over incorrect classes.
result Squentropy loss outperforms cross-entropy and rescaled square losses in classification accuracy and model calibration.