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

3517021,0531,404 · Jun 202019922001200920172026
48 results for general label space

Extends FJS analysis to general label spaces, including classification and regression.

problem Distribution shift in general label spaces, including covariate and label shifts.
method Proposes a framework for analyzing FJS in general label spaces and generalizes existing results.
result Generalizes FJS analysis to general label spaces, including classification and regression.

PML-LFC improves PML by estimating label confidence from both feature and label spaces.

problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.

CCVAE captures label characteristics in VAEs for better representation learning.

problem Capturing rich label characteristics in VAEs without conflating them with label values.
method Developed CCVAE, a novel VAE model that explicitly captures label characteristics in latent space.
result CCVAE allows for effective and general interventions like smooth traversals and diverse conditional generation.

SSMs can be poisoned with clean labels, leading to generalization failure.

problem The implicit bias of SSMs can be manipulated by including special training examples with clean labels.
method Formal proof and empirical demonstration of the phenomenon.
result SSMs can fail to generalize even with clean labels, due to the inclusion of special training examples.

A bidirectional loss function improves label distribution learning and enhancement.

problem Challenges in label distribution learning and label enhancement.
method Bidirectional loss function to address dimensional gap and label enhancement.
result The bidirectional loss function improves the accuracy of label distribution learning and enhancement.

An important problem in multi-label classification is to capture label patterns or underlying structures that have an impact on such patterns. This paper addresses one such problem, namely how to exploit hierarchical structures over labels. We present a novel method to learn vector representations of a label space give…

2014-12-22abs ↗pdf ↗

PLRM synthesizes labels from mismatched sources for better training sets.

problem Creating labeled training sets is a major challenge in machine learning.
method PLRM uses probabilistic modeling to synthesize labels from indirect supervision sources with different output spaces.
result PLRM outperforms baselines by 2%-9% on various tasks.

One-hot encoding is a labelling system that embeds classes as standard basis vectors in a label space. Despite seeing near-universal use in supervised categorical classification tasks, the scheme is problematic in its geometric implication that, as all classes are equally distant, all classes are equally different. Thi…

2018-10-22abs ↗pdf ↗

Partial multi-label learning (PML), which tackles the problem of learning multi-label prediction models from instances with overcomplete noisy annotations, has recently started gaining attention from the research community. In this paper, we propose a novel adversarial learning model, PML-GAN, under a generalized encod…

2019-09-15abs ↗pdf ↗

Multi-label classification aims to classify instances with discrete non-exclusive labels. Most approaches on multi-label classification focus on effective adaptation or transformation of existing binary and multi-class learning approaches but fail in modelling the joint probability of labels or do not preserve generali…

2018-12-07abs ↗pdf ↗

End-to-end deep metric learning tackles multi-label image classification.

problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.

Multi-label learning is concerned with the classification of data with multiple class labels. This is in contrast to the traditional classification problem where every data instance has a single label. Due to the exponential size of output space, exploiting intrinsic information in feature and label spaces has been the…

2018-12-24abs ↗pdf ↗

We propose to formulate multi-label learning as a estimation of class distribution in a non-linear embedding space, where for each label, its positive data embeddings and negative data embeddings distribute compactly to form a positive component and negative component respectively, while the positive component and nega…

2019-11-17abs ↗pdf ↗

Many modern applications deal with multi-label data, such as functional categorizations of genes, image labeling and text categorization. Classification of such data with a large number of labels and latent dependencies among them is a challenging task, and it becomes even more challenging when the data is received onl…

2018-04-04abs ↗pdf ↗

EXoN creates an explainable latent space for semi-supervised learning.

problem Creating an explainable latent space for semi-supervised learning.
method EXoN combines VAE with SCI (Soft-label Consistency Interpolation) to create an explainable latent space.
result EXoN reduces the cost of investigating representation patterns on the latent space.

Unsupervised Domain Adaptation (DA) is used to automatize the task of labeling data: an unlabeled dataset (target) is annotated using a labeled dataset (source) from a related domain. We cast domain adaptation as the problem of finding stable labels for target examples. A new definition of label stability is proposed, …

2017-06-16abs ↗pdf ↗

It is well-known that exploiting label correlations is crucially important to multi-label learning. Most of the existing approaches take label correlations as prior knowledge, which may not correctly characterize the real relationships among labels. Besides, label correlations are normally used to regularize the hypoth…

2019-02-08abs ↗pdf ↗

MPVAE learns latent embeddings and label correlations for multi-label classification.

problem Challenging task of predicting multiple targets with label correlations.
method Proposes MPVAE, a novel framework that learns latent embedding spaces and label correlations using a Multivariate Probit model.
result MPVAE outperforms state-of-the-art methods on various application domains and is robust under noisy settings.

The paper analyzes the bias-variance tradeoff for Bregman divergences.

problem Understanding the bias-variance tradeoff for Bregman divergences.
method Analyzes the bias-variance tradeoff through operations in dual space.
result Derives several results including a generalized law of total variance and ensembling operations.

Integrates multiple datasets to solve open set crowdsourcing problems.

problem Crowdsourcing with unknown label space and unfamiliar tasks.
method Integrates multiple crowdsourced datasets, weights them based on category correlation, and uses open set transfer learning.
result Proves OSCrowd solves open set crowdsourcing problems and outperforms related solutions.

Regression problems are pervasive in real-world applications. Generally a substantial amount of labeled samples are needed to build a regression model with good generalization ability. However, many times it is relatively easy to collect a large number of unlabeled samples, but time-consuming or expensive to label them…

2018-08-08abs ↗pdf ↗

Proposes an online metric learning method for multi-label classification.

problem Lack of consideration for label dependencies and theoretical analysis of loss functions in existing multi-label classification methods.
method Develops a novel online metric learning paradigm based on k-Nearest Neighbour (kNN) and large margin principle, adapted for online streaming data.
result The proposed OML algorithm outperforms state-of-the-art methods on benchmark multi-label datasets.

This paper tackles multilabel classification by exploiting label sparsity and hierarchy.

problem Sparse label vectors and unknown label hierarchy in large-scale multilabel classification problems.
method Data-dependent grouping and hierarchical partitioning to solve multilabel classification problems in a lower-dimensional space.
result Our methods achieve competitive accuracy with significantly lower computational costs compared to other methods.

This paper examines error bounds for deep learning classifiers with noisy labels.

problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.

New bounds for contrastive learning handle domain shifts and generalization.

problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.

We present label gradient alignment, a novel algorithm for semi-supervised learning which imputes labels for the unlabeled data and trains on the imputed labels. We define a semantically meaningful distance metric on the input space by mapping a point (x, y) to the gradient of the model at (x, y). We then formulate an …

2019-02-06abs ↗pdf ↗

Human labeling of data can be very time-consuming and expensive, yet, in many cases it is critical for the success of the learning process. In order to minimize human labeling efforts, we propose a novel active learning solution that does not rely on existing sources of unlabeled data. It uses a small amount of labeled…

2018-05-11abs ↗pdf ↗

SAP corrects model for label noise by identifying and removing noisy samples.

problem Label corruption degrades model performance; acquiring perfect labels is costly.
method SAP uses SVD to identify and project model weights onto a clean activation space.
result SAP improves model generalization by up to 6% on CIFAR dataset with 25% synthetic corruption.

Consider a general machine learning setting where the output is a set of labels or sequences. This output set is unordered and its size varies with the input. Whereas multi-label classification methods seem a natural first resort, they are not readily applicable to set-valued outputs because of the growth rate of the o…

2019-03-12abs ↗pdf ↗

This paper discusses the effect of hubness in zero-shot learning, when ridge regression is used to find a mapping between the example space to the label space. Contrary to the existing approach, which attempts to find a mapping from the example space to the label space, we show that mapping labels into the example spac…

2015-07-03abs ↗pdf ↗

The paper tackles partial inference in structured prediction using a convex optimization approach.

problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.

New algorithm tackles multiclass transductive online learning with unbounded labels.

problem Characterizing optimal mistake bound for unbounded label spaces.
method Introducing new combinatorial dimensions (Level-constrained Littlestone and Branching dimensions) to characterize online learnability.
result Established trichotomy of possible minimax rates for unbounded label spaces: Θ(T)Θ(T), Θ(logT)Θ(\log T), or Θ(1)Θ(1).