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

3979118157 · Jun 202019922001200920172026
48 results for vocal tract length perturbation

End-to-end speech recognition system trained on GPUs and CPUs.

problem Building state-of-the-art speech recognition systems.
method Utilizes CPUs and GPUs for training, data augmentation, and neural network updates. Uses vocal tract length perturbation and acoustic simulator for data augmentation. Employed Horovod allreduce for training.
result Achieved 7.92% WER on proprietary English Bixby open domain test set using a Bidirectional Full Attention (BFA) model.

Paper aims to find joint representation between vocal tract geometry and speech sound acoustics.

problem Finding a joint latent representation between articulatory and acoustic domains for vowel sounds.
method Invertible neural network models, convolutional autoencoder, normalizing flows, semi-supervised learning.
result Satisfactory performance in articulatory-to-acoustic and acoustic-to-articulatory mapping.

This paper examines the speaker identification potential of breath sounds in continuous speech. Speech is largely produced during exhalation. In order to replenish air in the lungs, speakers must periodically inhale. When inhalation occurs in the midst of continuous speech, it is generally through the mouth. Intra-spee…

2017-12-01abs ↗pdf ↗

Recent speech technology research has seen a growing interest in using WaveNets as statistical vocoders, i.e., generating speech waveforms from acoustic features. These models have been shown to improve the generated speech quality over classical vocoders in many tasks, such as text-to-speech synthesis and voice conver…

2018-04-25abs ↗pdf ↗

In this paper we propose a fusion approach to continuous emotion recognition that combines visual and auditory modalities in their representation spaces to predict the arousal and valence levels. The proposed approach employs a pre-trained convolution neural network and transfer learning to extract features from video …

2019-06-25abs ↗pdf ↗

New method clusters infant vocalizations using topological data.

problem Clustering infant vocalizations for developmental analysis.
method Topologically augmented signal representation with Dirichlet process mixture model.
result 8 clusters of vocalizations identified in the first 12 months of life.

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.

Study improves machine learning models for GI tract disease detection using comprehensive evaluations and cross-dataset testing.

problem Incomplete or incorrect evaluation of machine learning models for GI tract diseases.
method Comprehensive evaluations of five machine learning models using Global Features and Deep Neural Networks, introducing performance hexagons and cross-dataset testing.
result Demonstrates the need for more sophisticated performance metrics and evaluation methods to build generalizable models.

Study examines equity in post-Snow Uri recovery, finds disparities.

problem Disproportionate impacts on vulnerable populations during recovery.
method County and census tract level data analysis, satellite imagery, statistical procedures.
result Negative associations between non-Hispanic whites and outages, positive associations with certain demographic variables.

In this paper, we use several techniques with conventional vocal feature extraction (MFCC, STFT), along with deep-learning approaches such as CNN, and also context-level analysis, by providing the textual data, and combining different approaches for improved emotion-level classification. We explore models that have not…

2019-05-19abs ↗pdf ↗

DC-SIS selects features faster than mRMR for Parkinson's vocal diagnosis.

problem Feature selection for Parkinson's disease vocal data.
method DC-SIS (Distance Correlation Sure Independence Screening) using distance correlation measure.
result 90 times faster feature selection with similar accuracy.

The paper provides conditions for realizing graphs and polytopes with specified edge lengths.

problem Proving the existence of planar embeddings or polyhedra with specified edge lengths.
method Practical sufficient conditions and software verification for non-self-intersecting perturbations of initial realizations.
result Existence of planar embeddings and polyhedra with specified edge lengths.

Fundamental frequency (f0) estimation from polyphonic music includes the tasks of multiple-f0, melody, vocal, and bass line estimation. Historically these problems have been approached separately, and only recently, using learning-based approaches. We present a multitask deep learning architecture that jointly estimate…

2018-09-02abs ↗pdf ↗

Singing voice separation attempts to separate the vocal and instrumental parts of a music recording, which is a fundamental problem in music information retrieval. Recent work on singing voice separation has shown that the low-rank representation and informed separation approaches are both able to improve separation qu…

2018-01-09abs ↗pdf ↗

Quantum trace map defines invariants for knots and links, confirming a length conjecture.

problem Defining invariants for knots and links in hyperbolic 3-manifolds.
method Introducing a quantum trace map for ideally triangulated knot complements, combining with state-integral models.
result Perturbative invariants determine an asymptotic expansion of the Jones polynomial, confirming the length conjecture.

Paper proposes efficient multivariate spatial Fay-Herriot models using variational autoencoders.

problem Estimating population characteristics in small areas with limited data.
method Integrates multivariate spatial Fay-Herriot model with variational autoencoders to leverage spatial structure efficiently.
result Significant computational efficiency improvements for high-dimensional datasets.

Given a state-of-the-art deep neural network text classifier, we show the existence of a universal and very small perturbation vector (in the embedding space) that causes natural text to be misclassified with high probability. Unlike images on which a single fixed-size adversarial perturbation can be found, text is of …

2019-10-10abs ↗pdf ↗

Improved online Lasso reduces regret in sparse linear contextual bandits.

problem Sparse linear contextual bandit problem with inefficient sampling.
method Perturbed adversary approach to alleviate sampling inefficiency.
result Online Lasso achieves O(kTlogd)\mathcal{O}(\sqrt{kT\log d}) regret bound.

Following \cite{citeSavelyevVirtualMorsetheoryonOmegaOmegaHam(Momega)(Momega).}, we develop here a connection between Morse theory for the (positive) Hofer length functional L:ΩHam(M,ω)RL: Ω\text {Ham}(M, ω) \to \mathbb{R}, with Gromov-Witten/Floer theory, for monotone symplectic manifolds (M,ω) (M, ω) . This gives some immediate restrictio…

2013-08-15abs ↗pdf ↗

A faster Bayesian method for estimating spatial count data models.

problem Bayesian estimation of spatial count data models is computationally expensive and slow.
method Derive a Variational Bayes (VB) method for posterior inference in negative binomial models with spatial dependence.
result The VB method is up to 50 times faster than MCMC and offers similar accuracy.

Hierarchical CNNs improve diagnosis of GI diseases from histopathological images.

problem Diagnosing GI diseases from histopathological images is challenging due to heterogeneity and shared features.
method Embedded a class hierarchy into a VGGNet to address the hierarchical structure of GI diseases.
result The hierarchical model achieved better results than a flat model for multi-category diagnosis of GI disorders.

We prove a dynamical wave trace formula for asymptotically hyperbolic (n+1) dimensional manifolds with negative (but not necessarily constant) sectional curvatures which equates the renormalized wave trace to the lengths of closed geodesics. A corollary of this dynamical trace formula is a dynamical resonance-wave trac…

2008-09-19abs ↗pdf ↗

Shorter adversarial prompts help protect LLMs from jailbreak attacks.

problem Protecting large language models from jailbreak attacks with long adversarial suffixes.
method Adversarial training on shorter adversarial suffixes to defend against longer adversarial suffixes.
result Aligning LLMs on shorter adversarial suffixes can effectively defend against jailbreak attacks with longer suffixes.

New approach reduces unconstrained linear bandits to simpler optimization problems.

problem Unconstrained linear bandits problem.
method Perturbation-based approach combined with comparator-adaptive OLO algorithms.
result First high-probability guarantees for both static and dynamic regret in unconstrained linear bandits.

Fast algorithm for rescaling vectors with clipping, improving training efficiency.

problem Efficiently rescale vectors to a desired length while maintaining them within a domain after clipping.
method Analytical solution for optimal rescaling using fast and differentiable algorithm.
result Optimal rescaling can be found analytically, improving training efficiency for neural networks.

In this work we show that the systems of balance equations (balance systems) of continuum thermodynamics occupy a natural place in the variational bicomplex formalism. We apply the vertical homotopy decomposition to get a local splitting (in a convenient domain) of a general balance system as the sum of a Lagrangian pa…

2011-01-27abs ↗pdf ↗

This study tackles offline RL with perturbed data sources, deriving a lower bound and proposing an optimal algorithm.

problem Understanding offline RL with multiple perturbed data sources.
method Derives an information-theoretic lower bound, proposes HetPEVI algorithm considering sample and source uncertainties.
result HetPEVI is optimal up to a polynomial factor of the horizon length and can solve offline RL tasks.