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

146291437582 · Jun 202019922001200920182026
48 results for TIMIT dataset

End-to-end transformer model improves lexical stress detection accuracy.

problem Inaccurate phoneme boundaries and limited features for stress classification.
method End-to-end sequence to sequence model using transformer trained on feature sequences and phoneme sequences with stress marks.
result End-to-end model achieves better performance and lower phoneme error rate (6.36%) compared to syllable segmentation methods.

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.

Unsupervised speech recognition without labeled data using novel cost function and MAP refinement.

problem Training speech recognition systems without labeled data.
method Alternates between phoneme classifier learning and boundary refinement using Segmental Empirical Output Distribution Matching and MAP approach.
result Achieves phone error rate (PER) of 41.6% on TIMIT dataset.

Prob-PIT improves speech separation by considering output-label permutations as random variables.

problem Overconfident output-label assignment in PIT leads to unreliable speech separation.
method Prob-PIT treats output-label permutations as a discrete latent random variable with a uniform prior distribution and maximizes the log-likelihood function.
result Prob-PIT significantly outperforms PIT in terms of Signal to Distortion Ratio and Signal to Interference Ratio.

Learning invariant representations is an important problem in machine learning and pattern recognition. In this paper, we present a novel framework of transformation-invariant feature learning by incorporating linear transformations into the feature learning algorithms. For example, we present the transformation-invari…

2012-06-27abs ↗pdf ↗

The paper analyzes how speech enhancement and recognition can be improved in noisy environments.

problem Improving speech recognition in multi-talker scenarios with limited resources.
method Developed and trained two LSTM-based models for speech enhancement and phone recognition, then studied their joint optimization.
result Joint optimization of speech enhancement and recognition leads to a significant reduction in Phone Error Rate (PER).

In this paper, we propose and study random maxout features, which are constructed by first projecting the input data onto sets of randomly generated vectors with Gaussian elements, and then outputing the maximum projection value for each set. We show that the resulting random feature map, when used in conjunction with …

2015-06-11abs ↗pdf ↗

We stabilize the activations of Recurrent Neural Networks (RNNs) by penalizing the squared distance between successive hidden states' norms. This penalty term is an effective regularizer for RNNs including LSTMs and IRNNs, improving performance on character-level language modeling and phoneme recognition, and outperfor…

2015-11-26abs ↗pdf ↗

How can we efficiently propagate uncertainty in a latent state representation with recurrent neural networks? This paper introduces stochastic recurrent neural networks which glue a deterministic recurrent neural network and a state space model together to form a stochastic and sequential neural generative model. The c…

2016-05-24abs ↗pdf ↗

Training very deep networks is an important open problem in machine learning. One of many difficulties is that the norm of the back-propagated error gradient can grow or decay exponentially. Here we show that training very deep feed-forward networks (FFNs) is not as difficult as previously thought. Unlike when back-pro…

2014-12-19abs ↗pdf ↗

Many efforts have been devoted to training generative latent variable models with autoregressive decoders, such as recurrent neural networks (RNN). Stochastic recurrent models have been successful in capturing the variability observed in natural sequential data such as speech. We unify successful ideas from recently pr…

2017-11-15abs ↗pdf ↗

We study large-scale kernel methods for acoustic modeling in speech recognition and compare their performance to deep neural networks (DNNs). We perform experiments on four speech recognition datasets, including the TIMIT and Broadcast News benchmark tasks, and compare these two types of models on frame-level performan…

2017-01-13abs ↗pdf ↗

An important step in speaker verification is extracting features that best characterize the speaker voice. This paper investigates a front-end processing that aims at improving the performance of speaker verification based on the SVMs classifier, in text independent mode. This approach combines features based on conven…

2013-06-12abs ↗pdf ↗

We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTM…

2017-06-08abs ↗pdf ↗

We propose a novel end-to-end neural network architecture that, once trained, directly outputs a probabilistic clustering of a batch of input examples in one pass. It estimates a distribution over the number of clusters kk, and for each 1kkmax1 \leq k \leq k_\mathrm{max}, a distribution over the individual cluster assignm…

2018-07-11abs ↗pdf ↗

Kernel method outperforms deep neural networks in speech enhancement.

problem Improving single-channel speech enhancement performance.
method Kernel regression with an exponential power kernel and EigenPro iterative method.
result Kernel method consistently outperforms deep neural networks in speech enhancement.

Recurrent sequence generators conditioned on input data through an attention mechanism have recently shown very good performance on a range of tasks in- cluding machine translation, handwriting synthesis and image caption gen- eration. We extend the attention-mechanism with features needed for speech recognition. We sh…

2015-06-24abs ↗pdf ↗

Many machine learning tasks can be expressed as the transformation---or \emph{transduction}---of input sequences into output sequences: speech recognition, machine translation, protein secondary structure prediction and text-to-speech to name but a few. One of the key challenges in sequence transduction is learning to …

2012-11-14abs ↗pdf ↗

Bayesian SHMM discovers acoustic units from unlabeled speech.

problem Discovering language-specific acoustic units from unlabeled speech.
method Bayesian Subspace Hidden Markov Model (SHMM) trained on labeled data to find new acoustic units on target language.
result Significantly outperforms previous HMM-based systems and compares favorably with Variational Auto Encoder-HMM.

Kaleidoscope matrices improve model quality and inference speed.

problem Choosing structured linear transformations for efficiency and accuracy.
method Introduce kaleidoscope matrices that can capture any structured matrix with near-optimal space and time complexity. Learn these matrices automatically within end-to-end pipelines.
result Kaleidoscope matrices can improve model quality and inference speed.

Proposes a method to analyze distributed datasets without sharing original data.

problem Difficulty in centralizing large, distributed datasets due to size and privacy concerns.
method Centralizes intermediate representations instead of original datasets.
result Achieves higher prediction performance compared to individual analyses.

MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.

problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.

StyleDiff compares unlabeled datasets using disentangled image spaces.

problem Mismatches between development and real-world datasets lead to inaccurate predictions.
method Uses disentangled image spaces and focuses on attributes to compare datasets.
result Accurately detects and presents differences between datasets.

New framework assesses graph-learning datasets for better evaluation.

problem Insufficient evaluation of graph-learning datasets and methods.
method Introduces Rings framework for dataset ablations and proposes performance separability and mode complementarity measures.
result Demonstrates utility of Rings framework for graph-learning dataset evaluation.

Improved dataset distillation for images and texts boosts model accuracy.

problem Reducing dataset size for faster and more energy-efficient model training.
method Simultaneous distillation of images and soft labels, extending to text datasets.
result 2-4% increase in accuracy for image classification tasks, 20% reduction in distilled samples.