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

Trend · papers per month

12.5%25.0%37.5%50.0% · Apr 199419922001200920172026
48 results for Label separation

Single-microphone, speaker-independent speech separation is normally performed through two steps: (i) separating the specific speech sources, and (ii) determining the best output-label assignment to find the separation error. The second step is the main obstacle in training neural networks for speech separation. Recent…

2019-08-04abs ↗pdf ↗

This paper proposes a multichannel source separation technique called the multichannel variational autoencoder (MVAE) method, which uses a conditional VAE (CVAE) to model and estimate the power spectrograms of the sources in a mixture. By training the CVAE using the spectrograms of training examples with source-class l…

2018-08-02abs ↗pdf ↗

AUC-spec optimizes graph-based SSL for complex label distributions.

problem Training accurate models with scarce labeled data and abundant unlabeled data.
method Computes a low-dimensional representation that maximizes class separation via AUC optimization.
result AUC-spec achieves competitive results on synthetic and real-world datasets.

Structured credal learning separates covariate shift and label disagreement.

problem Uncertainty in real-world learning tasks due to covariate shift and noisy labels.
method Introduces a structured credal learning framework that explicitly separates these sources.
result Geometric bounds and decomposition reveal how covariate shifts affect label disagreement contributions.

The paper cleans label noise in supervised classification using Bernoulli sampling.

problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.

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.

CascadeXML improves multi-resolution learning for XMC with transformer features.

problem Learning subset labels from millions of choices with trade-offs between performance and computation.
method End-to-end multi-resolution learning pipeline using transformer multi-layer architecture.
result Significantly outperforms existing approaches on benchmark datasets.

New approach uses under-trained deep ensembles to learn from noisy labels.

problem Improper labelling hinders reliable generalization in supervised learning.
method Under-trained deep ensembles, each trained on a subset of data, combine to form better labels.
result Significant performance improvement in accuracy and kappa for noisy label tasks.

Recently, digital music libraries have been developed and can be plainly accessed. Latest research showed that current organization and retrieval of music tracks based on album information are inefficient. Moreover, they demonstrated that people use emotion tags for music tracks in order to search and retrieve them. In…

2017-09-17abs ↗pdf ↗

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.

The need for labour intensive pixel-wise annotation is a major limitation of many fully supervised learning methods for segmenting bioimages that can contain numerous object instances with thin separations. In this paper, we introduce a deep convolutional neural network for microscopy image segmentation. Annotation iss…

2019-06-20abs ↗pdf ↗

Detecting and recovering labels in binomial logistic mixtures is challenging due to an information gap.

problem Detecting and recovering labels in binomial logistic mixtures
method Propose two feasibility-aware inference procedures
result Avoid misleading component selections and improve label probability calibration

OSAMD adapts online to changing distributions with limited labels.

problem Models struggle with continual distribution shifts and expensive labeling in changing environments.
method Online Active Continual Adaptation with OSAMD, an online teacher-student structure and margin-based criterion.
result OSAMD achieves favorable dynamic regret bounds under changing environments with limited labels.

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

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.

Fisher loss improves deep domain adaptation by learning discriminative within-class compact and between-class separable representations.

problem Improving deep domain adaptation performance by learning discriminative representations.
method Proposes a Fisher loss to learn discriminative representations that are within-class compact and between-class separable.
result Noticeable improvements in deep domain adaptation performance, e.g., 6.67% absolute improvement in mean accuracy on the Office-Home dataset.

Unified framework for learning with indirect supervision signals.

problem Learning from indirect supervision signals when gold labels are missing or costly.
method Developed a unified theoretical framework for multi-class classification with variable supervision.
result Introduced the concept of separation to characterize learnability and generalization bounds.

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.

Preventing early progression of epilepsy and so the severity of seizures requires an effective diagnosis. Epileptic transients indicate the ability to develop seizures but humans overlook such brief events in an electroencephalogram (EEG) what compromises patient treatment. Traditionally, training of the EEG event dete…

2019-03-11abs ↗pdf ↗

Binary classification improves with a small fraction of corrupted labels.

problem Binary classification with corrupted labels.
method Established corruption as a form of regularization and computed upper bounds on estimation error.
result Corruption is beneficial only up to a small fraction of the total sample, scaling with the square root of the sample size.

We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit an universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the considered surface.

2000-06-02abs ↗pdf ↗

Semi-supervised learning improves classification in high dimensions.

problem Combining labeled and unlabeled data for high-dimensional classification.
method Information theoretic and computational lower bounds analysis for feature selection.
result Semi-supervised learning is advantageous for classification in high dimensions.

Study of eigenvalues in nonlinear kernels for classification of separable data.

problem Understanding the applicability of linear equivalents in nonlinearly separable data classification.
method Analysis of conjugate kernels and their quadratic equivalents for a canonical nonlinearly separable dataset (XOR problem).
result Identification of regimes where nonlinear kernels deviate from linear equivalents, leading to label-aligned eigenspaces.

Uplift modeling is aimed at estimating the incremental impact of an action on an individual's behavior, which is useful in various application domains such as targeted marketing (advertisement campaigns) and personalized medicine (medical treatments). Conventional methods of uplift modeling require every instance to be…

2018-03-14abs ↗pdf ↗

Practically, we are often in the dilemma that the labeled data at hand are inadequate to train a reliable classifier, and more seriously, some of these labeled data may be mistakenly labeled due to the various human factors. Therefore, this paper proposes a novel semi-supervised learning paradigm that can handle both l…

2019-02-20abs ↗pdf ↗

Competitive methods for multi-label classification typically invest in learning labels together. To do so in a beneficial way, analysis of label dependence is often seen as a fundamental step, separate and prior to constructing a classifier. Some methods invest up to hundreds of times more computational effort in build…

2015-03-31abs ↗pdf ↗

SGD-trained neural networks generalize well even with adversarial label noise.

problem Generalization of neural networks trained on adversarial label noise.
method Training a one-hidden-layer neural network with SGD on arbitrary width networks.
result SGD-trained networks achieve classification accuracy competitive with the best halfspace over adversarial label noise.

ATLAS separates invariant and transferable latent factors across diverse environments.

problem Transfer learning and robust prediction in heterogeneous environments.
method ATLAS leverages invariance principle to disentangle latent factors and uses auxiliary labels for robust prediction.
result Near-oracle performance and robust transferable prediction in new environments.

Generalizes underlap coefficient for multivariate group separation.

problem Quantifying distributional separation across groups in statistical learning.
method Generalizes underlap coefficient (UNL) to multivariate settings, studies its relationship with Bayes risk and mutual information, proposes an efficient importance sampling estimator.
result UNL as a measure of dependence between group labels and variables of interest, interpretable measure of partition-covariate dependence in clustering.

Generalizes underlap coefficient for multivariate group separation.

problem Quantifying distributional separation across groups in statistical learning.
method Generalizes underlap coefficient (UNL) to multivariate variables, establishes key properties, interprets as dependence measure, proposes efficient estimator.
result Highlights the UNL's utility in clustering for evaluating group structure dependence on covariates.

DM2L tackles missing labels in multi-label learning by modeling local and global rank structures.

problem Missing labels in multi-label learning.
method DM2L imposes local low-rank structures and global high-rank structures on predictions of instances from the same and different labels, respectively.
result DM2L outperforms state-of-the-art methods in multi-label learning with missing labels.