TADAM improves few-shot learning by task-dependent metric scaling.
problem Improving few-shot learning models with limited data.
method Task-dependent metric scaling and co-training.
result State-of-the-art performance on mini-Imagenet and new CIFAR100 dataset.
Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.
problem Catastrophic forgetting in neural networks trained on a sequence of tasks.
method Sparse routing networks with co-training to minimize interference between dissimilar tasks.
result Sparse routing networks with co-training outperform densely connected networks on benchmarks.
Co-training improves sequential decision-making policies from multiple views.
problem Learning policies in settings with multiple state-action representations.
method Inspired by co-training for classification, we present a co-training framework for sequential decision making.
result Our framework improves upon learning from a single view alone.
Theoretical analysis of co-training and disagreement-based algorithms.
problem Addressing theoretical issues in disagreement-based learning approaches.
method Theoretical analyses of co-training and its variants.
result Provides a theoretical foundation for co-training and similar algorithms.
MICO uses mutual information co-training to improve selective search efficiency.
problem Efficiently search and route unseen queries in large-scale search systems.
method Mutual Information Co-training framework for selective search with minimal supervision.
result Significantly improves performance on multiple metrics of selective search.
AuxiLearn combines auxiliary tasks into a single loss function.
problem Improving neural network performance on a main task using auxiliary tasks.
method Implicit differentiation to learn a network that combines auxiliary tasks into a single coherent objective function.
result AuxiLearn consistently outperforms competing methods in various tasks and domains.
Proposes a new method to learn distance metrics for semi-supervised learning.
problem Inconsistency between perturbed input sets and lack of pairwise relationship information.
method Metric Learning by Similarity Network (MLSN) co-training with a classification network to learn distance metrics adaptively.
result Performs better than state-of-the-art methods on empirical tasks.
The paper proposes a new co-training method using information theory.
problem Predicting future sensations from past ones.
method Introduces a co-training objective based on mutual information.
result The method improves mutual information between past and future sensations.
Deep learning model for demographic classification using label proportions.
problem Lack of annotated training data for deep learning.
method LLP setting with Batch Averager regularization and co-training algorithm.
result Deep LLP model outperforms baselines for demographic classification.
New method learns auxiliary labels automatically for improved generalisation.
problem Improving generalisation in supervised learning without additional data.
method Trains two neural networks: label-generation and multi-task networks.
result MAXL outperforms single-task learning on 7 image datasets.
Aux-NAS uses auxiliary labels to improve primary task performance without extra inference cost.
problem Improving primary task performance using auxiliary labels without increasing inference cost.
method Architecture-based approach with a flexible asymmetric structure for primary and auxiliary tasks, using Neural Architecture Search (NAS) to evolve networks with only primary-to-auxiliary connections.
result Achieves improved performance on multiple tasks without increasing inference cost.
This paper reviews dMTL and methods for selecting auxiliary tasks.
problem Improving model performance for multiple tasks.
method Review of dMTL approaches and methods for selecting auxiliary tasks.
result Methods for selecting auxiliary tasks can improve dMTL performance.
AutoSeM automatically selects and balances auxiliary tasks in MTL.
problem Choosing and balancing auxiliary tasks in MTL.
method AutoSeM uses a Beta-Bernoulli multi-armed bandit with Thompson Sampling for task selection and a Gaussian Process for learning the mixing ratio.
result AutoSeM achieves significant performance boosts on GLUE language understanding tasks.
Method reweights auxiliary tasks to reduce data need for main task.
problem Limited labeled data for supervised learning.
method Formulates weighted likelihood function as surrogate prior, minimizing divergence to true prior.
result Effective use of limited labeled data with auxiliary tasks, improving performance.
Master-slave architecture tackles combinatorial multi-armed bandits with diversity constraints.
problem Solving top-K combinatorial multi-armed bandits with non-linear feedback and diversity constraints. method Master-slave architecture with six slave models, teacher learning, and policy co-training.
result Significantly outperforms existing algorithms in synthetic and real datasets.
Auxiliary Tuning adapts pre-trained models for novel tasks efficiently.
problem Adapting pre-trained models for new tasks efficiently.
method Supplementing pre-trained model with an auxiliary model that shifts output distribution.
result Achieved similar results to training from scratch with fewer resources.
New autoencoder framework learns structured latent priors.
problem Learning autoencoders with flexible priors.
method Relational regularization on latent prior, scalable algorithms.
result RAE outperforms existing autoencoders in image generation.
This paper surveys multi-view clustering methods and proposes a taxonomy.
problem The challenge of combining multiple data views for clustering.
method Review of existing multi-view clustering methods and taxonomy proposal.
result A novel taxonomy of multi-view clustering methods is proposed.
Adapts auxiliary losses using gradient similarity to improve neural network performance.
problem Statistical inefficiency in neural networks and difficulty in selecting helpful auxiliary tasks.
method Uses cosine similarity between gradients of tasks to adaptively weight auxiliary losses.
result Guaranteed convergence to critical points of the main task and practical usefulness across domains.
New method improves adversarial learning with unlabeled data.
problem Poor quality of pseudo labels on unlabeled data.
method Robust Co-training (RCT) using deep co-training.
result RCT significantly outperforms baselines in adversarial robustness.
Proposes a method to improve graph neural networks on heterogeneous graphs using meta-paths.
problem Improving graph neural networks on heterogeneous graphs with auxiliary tasks.
method Self-supervised auxiliary learning with meta-paths for heterogeneous graphs.
result Consistently improves link prediction and node classification on heterogeneous graphs.
DriftMoE adapts to concept drifts in data streams efficiently.
problem Adapting to non-stationary data streams with concept drifts.
method Online Mixture-of-Experts (MoE) architecture with co-training framework.
result DriftMoE achieves competitive results with state-of-the-art stream learning adaptive ensembles.
Proto-value networks improve deep reinforcement learning representations using auxiliary tasks.
problem Improving deep reinforcement learning representations with auxiliary tasks.
method Derived a new family of auxiliary tasks based on the successor measure, combined with off-policy learning rule.
result Proto-value networks produce rich features comparable to established algorithms using only linear approximation and a small number of interactions.
AuxNet uses auxiliary tasks to enhance semantic segmentation for automated driving.
problem Time-consuming and expensive semantic annotation for automated driving.
method Leveraging auxiliary tasks like depth estimation to improve semantic segmentation performance.
result 3% and 5% improvement in accuracy on SYNTHIA and KITTI datasets respectively.
Paper presents MTTDSC for better target-specific sentiment classification.
problem Improving accuracy in detecting and aggregating sentiments towards specific targets in social media.
method MTTDSC uses a multi-task learning approach with an auxiliary task for passage-level sentiment classification and a main task for target-specific sentiment classification.
result MTTDSC outperforms state-of-the-art baselines in sentiment classification.
In-N-Out improves model robustness to out-of-distribution data.
problem Learning robust models with few in-distribution labeled examples.
method Pre-training with auxiliary information and self-training with pseudolabels.
result In-N-Out outperforms auxiliary inputs or outputs alone on both in-distribution and OOD error.
HydaLearn dynamically adjusts task weights for better MTL performance.
problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.
This paper proposes a new RV prediction model using neural distributional transformation and co-training.
problem Predicting skewed and fat-tailed realized volatility (RV) is challenging.
method The paper uses a neural distributional transformation and co-training to predict RV. It jointly trains the transformation and prediction model using a maximum-likelihood objective function.
result The proposed method significantly outperforms other methods on a dataset of 100 stocks.
In this paper we propose a strategy for semi-supervised image classification that leverages unsupervised representation learning and co-training. The strategy, that is called CURL from Co-trained Unsupervised Representation Learning, iteratively builds two classifiers on two different views of the data. The two views c…
The paper introduces a new language for semi-supervised learning tasks.
problem Handling semi-supervised learning with declarative constraints.
method Developed a declarative language for modeling both supervised and semi-supervised learning tasks, including heuristics and combining multiple heuristics.
result Improved performance on relation-extraction tasks for real-world domains.
New bounds for transfer learning in linear models, improving generalization.
problem Understanding when auxiliary data helps in improving generalization in linear models.
method Derivation of exact error bounds and optimal task weights for linear regression and linear neural networks.
result First non-vacuous sufficient conditions for beneficial auxiliary learning in linear neural networks.
ScoreFusion fuses multiple diffusion models to enhance generative modeling of a target population.
problem Enhancing generative modeling of a target population with limited data.
method ScoreFusion uses KL barycenters of auxiliary populations and recasts the learning problem as score matching in denoising diffusion.
result ScoreFusion achieves a dimension-free sample complexity bound in total variation distance.
Robots learn tasks from a single demonstration using auxiliary video context.
problem Learning from demonstrations is challenging due to ambiguity and lack of labeled data.
method Metalearning to localize actions in auxiliary videos, learning reward functions, and reinforcement learning.
result Robots can learn multi-step tasks more effectively with auxiliary video context.
Enhances machine learning with background knowledge through feature generation.
problem Machine learning struggles with small datasets.
method Generates features from auxiliary datasets not similar to the original task.
result Significant improvement in various learning tasks.
End-to-end autonomous driving framework using guided auxiliary supervision.
problem Learning to drive in highly stochastic urban settings.
method Multi-task Learning from Demonstration (MT-LfD) framework with end-to-end trainable network and supervised auxiliary tasks.
result Joint learning and supervised guidance facilitate faster and better driving performance.
A framework for using auxiliary data to improve few-shot learning.
problem Few-shot learning with scarce labeled examples and abundant auxiliary data.
method Automatic pseudo-shot selection and masking module to adjust auxiliary features.
result Masking module improves accuracy by 4.68 and 6.03 percentage points.
Paper tackles robust imitation learning from noisy demonstrations.
problem Learning from noisy demonstrations is challenging.
method Optimizes a classification risk with a symmetric loss, combining pseudo-labeling and co-training.
result Our method is more robust than state-of-the-art methods.
Efficiently optimize expensive functions using auxiliary task information.
problem Optimizing expensive functions with limited data.
method Gaussian process with neural network mean and covariance functions, leveraging auxiliary task information.
result Identifies optimal points with fewer evaluations than existing methods.
Method trains vision and control policies on real robots quickly.
problem Training vision-based control policies on real robots efficiently.
method Multi-task Reinforcement Learning with auxiliary tasks.
result Significant learning speed-ups and task learning from-scratch.
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.
SAC-X enables learning complex behaviors from sparse rewards.
problem Learning complex behaviors from sparse reward signals.
method Scheduled Auxiliary Control (SAC-X) with auxiliary tasks.
result SAC-X enables efficient exploration and complex behavior learning.
Despite its size and complexity, the human cortex exhibits striking anatomical regularities, suggesting there may simple meta-algorithms underlying cortical learning and computation. We expect such meta-algorithms to be of interest since they need to operate quickly, scalably and effectively with little-to-no specializ…
New method uses simple sensor intentions to learn complex tasks.
problem Defining reward schemes for exploration in robotic systems.
method Introduce simple sensor intentions (SSIs) to define auxiliary tasks.
result Learning system can solve complex robotic tasks using only raw sensor streams.
MTGA optimizes multiple tasks with auxiliary data.
problem Optimizing multiple tasks simultaneously.
method Evolutionary multi-tasking genetic algorithm (MTGA).
result MTGA outperforms other approaches in optimization.
Small parameterized towers improve multi-task learning efficiency and generalization.
problem Balancing Pareto efficiency and generalization in multi-task learning.
method Under-parameterized self-auxiliaries for multi-task models.
result Small parameterized towers enhance Pareto efficiency in various multi-task applications.
MTCNet uses MTL to estimate crowd density and count.
problem Crowd count estimation challenges due to scale variations and perspective.
method MTL deep neural network architecture with two tasks: density estimation and count classification.
result Achieves lower MAE than state-of-the-art methods on multiple datasets.
Study proposes using auxiliary classification to improve unsupervised anomaly detection.
problem Challenging anomaly detection in high-dimensional data.
method Use of an auxiliary classification task to extract features from unlabelled data by supervised learning.
result Our feature learning approach yields best anomaly detection performance.
Paper improves speaker verification with federated learning and differential privacy.
problem Improving speaker verification accuracy using private data.
method Combining federated learning and differential privacy to train an auxiliary model that predicts vocal characteristics.
result 6% relative improvement in equal error rate over a baseline system.