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

3867721,1571,543 · Jun 202019922001200920182026
48 results for multi-instance multi-task 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.

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.

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 ↗

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.

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.

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.

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.

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 ↗

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.

This paper improves sentence-level sentiment analysis of financial news.

problem Blurred insights into individual sentences' sentiment in financial news.
method Distributed text representations and multi-instance learning.
result Superior predictive performance of up to 69.90%.

New DL algorithm detects critical chest X-ray findings without manual annotations.

problem Lack of explainability and manual annotation costs for DL models in medical imaging.
method Multi-instance learning approach to jointly classify and localize critical findings in CXR.
result Competitive classification results on three CXR 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 ↗

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 ↗

Extends neural network approximation to probability measures and tree-structured data.

problem Universal approximation of functions on probability measures and tree-structured domains.
method Proof of neural network density in probability measure spaces and Cartesian products.
result Universal approximation theorem for tree-structured domains, including JSON.

We generate transformation-invariant CNNs using context-aware filters.

problem Creating transformation-invariant neural networks for image recognition.
method Input-conditioned convolution filters combined with max-pooling and multi-instance learning.
result Significantly improved error rates on MNIST variations (1.13% on MNIST-rot-12k, 1.12% on Half-rotated MNIST, 0.68% on Scaling MNIST).

Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…

2018-02-03abs ↗pdf ↗

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.

Framework detects and classifies multi-label RBC images from microscopic images.

problem Challenges in separating touching or overlapping cells for classification.
method Region proposal model + CNN feature extraction + multi-label prediction networks.
result Framework achieves good performance in automatic cell detection and classification.

Automatically finds efficient multi-task models with less data.

problem Training separate models requires more data, parameters, and time.
method Compact search space for multi-task architectures, feature distillation for quick evaluation.
result Automatically identifies multi-task architectures that balance resource requirements and performance.

Wide neural networks can benefit from multi-task learning in their infinite-width limit.

problem The generalization behavior of wide neural networks in multi-task learning settings.
method Optimizing wide ReLU neural networks with L2-regularization promotes multi-task learning in the infinite-width limit.
result An exact quantitative characterization of multi-task learning in the infinite-width limit of wide ReLU neural networks.

Deep multi-task learning benefits from low intrinsic dimensionality, leading to better generalization.

problem Improving generalization in deep multi-task learning with high-dimensional models.
method Parametrizing multi-task networks in a low-dimensional space using random expansions and weight compression.
result First non-vacuous generalization bounds for deep multi-task networks are derived.

Near-optimal rates for multi-task learning with shared representations.

problem Approximation and statistical complexity of learning multiple operators.
method Multiple Neural Operators (MNO) architecture and comparison with DeepONet.
result Near-optimal upper and lower bounds for approximation and generalization.

VIRTUAL improves federated multi-task learning for non-convex models.

problem Real-world federated datasets show statistical heterogeneity.
method VIRTUAL treats federated network as a star-shaped Bayesian network and uses variational inference.
result VIRTUAL outperforms state-of-the-art for federated learning on real-world datasets.

Improves shared encoder representations for better multi-task learning performance.

problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.

We study the stability properties of nonlinear multi-task regression in reproducing Hilbert spaces with operator-valued kernels. Such kernels, a.k.a. multi-task kernels, are appropriate for learning prob- lems with nonscalar outputs like multi-task learning and structured out- put prediction. We show that multi-task ke…

2013-06-17abs ↗pdf ↗

SON-GOKU uses graph coloring to improve multi-task learning by partitioning tasks into compatible groups.

problem Gradient interference between conflicting multi-task learning objectives slows convergence and model performance.
method SON-GOKU computes gradient interference, constructs an interference graph, and applies greedy graph-coloring to partition tasks.
result SON-GOKU consistently outperforms baselines and state-of-the-art multi-task optimizers on six datasets.

Research explores the trade-off between multi-task learning and multitasking in deep neural networks.

problem Trade-off between multi-task learning and multitasking in deep neural networks.
method Meta-learning algorithm to manage the trade-off between shared and separated representations.
result Agent successfully optimizes training strategy based on environment.

Bayesian approach improves network lasso for multi-task learning.

problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.

The paper uses random matrix theory for multi-task regression, improving time series forecasting.

problem Improving time series forecasting using multi-task regression.
method Applying random matrix theory to multi-task regression problems, deriving closed-form solutions for optimization.
result Provides a robust foundation for hyperparameter optimization in multi-task regression scenarios.

Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of differen…

2016-12-13abs ↗pdf ↗