Paper tackles labelling problem in datasets with nonlinear relationships.
problem Discovering nonlinear relationships in noisy datasets.
method Develops a framework for labelling, introduces precise label notion, proposes algorithm to discover labels.
result Algorithm successfully discovers labels in synthetic datasets.
PrML exploits label relationships using privileged information and low-rank constraints.
problem Improving multi-label learning performance by leveraging implicit and explicit label connections.
method Generates privileged label features and integrates them into low-rank based multi-label learning framework.
result PrML significantly improves multi-label learning performance compared to competing methods.
NURD improves model performance by distilling representations independent of nuisance variables.
problem Models trained under spurious correlations may fail on data with different nuisance-label relationships.
method Developed Nuisance-Randomized Distillation (NURD) to find representations independent of nuisance variables.
result NURD finds representations that perform better regardless of nuisance-label relationships.
It is challenging to handle a large volume of labels in multi-label learning. However, existing approaches explicitly or implicitly assume that all the labels in the learning process are given, which could be easily violated in changing environments. In this paper, we define and study streaming label learning (SLL), i.…
LoCEC classifies user relationships in large social networks, addressing sparsity issues.
problem Sparse relationship feature and label data in real social platforms.
method Local Community-based Edge Classification (LoCEC) framework with three-phase processing.
result Effective and efficient classification of user relationships in large-scale networks.
Nodes in real world networks often have class labels, or underlying attributes, that are related to the way in which they connect to other nodes. Sometimes this relationship is simple, for instance nodes of the same class are may be more likely to be connected. In other cases, however, this is not true, and the way tha…
A new method makes adversarial domain adaptation aware of class relationships.
problem Ignoring inter-class semantic relationships in domain adaptation.
method RADA algorithm that aligns inter-class dependencies learned from domain discriminator with those from label predictor.
result Improves performance on benchmark datasets by incorporating class relationships.
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.
Multiple conventions have been adopted for denoting Interval Exchange Transformations (IETs). The "non-labeled" convention was the original, while the "labeled" convention has proven convenient when investigating Flat Surfaces as described by IETs. We establish the relationship between Extended Rauzy Classes, an equiva…
A Bayesian approach to multilabel classification using tree-based models.
problem Challenges in multilabel classification due to complex label relationships and correlations.
method Bayesian Additive Regression Trees (BART) framework for modeling multilabel classification.
result Improved predictive performance compared to other models, including an oracle model.
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.
The paper uses machine learning to infer causal relationships from data.
problem Inferring causal relationships from observational data.
method A distance-based approach within a manifold regularization framework.
result The approach is effective and general across different biological data sets.
Refines diagnostic prediction using causal relationships.
problem Improving accuracy of pain diagnostics prediction.
method Two approaches: 1) Inference of causal relationships, 2) Post-processing refinement.
result Potential for improving pain diagnostics prediction accuracy.
SFB uses stable features to adapt unstable ones for better performance.
problem Improving classifier performance on out-of-distribution data by leveraging stable features.
method SFB learns a predictor that separates stable and unstable features, then adapts unstable predictions using stable predictions.
result SFB can learn an asymptotically-optimal predictor without test-domain labels.
This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…
Deep learning method for brain CT scan anomaly labeling using nearest neighbors.
problem Automated anatomical labeling of brain CT scan anomalies.
method Combines local and global context, uses Relation Networks (RNs) for prediction, and employs nearest neighbors for training.
result Improved performance of Relation Networks (RNs) through nearest neighbors training strategy.
Paper improves short text clustering by integrating semantic relationships into Optimal Transport.
problem Erroneous pseudo-labels caused by neglecting semantic consistency in existing OT methods.
method Designs an instance-level attention mechanism to capture semantic relationships and integrates them into the OT formulation.
result Generates reliable pseudo-labels that improve clustering accuracy.
Paper tackles training deep neural nets from noisy labels.
problem Training deep neural nets from noisy labeled datasets.
method Formulates problem using graphical model, semi-supervised learning, and auxiliary information.
result Proposed model reduces label noise and improves unseen image labeling.
New framework infers multiple classes per image for one-shot learning.
problem Inferring multiple classes per image in one-shot learning.
method Compositional embedding framework with joint training of embedding and composition/query functions.
result Compositional embedding models outperform existing methods on various datasets.
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.
Improved predictions for rare labels using neural networks and ontologies.
problem Long-tailed frequency distribution in multi-label prediction problems.
method Modified neural network output layer with a Bayesian network of sigmoids leveraging ontology relationships.
result Significant improvements in per-label AUROC and average precision for less common labels.
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.
New method identifies latent relationships in deep models without additional constraints.
problem Latent representations in deep latent variable models are not statistically identifiable.
method Identifies relationships between latent variables (distances, angles, volumes) under mild model conditions.
result Empirically demonstrates more reliable latent distances without additional labeled data.
Bayesian algorithms improve crowdsourcing with label and instance constraints.
problem Efficiently labeling large datasets with additional human annotator information.
method Developed Bayesian algorithms for semi-supervised crowdsourced classification under label and instance constraints.
result Improved performance compared to unsupervised crowdsourcing on various datasets.
Interpolating label noise makes models vulnerable to adversarial attacks.
problem Adversarial vulnerability of models trained on noisy labels.
method Theoretical analysis of label noise and adversarial risk relationship.
result Uniform label noise induces adversarial risk similar to worst-case poisoning.
A framework learns dynamic soft labels to improve model generalization and accuracy.
problem Models trained on one-hot labels overfit and are sensitive to noisy annotations.
method Proposes a framework where labels are treated as learnable parameters, adapting dynamically during optimization.
result Consistent gains across different datasets and architectures, improving ResNet18 by 2.1% on CIFAR100.
Graph attention network improves MLTC by capturing label dependencies.
problem Ignoring label dependencies in MLTC tasks.
method Graph attention network model that captures label dependencies.
result The model achieves similar or better performance than state-of-the-art models.
PPI uses proxy data to improve inference from limited labels across related tasks.
problem Statistical inference with limited labels across multiple related tasks.
method Prediction-powered inference framework that uses cross-task recalibration to improve power and accuracy.
result Cross-task recalibration can substantially reduce confidence interval widths when labels are scarce.
New method adapts to structural shifts in graph data for better label prevalence estimation.
problem Structural shifts in graph data affect label prevalence estimation.
method Importance sampling variant of KDEy quantification approach.
result Adapts to structural shifts and outperforms standard approaches.
This paper proposes a new AL method that directly uses geometric sampling over clusters.
problem Performance degeneration in uncertainty evaluation for AL with insufficient labeled data.
method Divide-and-conquer approach to AL, transferring it to geometric sampling over clusters.
result The proposed GAL method significantly outperforms state-of-the-art baselines.
Paper proposes LAHA to improve XMTC by integrating document content and label correlation.
problem Challenges in tagging documents with most relevant labels from a large label set.
method Hybrid attention deep neural network model (LAHA) that combines multi-label self-attention and adaptive fusion strategies.
result LAHA outperforms state-of-the-art methods, especially on tail labels.
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.
Adversarial constraint learning improves structured prediction with minimal labeled data.
problem Reducing the need for manual label collection in structured prediction tasks.
method Simulates valid structured outputs and trains a model to produce outputs indistinguishable from these simulations using adversarial training.
result The model achieves high accuracy with only a small number of labeled inputs, sometimes requiring none.
A new method fills missing labels in multi-label classification problems.
problem Missing feature and label values in multi-label classification.
method Proposes co-completion (COCO) algorithm based on subgradient descent.
result Demonstrates theoretical and practical effectiveness of COCO.
The paper studies how to use AI-generated labels in econometrics to avoid bias.
problem Small misclassification errors in AI-generated labels can lead to large biases in econometric estimators.
method The paper proposes a coupled-label bootstrap method to correct bias and deliver valid inference.
result The coupled-label bootstrap method is valid without the strong independence condition between true and imputed labels.
SJS model predicts label shifts in multinomial datasets.
problem Predicting label shifts in multinomial datasets.
method Sparse joint shift model for dataset shift.
result Valid predictions and class prior probabilities estimates.
New benchmark for causal reasoning from human video descriptions.
problem Lack of diversity in event types and natural language descriptions, and differences from human judgments.
method Iterative event cloze task and data augmentation techniques.
result Improved data collection efficiency and diverse causal judgments.
Dual-T method improves transition matrix estimation in noisy label learning.
problem Large estimation error in noisy class posterior leads to poor transition matrix estimation.
method Introducing an intermediate class to avoid direct estimation of noisy class posterior, factorizing the transition matrix into two easier-to-estimate matrices.
result The dual-T estimator leads to better classification performances.
Paper proposes M3Lcmf for better M3L performance.
problem Complex objects with diverse instances and multiple labels.
method Collaborative matrix factorization with heterogeneous network.
result M3Lcmf outperforms other solutions in benchmark datasets.
Proposes GM-PLL for better partial label learning.
problem Learning from data with partially labeled instances.
method Reformulates PLL as graph matching problem, incorporating GM scheme and extending matching algorithm.
result Superior performance compared to state-of-the-art methods.
Enhances LDL by integrating distance and directional information for more robust label feature representation.
problem Lack of robust label feature representation in LDL tasks, especially with label ambiguity.
method Introduces Structural Anchor Points (SAPs) to capture inter-cluster interactions and a novel LSFs construction strategy, LIFT-SAP.
result Improves LDL performance by 15% on average across 15 real-world datasets.
LangDA improves domain adaptation for semantic segmentation by learning context-aware scene descriptions.
problem Improving domain adaptation for semantic segmentation with dense prediction tasks.
method LangDA learns contextual relationships between objects via VLM-generated scene descriptions and aligns image features with text representation.
result LangDA sets new state-of-the-art across three DASS benchmarks, outperforming existing methods.
Bayesian GCNN improves graph classification with limited labels.
problem Uncertainty in graph structure limits GCNN performance.
method Bayesian approach to modeling graph uncertainty and node labels.
result Bayesian GCNN outperforms traditional methods in semi-supervised classification.
This paper tackles adversarial perturbations in multi-label classification problems.
problem Vulnerability and robustness of multi-label learning models under adversarial attacks.
method Proposes a general attacking framework and a ranking-based framework for generating multi-label adversarial perturbations.
result Demonstrates the effectiveness of the proposed frameworks and provides insights into the vulnerability of multi-label deep learning models.
CondMTL improves toxicity detection by learning group-specific representations.
problem Algorithmic bias in toxic language detection across demographic groups.
method Conditional Multi-Task Learning (CondMTL) for demographic-specific tasks.
result CondMTL improves predictive recall for minority demographic groups.
Paper tackles multi-source transfer learning with diverse labeling volume and reliability.
problem Challenges in multi-source transfer learning with diverse labeling volume and reliability.
method Combines domain similarity and source reliability through a new transfer learning method, and integrates distribution matching and uncertainty sampling in pool-based active learning.
result Demonstrates superior performance over state-of-the-art transfer learning methods.
Unified model combines GCN and LPA for better node classification.
problem Combining GCN and LPA for improved node classification.
method Unified model that unifies GCN and LPA, learns edge weights and attention weights.
result Unified model outperforms state-of-the-art GCN-based methods in node classification accuracy.
Bayesian networks are simplified for categorical variables using staged trees and asymmetry-labeled DAGs.
problem Representing non-symmetric conditional independences in Bayesian networks.
method Formalized relationship between Bayesian networks and staged trees, introduced asymmetry-labeled DAGs, and developed an algorithm to learn staged trees.
result A novel algorithm for learning staged trees that captures non-symmetric independences.