New deep-unfolded network improves video background separation.
problem Video foreground-background separation.
method Deep unfolding of an iterative RPCA algorithm with adaptive learning.
result Proposed network outperforms state-of-the-art in video foreground-background separation.
Novel algorithm for separating moving camera video into static and dynamic components.
problem Foreground-background separation in noisy, moving camera video.
method Augmented robust PCA with total variation regularization, OptShrink low-rank matrix estimator.
result Panoramic low-rank component spanning entire field of view, automatically stitching corrupted data.
New method for separating foreground from background in noisy, moving camera video.
problem Foreground-background separation in noisy, free-moving camera video.
method Registers frames, encodes perspective as missing data, uses OptShrink for low-rank estimation, and weighted total variation for smooth foreground.
result Panoramic background component that stitches together corrupted data from overlapping frames.
Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF problem as that of finding the extreme rays of the conical hull of a finite set …
We consider an online version of the robust Principle Component Analysis (PCA), which arises naturally in time-varying source separations such as video foreground-background separation. This paper proposes a compressive online robust PCA with prior information for recursively separating a sequences of frames into spars…
We propose a unified and systematic framework for performing online nonnegative matrix factorization in the presence of outliers. Our framework is particularly suited to large-scale data. We propose two solvers based on projected gradient descent and the alternating direction method of multipliers. We prove that the se…
This research shows unsupervised GANs can perform object segmentation without labels.
problem Performing object segmentation without pixel or image-level labels.
method Used large-scale unsupervised GAN models to differentiate foreground from background.
result Demonstrated high-quality saliency masks and new state-of-the-art performance.
Ensemble methods are arguably the most trustworthy techniques for boosting the performance of machine learning models. Popular independent ensembles (IE) relying on naive averaging/voting scheme have been of typical choice for most applications involving deep neural networks, but they do not consider advanced collabora…
Machine learning's data-centric philosophy conflicts with natural sciences' standards.
problem Conflict between machine learning's ontology and epistemology and natural sciences' practices.
method Identifying and analyzing contexts where ML can be beneficial or harmful in natural sciences.
result ML can enhance trustworthiness in causal inference but introduces biases in emulation and labeling.
New graph types help identify complex relationships.
problem Understanding complex relationships in data.
method Introducing separable and essentially separable graphs to characterize and identify graphical models.
result Developed algorithms to identify equivalence classes of essentially separable graphs.
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.
Shallow neural nets classify objects perfectly if their distribution is linearly separable.
problem Designing efficient neural networks for classification.
method Constructed shallow sigmoid-type neural networks.
result Achieves 100% accuracy for datasets following a linear separability condition.
Spectrogram-Channels U-Net separates sounds by treating each channel as a source's spectrogram.
problem Sound source separation in music information retrieval.
method Adapting U-Net to treat each channel of the output as a source's spectrogram, balancing volumes between sources.
result State-of-the-art performance on singing voice and multi-instrument separation.
System separates sounds from mixtures without ground truth info.
problem Sound separation from multi-channel mixtures without labeled data.
method Deep clustering on multi-channel mixtures, projecting bins to spatially correlated clusters.
result Performance matches ground truth separation using only multi-channel mixtures.
Neural networks can separate non-separable data using feature maps.
problem Non-separable data in neural networks.
method Characterization of feedforward neural networks and use of feature maps.
result ReLU neural networks can separate concentric data.
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.
New method separates audio sources without needing known decompositions.
problem Difficulty in training source separation models on real-world mixtures.
method Generates estimated decompositions from stereo mixtures and trains a deep learning model.
result Trained model can separate single-channel audio sources effectively.
Proposes a two-step method for sound source separation.
problem Improving sound source separation performance.
method First, learn a latent space transform. Second, train a separation module in the latent space.
result The proposed method achieves better performance than joint learning approaches.
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.
New method separates mixed distributions without requiring samples of each source.
problem Separating mixed distributions in machine learning and signal processing.
method Neural Egg Separation method iteratively learns to separate known from unknown distributions.
result Neural Egg Separation outperforms current methods in audio and image separation tasks.
Bayesian approach uses generative models as priors for better source separation.
problem Artifacts in source separation for richly structured data.
method Bayesian approach with generative models as priors and noise-annealed Langevin dynamics.
result Achieves state-of-the-art performance for MNIST digit separation.
New algorithm separates vocals from music recordings efficiently.
problem Separate vocal and instrumental parts in music recordings.
method Informed group-sparse representation for linear-time singing voice separation.
result Efficacy confirmed on iKala dataset; music accompaniment follows group-sparse structure.
New examples show some convex-cocompact subgroups are separable.
problem Whether all convex-cocompact subgroups are separable.
method Using Manning-Mj-Sageev construction, examples of separable subgroups of arbitrary finite rank are given.
result Examples of separable convex-cocompact subgroups of arbitrary finite rank exist.
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.
Non-relatively hyperbolic separating curve graph for surfaces.
problem Classifying hyperbolicity of separating curve graphs.
method Proof of non-relatively hyperbolic property.
result Separating curve graph is not relatively hyperbolic for surfaces with genus ≥ 3 and one boundary component.
Deep learning models improve sound separation across various types of sounds.
problem Developing a universal method to separate arbitrary sounds of different types.
method Created a dataset of mixtures containing arbitrary sounds, investigated mask-based separation architectures, and tested different framewise analysis-synthesis bases.
result STFT outperformed learnable bases in universal sound separation tasks.
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.
New method uses adversarial training for blind source separation.
problem Blind single-channel source separation challenge.
method Adversarial training for independence of sources.
result Good performance validated on image sources.
The paper examines subgroup separability for surface and virtual braid groups.
problem Subgroup separability of surface and virtual braid groups.
method Study of subgroup separability (LERF) properties.
result Properties of subgroup separability for surface and virtual braid groups are explored.
Prob-PIT improves speech separation by considering output-label permutations as random variables.
problem Overconfident output-label assignment in PIT leads to unreliable speech separation.
method Prob-PIT treats output-label permutations as a discrete latent random variable with a uniform prior distribution and maximizes the log-likelihood function.
result Prob-PIT significantly outperforms PIT in terms of Signal to Distortion Ratio and Signal to Interference Ratio.
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 2logg. New algorithm separates sparse sources from Poisson measurements.
problem Blind source separation of sparse sources from Poisson measurements.
method pGMCA algorithm for Poisson measurements.
result Recovery of sparse sources from Poisson measurements.
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.
This work examines a semi-blind single-channel source separation problem. Our specific aim is to separate one source whose local structure is approximately known, from another a priori unspecified background source, given only a single linear combination of the two sources. We propose a separation technique based on lo…
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.
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…
This work learns sparse tensor representations using mixtures of separable dictionaries.
problem Learning sparse representations of tensor data with structured models.
method Proposes and explores learning a mixture of separable dictionaries with sufficient conditions for local identifiability.
result Developed computational algorithms for batch and online learning.
Criterion for subgroup separability in outer automorphism groups.
problem Subgroup separability in outer automorphism groups.
method Criterion for separability of subgroups.
result Strengthening and generalizing a previous result on mapping class groups.
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.
Wavesplit separates speech from mixtures using clustering.
problem Permutation problem in speech separation.
method End-to-end system infers speaker representations and estimates signals.
result Robust separation of long recordings, new benchmarks set.
The paper introduces toric separable geometries and finds new extremal metrics.
problem Finding explicit extremal Kähler metrics on toric manifolds.
method Introducing toric separable geometries and analyzing their moduli space.
result Explicit computation of scalar curvature and derivation of necessary conditions for extremality.
The paper simplifies 3-manifold decompositions using separating surfaces.
problem Decomposing 3-manifolds with Heegaard splittings.
method Using Morse position and separating incompressible surfaces.
result Simplifies the hierarchy of 3-manifolds.
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…
Adaptive algorithm reduces regret in causal bandits.
problem Minimize regret in causal bandits with unknown d-separators.
method Adaptive algorithm exploiting d-separators without prior knowledge.
result Significantly smaller regret than previous methods.