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.
In this paper, we investigate the problem of learning disentangled representations. Given a pair of images sharing some attributes, we aim to create a low-dimensional representation which is split into two parts: a shared representation that captures the common information between the images and an exclusive representa…
HCL learns shared and modality-specific latent representations for multimodal data.
problem Binary shared-private decomposition inadequately represents shared information across subsets of modalities.
method Hierarchical Contrastive Learning framework combining latent-variable formulation, structural sparsity, and contrastive objective.
result HCL accurately recovers hierarchical structure and improves predictive performance on multimodal data.
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.
First-order ANIL learns shared representations even with overparametrization.
problem Lack of theoretical evidence for model-agnostic meta-learning (ANIL) learning shared representations.
method First-order ANIL with a linear two-layer network architecture, showing asymptotically low-rank solutions with overparametrization.
result First-order ANIL learns linear shared representations, even with overparametrization, and performs well in adaptation.
Unpaired multi-domain causal representation learning is possible with sufficient conditions.
problem Learning shared causal representation from unpaired data across domains.
method Identify sufficient conditions for joint distribution and shared causal graph recovery.
result Practical method to recover shared latent causal graph from marginal distributions.
Improved AutoDML estimator for causal inference using outcome-adapted shared covariate representation.
problem Efficiency in estimating treatment or policy effects in causal inference.
method Outcome-adapted AutoDML estimator that uses a shared covariate representation that is predictive of the outcome but not the Riesz representer.
result Outcome-adapted AutoDML estimator is asymptotically more efficient than baseline AutoDML.
New algorithms minimize regret in multi-task and lifelong linear bandits with shared representation.
problem Minimizing regret in multi-task and lifelong linear bandits with shared representation.
method Novel algorithms using efficient estimator for low-rank linear feature extractor and novel analysis.
result Achieved regret bounds matching minimax lower bound up to logarithmic factors.
We study the problem of distributed multi-task learning with shared representation, where each machine aims to learn a separate, but related, task in an unknown shared low-dimensional subspaces, i.e. when the predictor matrix has low rank. We consider a setting where each task is handled by a different machine, with sa…
New bounds on learning shared representations improve model performance and efficiency.
problem Improving model performance and efficiency through shared representations across clients.
method Established new upper and lower bounds on statistical error, designed a spectral estimator for non-convex least-squares solutions.
result Optimal statistical rate achieved when shared representation is well covered across clients.
Training-free source selection for LLM families with shared vocabularies
problem Source selection for LLM families with shared vocabularies
method Fisher alignment at vocabulary scale
result Fisher alignment is a cosine between kernel mean embeddings in the joint activation-error space
Different neural networks trained on the same dataset often learn similar input-output mappings with very different weights. Is there some correspondence between these neural network solutions? For linear networks, it has been shown that different instances of the same network architecture encode the same representatio…
Generalizes risk sharing models to a continuum of agents.
problem Risk sharing among a large number of heterogeneous agents.
method Modeling agents as points in a measure space, using risk measures on a probability space, and deriving dual representations.
result Explicit formulas for specific risk measures (entropic and expected shortfall) and applications to Pareto efficiency.
New method learns shared structures in non-linear tasks.
problem Learning shared linear representations in non-linear tasks.
method Convex optimization with structural assumptions.
result Rank and clustered estimators recover shared structures under certain conditions.
As a highlighting research topic in the multimedia area, cross-media retrieval aims to capture the complex correlations among multiple media types. Learning better shared representation and distance metric for multimedia data is important to boost the cross-media retrieval. Motivated by the strong ability of deep neura…
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.
SPLICE method disentangles shared and private latent variables from multi-view data.
problem Lack of methods to characterize nonlinear relationships and preserve geometric information in multi-view data.
method Neural network-based approach to infer disentangled, interpretable representations of shared and private latent variables.
result SPLICE yields more interpretable representations by preserving geometry and is more robust to incorrect latent dimensionality.
Fine-tuning improves meta-learning by leveraging shared representations.
problem Meta-learning's challenge in rapidly learning new tasks.
method Theoretical framework and risk bounds on gradient descent fine-tuning.
result Fine-tuning-based methods can provably leverage shared structure.
New model extracts shared brain activity patterns from fMRI data.
problem Challenges in aggregating multi-subject fMRI data due to variability.
method Shared Gaussian Process Factor Analysis (S-GPFA) incorporating temporal information.
result Model reveals ground truth latent structures and replicates experimental performance.
DECAT framework evaluates multimodal models for shared biology, detecting confounders and false positives.
problem Determining if multimodal models learn shared biology or just confounders.
method DECAT framework classifies multimodal representations into four diagnostic scenarios using null-referenced metrics.
result DECAT detects confounders and false positives in multimodal models, improving with larger cohorts and stronger representations.
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…
GeoERM learns shared representations on Riemannian manifolds for multi-task learning.
problem Heterogeneous and adversarial tasks in MTL.
method Geometry-aware MTL framework embedding shared representation on Riemannian manifold, optimizing via manifold operations.
result GeoERM improves estimation accuracy and stability, outperforming alternatives.
The paper tackles learning from similar but not identical linear representations, improving performance over single-task learning.
problem Understanding how to learn from tasks with similar but not exactly the same linear representations, especially when dealing with outlier tasks.
method Proposes adaptive and robust penalized empirical risk minimization and spectral methods.
result Both methods outperform single-task learning when representations are similar and perform at least as well otherwise, with minimax optimality demonstrated.
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…
DISCoVeR learns disentangled representations by separating shared and condition-specific factors.
problem Learning disentangled representations for multi-condition data.
method Dual-latent architecture, parallel reconstructions, max-min objective.
result DISCoVeR achieves improved disentanglement on various datasets.
Study shows automorphisms of Markov surfaces share periodic points if they share a common iterate.
problem Study of unlikely intersections for automorphisms of Markov surfaces with positive entropy.
method Arithmetic equidistribution for adelic line bundles, theory of laminar currents, quasi-Fuchsian representation theory.
result Two automorphisms with positive entropy share a Zariski dense set of periodic points if and only if they share a common iterate.
New statistical guarantees for transfer learning with diverse tasks.
problem Statistical guarantees for transfer learning across different tasks.
method Formal analysis of t+1 tasks with shared representation. result Sample complexity reduction for new tasks using shared representation.
A tensor model for meta-learning adapts to task-specific features.
problem Learning shared representations for diverse tasks without task-specific observable information.
method Modeling meta-parameters as an order-3 tensor, estimating through tensor regression and method of moments.
result Tensor-based approach improves meta-learning performance with fewer samples.
Robots could learn their own state and world representation from perception and experience without supervision. This desirable goal is the main focus of our field of interest, state representation learning (SRL). Indeed, a compact representation of such a state is beneficial to help robots grasp onto their environment …
In this paper we analyze a dynamic recursive extension of the (static) notion of a deviation measure and its properties. We study distribution invariant deviation measures and show that the only dynamic deviation measure which is law invariant and recursive is the variance. We also solve the problem of optimal risk-sha…
Meta-learning for bandit tasks using shared representations.
problem Learning new bandit tasks efficiently using shared low-dimensional representations.
method Proposes a greedy policy to learn new bandit tasks leveraging a partially learned low-dimensional representation.
result Upper bound on regret of proposed policy, showing efficiency of learning new tasks.
STAR improves equivariant and invariant representation learning by routing projection heads.
problem Redundant feature learning in equivariant and invariant representation learning.
method Soft Task-Aware Routing (STAR) for projection heads specialization.
result Lower canonical correlations between invariant and equivariant embeddings.
Joint diffusion models improve data representation for both generation and prediction.
problem Inconsistent performance between generation and classification tasks in joint models.
method Extended vanilla diffusion model with a classifier for joint end-to-end training.
result Joint diffusion model outperforms state-of-the-art hybrid methods in classification and generation.
Learning by integrating multiple heterogeneous data sources is a common requirement in many tasks. Collective Matrix Factorization (CMF) is a technique to learn shared latent representations from arbitrary collections of matrices. It can be used to simultaneously complete one or more matrices, for predicting the unknow…
Dockless bike sharing systems need effective bike flow prediction models.
problem Imbalanced and dynamic use of bikes leads to mandatory rebalancing operations.
method Divide urban area into regions, model spatio-temporal bike flows, extract traffic patterns, and predict bike flows.
result Interpretable bike flow prediction model provides valuable insights into bike flow analysis.
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.
GROOVE learns representations for weakly paired multimodal data.
problem Learning representations for high-content perturbation data with weakly paired samples.
method GroupCLIP contrastive loss integrated with an autoencoder framework.
result GROOVE performs on par with or outperforms existing approaches for cross-modal tasks.
FedLog reduces communication in federated learning by sharing data summaries.
problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.
Modern discriminative predictors have been shown to match natural intelligences in specific perceptual tasks in image classification, object and part detection, boundary extraction, etc. However, a major advantage that natural intelligences still have is that they work well for "all" perceptual problems together, solvi…
Unsupervised methods have proven effective for discriminative tasks in a single-modality scenario. In this paper, we present a multimodal framework for learning sparse representations that can capture semantic correlation between modalities. The framework can model relationships at a higher level by forcing the shared …
New results show contrastive learning can recover shared factors in multimodal data.
problem Understanding when contrastive learning can recover shared latent factors in multimodal data.
method New identifiability results for multimodal contrastive learning, distinguishing between multi-view and multimodal settings.
result Contrastive learning can block-identify shared latent factors in multimodal data, even with dependencies.
Multimodal learning with deep Boltzmann machines (DBMs) is an generative approach to fuse multimodal inputs, and can learn the shared representation via Contrastive Divergence (CD) for classification and information retrieval tasks. However, it is a 2-fan DBM model, and cannot effectively handle multiple prediction tas…
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.
Study k-positive surface group representations and their degenerations.
problem Understanding the behavior of surface group representations under degenerations.
method Introduced k-positive representations and studied their degenerations using a limit theorem for positively ratioed representations.
result Degenerations of k-positive representations can lead to limits that are at least (k-3)-positive and irreducible limits are (k-1)-positive.
Survey of multimodal deep generative models for diverse data types.
problem Inference of shared representations and cross-modal generation from heterogeneous multimodal data.
method Variational autoencoders and other deep generative models.
result A comprehensive survey of multimodal deep generative models.
HEAR benchmark evaluates audio representations for diverse tasks.
problem Developing a general-purpose audio representation for various tasks.
method Evaluated 29 models across 19 tasks using 16 datasets.
result No single audio representation performs holistically.
IndiSeek learns disentangled representations by balancing independence and completeness.
problem Learning disentangled representations with mutual information in multi-modal data.
method Combines independence-enforcing objective with a reconstruction loss that bounds conditional mutual information.
result Demonstrates effectiveness on synthetic data, CITE-seq, and real-world multi-modal benchmarks.
Paper proposes an algorithm for lifelong learning with shared structure.
problem Lifelong learning with shared structure in an online setting.
method Proposes a simple algorithm using multi-task empirical risk minimization.
result Establishes a sample complexity bound based on task-eluder dimension.