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

Trend · papers per month

3367100133 · May 202619922001200920172026
48 results for masking-based separation

Improved speech separation and enhancement using neural beamforming.

problem Challenging speech separation and enhancement in reverberant environments.
method Sequential neural beamforming combining spectral and spatial separation methods.
result Average improvement of 2.75 dB in scale-invariant signal-to-noise ratio and 14.2% absolute reduction in speech recognition metric.

Recent deep learning approaches have achieved impressive performance on speech enhancement and separation tasks. However, these approaches have not been investigated for separating mixtures of arbitrary sounds of different types, a task we refer to as universal sound separation, and it is unknown how performance on spe…

2019-05-08abs ↗pdf ↗

Traditional classifiers can generate high-quality images comparable to generative models.

problem Separation between classifiers and generators in neural networks.
method Optimizing input gradients to produce images, using mask-based stochastic reconstruction, progressive-resolution technique, and distance metric loss.
result Traditional classifiers can generate high-fidelity images of 256imes imes256 resolution on ImageNet.

PSI models and infers feature attributions efficiently and accurately.

problem Modeling and inferring feature attributions in flexible predictive models.
method Probabilistic Shapley inference (PSI) framework using latent random variables and a masking-based neural network architecture.
result PSI learns feature attribution distributions centered at Shapley values, revealing meaningful uncertainty.

EXAGREE selects a stakeholder-aligned model to reduce conflicting explanations in machine learning.

problem Conflicting explanations from different attribution methods limit the adoption of machine learning models in safety-critical domains.
method EXAGREE is a two-stage framework that selects a Stakeholder-Aligned Explanation Model (SAEM) from a set of similar-performing models, maximizing Stakeholder-Machine Agreement (SMA).
result EXAGREE achieves simultaneous gains in faithfulness, plausibility, and fairness over baselines while preserving task accuracy.

We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of …

2019-04-02abs ↗pdf ↗

CADD improves generative quality by augmenting discrete diffusion with continuous latent space.

problem Loss of semantic information between denoising steps in discrete diffusion models.
method Introduces a framework that augments discrete state space with a continuous latent space, allowing for graded, informative masked tokens.
result CADD improves generative quality across text generation, image synthesis, and code modeling.

Unified deep learning framework improves SV in noisy, reverberant, and long non-speech segments.

problem Robust speaker verification in adverse environments, especially short speech segments.
method Feature Pyramid Module (FPM)-based Multi-scale Aggregation (MSA), Self-adaptive Soft VAD (SAS-VAD), Masking-based Speech Enhancement (SE).
result The proposed method outperforms baseline systems in challenging conditions.

This paper improves universal sound separation using sound classification.

problem Separating acoustic sources from an open domain, regardless of their class.
method Utilizing semantic embeddings from a sound classifier to condition a separation network.
result Classifier embeddings provide nearly one dB of SNR gain, and iterative models achieve significant performance.

DSI measures dataset separability for neural networks.

problem Difficulty in separating different classes of data in neural networks.
method Created the Distance-based Separability Index (DSI) to quantify dataset separability.
result DSI effectively measures dataset separability and indicates similar distributions of different classes.

Separates estimation and control in risk-sensitive investment problems with partial observation.

problem Risk-sensitive investment problems with incomplete observation.
method Investigates separability of a general class of risk-sensitive investment management problems using a finite-dimensional filter.
result The separated problem is strictly equivalent to the original control problem.

Boosts neural network performance by improving weight separability.

problem Improving the separability of weight vectors in neural networks.
method Proposes a new evaluation metric and feed-backward reconstruction loss to encourage weight separability.
result Improves visual recognition performance across various tasks.

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

New machine learning method detects quantum separability in large-scale systems.

problem Deciding quantum separability of large-scale bipartite density matrices.
method Frank-Wolfe-based algorithm for finding nearest separable density matrices and classification of density matrices as separable or entangled.
result The method scales up to thousands of density matrices and achieves high quantum entanglement detection accuracy.

The study shows subgroup separability conditions for specific groups.

problem Conditions for subgroup separability in free-by-cyclic and deficiency 1 groups.
method Analyzes polynomially growing monodromy and asymptotic probability of random groups.
result Random deficiency 1 groups are not subgroup separable with positive probability.

The study of random surfaces reveals asymptotic lengths of separating geodesics.

problem Understanding geometric properties of random hyperbolic surfaces.
method Analysis of Weil-Petersson measure and asymptotic behavior of lengths.
result The shortest separating closed geodesics have lengths about 2logg2\log g.

A new measure DCSI quantifies separability for density-based clustering.

problem Quantifying meaningful clusters in data sets.
method Developed a new separability measure DCSI based on separation and connectedness.
result Correctly identifies touching or overlapping classes that do not correspond to meaningful density-based clusters.

A new NMF variant tackles underdetermined problems with sparse and separable assumptions.

problem Underdetermined blind source separation, especially multispectral image unmixing.
method Sparse Separable Nonnegative Matrix Factorization (SSNMF) combining separability and sparsity assumptions. Algorithm based on SNPA and sparse nonnegative least squares.
result In noiseless settings, the algorithm recovers true underlying sources.

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact propagation of marginals for prediction. This paper addresses two questions left open by t…

2012-06-27abs ↗pdf ↗

Develops large-sample theory for non-stationary source separation.

problem Lack of large-sample results for non-stationary source separation methods.
method Large-sample theory for NSS-JD method under specific assumptions.
result Consistency of unmixing estimator and its convergence to Gaussian distribution.

Study on hyperbolic groups, focusing on separability and splittings.

problem Coarse separability and splittings in hyperbolic groups.
method Quantitative analysis of volume growth and cut-sets, focusing on thickened spheres.
result One-ended hyperbolic groups that are not virtually surface groups are coarsely separable by a subset of subexponential growth if and only if they split over a virtually cyclic subgroup.

The paper solves optimal bounds for separating data points in high dimensions.

problem Correcting AI errors and analyzing vulnerabilities in high-dimensional data.
method General stochastic separation theorems with optimal probability estimates.
result Explicit and optimal estimates of separation probabilities for important classes of distributions.

Suppose that all hyperbolic groups are residually finite. The following statements follow: In relatively hyperbolic groups with peripheral structures consisting of finitely generated nilpotent subgroups, quasiconvex subgroups are separable; Geometrically finite subgroups of non-uniform lattices in rank one symmetric sp…

2008-11-25abs ↗pdf ↗

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 ↗

Improved mistake bound for group linear separable cases in online multiclass linear classification.

problem Improving mistake bounds for online multiclass linear classification under group linear separable conditions.
method Refined group weak linear separability condition and rational kernel approach.
result Achieved a mistake bound of K2ildeO(1/γlogL))K\cdot 2^{ ilde{O}(\sqrt{1/γ}\log L)}) under group weak linear separable condition.

Study on diagonal and separating coordinates for symmetric spaces of rank 1.

problem Existence and nonexistence of diagonal and separating coordinates for symmetric spaces of rank 1.
method Generalization of results by Gauduchon and Moroianu, 2020, and analysis of constant sectional curvature and orthogonal separation of variables.
result Diagonal coordinates exist if and only if the symmetric space has constant sectional curvature.