Bayesian neural networks improve knowledge sharing across networks.
problem Improving knowledge sharing between neural networks.
method Application of Bayesian interpretations to neural networks for feature sharing.
result Enhanced feature sharing across networks.
Enhances generative model accuracy through knowledge transfer.
problem Improving generative model precision across different tasks.
method Introduces a novel framework for transfer learning using shared structures.
result Demonstrates enhanced performance in diffusion and normalizing flows models.
Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts
problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios
Boosts share routing for multi-task learning with flexible sparse connections.
problem Designing suitable sharing mechanisms among multiple tasks in multi-task learning.
method Proposes MTNAS framework to modularize sharing into sub-networks with sparse connections and gating.
result Demonstrates consistent improvement over single-task and typical multi-task methods while maintaining efficiency.
Bayesian model transfers knowledge across different engineering fleets.
problem Data sparsity in predictive models for engineering infrastructure.
method Hierarchical Bayesian approach with multitask learning.
result Improves survival analysis and power prediction in truck fleets and wind farms.
We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…
GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.
problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.
This paper proposes a new VoI analysis framework for complex decision problems.
problem Optimizing resource allocation for information collection in decision-making under uncertainty.
method Surrogate-based framework for Value of Information analysis, integrating knowledge sharing and adaptive training.
result Accurate and robust estimates of VoI with fewer model evaluations compared to state-of-the-art methods.
Unified Bayesian framework for clustered federated learning improves model performance.
problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.
Intelligent behaviour in the real-world requires the ability to acquire new knowledge from an ongoing sequence of experiences while preserving and reusing past knowledge. We propose a novel algorithm for unsupervised representation learning from piece-wise stationary visual data: Variational Autoencoder with Shared Emb…
This paper introduces self-paced task selection to multitask learning, where instances from more closely related tasks are selected in a progression of easier-to-harder tasks, to emulate an effective human education strategy, but applied to multitask machine learning. We develop the mathematical foundation for the appr…
Purveyors of malicious network attacks continue to increase the complexity and the sophistication of their techniques, and their ability to evade detection continues to improve as well. Hence, intrusion detection systems must also evolve to meet these increasingly challenging threats. Machine learning is often used to …
The paper analyzes how shared priors affect Bayesian data fusion performance.
problem Effect of shared priors on Bayesian data fusion performance.
method Theoretical analysis using two divergences common in Bayesian inference.
result Theoretical analysis and experimental validation of performance behavior.
SPEQ improves quantized neural networks by stochastic precision sharing and cosine similarity loss.
problem Improving quantized deep neural networks for edge devices.
method SPEQ combines stochastic precision sharing and cosine similarity loss for knowledge distillation.
result SPEQ outperforms existing methods in various tasks.
Unsupervised domain adaptation (UDA) aims to learn the unlabeled target domain by transferring the knowledge of the labeled source domain. To date, most of the existing works focus on the scenario of one source domain and one target domain (1S1T), and just a few works concern the scenario of multiple source domains and…
Financial economic models often assume that investors know (or agree on) the fundamental value of the shares of the firm, easing the passage from the individual to the collective dimension of the financial system generated by the Share Exchange over time. Our model relaxes that heroic assumption of one unique "true val…
A new method for multi-task learning by allocating parameters.
problem Sharing parameters between unrelated tasks can hurt performance.
method Learned binary variables to allocate components to tasks, encouraging sharing between related tasks.
result Achieves a 17% relative reduction of the error rate on Omniglot benchmark.
Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separa…
PerPCA separates unique and shared features from heterogeneous data.
problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.
Sharing knowledge between tasks is vital for efficient learning in a multi-task setting. However, most research so far has focused on the easier case where knowledge transfer is not harmful, i.e., where knowledge from one task cannot negatively impact the performance on another task. In contrast, we present an approach…
Cronus securely transfers model parameters to protect federated learning from poisoning attacks.
problem Federated learning's privacy and security issues, especially with large models.
method Cronus uses black-box knowledge transfer to reduce parameter dimensions and control information leakage.
result Cronus is the only secure federated learning method against poisoning attacks.
This research shows how to learn shared representations from unpaired data.
problem Learning shared representations from unpaired data.
method Spectral embeddings of random walk matrices from each unimodal representation.
result Shared representations can be learned almost exclusively from unpaired data.
Deep learning models for semantic segmentation of images require large amounts of data. In the medical imaging domain, acquiring sufficient data is a significant challenge. Labeling medical image data requires expert knowledge. Collaboration between institutions could address this challenge, but sharing medical data to…
Recently there has been an increasing interest in the multivariate Gaussian process (MGP) which extends the Gaussian process (GP) to deal with multiple outputs. One approach to construct the MGP and account for non-trivial commonalities amongst outputs employs a convolution process (CP). The CP is based on the idea of …
In order to learn quickly with few samples, meta-learning utilizes prior knowledge learned from previous tasks. However, a critical challenge in meta-learning is task uncertainty and heterogeneity, which can not be handled via globally sharing knowledge among tasks. In this paper, based on gradient-based meta-learning,…
Proposes TFCL to mitigate negative transfer in MTL by collaborating across features and tasks.
problem Negative transfer in Multi-Task Learning (MTL) due to dissimilar tasks.
method Task-Feature Collaborative Learning (TFCL) with heterogeneous block-diagonal structure regularizer and optimization method.
result Global convergence and block-diagonal structure recovery guarantees.
PIMA autoencoders discover shared features in multimodal scientific data.
problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.
The incorporation of prior knowledge into learning is essential in achieving good performance based on small noisy samples. Such knowledge is often incorporated through the availability of related data arising from domains and tasks similar to the one of current interest. Ideally one would like to allow both the data f…
Graph-based RKD improves knowledge distillation for resource-constrained systems.
problem Efficiently distill deep learning knowledge for resource-constrained systems.
method Graph-based relative knowledge distillation (RKD) to capture latent space geometry.
result The proposed method achieves better accuracy with the same resource budget.
A method learns matrix factorization from diverse matrices and applies the knowledge to unseen matrices.
problem Matrix factorization without shared rows or columns.
method Neural network meta-learned to minimize expected imputation error using MAP estimation.
result The method can impute missing values from unseen matrices efficiently.
This paper improves ASR performance by aligning frames more accurately.
problem Disagreement between teacher-student models in frame-level alignment.
method Introduces self-knowledge distillation (SKD) to guide frame-level alignment.
result Improves both resource efficiency and performance in ASR.
Multi-view subspace learning (MSL) aims to find a low-dimensional subspace of the data obtained from multiple views. Different from single view case, MSL should take both common and specific knowledge among different views into consideration. To enhance the robustness of model, the complexity, non-consistency and simil…
Graph few-shot learning improves node classification with prior knowledge transfer.
problem Challenging semi-supervised node classification with few labeled nodes.
method Incorporates prior knowledge from auxiliary graphs into a transferable metric space.
result Improves classification accuracy on target graphs.
Paper proposes sharing models instead of data for smart health predictions.
problem Sharing sensitive medical data is legally restricted and challenging.
method Train a teacher model on sensitive data, then transfer its knowledge to a student model without accessing original data.
result Student model mimics teacher model performance in making accurate predictions.
Hierarchical Modular Reinforcement Learning (HMRL), consists of 2 layered learning where Profit Sharing works to plan a prey position in the higher layer and Q-learning method trains the state-actions to the target in the lower layer. In this paper, we expanded HMRL to multi-target problem to take the distance between …
ARML learns task relations to improve meta-learning efficiency.
problem Handling task heterogeneity in meta-learning.
method Automatically extracts cross-task relations and constructs a meta-knowledge graph.
result ARML outperforms state-of-the-art baselines in few-shot learning tasks.
KEEN Universe provides reproducible and transferable knowledge graph embeddings.
problem Lack of reproducibility and transferability in KGE experiments.
method Developed an ecosystem with Python packages for reproducible and transferable KGEs.
result KEEN Universe facilitates sharing of trained KGE models across different fields.
Pea-KD improves BERT student models by 4.4% on average in GLUE tasks.
problem Efficiently compressing BERT while maintaining performance.
method Parameter-efficient and accurate Knowledge Distillation (Pea-KD) with Shuffled Parameter Sharing (SPS) and Pretraining with Teacher's Predictions (PTP).
result Pea-KD improves student model's performance by 4.4% on average in four GLUE tasks.
PoDiRe learns long-term rewards in multi-task recommendations.
problem Long-term rewards in multiple recommendation tasks.
method Policy Distilled Reinforcement Learning (PoDiRe) combining deep reinforcement learning and knowledge distillation.
result PoDiRe outperforms state-of-the-art methods in real-world data.
DRUM discovers interpretable rules from knowledge graphs for unseen entities.
problem Inductive link prediction on unseen entities and lack of interpretability.
method Differentiable approach using bidirectional RNNs for low-rank tensor approximation.
result DRUM outperforms existing methods in inductive link prediction.
Novel framework for data sharing and coordinated exploration in concurrent RL with non-identical environments.
problem Learning more data-efficient and better policies in concurrent RL with non-identical environments.
method Proposes a novel algorithmic framework that leverages causal inference via ANM-MM to extract model parameters and a new data sharing scheme based on similarity measures.
result Demonstrates superior learning speeds on various tasks and effectiveness of diverse action selection.
In real-world applications, it is often expensive and time-consuming to obtain labeled examples. In such cases, knowledge transfer from related domains, where labels are abundant, could greatly reduce the need for extensive labeling efforts. In this scenario, transfer learning comes in hand. In this paper, we propose D…
A framework for multilayer networks predicts links without shared structures.
problem Link prediction in multilayer networks without shared structures.
method Bi-level model averaging with K-fold cross-validation. result Framework outperforms existing methods in predictive accuracy and robustness.
PFedRL-Rep learns shared and personalized policies for heterogeneous environments.
problem Poor performance of single policy in heterogeneous environments.
method Develops PFedRL-Rep framework with shared feature representation and personalized weights.
result Proves linear convergence speedup with respect to the number of agents.
Unified scoring model improves efficiency and performance across multiple tasks.
problem Efficient and resource-efficient automated scoring for diverse tasks.
method Knowledge-distilled multi-task Mixture-of-Experts (MoE) approach.
result Comparable performance to task-specific models with significantly less storage and training resources.
Role-wise data augmentation improves knowledge distillation effectiveness.
problem Existing knowledge distillation methods fail to utilize the full potential of teacher-student data interaction.
method Design and implement data augmentation agents with distinct roles for teacher and student.
result Specially tailored data points enhance the demonstration of teacher's knowledge to the student.
Deep RL policies share adversarial features across different MDPs.
problem Understanding decision boundaries and loss landscapes in neural policies.
method Investigating similarities in high sensitivity directions across MDPs using Arcade Learning Environment.
result High sensitivity directions for neural policies are correlated across MDPs, suggesting shared non-robust features.
AlphaNet improves supernets training with alpha-divergence.
problem Improving the uncertainty distillation in weight-sharing NAS.
method Proposes alpha-divergence for better uncertainty distillation in supernets.
result Significant improvements in model performance across various FLOPs regimes.