Proposes MLPSVM for multi-label learning, improving on binary relevance.
problem Handles multi-label learning tasks more efficiently than binary relevance.
method Uses standard support vector machines with parallel decision hyper-planes.
result Outperforms other multi-label learning algorithms on various data sets.
Paper tackles ambiguity in relevance labels for neural list-wise learning to rank.
problem Ambiguity in relevance labels in learning to rank data.
method Proposes a novel sampling technique for computing a list-wise loss.
result Significantly outperforms other methods on validation and test sets.
GLAD learns local relevance of global anomaly detectors via human feedback.
problem Improving explainability and local relevance of global anomaly detectors.
method A human-in-the-loop learning algorithm that adjusts the local relevance of anomaly detection ensemble members using label feedback.
result GLAD effectively learns local relevance and discovers anomalies via label feedback.
A new multi-label classification model combining SVM and BR with low-rank learning.
problem Class imbalance and label correlation issues in multi-label classification.
method Joint Ranking SVM and Binary Relevance with robust Low-rank learning (RBRL).
result RBRL outperforms state-of-the-art methods in multi-label classification.
Study certifies missed relevant items in candidate generation with audit labels.
problem Certify missed relevant items in candidate generation with audit labels.
method Characterizes label complexity, develops exact finite-sample toolkit.
result Excluded-pool auditing is minimax rate-optimal for missed-mass certification.
BP pretreatment reduces multi-label classification time.
problem Efficiently annotate large label sets for extreme multi-label classification.
method Divide instances into clusters, attach most relevant labels, train on pairs of clusters.
result BP reduces prediction time significantly without sacrificing accuracy.
Proposes IFCDA framework to improve cross-domain adaptation.
problem Negative transfer and difficulty in handling category-irrelevant losses in DA.
method Importance filtered mechanism to generate filtered soft labels, combined with graph-based label propagation.
result Significantly improves performance in both Closed-Set and Open-Set DA scenarios.
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.
Bird sound data collected with unattended microphones for automatic surveys, or mobile devices for citizen science, typically contain multiple simultaneously vocalizing birds of different species. However, few works have considered the multi-label structure in birdsong. We propose to use an ensemble of classifier chain…
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.
XR improves search advertising relevance predictions.
problem Accurately predicting relevance of millions of search labels.
method eXtreme Regression (XR) with new evaluation metrics and XReg algorithm.
result XReg outperforms state-of-the-art methods by up to 50% in XR error metric.
This paper proposes a method to select relevant features for multi-label learning.
problem Feature selection in multi-label learning to retain important information with minimal features.
method Random manifold sampling and joint sparse regularization to solve multicollinearity and obtain sparse feature sets.
result The proposed method outperforms other methods in selecting relevant features for multi-label learning.
New loss functions improve extreme classification with missing labels.
problem Large number of infrequent labels and missing labels in XMC.
method Derive unbiased loss functions for XMC, incorporating them into existing algorithms.
result Significant improvement in extreme classification performance (up to 20%) over existing methods.
Simplifies multi-label classification with stochastic sketch strategy.
problem Complex training processes in multi-label classification.
method Simple stochastic sketch strategy for multi-label classification.
result Competitive performance without complex training processes.
A federated method for feature selection in multi-label data.
problem Feature selection in multi-label data for distributed and federated environments.
method Semi-Supervised Federated Multi-Label Feature Selection (SSFMLFS) using fuzzy information measures.
result SSFMLFS outperforms other methods in feature selection for multi-label data in federated settings.
Boosting for label ranking outperforms existing methods.
problem Improving label ranking predictions using boosting techniques.
method Proposed a boosting algorithm tailored for label ranking tasks.
result Significantly outperforms existing label ranking algorithms.
HAXMLNet tackles extreme multi-label text classification with hierarchical attention.
problem Tagging each text with relevant labels from an extreme-scale label set.
method Proposes a hierarchical structure with multi-label attention for efficient and effective XMTC.
result HAXMLNet achieves competitive performance compared to state-of-the-art methods.
A framework for document classification using keywords and unlabeled data.
problem Classifying documents without labels but with relevant keywords.
method Theoretical framework for optimizing AUC and other metrics.
result Effective use of keywords and unlabeled data for classification.
New algorithm for XMC from aggregated labels.
problem Finding relevant labels for inputs from a large label universe.
method Developed a scalable algorithm to impute individual labels from group labels.
result Advantages over existing approaches in XMC and MIML tasks.
MRTL transfers knowledge across multiple target domains using shared latent factors.
problem Transfer learning in label-scarce target domains.
method MRTL uses collective nonnegative matrix tri-factorization to transfer knowledge from multiple sources to multiple targets.
result MRTL achieves better performance than state-of-the-art methods.
ELICA helps analysts understand unfamiliar domains by extracting relevant terms.
problem Communication barriers between analysts and stakeholders in unfamiliar domains.
method ELICA uses WFSTs to dynamically extract and label requirements-relevant knowledge from text and non-linguistic cues.
result ELICA supports analysts in understanding and eliciting requirements from unfamiliar domains.
Interactive image retrieval system learns from user feedback and unlabeled data.
problem Efficiently retrieve relevant images with minimal user interaction.
method Combines active learning and graph-based semi-supervised learning (GSSL) to use unlabeled data.
result High F1 scores with few relevance feedback rounds on large datasets.
Semi-supervised model removes noisy content from webpages.
problem Extracting relevant content from webpages with ads and noise.
method Graph representation of webpage, semi-supervised learning with Gaussian Random Fields.
result Preliminary results show successful extraction of relevant content.
SURI boosts features with high unique relevant information for better health data analysis.
problem Preserving interpretability in health data analysis.
method Mutual information-based feature selection (MIBFS) method called SURI.
result SURI selects more relevant features leading to higher classification performance.
Systems rank PubMed abstracts and sentences for RDoC criteria, achieving high mAP and MAA.
problem Lack of RDoC labeled datasets and complex labelling process hinder full use of RDoC framework.
method Attention-based neural topic models, supervised and unsupervised sentence ranking models, BM25, BoW, TF-IDF.
result Best systems achieved 1st rank with 0.86 mAP and 0.58 MAA.
APLC-XLNet improves XMTC by clustering labels and reducing computational time.
problem Efficiently tagging texts with many labels from a large set.
method Fine-tunes XLNet with APLC to approximate cross entropy loss.
result Achieved state-of-the-art results on XMTC benchmarks.
Paper improves gas species identification in complex mixtures using neural networks.
problem Identifying gas species in multi-gas mixtures with high accuracy.
method Multi-label neural networks with optimal thresholding for IR spectroscopy.
result Optimal thresholding improves classification performance over conventional methods.
Deeper networks are better for local labels, but shallower for global labels.
problem Understanding the effect of depth in overparameterized neural networks.
method Introduced local and global labels to investigate the advantage of depth.
result Deeper networks are better for local labels, shallower for global labels.
Paper tackles noisy labels by compressing feature representations.
problem Learning with noisy labels leads to overfitting and poor generalization.
method Introduces compression inductive bias using Dropout and Nested Dropout.
result Compression helps in combating label noise and improving performance.
Paper tackles medical image diagnosis with unsupervised domain adaptation.
problem Limited labeled samples and label noise in medical images.
method Collaborative Unsupervised Domain Adaptation (UDA) algorithm.
result Empirical results show superiority of the proposed method.
Algorithm learns from label proportions in unlabeled bags.
problem Learning from unlabeled bags with known label proportions.
method Differentiable loss functions for deep neural networks.
result Deep neural networks can accurately classify images from unlabeled bags.
This paper analyzes shallow ViTs, providing sample complexity and SGD behavior insights.
problem Theoretical understanding of shallow ViTs, especially their sample complexity and SGD behavior.
method Data model with label-relevant and label-irrelevant tokens, theoretical analysis of shallow ViT training.
result Characterization of sample complexity for zero generalization error in shallow ViTs.
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.
Paper proposes a method to recover accurate labels from partially valid data in multi-label learning.
problem Tackles noisy supervision in multi-label learning with partially valid labels.
method Develops a two-stage method that estimates label enrichment and ground-truth confidences.
result Demonstrates improved performance over state-of-the-art PML methods.
Self-supervised attention model improves weakly labeled audio event classification.
problem Efficiently classify audio events with minimal labeled data.
method Develops a self-supervised attention model for weakly labeled audio clips.
result Self-supervised attention model performs comparably to strongly supervised model trained with strong labels.
This paper uses Bayesian networks to analyze label correlations for improving multi-label classifier chains.
problem Improving multi-label classifier chain performance by discovering label correlations and determining the label order.
method Bayesian network (BN) to model label correlations, scoring function to evaluate BN structure, heuristic algorithm to optimize BN, topological sorting to derive label order.
result The proposed BNCC method enhances multi-label classifier chain performance through optimized label order and correlation analysis.
FDive helps analysts create relevant patterns in high-dimensional datasets.
problem Difficult detection of relevant patterns in large, high-dimensional datasets.
method FDive uses a visual active learning system with pattern-based similarity measures to rank and classify data.
result FDive enhances the quality and understanding of relevance models, leading to new insights.
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.
TRAIL improves robot imitation learning by focusing on task-relevant features.
problem Discriminator networks learn spurious associations, providing poor reward signals.
method Constrained discriminator optimization to learn task-relevant rewards.
result TRAIL outperforms GAIL and behaviour cloning in robotic manipulation tasks.
Automated radar data labeling using GNSS improves efficiency without sacrificing accuracy.
problem Manual annotation of automotive radar data is time-consuming and error-prone.
method The article introduces an automated system using GNSS to acquire data labels.
result The proposed method provides clear advantages in time savings with minimal data distortion.
A deep learning method for XML with autoencoder and ranking loss.
problem XML with large label collections, high complexity, inter-label and feature dependencies, and noisy labels.
method Word-vector-based self-attention, ranking-based AutoEncoder architecture.
result Competitive performance on benchmark datasets.
The paper explores symmetric losses for better learning from corrupted labels.
problem Learning from corrupted labels with balanced error rate or AUC maximization.
method Proves theoretical properties of symmetric losses and proposes a convex barrier hinge loss.
result Symmetric losses are advantageous in BER minimization and AUC maximization from corrupted labels.
HERA improves PLL by integrating heterogeneous loss and sparse-low-rank regularization.
problem Learning from data with partial labels.
method Combines heterogeneous loss and sparse-low-rank regularization.
result Achieves superior performance on artificial and real-world data.
Paper improves XMLC by no-regretly generalizing HSM to PLTs.
problem Efficiently tagging instances with a small subset of relevant labels from a large pool.
method Probabilistic label trees (PLTs) as a no-regret multi-label generalization of hierarchical softmax (HSM).
result XT (extremeText) outperforms HSM with pick-one-label heuristic and XML-CNN.
BiLA uses variational Bayesian inference to aggregate noisy labels online.
problem Aggregating noisy labels from crowd workers in real-time.
method Variational Bayesian inference and stochastic optimization.
result BiLA reduces label error by at least 10-1.5% points.
New loss functions make deep nets robust to noisy labels.
problem Label noise in training data affects deep neural networks.
method Developed conditions for loss functions to be robust to label noise.
result Mean absolute value loss is inherently robust to label noise.
Self-supervised learning improves EEG signal analysis without labeled data.
problem Limited labeled data in clinical EEG signals.
method Temporal context prediction and contrastive predictive coding tasks.
result SSL-learned features outperform supervised deep neural networks in low-labeled data regimes.
Probabilistic label trees improve XMLC by organizing labels hierarchically.
problem Efficiently tagging instances with a small subset of relevant labels from a large pool.
method Introduce and analyze probabilistic label trees (PLTs) as a generalization of hierarchical softmax for multi-label problems.
result PLTs are consistent for various performance metrics and can be trained online without prior knowledge.