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.
SALT combines geometric and model-based alignment for domain adaptation.
problem Aligning source and target domains for unsupervised domain adaptation.
method SALT treats alignment as an auxiliary task, leveraging subspace geometry and gradient-based optimization.
result SALT achieves comparable or better performance than state-of-the-art methods.
We show how a deep denoising autoencoder with lateral connections can be used as an auxiliary unsupervised learning task to support supervised learning. The proposed model is trained to minimize simultaneously the sum of supervised and unsupervised cost functions by back-propagation, avoiding the need for layer-wise pr…
Enhances weather detection by learning from auxiliary information.
problem Mispredictions in unsupervised severe weather detection.
method Learning joint representations of textual and weather data.
result Improved decision boundaries for severe weather detection.
Deep RL agent performs well in Doom, a complex FPS game.
problem Addressing complex environments with sparse rewards and large state spaces.
method Divide and conquer approach using unsupervised auxiliary tasks.
result Our agent performs better in unknown environments than state-of-the-art algorithms.
This work addresses encoding biases in neural networks by tailoring models with unsupervised losses.
problem Improving neural network representations and reducing the generalization gap.
method Inspired by transductive learning, the authors propose tailoring and meta-tailoring to optimize unsupervised losses during prediction time.
result Models trained with tailoring and meta-tailoring perform better on the task objective after adapting to unsupervised losses.
Paper extends ICA to ISA with auxiliary variables for better speech representation learning.
problem Learning unsupervised speech representations with independent subspaces.
method Theoretical framework of nonlinear ISA with auxiliary variables.
result Proposes an algorithm to learn speech representations with independent subspaces.
This work prevents variational autoencoders from collapsing by adding an auxiliary decoder.
problem Variational autoencoders can collapse into autodecoders, losing semantic information.
method Adding an auxiliary decoder to regularize the latent space.
result Auxiliary decoders increase semantic information in the latent space and reconstructions.
ZNMF improves facial recognition performance using data-dependent penalties.
problem Facial recognition performance in the Cambridge ORL database.
method ZNMF uses data-dependent auxiliary constraints to modify NMF.
result ZNMF outperforms other constrained NMF algorithms in facial recognition.
SXL embeds spatial autocorrelation into neural networks for better geographic data learning.
problem Difficulties in learning spatial effects for neural networks in geographic data.
method SXL uses auxiliary tasks and autoregressive embeddings to learn spatial autocorrelation.
result SXL improves neural network training in unsupervised and supervised learning tasks.
Paper tackles domain adaptation without labeled target data.
problem Performing well on an unlabeled target domain using only labeled source data.
method Learning self-supervised tasks on both source and target domains simultaneously.
result Successfully generalizes to the unlabeled target domain.
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.
Project explores reinforcement learning solutions for sparse reward environments.
problem Difficulty in navigating environments with infrequent rewards.
method Contrast and investigate existing reinforcement learning solutions in various video games.
result Introduces a novel reinforcement learning solution combining curiosity and auxiliary tasks.
The ability of the Generative Adversarial Networks (GANs) framework to learn generative models mapping from simple latent distributions to arbitrarily complex data distributions has been demonstrated empirically, with compelling results showing that the latent space of such generators captures semantic variation in the…
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.
Deep generative models parameterized by neural networks have recently achieved state-of-the-art performance in unsupervised and semi-supervised learning. We extend deep generative models with auxiliary variables which improves the variational approximation. The auxiliary variables leave the generative model unchanged b…
Study improves interpretability in generative models by disentangling latent variables in scientific datasets.
problem Extracting generative factors from complex, high-dimensional datasets in unsupervised or semi-supervised settings.
method Introducing Aux-VAE, a novel architecture within the VAE framework, which disentangles latent variables by guiding them with auxiliary variables.
result Aux-VAE achieves disentanglement with minimal modifications to the standard VAE loss function, validated on multiple datasets.
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.
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.
Paper presents a world model that learns invariant causal features using contrastive unsupervised learning.
problem Learning invariant causal features in unsupervised settings.
method Contrastive unsupervised learning with intervention invariant auxiliary task.
result Significantly outperforms state-of-the-art methods on out-of-distribution point navigation tasks.
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.
We develop a novel method for training of GANs for unsupervised and class conditional generation of images, called Linear Discriminant GAN (LD-GAN). The discriminator of an LD-GAN is trained to maximize the linear separability between distributions of hidden representations of generated and targeted samples, while the …
Unsupervised domain adaptation improves with privileged information.
problem Domain adaptation under covariate shift and overlap limitations.
method Two-stage learning algorithm inspired by expected error analysis.
result Using privileged information reduces errors and increases sample efficiency.
A new method detects concept drift without true labels.
problem Detecting concept drift in unsupervised settings.
method Student-teacher learning paradigm for drift detection.
result The method outperforms state-of-the-art approaches in experiments.
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.
Self-supervised GANs improve image synthesis without labeled data.
problem Lack of labeled data for conditional GANs.
method Combines adversarial training and self-supervision to learn meaningful feature representations.
result Self-supervised GANs achieve comparable performance to state-of-the-art conditional GANs.
Proves identifiability of deep latent variable models without auxiliary information.
problem Identify deep generative models without side information.
method Analyzes a broad class of deep latent variable models with universal approximation capabilities.
result Identifiability of generative models without side information u. 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.
SCC clusters data with supervising variables for better interpretation.
problem Challenging interpretations in unsupervised clustering.
method Joint convex fusion penalty using supervising and unlabeled data.
result Discover new genes and subtypes of Alzheimer's Disease.
New NMF algorithm uses Toeplitz matrix for facial recognition.
problem Facial recognition performance improvement.
method Proposes TNMF algorithm with Toeplitz penalty for NMF.
result TNMF outperforms ZNMF and other constrained NMF algorithms.
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.
Proposes a framework for semi-supervised continual learning from sequentially arriving data.
problem Learning from data with changing task distribution over time, especially in domains with a mix of labeled and unlabeled data.
method Meta-Consolidation for Continual Semi-Supervised Learning (MCSSL) framework with a hypernetwork and semi-supervised auxiliary classifier.
result Significant improvements in continual semi-supervised learning setting.
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.
Deep neural networks improve two-sample testing.
problem Efficiently distinguishing between two unknown distributions.
method Deep learning representations for two-sample testing.
result Significant reduction in type-2 error rate compared to existing methods.
TILT improves target domain performance by penalizing an auxiliary component on unlabeled target inputs.
problem Improving performance on target domain under covariate shift.
method TILT uses a novel objective function to decompose the source predictor and penalize an auxiliary component on unlabeled target inputs.
result TILT improves target domain performance over source-only training and other baselines.
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.
Elastic co-clustering improves clustering of single-cell genomic data.
problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.
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.
Despite recent advances in training recurrent neural networks (RNNs), capturing long-term dependencies in sequences remains a fundamental challenge. Most approaches use backpropagation through time (BPTT), which is difficult to scale to very long sequences. This paper proposes a simple method that improves the ability …
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.
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.
FedAUX improves Federated Learning by better using unlabeled data.
problem Improving Federated Learning performance with unlabeled data.
method FedAUX modifies FD training by unsupervised pre-training and private certainty scoring.
result FedAUX outperforms state-of-the-art Federated Learning methods.
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.