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

2915828721,163 · Jun 202019922001200920172026
48 results for data separability

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.

This paper investigates how data augmentation improves linear separation of manifold data.

problem Understanding how data augmentation enhances linear separation of manifold data.
method Investigates the conditions under which self-supervised representations can linearly separate multi-manifold data.
result Self-supervised learning can linearly separate manifolds with a smaller distance than unsupervised learning.

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.

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.

Scattering networks maximize separation on low-dimensional data.

problem Maximizing separation capacity on low-dimensional datasets.
method Characterize and bound separation capacity for feature extractors, then apply to scattering networks with specific criteria.
result Design criteria for scattering networks to maximize separation on low-dimensional data.

Constructs classifiers for neural networks with specific data configurations.

problem Finding global minima of deep ReLU neural networks on sequentially separable data.
method Explicitly constructs zero loss neural network classifiers using cumulative parameters and truncation maps.
result Global minimizers can be described with a limited number of parameters based on the data structure.

Despite substantial progress in signal source separation, results for richly structured data continue to contain perceptible artifacts. In contrast, recent deep generative models can produce authentic samples in a variety of domains that are indistinguishable from samples of the data distribution. This paper introduces…

2020-02-19abs ↗pdf ↗

Shallow nonlinear networks can separate classes linearly with polynomially scaling width.

problem Understanding the linear separability of deep networks' features.
method Modeling inputs as a union of low-dimensional subspaces and using random weights and quadratic activations.
result Shallow nonlinear networks can achieve linear separation with polynomially scaling width.

Neural networks use their hidden layers to transform input data into linearly separable data clusters, with a linear or a perceptron type output layer making the final projection on the line perpendicular to the discriminating hyperplane. For complex data with multimodal distributions this transformation is difficult t…

2018-07-08abs ↗pdf ↗

Speech separation refers to extracting each individual speech source in a given mixed signal. Recent advancements in speech separation and ongoing research in this area, have made these approaches as promising techniques for pre-processing of naturalistic audio streams. After incorporating deep learning techniques into…

2019-12-17abs ↗pdf ↗

Mirror flow optimizes separable data problems, converging to a maximum margin classifier.

problem Optimizing classification problems with separable data using mirror flow.
method Examine mirror flow on linearly separable classification problems, focusing on the horizon function of the mirror potential.
result Mirror flow converges to a maximum margin classifier for separable data under certain conditions.

Paper develops robust methods for panel data with latent groups, improving inference under group separation violations.

problem Inference in latent group panel models under group separation violations.
method Selective conditional inference approach to derive conditional distribution of coefficients given estimated group structure.
result Valid inference under violations of group separation, superior to traditional asymptotic methods.

Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data with applications such as image analysis, text mining, audio source separation and hyperspectral unmixing. Given a data matrix MM and a factorization rank rr, NMF looks for a nonnegative matrix WW with rr columns and a …

2019-05-30abs ↗pdf ↗

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

A new method for separating mixed signals in space and time.

problem Nonlinear and nonstationary spatio-temporal data challenges.
method Identifiable autoregressive variational autoencoder.
result The method outperforms existing techniques in blind source separation and spatio-temporal prediction.

Adversarial noises are linearly separable for random neural networks.

problem The challenge of adversarial examples in neural networks.
method Theoretical proof and empirical evidence for two-layer networks with random initialization and neural tangent kernel setup.
result Adversarial noises are linearly separable with corresponding labels.

New algorithms improve blind source separation for linear-quadratic mixtures.

problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with noise.

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.

Separable losses are inconsistent for structured prediction models.

problem Inconsistency of separable losses in structured prediction models.
method Analysis of separable negative log-likelihood losses for structured prediction.
result Separable losses are not Bayes consistent and may not predict the most probable structure.

The paper connects decision tree interpretability and robustness through separation.

problem Empirical observation of a connection between robustness and interpretability in decision trees.
method Investigation of the connection through decision trees and ll_{\infty}-perturbation robustness, proving bounds on tree size.
result First algorithm with guarantees on robustness, interpretability, and accuracy for decision trees.

Graph convolution improves linear separability and generalizes to out-of-distribution data.

problem Improving linear separability in semi-supervised classification.
method Applying graph convolution to mixtures of Gaussians in a stochastic block model.
result Graph convolution extends the linear separability regime by a factor of 1/D1/\sqrt{D}.

Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this …

2018-12-17abs ↗pdf ↗

This work investigates implicit bias in multiclass separable data using a novel geometry-aware optimizer.

problem Understanding implicit bias in overparameterized models on multiclass separable data.
method Introduces NucGD, a geometry-aware optimizer enforcing low-rank structures through nuclear norm constraints.
result NucGD enables scalable training and characterizes the impact of stochastic optimization dynamics.

Inverse Drum Machine separates drum mixes using transcription and synthesis.

problem Separating individual drum tracks from mixed recordings.
method Analysis-by-synthesis framework combining deep learning and automatic transcription.
result Separation quality comparable to supervised methods requiring isolated stems.

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 ↗