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

Trend · papers per month

316292123 · May 202619922001200920172026
48 results for tt* equations

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…

2010-10-10abs ↗pdf ↗

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.

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…

2012-09-11abs ↗pdf ↗

We propose a Lie-theoretic definition of the tt*-Toda equations for any complex simple Lie algebra g\mathfrak{g}, based on the concept of topological-antitopological fusion which was introduced by Cecotti and Vafa. Our main result concerns the Stokes data of a certain meromorphic connection, whose isomonodromic deform…

2018-02-04abs ↗pdf ↗

Constructs positive energy representations from Toda equations Stokes data.

problem Creating positive energy representations of affine algebras.
method Using Stokes data of tt*-Toda equations to construct representations.
result Illustrates construction with examples in conformal field theory.

We study possible real structures in the space of solutions to the quantum differential equation. We show that, under mild conditions, a real structure in orbifold quantum cohomology yields a pure and polarized tt^*-geometry near the large radius limit. We compute an example of P^1 which is pure and polarized over the …

2009-06-06abs ↗pdf ↗

In this paper, a symmetry classification of a (2+1)(2+1)-nonlinear wave equation uttf(u)(uxx+uyy)=0u_{tt}-f(u)(u_{xx}+u_{yy})=0 where f(u)f(u) is a smooth function on uu, using Lie group method, is given. The basic infinitesimal method for calculating symmetry groups is presented, and used to determine the general symmetry group of this $…

2009-07-28abs ↗pdf ↗

The paper proves an isomorphism between tttt^* structures of Landau-Ginzburg and Calabi-Yau models.

problem Establishing an isomorphism between tttt^* 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 tttt^* structures of Landau-Ginzburg and Calabi-Yau models is proven.

Two problems concerning asymptotically hyperbolic manifolds with an inner boundary are studied. First, we study scalar curvature presciption with either Dirichlet or mean curvature prescription interior boundary condition. Then we apply those results to the Lichnerowicz equation with (future or past) apparent horizon i…

2008-02-22abs ↗pdf ↗

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…

2018-11-04abs ↗pdf ↗

Efficiently learns and transports posterior densities for real-time inference.

problem High computational cost of Bayesian inference for complex posterior densities.
method Tensor-train (TT) format for offline learning, conditional transport for online inference.
result Significant improvement in inference performance for high-dimensional problems.

The non-abelian Hodge correspondence identifies complex variations of Hodge structures with certain Higgs bundles. In this work we analyze this relationship, and some of its ramifications, when the variations of Hodge structures are determined by a (complete) one-dimensional family of compact Calabi-Yau manifolds. This…

2019-11-15abs ↗pdf ↗

We study transverse-tracefree (TT)-tensors on conformally flat 3-manifolds (M,g)(M,g). The Cotton-York tensor linearized at gg 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…

1996-06-18abs ↗pdf ↗

We propose RandUCB\tt RandUCB, a bandit strategy that builds on theoretically derived confidence intervals similar to upper confidence bound (UCB) algorithms, but akin to Thompson sampling (TS), it uses randomization to trade off exploration and exploitation. In the KK-armed bandit setting, we show that there are infinitel…

2019-10-11abs ↗pdf ↗

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.

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.

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.

This is the first of a series of papers to construct the deformation theory of the form Schrödinger equation, which is related to a section-bundle system (M,g,f)(M,g,f), where (M,g)(M,g) is a noncompact complete Kähler manifold with bounded geometry and ff is a holomorphic function defined on MM. This work is also the first …

2011-07-07abs ↗pdf ↗

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…

2019-04-18abs ↗pdf ↗

Tensor, a multi-dimensional data structure, has been exploited recently in the machine learning community. Traditional machine learning approaches are vector- or matrix-based, and cannot handle tensorial data directly. In this paper, we propose a tensor train (TT)-based kernel technique for the first time, and apply it…

2020-01-02abs ↗pdf ↗

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.

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.