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.
A new framework CL embeds features and labels for multi-label classification.
problem Exponential growth of output space in multi-label classification.
method Compact Learning (CL) framework that embeds features and labels simultaneously.
result CMLL maximizes label-feature dependency and minimizes label space loss.
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…
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.
A fast method reduces label space for online multi-label classification.
problem Challenging multi-label classification with many labels and latent dependencies.
method Linear label space dimension reduction and pseudo-label training.
result Effective in terms of running times and prediction performance.
Bonsai learns fast, deep trees for XMC with fast training and high accuracy.
problem Efficiently learning multi-label classification models with millions of labels.
method Develops Bonsai suite of algorithms that generalize label representation and learn shallow trees.
result Bonsai achieves best of fast training and high accuracy on XMC tasks.
Combines multi-task and semi-supervised learning for disparate label spaces.
problem Sequence classification tasks with multiple, unrelated label sets.
method Joint embedding space and transfer functions between label embeddings.
result Outperforms strong baselines in topic-based sentiment analysis.
A new method embeds labels and group information for efficient multi-label classification.
problem Efficient multi-label classification with label sparsity and group structure.
method Identifies label groups, embeds labels and features in a low-dimensional space preserving sparsity and group structure.
result Our method outperforms state-of-the-art algorithms on benchmark datasets.
Enhances labels from unlabeled data using sample correlations.
problem Lack of label distributions in real-world applications.
method Proposes LESC and gLESC methods to enhance label distributions.
result Improves performance of label enhancement through sample correlations.
The paper investigates how multi-label evaluation metrics can prune rule search space.
problem Challenges in inducing rules with multiple labels in multi-label classification.
method Examines anti-monotonicity and decomposability properties of multi-label evaluation metrics.
result Commonly used multi-label evaluation metrics exhibit anti-monotonicity, aiding rule search space pruning.
Prototypical Networks improve multi-label classification accuracy.
problem Multi-label classification with nonlinear label dependencies.
method Formulate multi-label learning as class distribution in a non-linear embedding space. For each label, positive and negative embeddings are compactly distributed. Labels are inferred by measuring the distance to prototype positive or negative embeddings.
result Extensive experiments show improved accuracy compared to state-of-the-art algorithms.
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.
Paper connects sampling and labeling biases in large-output spaces.
problem Efficient training in large-output spaces with label imbalance.
method Unified approach to address sampling and labeling biases.
result Different negative sampling schemes trade-off performance on dominant and rare labels.
A new model embeds word and label hierarchies in hyperbolic space for HMLC.
problem Learning mappings from word hierarchies to label hierarchies in hierarchical multi-label classification.
method Proposes a Hyperbolic Interaction Model (HyperIM) to learn label-aware document representations in hyperbolic space.
result Demonstrates improved performance for HMLC compared to state-of-the-art methods.
A new method learns label correlations for better multi-label predictions.
problem Label correlations not accurately characterized by existing approaches.
method Sparse reconstruction in the label space to learn correlations, then integrate into model training.
result Our approach outperforms state-of-the-art multi-label learning methods.
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.
Curvature improves label space encoding for better class representation.
problem Inconsistent class distances in one-hot encoding.
method Introducing curvature using a metric tensor.
result Better representation of ancestral and convergent relationships.
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.
A new semi-supervised learning method using label gradients.
problem Improve accuracy in semi-supervised learning with limited labeled data.
method Impute labels for unlabeled data using a distance metric based on model gradients, then optimize these imputed labels.
result Demonstrates state-of-the-art accuracy in semi-supervised CIFAR-10 classification.
Improves multi-label text classification by regularizing model complexity and label dependencies.
problem High dimensional features and correlated labels in multi-label text classification.
method Regularizes model complexity using Elastic-net penalty and early stopping, and optimizes label search space with support inference and F-optimizer GFM.
result Significant improvement in accuracy on benchmark datasets, including unseen label combinations.
New method stratifies multi-label data for better classification performance.
problem Maintaining label space structure in multi-label data splits.
method Iterative stratification approach considering second-order relationships.
result Improves classification performance and stability of network characteristics.
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…
Efficiently discovers multi-label rules with relaxed pruning.
problem Learning multi-label heads in multi-label classification.
method Relaxed pruning approach to induce more expressive rules.
result Relaxed pruning leads to more expressive rules without sacrificing performance.
Dynamic text classification with changing labels using learned metrics.
problem Traditional text classifiers struggle with dynamic label sets.
method Replacing fixed output layer with a learned metric space for nearest-neighbor classification.
result Learning a non-Euclidean metric improves performance in low data regimes.
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), Θ(logT), or Θ(1). Multi-label classification has received considerable interest in recent years. Multi-label classifiers have to address many problems including: handling large-scale datasets with many instances and a large set of labels, compensating missing label assignments in the training set, considering correlations between labels…
We propose using five data-driven community detection approaches from social networks to partition the label space for the task of multi-label classification as an alternative to random partitioning into equal subsets as performed by RAkELd: modularity-maximizing fastgreedy and leading eigenvector, infomap, walktrap an…
A new method reduces noise in multi-label data and reduces dimensionality.
problem Handling noisy multi-label data in semi-supervised settings.
method Semi-supervised and multi-label dimensionality reduction method using label propagation.
result NMLSDR outperforms state-of-the-art algorithms in reducing noise and dimensionality.
Study investigates classification with unknown label noise in non-compact feature spaces.
problem Classification in the presence of unknown class-conditional label noise in non-compact feature spaces.
method Determines minimax optimal learning rates and presents an adaptive algorithm for classification.
result Optimal learning rates differ from those without label noise, displaying interesting threshold behavior.
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.
A new method for adapting to label shifts using class probability matching.
problem Adapting to label shifts where class probabilities differ between source and target domains.
method Class Probability Matching using Kernel Methods (CPMKM) framework.
result CPMKM outperforms existing methods on real datasets.
Multi-label classification is a type of supervised learning where an instance may belong to multiple labels simultaneously. Predicting each label independently has been criticized for not exploiting any correlation between labels. In this paper we propose a novel approach, Nearest Labelset using Double Distances (NLDD)…
This paper tackles multi-modal label disentanglement in partition-based XMC.
problem Existing partition-based XMC methods create mutually exclusive clusters, which is sub-optimal for multi-modal labels.
method Formulates label assignment as an optimization problem to maximize precision rates, creating flexible and overlapped label clusters.
result Successfully disentangles multi-modal labels, leading to state-of-the-art results on XMC benchmarks.
New method selects data for labeling in RKHS to improve regression accuracy.
problem Labeling cost in supervised learning.
method Importance labeling scheme in RKHS with gradient descent.
result Gradient descent with proposed labeling scheme achieves optimal convergence rate.
A new method improves graph-based semi-supervised classification by removing noise and mixed signs.
problem Inaccurate soft labels and noise in graph-based semi-supervised classification.
method Triple-matrix-recovery-based robust auto-weighted label propagation framework (ALP-TMR).
result Improved robustness to noise and outliers in label estimation.
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.
Extracts geometric information from point-clouds for multiclass classification.
problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.
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.
Graph ConvNet improves classification by leveraging label graph structure.
problem Ignoring label graph structure in multi-class classification leads to suboptimal performance.
method Proposes a GCN-based neural network classifier that incorporates the graph structure of labels.
result The proposed model outperforms baseline methods in terms of graph-theoretic metrics.
LNEMLC embeds label network for multi-label classification.
problem Lack of effective adaptation and preservation of generalization abilities for unseen label combinations.
method LNEMLC embeds label network to extend input space for any base multi-label classifier.
result Statistically significant improvements over simple kNN baseline classifier.
OPLTs online train label trees for multi-label and multi-class classification.
problem Online multi-label and multi-class classification challenges.
method Fully online training of label trees without prior knowledge.
result Strong theoretical guarantees and low complexity.
Proposes a constrained labeling method for weakly supervised learning.
problem Combining weak supervision signals while navigating misleading correlations.
method Randomized constrained labeling within a defined space.
result Randomized constrained labeling converges after few iterations and outperforms other methods.
Paper provides label complexity guarantees for deep active learning.
problem Lack of rigorous label complexity guarantees for deep active learning.
method Studied deep active learning from nonparametric classification perspective.
result Proved near-optimal label complexity guarantees for deep active learning.
Paper proposes methods to reduce affect estimation labeling costs.
problem High cost and time-consuming for labeling affective computing samples.
method Multi-task active learning for regression to select beneficial samples.
result Optimal sample selection leads to better estimation performance.
Paper tackles multi-label zero-shot learning, improving label embedding projection for unseen classes.
problem Challenges in transferring knowledge from seen to unseen classes in multi-label zero-shot learning.
method Proposes a transfer-aware embedding projection approach to project label embeddings into a low-dimensional space for better inter-label relationships and explicit information transfer.
result Demonstrates the efficacy of the proposed approach through experiments on zero-shot multi-label image classification.
Proposes a hierarchical curriculum loss to improve model accuracy and interpretability.
problem Flat label spaces in classification algorithms fail to capture dependencies in real-world data.
method Introduces hierarchical curriculum loss with two properties: satisfying hierarchical constraints and providing non-uniform label weights.
result The proposed loss function significantly outperforms multiple baselines on real-world image datasets.
Exploits class similarity for better machine learning models with confidence labels and projective loss functions.
problem Poor model performance due to confusing similar classes.
method Exploits class similarity with confidence labels and projective loss functions.
result Improved model performance on noisy labels.
Characterizes quasi-projective even Artin groups based on graph labels.
problem Understanding quasi-projective even Artin groups.
method Characterization through defining graph properties and K(pi,1) spaces.
result Quasi-projective even Artin groups are realizable by K(pi,1) quasi-projective spaces.