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

Trend · papers per month

89177266354 · Jun 202019922001200920172026
48 results for multiplicative separation

We present a new method for separating a mixed audio sequence, in which multiple voices speak simultaneously. The new method employs gated neural networks that are trained to separate the voices at multiple processing steps, while maintaining the speaker in each output channel fixed. A different model is trained for ev…

2020-02-29abs ↗pdf ↗

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

We consider the notion of multiple gap as a finite set of ideals that cannot be separated. We study the different types of such objects that can be found in the Boolean algebra of subsets of the natural numbers modulo finite sets.

2010-01-27abs ↗pdf ↗

The Allen-Cahn system on manifolds yields multiple phase distributions.

problem Finding the number of solutions to the Allen-Cahn system on manifolds.
method Volume-fixing variations approach to classify isoperimetric clusters.
result The number of solutions is bounded by topological invariants for parallelizable manifolds.

Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.

problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.

Singing voice separation attempts to separate the vocal and instrumental parts of a music recording, which is a fundamental problem in music information retrieval. Recent work on singing voice separation has shown that the low-rank representation and informed separation approaches are both able to improve separation qu…

2018-01-09abs ↗pdf ↗

The study investigates noise effects on parameter estimation for Ornstein-Uhlenbeck processes.

problem Impact of noise on parameter fitting for Ornstein-Uhlenbeck processes.
method Proposed algorithms to distinguish between thermal and multiplicative noise.
result Effective methods to estimate parameters even when multiplicative noise dominates.

The paper extends optimal transport for linear separability of sheared distributions in supervised learning.

problem Learning on the space of probability measures using shifts and scalings.
method Embedding probability measures into L2L^2 spaces using optimal transport, then applying regular machine learning techniques.
result Sheared distributions can be linearly separated under certain conditions, with bounds on transformations.

SepIt improves speech separation for multiple speakers.

problem Improving speech separation for multiple speakers in single channel recordings.
method SepIt uses a deep neural network that iteratively improves estimates of different speakers based on mutual information.
result SepIt outperforms state-of-the-art methods for 2, 3, 5, and 10 speakers.

Recently, there has been growing interest in multi-speaker speech recognition, where the utterances of multiple speakers are recognized from their mixture. Promising techniques have been proposed for this task, but earlier works have required additional training data such as isolated source signals or senone alignments…

2018-05-15abs ↗pdf ↗

Understanding separation effects on parameter estimation in finite Gaussian mixtures

problem Minimum component separation impact on convergence rates in finite Gaussian mixtures
method Developing a unified geometric framework using Hellinger lower bounds and specialized moment-extraction test functions
result Separation complexity driven by spatial configuration of mixture components

We present an approach to learn the dynamics of multiple objects from image sequences in an unsupervised way. We introduce a probabilistic model that first generate noisy positions for each object through a separate linear state-space model, and then renders the positions of all objects in the same image through a high…

2019-07-20abs ↗pdf ↗

Recent progress in separating the speech signals from multiple overlapping speakers using a single audio channel has brought us closer to solving the cocktail party problem. However, most studies in this area use a constrained problem setup, comparing performance when speakers overlap almost completely, at artificially…

2019-07-02abs ↗pdf ↗

Constructs initial data for multiple black holes with specified ADM parameters.

problem Forming multiple black holes with specific ADM parameters.
method Smooth, asymptotically flat vacuum initial data with prescribed ADM energy, momentum, and angular momentum.
result Maximal development of data results in spacetimes containing multiple black holes.

New examples of non-bumpy metrics on spheres and projective spaces with multiplicity.

problem Finding non-bumpy metrics with multiplicity on spheres and projective spaces.
method New area-and-separation estimate for minimal hypersurfaces with Morse index two.
result First examples of non-bumpy metrics with multiplicity on (n+1)(n+1)-spheres and projective spaces.

MFCVAE clusters data over multiple facets, improving disentanglement and generation.

problem Clustering high-dimensional data like images over multiple characteristics.
method Variational autoencoder with hierarchical latent variables and Mixture-of-Gaussians priors.
result MFCVAE learns and clusters over multiple aspects of data in a disentangled manner.

Model separates overall uncertainty into aleatoric and epistemic components for active learning.

problem Active learning with uncertainty quantification.
method Non-stationary Heteroscedastic Gaussian process model.
result Model separates overall uncertainty into aleatoric and epistemic components.

The task of clustering a set of objects based on multiple sources of data arises in several modern applications. We propose an integrative statistical model that permits a separate clustering of the objects for each data source. These separate clusterings adhere loosely to an overall consensus clustering, and hence the…

2013-02-28abs ↗pdf ↗

Research in deep learning for multi-speaker source separation has received a boost in the last years. However, most studies are restricted to mixtures of a specific number of speakers, called a specific scenario. While some works included experiments for different scenarios, research towards combining data of different…

2018-08-24abs ↗pdf ↗

A new method detects hidden driving forces in systems with multiple observables.

problem Hidden driving forces in systems with multiple observables cannot be detected by scalar statistics.
method Cross-spectral witness for hidden nonequilibrium.
result Two simultaneously observed channels retain an off-diagonal cross-spectral sector inaccessible to scalar reductions.

This paper develops a new nonlocal approximation method for minimal surfaces, proving robust estimates and separation properties.

problem Constructing minimal surfaces in 3-manifolds and understanding their stability and separation.
method Nonlocal approximation of minimal surfaces, focusing on stability and separation properties.
result Robust curvature and separation estimates for stable nonlocal minimal surfaces, proving hyperplanes are the only stable hypersurfaces in R^4.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

We present a data dependent generalization bound for a large class of regularized algorithms which implement structured sparsity constraints. The bound can be applied to standard squared-norm regularization, the Lasso, the group Lasso, some versions of the group Lasso with overlapping groups, multiple kernel learning a…

2011-08-17abs ↗pdf ↗

Improved defect detection in layered materials using signal separation methods.

problem Challenging defect detection due to strong clutter in layered structures.
method Joint rank and sparsity minimization with an iteratively reweighted nuclear and 1\ell_1-norm approach, combined with deep learning for parameter optimization.
result The proposed approach outperforms conventional methods in terms of accuracy and speed of convergence.

System learns to combine multiple model components for personalized text generation.

problem Adapting and biasing language models for personal preferences.
method Combines model-defined components, learns activation and probability combination from unlabeled text.
result Directly generates text with personalized components from unlabeled data.