Proposes deep learning method for GCI detection from pathological speech.
problem Detecting glottal closure instants (GCI) in pathological acoustic speech.
method Convolutional neural network with fused deep acoustic speech and linear prediction residual features.
result Significantly better than state-of-the-art methods in GCI detection.
Improved speech emotion recognition using pitch-synchronous single frequency filtering spectrogram.
problem Uncertainty principles in STFT spectrogram limit time and frequency resolutions.
method Modified SFF spectrogram by averaging amplitudes between GCI locations, named pitch-synchronous SFF spectrogram.
result Improved SER accuracy (63.95% to 70.4%) on IEMOCAP dataset.
The state-of-the-art in text-to-speech synthesis has recently improved considerably due to novel neural waveform generation methods, such as WaveNet. However, these methods suffer from their slow sequential inference process, while their parallel versions are difficult to train and even more expensive computationally. …
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…
Paper introduces a new outer measure for continuous price paths with instant enforcement.
problem Defining a new outer measure for continuous price paths with instant enforcement.
method Introducing an outer measure on the space [0,+∞)imesΩ that assigns zero value to instantly blockable sets. result Proves BDG inequalities and an Itô-type integral for the modified measure.
The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.
problem Identifying edge weights in Bernoulli Autoregressive (BAR) models.
method Maximum Likelihood (ML) estimation for two variants of BAR models.
result ML estimators are strongly consistent for edge weight identification.
Given a Lorentzian manifold (M,g), a geodesic γ in M and a timelike Jacobi field Y along γ, we introduce a special class of instants along γ that we call Y-pseudo conjugate (or focal relatively to some initial orthogonal submanifold). We prove that the Y-pseudo conjugate insta…
Algorithm converts plat to standard closure of braids in 3D and related spaces.
problem Converting plat to standard closure of braids in different spaces.
method Algorithmic approach for plat to standard closure conversion in \(\mathbb{R}^3\), handlebodies, and thickened surfaces.
result Algorithm is quadratic for plat to standard closure and linear for standard to plat closure.
Using symplectic techniques and spectral analysis of smooth paths of self-adjoint operators, we characterize the set of conjugate instants along a geodesic in an infinite dimensional Riemannian Hilbert manifold.
HyperFast instantly classifies tabular data in one pass.
problem Computational burden and time-consuming hyperparameter tuning for deep learning models.
method Meta-trained hypernetwork for instant classification.
result Significantly faster than competing methods with competitive performance.
The paper studies knitted surfaces and surface-links, showing their isotopy and closure properties.
problem Understanding the isotopy and closure properties of knitted surfaces and surface-links.
method Analyzing the structure and closure of knitted surfaces and surface-links in R4. result Any surface-link is ambient isotopic to the closure of a 2-dimensional knit.
USFAs combine UVFAs, SFs, and GPI for scalable, instant RL generalisation.
problem Generalizing to unseen tasks in reinforcement learning.
method Combining universal value function approximators, successor features, and generalized policy improvement.
result Demonstrates practical benefits and transfer abilities in a complex 3D environment.
Algorithm learns data structure in real-time with outliers and change points.
problem Sequential online prediction in the presence of outliers and change points.
method INTEL algorithm using WGPs and POE model for real-time structure learning.
result Significantly better performance than benchmarks in real datasets.
Study on knot classification using 3-braid closures and ribbon surfaces.
problem Classifying smoothly slice knots from 3-braid closures.
method Construct ribbon surfaces and use twisted Alexander polynomial.
result Classification of knots up to 20 crossings.
New tool predicts option evolution with mixed price times.
problem Uncertainty in predicting option prices at specific times.
method Financial Hamiltonian for predicting system evolution.
result Prediction of option evolution with mixed price times.
New proof classifies orbit closures in Hodge bundle.
problem Classifying mGL+(2,R)-orbit closures in Hodge bundle. method Using deformations of flat pairs of pants.
result Short proof of absolute period foliation classification.
In the present paper we construct stock price processes with the same marginal log-normal law as that of a geometric Brownian motion and also with the same transition density (and returns' distributions) between any two instants in a given discrete-time grid. We then illustrate how option prices based on such processes…
We study a regular closure operator in the category of quandles. We show that the regular closure operator and the pullback closure operator corresponding to the reflector from the category of quandles to its full subcategory of trivial quandles coincide, we give a simple description of this closure operator, and analy…
The study connects lamination and orbit closures in hyperbolic manifolds.
problem Understanding the geometric and dynamical properties of horocycle orbit closures in Z-covers of compact hyperbolic manifolds. method Exposes connections between distance minimizing laminations and horospherical orbit closures in Z-covers of compact hyperbolic manifolds. Provides novel constructions and explicit descriptions. result Even slight perturbations to hyperbolic metrics can drastically change horocycle orbit closures.
Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.
problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.
Diversifies reply suggestions for IM systems using M-CVAE.
problem Improving diversity of automated reply suggestions in instant messaging systems.
method Formulated a generative latent variable model with Conditional Variational Auto-Encoder (M-CVAE) to diversify responses.
result Increased diversity by ~30-40% without significant impact on relevance.
Proves closure for specific spacetimes with certain conditions.
problem Proving closure for globally hyperbolic spacetimes.
method Using a Bonnet-Myers type result.
result Proves closure for spacetimes with specific conditions.
Classifies Zariski closures of positive representations in Lie groups.
problem Classifying Zariski closures of positive representations in Lie groups.
method Classifies the Lie algebra of the Zariski closure of a discrete subgroup with specific properties.
result Obtains a new proof of Guichard's classification of Zariski closures of Hitchin representations.
Study proposes curvature flow model for Drosophila dorsal closure.
problem Modeling and understanding Drosophila dorsal closure during embryonic development.
method Curvature-based mathematical model, analysis of maximum-principle and integral-estimates, numerical approximation scheme.
result Established global existence and convergence for the model.
The paper tackles the problem of deriving a topological structure among stock prices from high frequency historical values. Similar studies using low frequency data have already provided valuable insights. However, in those cases data need to be collected for a longer period and then they have to be detrended. An effec…
The paper tackles fairness in forecasting and learning linear dynamical systems.
problem Under-representation bias in training data for multiple subgroups.
method Introducing subgroup-fair and instant-fair learning of LDS from multiple trajectories of varying lengths, using hierarchies of convexifications of non-commutative polynomial optimisation problems.
result Empirical results show both the beneficial impact of fairness considerations on statistical performance and encouraging effects of exploiting sparsity on run time.
Classifies orbit closures in translation surface strata.
problem Classifying orbit closures in translation surface strata.
method Classification of extGL(2,R) orbit closures. result Applications to joinings of certain Masur-Veech measures.
Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.
problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.
We discuss two different in general natural approaches to the ideal closure and ideal boundary of Busemann nonpositively curved metric space. It is shown that the identity map of the space admits surjective continuation from its coarse ideal closure to the weak one. We consider some situations when these closures coinc…
A new method predicts non-Markovian closure terms for complex systems.
problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.
The study bounds the number of closed geodesics in a specific orbit closure of surfaces.
problem Counting closed geodesics in a specific orbit closure of surfaces.
method Analyzes triangulations and Teichmüller geodesics to bound the number of closed geodesics.
result Obtains exponential bounds on the number of closed geodesics of length at most R.
Extends graph degree theorem to simplicial closure of Auter space.
problem Connectivity of graphs in Auter space.
method Defines degree for simplicial closure, extends Hatcher-Vogtmann theorem.
result Simplicial closure of Auter space is (d-1)-connected for degree d.
We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev invariants behave under this braid closure.
We give a Dehn-Nielsen type theorem for the homology cobordism group of homology cylinders by considering its action on the acyclic closure, which was defined by Levine, of a free group. Then we construct an additive invariant of those homology cylinders which act on the acyclic closure trivially. We also describe some…
The paper defines plat closures for spherical braids and shows links in RP3 can be realized this way.
problem Defining and analyzing plat closures for spherical braids in RP3. method Defining plat closures, associating residual permutations, and presenting moves on spherical braids.
result The number of components of the plat closure link of a spherical braid is equal to the number of disjoint cycles in its residual permutation.
Determine lens spaces as closures of homology cobordisms over planar surfaces.
problem Identify conditions for lens spaces to be closures of homology cobordisms over planar surfaces.
method Use Chebotarev density theorem in the proof.
result Every lens space is represented as a closure of homology cobordism over a planar surface with three boundary components.
In this paper we study the setting where features are added or change interpretation over time, which has applications in multiple domains such as retail, manufacturing, finance. In particular, we propose an approach to provably determine the time instant from which the new/changed features start becoming relevant with…
The paper classifies orbit closures of symplectic Lie algebras.
problem Classifying orbit closures of symplectic Lie algebras under the action of Sp(4,R). method Analyzing the natural action of Sp(4,R) on the set of 4-dimensional Lie algebras with symplectic structures. result A complete classification of orbit closures of 4-dimensional symplectic Lie algebras.
Characterizes closures of mapping class group orbits on non-orientable surfaces.
problem Understanding closures of orbits in Teichmüller spaces for non-orientable surfaces.
method Analyzes closures in ML and PML for measured laminations, projective measured laminations, and points. result Characterizes closures of weighted two-sided curves in ML. We prove Ptolemaean Inequality and Ptolemaeus' Theorem in the closure complex hyperbolic plane endowed with the Cygan metric.
Study bifurcations and local rigidity on flag manifolds for Yamabe solutions.
problem Yamabe problem on maximal flag manifolds
method Determine bifurcation and local rigidity points for 1-parameter families of solutions
result Identify specific points of bifurcation and local rigidity
The paper proves orbit closure theorems for hyperbolic manifolds with Fuchsian ends.
problem Analyzing the orbit closures of unipotent flows on hyperbolic manifolds with specific ends.
method Establishing an analogue of Ratner's orbit closure theorem for unipotent subgroups in SO(d,1).
result Proves the closure of k-horospheres and (k+1)-geodesic planes are properly immersed submanifolds. The article finds equivalence moves for links in specific manifolds using plat closure of braids.
problem Finding equivalence moves for links in Dunwoody and periodic Takahashi manifolds.
method Representing manifolds with Heegaard splitting and braids, determining equivalence moves algorithmically and computing them explicitly.
result Explicit computation of equivalence moves for some cases.
Simplified proof of foliation closure theorem for linear foliations.
problem Proving the closure of linear foliations on Riemannian manifolds.
method Direct geometric approach, focusing on projectable foliations and compatible connections.
result Smoothness of the closure of linear foliations directly proven.
We show that if a braid B can be parametrised in a certain way, then previous work can be extended to a construction of a polynomial f:R4→R2 with the closure of B as the link of an isolated singularity of f, showing that the closure of B is real algebraic. In particular, we prove that cl…
Normal closures of certain finite subgroups in automorphism and outer automorphism groups of free groups are determined.
problem Determining the normal closures of specific finite subgroups in automorphism and outer automorphism groups of free groups.
method Analyzing the structure of finite subgroups and their normal closures in Aut(Fn) and Out(Fn). result The normal closure of certain finite subgroups in Aut(Fn) and Out(Fn) are determined. Specialized knot theory theorems for strongly involutive links.
problem Classical Alexander and Markov theorems for links.
method Equivariant closure map for strongly involutive links.
result Surjective equivariant closure map up to equivalence of strongly involutive links.
Neural networks trained on natural scenes exhibit Gestalt closure.
problem Understanding how visual perception groups elements in natural scenes.
method Used deep-learning methods to investigate natural scene statistics and their relation to Gestalt laws.
result A neural network trained on natural images exhibits closure on synthetic edge fragment displays.