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

Trend · papers per month

127253380506 · Jun 202019922001200920172026
48 results for multi-label predictions

Advances rule-based multi-label classification using conformal prediction.

problem Improving accuracy and decision making in multi-label classification.
method Combines conformal prediction with rule-based learning to provide natural conformity scores and calibrate rule assessments.
result Calibrated conformity scores enhance prediction accuracy and decision making.

PML-GAN tackles noisy multi-label annotations using adversarial learning.

problem Learning multi-label models from noisy, overcomplete annotations.
method PML-GAN uses a disambiguation network and a generative adversarial network to map noisy labels to clean labels and data samples.
result PML-GAN achieves state-of-the-art performance on partial multi-label learning datasets.

C-HMCNN(h) improves HMC classification by leveraging class hierarchy.

problem Hierarchical multi-label classification with class hierarchy constraints.
method Exploits class hierarchy to produce coherent predictions for multi-label classification.
result C-HMCNN(h) outperforms state-of-the-art models in HMC classification.

Paper tackles gene mutation prediction for HCC using multi-instance multi-label learning.

problem Gene mutation prediction in hepatocellular carcinoma for personalized treatments.
method Multi-instance multi-label learning with oversampling for data imbalance.
result Proposed approach shows superiority in gene mutation prediction.

The paper tackles multi-label ranking with uncertain probabilities.

problem Making skeptical inferences for multi-label ranking with sets of probabilities.
method Assumes a convex set of probabilities (credal set) over labels and seeks set-valued predictions.
result Developed methods for making skeptical inferences in multi-label ranking with uncertain probabilities.

The number of methods available for classification of multi-label data has increased rapidly over recent years, yet relatively few links have been made with the related task of classification of sequential data. If labels indices are considered as time indices, the problems can often be seen as equivalent. In this pape…

2016-09-27abs ↗pdf ↗

Develops gradient boosting for multi-label classification.

problem Lack of customizable learning algorithms for multi-label classification.
method Generalizes gradient boosting to multi-output problems and proposes an algorithm for learning multi-label classification rules.
result Ability to minimize both decomposable and non-decomposable loss functions.

Enhances medical code predictions for multi-morbidity patients using text classification.

problem Improving accuracy in predicting medical codes for patients with multiple illnesses.
method Used machine learning techniques, including multi-label medical text classification, to enhance predictions.
result High dimensional embeddings pre-trained on health data significantly improve multi-label classification performance.

Multi-label classification is an important learning problem with many applications. In this work, we propose a principled similarity-based approach for multi-label learning called SML. We also introduce a similarity-based approach for predicting the label set size. The experimental results demonstrate the effectiveness…

2017-10-27abs ↗pdf ↗

Two strategies extend multi-label chaining for imprecise probability estimates.

problem Handling imprecise probability estimates in multi-label classification.
method Adapting multi-label chaining to use convex sets of distributions (credal sets).
result Adapted approaches produce relevant cautiousness on hard-to-predict instances.

Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.

problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.

Proposes a new batch selection method for multi-label classification.

problem Improving the accuracy of deep neural networks in multi-label classification tasks.
method Adapts uncertainty measures to multi-label data, considering label correlations and dynamic uncertainty.
result Improves performance and accelerates convergence of multi-label deep learning models.

Extreme multi-label classification aims to learn a classifier that annotates an instance with a relevant subset of labels from an extremely large label set. Many existing solutions embed the label matrix to a low-dimensional linear subspace, or examine the relevance of a test instance to every label via a linear scan. …

2018-11-04abs ↗pdf ↗

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

A new multi-label CPC method improves mutual information estimation and representation learning.

problem Underestimation of mutual information in contrastive predictive coding.
method Introducing a multi-label classification problem to overcome the logm\log m bound in mutual information estimation.
result The new method exceeds the logm\log m bound and leads to better mutual information estimation and improved unsupervised representation learning.

We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for…

2017-10-23abs ↗pdf ↗

The paper tackles skeptical binary inferences in multi-label problems with sets of probabilities.

problem Making distributionally robust, skeptical inferences for multi-label problems.
method Study of distributionally robust, skeptical inferences for multi-label problems using Hamming loss.
result Skeptical inferences provide partial predictions for a sufficiently big set of probability distributions.

In this paper we study output coding for multi-label prediction. For a multi-label output coding to be discriminative, it is important that codewords for different label vectors are significantly different from each other. In the meantime, unlike in traditional coding theory, codewords in output coding are to be predic…

2012-06-27abs ↗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 ↗

Proposes a self-paced multi-label learning method to handle diverse labels efficiently.

problem Learning from multi-label data with a large label space is NP-hard and prone to overfitting.
method Self-paced multi-label learning with diversity (SPMLD) approach, incorporating gradual label inclusion and diversity maintenance.
result The proposed SPMLD framework optimizes a non-convex objective function using block coordinate descent.

Domain knowledge helps detect adversarial examples in multi-label classification.

problem Detecting adversarial examples in multi-label classification.
method Convert domain knowledge into constraints and inject them into a semi-supervised learning problem.
result Domain-knowledge constraints help detect adversarial examples effectively.

This work explores how to balance rule consistency and coverage for multi-label classification.

problem Balancing rule consistency and coverage for effective multi-label classification.
method Empirical study of rule learning heuristics in multi-label classification.
result The choice of heuristic for multi-label classification is crucial and depends on the performance measure.

A new method improves node classification in graphs with limited labels.

problem Semi-supervised multi-label node classification in attributed graphs.
method Collaborative Graph Walk (Multi-Label-Graph-Walk) using reinforcement learning.
result Significantly better multi-label classification performance compared to state-of-the-art methods.

Paper tackles fault classification in time series data with deep neural networks.

problem Fault classification over a future horizon in multidimensional time series data with class imbalances.
method Proposes a multi-label recurrent neural network with a new cost function to address class imbalances.
result The proposed algorithm outperforms state-of-the-art techniques in F1-score, precision, and recall.

We introduce structured prediction energy networks (SPENs), a flexible framework for structured prediction. A deep architecture is used to define an energy function of candidate labels, and then predictions are produced by using back-propagation to iteratively optimize the energy with respect to the labels. This deep a…

2015-11-19abs ↗pdf ↗

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)…

2017-02-15abs ↗pdf ↗

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.

We consider multi-label classification where the goal is to annotate each data point with the most relevant subset\textit{subset} of labels from an extremely large label set. Efficient annotation can be achieved with balanced tree predictors, i.e. trees with logarithmic-depth in the label complexity, whose leaves correspon…

2019-05-24abs ↗pdf ↗

Paper proposes a new MLC framework without predefined label order, improving performance and generalization.

problem Exposure bias in multi-label classification due to lack of predefined label order.
method Proposes a new framework that transforms MLC into a sequence prediction problem without predefined label order.
result The proposed method outperforms competitive baselines and has better generalization capability.

As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer. Multi-label data stream classification is a supervised learning problem where each instance in the data stream is classified into one or more pre-defined sets of labels. Many methods hav…

2018-09-26abs ↗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.

Multi-output prediction deals with the prediction of several targets of possibly diverse types. One way to address this problem is the so called problem transformation method. This method is often used in multi-label learning, but can also be used for multi-output prediction due to its generality and simplicity. In thi…

2019-04-08abs ↗pdf ↗

A new method for online multi-label stream classification.

problem Challenges in classifying continuous data streams with concept drift and delayed labels.
method Online unsupervised incremental method based on self-organizing maps.
result The method is highly competitive in both stationary and concept drift scenarios.

pRSL combines probabilistic rules to improve multi-label classification.

problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.