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.

169,051 papers · 148 categories

Trend · papers per month

15.8%31.7%47.5%63.4% · Jun 202019922001200920182026
48 results for multi instance learning

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.

End-to-end method learns geometry and appearance for multi-view object detection.

problem Challenges in multi-view object detection, including viewpoint, lighting, and scale variability.
method Jointly learns multi-view geometry and warping for robust cross-view object detection.
result Superior performance compared to baselines on a new street-level panorama data set.

We study learning latent models with multi-instance weak supervision.

problem Learning latent models with multi-instance weak supervision.
method Formulated as multi-instance Partial Label Learning (multi-instance PLL), proposed a necessary and sufficient condition for learnability, derived Rademacher-style error bounds.
result First theoretical study of multi-instance PLL with unknown transition function, aligns with empirical results but highlights scalability issues.

Paper uses financial news for stock trend forecasting using deep multiple instance learning.

problem Forecasting stock trends from financial news articles.
method Developed a flexible and adaptive multi-instance learning model for bags of instances (financial news articles) on trading days.
result Outstanding trend prediction accuracy compared to state-of-the-art approaches.

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.

SI learning is effective for unbalanced data, showing resilience to object dependencies.

problem Learning from unbalanced data in multi-instance learning.
method Analysis of SI learning objective with rich classifier families, focusing on unbalanced data.
result Unbalanced data improves resilience of SI method to object dependencies, especially in neural networks.

Much recent machine learning research has been directed towards leveraging shared statistics among labels, instances and data views, commonly referred to as multi-label, multi-instance and multi-view learning. The underlying premises are that there exist correlations among input parts and among output targets, and the …

2017-02-22abs ↗pdf ↗

AMI-Net+ tackles medical diagnosis from incomplete, imbalanced data.

problem Medical diagnosis from incomplete and imbalanced data.
method AMI-Net+ uses multi-instance neural network with embedding, multi-head attention, and gated attention-based pooling. It also employs focal loss and self-adaptive multi-instance pooling.
result AMI-Net+ outperforms state-of-the-art models on real-world medical datasets.

Unified framework for various learning problems via Multiple-Instance Learning.

problem Various learning problems including multi-class, complementarily labeled, multi-label, and multi-task learning.
method Reduction of various learning problems to Multiple-Instance Learning (MIL) with theoretical guarantees.
result Unified and simplified framework for designing and analyzing algorithms for various learning problems.

We present a new approach for transferring knowledge from groups to individuals that comprise them. We evaluate our method in text, by inferring the ratings of individual sentences using full-review ratings. This approach, which combines ideas from transfer learning, deep learning and multi-instance learning, reduces t…

2014-11-12abs ↗pdf ↗

In this paper, we investigate the multi-variate sequence classification problem from a multi-instance learning perspective. Real-world sequential data commonly show discriminative patterns only at specific time periods. For instance, we can identify a cropland during its growing season, but it looks similar to a barren…

2017-12-19abs ↗pdf ↗

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.

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.

Solves dual imbalance in detecting sparse anomalies in MIL.

problem Detecting scarce and sparse anomalous samples in MIL.
method Reformulates MIL as a fine-grained PU learning problem, addressing imbalance at both macro and micro levels.
result Demonstrates effectiveness of BFGPU framework on synthetic and real-world datasets.

CSI detects novelty by contrasting shifted instances, outperforming existing methods.

problem Detecting samples from outside the training distribution.
method Contrastive learning with distributionally shifted augmentations.
result CSI outperforms existing methods in various novelty detection scenarios.

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.

Proposes methods to improve multi-label learning by addressing local label imbalance.

problem Local label imbalance within minority class examples degrades multi-label learning performance.
method Introduces a measure to assess local label imbalance and two sampling approaches (MLSOL, MLUL) to address it.
result Experimental results show MLSOL and MLUL improve performance on multi-label datasets.

Multi-instance learning (MIL) has a wide range of applications due to its distinctive characteristics. Although many state-of-the-art algorithms have achieved decent performances, a plurality of existing methods solve the problem only in instance level rather than excavating relations among bags. In this paper, we prop…

2015-12-03abs ↗pdf ↗

InstaGAN tackles image-to-image translation for images with multiple instances and significant shape changes.

problem Challenging cases, especially images with multiple target instances and significant shape changes.
method Instance-aware GAN (InstaGAN) that incorporates instance information and context preserving loss.
result Improves multi-instance transfiguration while maintaining permutation invariance of instances.

The paper proposes a method to improve fine-resolution predictions using coarse-resolution data.

problem Limited supervision for fine-resolution predictions with scarce data.
method Attention-based regularization on multi-view coarse-resolution data.
result The method improves fine-resolution predictions using coarse-resolution data.

We propose a nonparametric Bayesian probabilistic latent variable model for multi-view anomaly detection, which is the task of finding instances that have inconsistent views. With the proposed model, all views of a non-anomalous instance are assumed to be generated from a single latent vector. On the other hand, an ano…

2014-11-13abs ↗pdf ↗

Paper introduces a structured prediction approach for multi-agent reinforcement learning.

problem Scaling and generalization in cooperative multi-agent reinforcement learning.
method Structured prediction approach using learned scoring models for task assignment.
result The approach can generalize to larger problems with more agents and tasks.

Paper tackles rDR classification and lesion segmentation using self-supervised equivariant learning and attention-based MIL.

problem Classifying rDR and segmenting lesions from image-level labels.
method Integrates self-supervised equivariant attention mechanism (SEAM) with attention-based multi-instance learning (MIL).
result Achieved AU ROC of 0.958 on Eyepacs dataset, outperforming state-of-the-art.

Unified framework improves deep multi-view clustering by addressing self-supervision and contrastive alignment issues.

problem Variations in self-supervision-based methods for deep multi-view clustering.
method Unified DeepMVC framework that includes recent methods and leverages self-supervision and contrastive alignment.
result Contrastive alignment negatively impacts cluster separability, especially with many views.

This paper analyzes dynamic ensemble selection and preprocessing for multi-class imbalanced datasets.

problem Class imbalance in multi-class datasets where majority classes have more instances.
method Examined dynamic selection techniques and data preprocessing methods for multi-class imbalanced problems.
result Dynamic ensemble improves AUC and G-mean compared to static ensemble.

GIRNet tackles multi-tasking with mixed domain sequences, improving sentiment and tagging tasks.

problem Labeling sequences with mixed domain data and position-specific inference.
method Unified position-sensitive multi-task RNN architecture with gated state sequences from auxiliary data.
result GIRNet achieves new state-of-the-art performance in sentiment classification, POS tagging, and target position-sensitive annotation.

Stochastic Gradient Trees learn decision trees incrementally.

problem Learning decision trees using stochastic gradient information.
method Incremental learning setting, soft splits not used, new tree not constructed per update.
result Performs similarly to standard incremental classification trees, outperforms state of the art incremental regression trees, comparable to batch multi-instance learning methods.

New method improves learning from multiple correlated data trajectories.

problem Learning from multiple correlated data trajectories without mixing assumptions.
method Hellinger localization framework for maximum likelihood estimation.
result Instance-optimal bounds that scale with full data budget under broad conditions.

No communication allows optimal instance-dependent regret guarantees in multi-player bandits.

problem Achieving optimal instance-dependent regret in multi-player multi-armed bandits without communication.
method Characterization of Pareto optimal trade-offs and development of an algorithm.
result Achieving optimal instance-dependent regret requires strict sub-optimality in other regimes.

This paper proposes Relational Similarity Machines (RSM): a fast, accurate, and flexible relational learning framework for supervised and semi-supervised learning tasks. Despite the importance of relational learning, most existing methods are hard to adapt to different settings, due to issues with efficiency, scalabili…

2016-08-02abs ↗pdf ↗