Ends and cohomology theory for noncompact spaces.
problem Study of noncompact spaces and their invariants.
method Exposition of ends theory, introduction of reduced end cohomology, proof of theorems.
result Proof of a theorem on end cohomology of end sums of manifolds.
End-to-end portfolio system accounts for model risk.
problem Model risk in portfolio selection.
method Distributionally robust optimization with convex duality.
result Explicitly accounts for model risk in portfolio selection.
Regularization is important for end-to-end speech models, since the models are highly flexible and easy to overfit. Data augmentation and dropout has been important for improving end-to-end models in other domains. However, they are relatively under explored for end-to-end speech models. Therefore, we investigate the e…
Develops Bayesian approach for end-to-end learning in stochastic optimization.
problem Stochastic optimization problems under uncertainty.
method Bayesian interpretation and new end-to-end learning algorithms.
result Improved decision maps for empirical risk minimization and distributionally robust optimization.
Study shows mapping class groups are one-ended for surfaces with at least one end.
problem Analyzing the number of ends in mapping class groups of surfaces.
method Proving the associated translatable curve graph is one-ended, quasi-isometric to the mapping class group.
result Mapping class groups are one-ended for surfaces with at least one end of discrete type.
We give a mathematical foundation for, and numerical demonstration of, the existence of mean curvature 1 surfaces of genus 1 with either two elliptic ends or two hyperbolic ends in de Sitter 3-space. An end of a mean curvature 1 surface is an ``elliptic end'' (resp. a ``hyperbolic end'') if the monodromy matrix at the …
End-to-end autonomous driving models get better uncertainty estimates.
problem Uncertainty quantification for end-to-end autonomous driving models.
method Approximate inference for implicit copula neural linear model.
result Densities for steering angle are marginally calibrated.
This work proposes splitting deep neural networks into smaller sub-networks for faster and more efficient distillation.
problem Challenges in training deep neural networks, including local optima, gradient issues, and computational demands.
method Proposes a non-end-to-end distillation approach by splitting networks into smaller, independent sub-networks (neighbourhoods).
result Independent training of smaller sub-networks can speed up distillation and improve efficiency in various applications.
End-to-end learning refers to training a possibly complex learning system by applying gradient-based learning to the system as a whole. End-to-end learning system is specifically designed so that all modules are differentiable. In effect, not only a central learning machine, but also all "peripheral" modules like repre…
End-to-end autonomous driving perception learns latent features for better performance.
problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.
Study end sum for surfaces and prove uniqueness results.
problem Uniqueness of end sum for surfaces and related manifolds.
method Analyzing end sum and adding a 1-handle at infinity for surfaces.
result The end sum of two surfaces with compact boundary is uniquely determined by the chosen ends.
Study of non-metrizable manifolds' ends, generalizing Nyikos's theorem.
problem Characterizing non-metrizable surfaces with ends.
method Introducing short and long ends, developing theory of spaces of ends.
result Characterization of surfaces as metrizable manifolds plus long pipes.
Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.
problem Learning a tree end-to-end for clustering without labels is an open challenge.
method Greedy maximization of the kernel KMeans objective without centroids.
result Kauri often outperforms existing unsupervised clustering methods, especially with non-linear kernels.
End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.
problem Handwritten numeral string recognition with traditional preprocessing steps.
method YoLo-based model for automatic detection and recognition, avoiding heuristic-based preprocessing and segmentation.
result Proposed method reduces complexity and is a feasible end-to-end solution for numeral string recognition.
New Hilbert bundles with ends defined from indexed bases.
problem Defining new structures in Hilbert bundles.
method Indexed bases and unitary operators of finite propagation.
result Characteristic classes of Hilbert bundles with ends.
Estimates ends of Ricci shrinkers, focusing on smooth and singular cases.
problem Understanding the structure of ends in Ricci shrinkers, especially singular ones.
method Analyzes general and asymptotically conical ends, applies to weak convergence.
result No new conical end can form in the limit of sequences of Ricci shrinkers.
End-to-end policy learning improves statistical arbitrage trading.
problem Traditional mean reversion trading strategies in statistical arbitrage are limited.
method We use Autoencoder architectures and policy learning to develop trading strategies.
result End-to-end training yields superior gross returns.
End-to-end audio recognition system improves accuracy.
problem Improving accuracy in auditory object recognition.
method Proposes an end-to-end deep neural network with an 'inception nucleus' to learn features from raw waveforms.
result Bests current state-of-the-art approaches by 10.4 percentage points on Urbansound8k dataset.
Derives an index formula for families of end-periodic Dirac operators.
problem Calculating the index of families of end-periodic Dirac operators.
method Using the renormalized Chern character and Fourier-Laplace transform of the Bismut superconnection.
result Establishes an index formula involving a new end-periodic eta form.
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…
New maxfaces with Enneper ends found.
problem Existence of higher-genus maxfaces with specific ends.
method Proved existence through mathematical proof.
result Existence of new maxfaces with Enneper ends.
In this paper, we present an end-to-end training framework for building state-of-the-art end-to-end speech recognition systems. Our training system utilizes a cluster of Central Processing Units(CPUs) and Graphics Processing Units (GPUs). The entire data reading, large scale data augmentation, neural network parameter …
The study counts ends on shrinkers using geometric covering methods.
problem Counting the number of ends on shrinkers.
method Geometric covering method to study the number of ends.
result Proves that the number of ends on any complete non-compact shrinker is at most polynomial growth with fixed degree.
End-to-end policy learning method improves CATE estimation.
problem Learning optimal treatment policies from partially observed data.
method Modified causal forest for policy learning.
result Maximizing policy value is equivalent to minimizing CATE.
Survey on manifold ends with new heat kernel estimates.
problem Analyzing geometric properties on manifolds with ends.
method Constructing manifolds with ends and analyzing their heat kernel estimates.
result Found manifolds with ends that have different heat kernel estimates.
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.
Free groups can be end homogeneity groups of 3-manifolds.
problem Tackling the possibility of free groups as end homogeneity groups of 3-manifolds.
method Constructing specific 3-manifolds with end homogeneity groups isomorphic to free groups.
result For every finitely generated free group, there exists an irreducible open 3-manifold with that group as its end homogeneity group.
Recent work on discriminative segmental models has shown that they can achieve competitive speech recognition performance, using features based on deep neural frame classifiers. However, segmental models can be more challenging to train than standard frame-based approaches. While some segmental models have been success…
Optimal Poincaré constant estimates on manifolds with ends.
problem Estimating the Poincaré constant on manifolds with ends.
method Heat kernel estimates extended to manifolds with ends, focusing on central balls.
result The Poincaré constant is determined by the second largest end.
New insights into ends of quotient spaces and graphs.
problem Understanding the ends of quotient spaces and graphs.
method Analyzing infinite volume ends of quotient spaces and graphs.
result Quotient spaces and graphs have exactly one infinite volume end under certain conditions.
End-to-end neural network optimizes portfolios by directly learning allocations from features.
problem Error maximization in two-step portfolio optimization.
method Single feed-forward neural network combining prediction and optimization.
result Model-based end-to-end framework achieves Sharpe ratio of 1.16.
Study of ends of complete gradient Schouten solitons, showing finitely many ends for shrinking and connected infinity for expanding ones.
problem Characterizing the ends of complete gradient Schouten solitons.
method Analysis of ends without additional assumptions, focusing on shrinking and expanding cases.
result Finitely many ends for shrinking Schouten solitons and connected infinity for expanding ones.
End-to-end Text-to-speech (TTS) system can greatly improve the quality of synthesised speech. But it usually suffers form high time latency due to its auto-regressive structure. And the synthesised speech may also suffer from some error modes, e.g. repeated words, mispronunciations, and skipped words. In this paper, we…
Two results on end spaces of infinite type surfaces, answering questions about their topology and equivalence.
problem Topology and equivalence of end spaces of infinite type surfaces.
method Examples and Tsankov's argument to show equivalence relation.
result Examples of infinite type surfaces with end spaces that are not self-similar but have a unique maximal type.
We show that an Osserman-type inequality holds for spacelike surfaces of constant mean curvature (CMC) 1 with singularities and with elliptic ends in de Sitter 3-space. An immersed end of a CMC 1 surface is an ``elliptic end'' if the monodromy representation at the end is diagonalizable with eigenvalues in the unit cir…
Paper proves timelike minimal surfaces with any number of ends exist.
problem Existence of timelike minimal surfaces with arbitrary ends.
method Analyzes asymptotic behavior and topology of constructed surfaces.
result Timelike minimal surfaces with arbitrary ends exist.
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…
Improved portfolio optimization reduces sensitivity to neural network initialization.
problem High sensitivity to neural network initialization in portfolio optimization.
method Robust end-to-end framework for risk budgeting portfolios.
result Enhanced stability in portfolio optimization without compromising performance.
Embeddings of mapping tori for end-periodic graph maps are proven.
problem Embedding mapping tori of end-periodic graph maps into finite complexes.
method Flowline-preserving homotopy equivalence and π1-injective map. result Every mapping class of Γ arising from an end-periodic homotopy equivalence contains a representative whose mapping torus realizes such an embedding.
End-to-end approach for weak supervision improves downstream model performance.
problem Data-labeling bottleneck in machine learning applications.
method Directly learning the downstream model by maximizing its agreement with probabilistic labels generated from weak supervision sources.
result Improved performance over prior work in terms of downstream model performance and robustness.
Proves unknottedness of certain 3D shapes with multiple ends.
problem Determining the structure of complex 3D shapes.
method Used mean curvature flow to analyze shapes with multiple ends.
result Proves unknottedness of shapes with multiple asymptotically conical ends.
Study on projective orbifolds with ends and their deformation theory.
problem Understanding deformation theory of projective orbifolds with ends.
method Analysis of convex real projective structures on strongly tame n-orbifolds.
result Deformation theory for nicest projective orbifolds.
Finite volume ends found in quaternionic Kähler manifolds.
problem Existence of quaternionic Kähler manifolds with finite volume ends.
method Proof in all dimensions 4m≥4. result Existence of quaternionic Kähler manifolds with finite volume ends.
WEEND uses a neural network to recognize speech and assign speakers to words.
problem End-to-end neural diarization without additional ASR and orchestration.
method Multi-task learning with an auxiliary network for ASR and speaker diarization.
result WEEND outperforms turn-based diarization and can handle 5-minute audio.
Real projective structures on n-orbifolds are useful in understanding the space of representations of discrete groups into SL(n+1,R) or PGL(n+1,R). A recent work shows that many hyperbolic manifolds deform to manifolds with such structures not projectively equivalent to the o…
For a complete minimal surface in the Euclidean 3-space, the so-called flux vector corresponds to each end. The flux vectors are balanced, i.e., the sum of those over all ends are zero. Consider the following inverse problem: For each balanced n vectors, find an n-end catenoid which attains given vectors as flux. Here,…
HabitatAgent offers a multi-agent system for transparent housing consultation.
problem Opaque reasoning and brittle multi-constraint handling in housing recommendation systems.
method HabitatAgent is a multi-agent architecture with specialized roles for memory, retrieval, generation, and validation.
result HabitatAgent achieves 95% accuracy in real user consultation scenarios, significantly outperforming a strong baseline.
Guided Learning improves end-to-end modeling for multi-stage decision-making.
problem Challenges in training unified neural networks for multi-stage decision-making.
method Guided Learning framework with a guide function and utility function.
result Significant improvement in performance over traditional methods.