Which Tasks Should Be Compressed Together? A Causal Discovery Approach for Efficient Multi-Task Representation Compression
No confident code implementation found for this paper. 1 possible match can be shown below.
No confident code implementation found for this paper. 1 possible match can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
SLM: A Smoothed First-Order Lagrangian Method for Structured Constrained Nonconvex Optimization
S2MAE: A Spatial-Spectral Pretraining Foundation Model for Spectral Remote Sensing Data
Synthesizing Realistic fMRI: A Physiological Dynamics-Driven Hierarchical Diffusion Model for Efficient fMRI Acquisition
CPCF: A Cross-Prompt Contrastive Framework for Referring Multimodal Large Language Models
SynMob: Creating High-Fidelity Synthetic GPS Trajectory Dataset for Urban Mobility Analysis
Beyond Circuit Connections: A Non-Message Passing Graph Transformer Approach for Quantum Error Mitigation
@article{guo2026which,
title = {Which Tasks Should Be Compressed Together? A Causal Discovery Approach for Efficient Multi-Task Representation Compression},
author = {Sha Guo and Jing Chen and Zixuan Hu and Zhuo Chen and Wenhan Yang and Yu Lin and Xing Jiang and Lingyu Duan},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:281a4b9dd206858961a58ea1296683d809a81c32},
journal = {ICLR 2025 2025}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/281a4b9dd206858961a58ea1296683d809a81c32)