This research explores various sampling methods and probability distributions for hard alignment in sequence-to-sequence TTS synthesis.
problem Improving alignment accuracy in sequence-to-sequence text-to-speech synthesis.
method Investigated various sampling methods (greedy, beam, random) and probability distributions (Bernoulli, Concrete) for hard alignment.
result Deterministic search is more preferable than stochastic search for natural alignment transition.
Investigates neural TTS systems for Japanese and English.
problem Improving neural TTS systems for high-quality speech synthesis.
method Comparative study of neural sequence-to-sequence TTS vs. DNN pipeline TTS, varying model architecture, parameter size, and language.
result A neural sequence-to-sequence TTS system requires sufficient model parameters and a powerful encoder for high-quality speech synthesis.
Proposes Textual Echo Cancellation to improve speech recognition.
problem Improving speech recognition performance and user experience for smart devices.
method A novel sequence-to-sequence model with multi-source attention that processes both the microphone mixture signal and source text of TTS playback.
result Demonstrates enhanced speech recognition performance and reduced latency.
We investigated the training of a shared model for both text-to-speech (TTS) and voice conversion (VC) tasks. We propose using an extended model architecture of Tacotron, that is a multi-source sequence-to-sequence model with a dual attention mechanism as the shared model for both the TTS and VC tasks. This model can a…
We present a voice conversion solution using recurrent sequence to sequence modeling for DNNs. Our solution takes advantage of recent advances in attention based modeling in the fields of Neural Machine Translation (NMT), Text-to-Speech (TTS) and Automatic Speech Recognition (ASR). The problem consists of converting be…
Classifies Toda-type tt*-structures and their fixed points.
problem Classifying Toda-type tt*-structures and their fixed points.
method Fixed point description and reduction of anti-symmetry conditions.
result Reduces possibilities of anti-symmetry condition to two cases.
Using nonlinear pde techniques, we construct a new family of globally smooth tt* structures. This includes tt* structures associated to the (orbifold) quantum cohomology of a finite number of complex projective spaces and weighted projective spaces. The existence of such "magical solutions" of the tt* equations, namely…
The paper proves an isomorphism between tt∗ structures of Landau-Ginzburg and Calabi-Yau models.
problem Establishing an isomorphism between tt∗ structures of different geometries. method Using Landau-Ginzburg models and Calabi-Yau hypersurfaces, proving the isomorphism via the big residue map.
result An isomorphism between tt∗ structures of Landau-Ginzburg and Calabi-Yau models is proven. Recent studies have introduced end-to-end TTS, which integrates the production of context and acoustic features in statistical parametric speech synthesis. As a result, a single neural network replaced laborious feature engineering with automated feature learning. However, little is known about what types of context in…
Relates quantum cohomology to tt*-Toda equations for minuscule flag manifolds.
problem Quantum cohomology of minuscule flag manifolds.
method Combining Lie-theoretic treatments of tt*-Toda equations and quantum cohomology.
result Relates quantum cohomology to tt*-Toda equations for minuscule flag manifolds.
Analyzes tt*-structures from ADE-type Stokes data.
problem Classifying tt*-structures over C∗. method Isomonodromic deformations with upper unitriangular real Stokes matrices.
result Establishes a direct analytic realization of the ADE classification. Polynomial growth elements found in all subgroups of Out(F_n).
problem Understanding polynomial growth in subgroups of Out(F_n).
method Analyzing conjugacy classes and elements of Out(F_n).
result Polynomial growth elements exist in all subgroups of Out(F_n).
Explains quantum cohomology of Grassmannians using tt* equations.
problem Relates quantum cohomology of complex Grassmannians to projective space.
method Uses tt* equations and Lie-theoretic connections.
result Illustrates relations between tt* equations and quantum cohomology.
Proves existence and uniqueness of solutions for A_n tt*-Toda equations.
problem Existence and uniqueness of solutions for A_n tt*-Toda equations.
method Proof of existence and uniqueness for any n, new treatment of asymptotic data.
result Existence and uniqueness of global solutions for any n.
We study transverse-tracefree (TT)-tensors on conformally flat 3-manifolds (M,g). The Cotton-York tensor linearized at g maps every symmetric tracefree tensor into one which is TT. The question as to whether this is the general solution to the TT-condition is viewed as a cohomological problem within an elliptic com…
Solves constant pre-factor problem for tt*-Toda equations using asymptotic data and symplectic structures.
problem Constant pre-factor problem for the tt*-Toda equations.
method Explicit evaluation using asymptotic data and introduction of symplectic structures.
result Preservation of symplectic structures by Riemann-Hilbert correspondence for wider class of solutions.
BOFFIN TTS optimizes hyper-parameters for new speaker adaptation.
problem Fine-tuning a pre-trained TTS model for a new speaker with limited data.
method Bayesian optimization to efficiently find optimal hyper-parameters.
result Average 30% improvement in speaker similarity over standard techniques.
Study of symplectic groupoids from tt*-Toda equations.
problem Geometry of meromorphic connections with irregular singularities.
method Holomorphic symplectic groupoid structure over Steinberg cross section.
result Proves the space of tt*-Toda connections is a symplectic Lie groupoid.
Solutions of tt*-equation from SU(2)_k fusion algebra.
problem Describe solutions to the tt*-equation from a specific algebra.
method Use DPW method and representations of SU(2).
result Construct solutions corresponding to A_k minimal model.
New surfaces with conjugate points have global blow-down maps in their TT spaces.
problem Constructing global blow-down maps for surfaces with conjugate points.
method Explicit construction of a family of non-trapping Riemannian surfaces with global blow-down maps.
result Global blow-down maps exist for some non-simple surfaces with conjugate points.
RandUCB combines UCB and TS for optimal bandit performance.
problem Optimizing decision-making in uncertain environments with limited feedback.
method Randomized UCB algorithm using confidence intervals.
result Achieves minimax-optimal regret in various bandit settings.
End-to-end text-to-speech (TTS) synthesis is a method that directly converts input text to output acoustic features using a single network. A recent advance of end-to-end TTS is due to a key technique called attention mechanisms, and all successful methods proposed so far have been based on soft attention mechanisms. H…
We present a fully convolutional wav-to-wav network for converting between speakers' voices, without relying on text. Our network is based on an encoder-decoder architecture, where the encoder is pre-trained for the task of Automatic Speech Recognition, and a multi-speaker waveform decoder is trained to reconstruct the…
A novel sequence-to-sequence model predicts missing sensor data.
problem Missing sensor data in sequences.
method Formulated a novel sequence-to-sequence model using forward and backward RNNs.
result The model produces the lowest errors in 12% more cases than the current state-of-the-art.
Bayesian tensor train method recovers streaming data with high accuracy.
problem Recovering high-order, incomplete, and noisy streaming data.
method Bayesian tensor train decomposition using streaming variational Bayes method.
result The proposed SPTT algorithm excels in recovering streaming data compared to state-of-the-art methods.
We describe all smooth solutions of the two-function tt*-Toda equations (a version of the tt* equations, or equations for harmonic maps into SL(n,R)/SO(n)) in terms of (i) asymptotic data, (ii) holomorphic data, and (iii) monodromy data. This allows us to find all solutions with integral Stokes data. These include solu…
Paper proposes efficient tensor completion method using Gaussian Process.
problem Tensor completion in high-dimensional data with unknown smooth functions.
method Gaussian Process Regression for initialization and TT-cross approximation for tensor rank selection.
result Improved reconstruction error compared to random initialization.
In "Isomonodromy aspects of the tt* equations of Cecotti and Vafa I. Stokes data" (arxiv:1209.2045) we described all smooth solutions of the two-function tt*-Toda equations in terms of asymptotic data, holomorphic data, and monodromy data. In this supplementary article we focus on the holomorphic data and its interpret…
A new TTS method uses diffusion and VAE for better speech synthesis.
problem Improving text-to-speech synthesis for better speech quality and robustness.
method Combines diffusion probabilistic model and variational autoencoder for latent variable conversion.
result The method is robust to poor orthography and alignment errors.
End-to-end Sanskrit TTS developed with limited data, achieving good quality.
problem Developing natural-sounding speech for Sanskrit with scarce data.
method Fine-tuning Tacotron2 model with WaveGlow and transfer learning.
result Achieved an overall MOS of 3.38 from 37 evaluators.
In this note we prove an existence result for the Einstein conformal constraint equations for metrics with vanishing Yamabe invariant assuming that the TT-tensor is small in L2.
We give an overview on the tt*-geometry defined for isolated hypersurface singularities and tame functions via Brieskorn lattices. We discuss nilpotent orbits in this context, as well as classifying spaces of Brieskorn lattices and (limits of) period maps.
Tensor network surrogate for efficient option pricing in large portfolios.
problem Large-scale portfolio revaluation problems in market risk management.
method Tensor-train (TT) approximation for high-dimensional price surfaces, direct inference using Laplacian kernel and TT representations.
result Tensor surrogate achieves lower test error and faster evaluation times compared to standard GPR.
Characterizes kernel of linearization for minimal surfaces problem
problem Characterizing kernel of linearization for minimal surfaces problem
method Show kernel consists of potential fields and TT fields
result In whole-space Euclidean decomposition, kernel consists of potential fields and TT fields
TensorGuide improves LoRA efficiency and expressivity through joint tensor-train optimization.
problem Limited expressivity and generalization of standard LoRA.
method TensorGuide uses a unified tensor-train structure with controlled Gaussian noise to generate correlated low-rank matrices.
result TensorGuide achieves superior accuracy and scalability with fewer parameters compared to standard LoRA and TT-LoRA.
Proposes a new kernel technique for tensor data in SVM.
problem Handling tensorial data in machine learning.
method Kernelized support tensor train machine for image classification.
result Tensorizes the standard SVM on its input structure and kernel mapping scheme.
Improved TTS style transfer across disjoint datasets with adversarial cycle consistency.
problem Suboptimal TTS style transfer on disjoint datasets with underrepresented styles.
method Adversarial cycle consistency training with paired and unpaired triplets.
result 78% improvement in style transfer with minimal reduction in fidelity and naturalness.
A new method computes Greeks for multi-asset options using tensor trains and Fourier transforms.
problem Efficient computation of Greeks for multi-asset options with high accuracy and low sample complexity.
method Tensor train (TT) representations of Fourier-based pricing functions, combined with numerical differentiation or analytical approaches.
result Significant speed-ups of up to 105imes over Monte Carlo simulations while maintaining comparable accuracy. Establishes correspondence between Calabi-Yau and Landau-Ginzburg structures.
problem Preserving real structures in the Calabi-Yau/Landau-Ginzburg correspondence.
method Detailed analysis of period integrals and modification of real structures.
result Full CY/LG correspondence for tt∗ structures established. For any triple (W,L,ρ), where W is a closed connected and oriented 3-manifold, L is a link in W and ρ is a flat principal B-bundle over W (B is the Borel subgroup of $SL(2,\mc)$), one constructs a $\Dd$-scissors congruence class $\cG_{\Dd}(W,L,ρ)$ which belongs to a (pre)-Bloch group $\Pp (\Dd)$. The class $\cG_{\D…
In this note, we prove that for a cobounded,Lipschitz path $γ:I\to\TT$, if the pull back bundle Hγ over I is a strongly relatively hyperbolic metric space then there exists a geodesic ξ in $\TT$ such that γ(I) and ξ are close to each other.
Using sequence to sequence algorithms for query expansion has not been explored yet in Information Retrieval literature nor in Question-Answering's. We tried to fill this gap in the literature with a custom Query Expansion engine trained and tested on open datasets. Starting from open datasets, we built a Query Expansi…
Transformers can approximate any sequence-to-sequence function, surprising given their complexity.
problem Understanding the expressive power of Transformer models for sequence-to-sequence functions.
method Established that Transformers are universal approximators of continuous permutation equivariant sequence-to-sequence functions with compact support, and extended this to arbitrary functions using positional encodings.
result Transformers are universal approximators of arbitrary continuous sequence-to-sequence functions on a compact domain.
Bayesian tensor train kernel machine uses Laplace approximation for scalable GP regression.
problem Scalability limitations of Gaussian process regression.
method Bayesian tensor train kernel machine with Laplace approximation and variational inference.
result VI replaces cross-validation and offers up to 65x faster training.
The paper studies automorphisms of free groups with a North-South dynamics.
problem Characterizing automorphisms of free groups with dynamical properties.
method Analyzes the action of outer automorphisms on a relative space of currents.
result Proves the existence of a preferred compact space on which automorphisms act with North-South dynamics.
The availability of large amounts of time series data, paired with the performance of deep-learning algorithms on a broad class of problems, has recently led to significant interest in the use of sequence-to-sequence models for time series forecasting. We provide the first theoretical analysis of this time series forec…
Paper tackles multivariate shape-constrained convex regression problems.
problem Fitting a convex function to data with component-wise monotonicity and uniform Lipschitz continuity.
method Least squares estimator via solving a constrained convex quadratic programming problem. Efficient algorithms designed: sGS-ADMM and pALM.
result Both proposed algorithms outperform state-of-the-art methods in numerical experiments.
Introduces TT-NF for more compact neural field representations.
problem Finding more compact and easy-to-fit neural field representations.
method Tensor Train parameterization trained with backpropagation.
result Low-rank compression improves downstream task quality metrics.