Zobrazeno 1 - 10
of 104
pro vyhledávání: '"HAWS, DAVID"'
Autor:
Turetzky, Arnon, Shabtay, Nimrod, Shechtman, Slava, Aronowitz, Hagai, Haws, David, Hoory, Ron, Dekel, Avihu
The success of autoregressive transformer models with discrete tokens has inspired quantization-based approaches for continuous modalities, though these often limit reconstruction quality. We therefore introduce SALAD, a per-token latent diffusion mo
Externí odkaz:
http://arxiv.org/abs/2410.16048
Large Language Models (LLMs) demonstrate impressive capabilities, yet interaction with these models is mostly facilitated through text. Using Text-To-Speech to synthesize LLM outputs typically results in notable latency, which is impractical for flue
Externí odkaz:
http://arxiv.org/abs/2309.11210
Beam search, which is the dominant ASR decoding algorithm for end-to-end models, generates tree-structured hypotheses. However, recent studies have shown that decoding with hypothesis merging can achieve a more efficient search with comparable or bet
Externí odkaz:
http://arxiv.org/abs/2208.01818
Sequence-to-Sequence Text-to-Speech architectures that directly generate low level acoustic features from phonetic sequences are known to produce natural and expressive speech when provided with adequate amounts of training data. Such systems can lea
Externí odkaz:
http://arxiv.org/abs/2207.12262
When recurrent neural network transducers (RNNTs) are trained using the typical maximum likelihood criterion, the prediction network is trained only on ground truth label sequences. This leads to a mismatch during inference, known as exposure bias, w
Externí odkaz:
http://arxiv.org/abs/2108.10803
Although Sequence-to-Sequence (S2S) architectures have become state-of-the-art in speech synthesis, capable of generating outputs that approach the perceptual quality of natural samples, they are limited by a lack of flexibility when it comes to cont
Externí odkaz:
http://arxiv.org/abs/2101.09940
Publikováno v:
Mathematical Programming A 164 (2017) n. 1-2, 285-324
This paper deals with faces and facets of the family-variable polytope and the characteristic-imset polytope, which are special polytopes used in integer linear programming approaches to statistically learn Bayesian network structure. A common form o
Externí odkaz:
http://arxiv.org/abs/1503.00829
Whole genome prediction of complex phenotypic traits using high-density genotyping arrays has attracted a great deal of attention, as it is relevant to the fields of plant and animal breeding and genetic epidemiology. As the number of genotypes is ge
Externí odkaz:
http://arxiv.org/abs/1310.1659
QuickLexSort: An efficient algorithm for lexicographically sorting nested restrictions of a database
Autor:
Haws, David
Lexicographical sorting is a fundamental problem with applications to contingency tables, databases, Bayesian networks, and more. A standard method to lexicographically sort general data is to iteratively use a stable sort -- a sort which preserves e
Externí odkaz:
http://arxiv.org/abs/1310.1649
We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time $T$, the size of the design matrix is $6 \times 3\cdot 2^{T-1}$ and the convex hull of its columns is the model polytope. We study t
Externí odkaz:
http://arxiv.org/abs/1204.3070