Disentangling Time Series Representations via Contrastive Independence-of-Support on l-Variational Inference
Khalid Oublal, Said Ladjal, David Benhaiem, Emmanuel LE BORGNE, François Roueff
OpenReview ground truth
TL;DR — Disentanglement under Independence-of-Support via Contrastive Learning based $l$-Variational Inference for appliance usage electricity, addressing realistic correlations during training to capture real-world complexity.
Abstract
Learning disentangled representations for time series is a promising path to facilitate reliable generalization to in- and out-of distribution (OOD), offering benefits like feature derivation and improved interpretability and fairness, thereby enhancing downstream tasks. We focus on disentangled representation learning for home appliance electricity usage, enabling users to understand and optimize their consumption for a reduced carbon footprint. Our approach frames the problem as disentangling each attribute's role in total consumption. Unlike existing methods assuming attribute independence which leads to non-identiability, we acknowledge real-world time series attribute correlations, learned up to a smooth bijection using contrastive learning and a single autoencoder. To address this, we propose a Disentanglement under Independence-Of-Support via Contrastive Learning (DIOSC), facilitating representation generalization across diverse correlated scenarios. Our method utilizes innovative \textit{l}-variational inference layers with self-attention, effectively addressing temporal dependencies across bottom-up and top-down networks. We find that DIOSC can enhance the task of representation of time series electricity consumption. We introduce TDS (Time Disentangling Score) to gauge disentanglement quality. TDS reliably reflects disentanglement performance, making it a valuable metric for evaluating time series representations disentanglement. Code available at https://institut-polytechnique-de-paris.github.io/time-disentanglement-lib.
Author context
Most prolific author: 1 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 42 comparisons
Ranked above opponent in 45% of matchups.
- ▲ beat Decomposition Ascribed Synergistic Learnin… ×6
- ▼ lost to It HAS to be Subjective: Human Annotator S… ×4
- ▼ lost to Frequency-Aware Transformer for Learned Im… ×4
- ▼ lost to Efficient Meshy Neural Fields for Animatab… ×4
- ▼ lost to Distributional Structured Pruning by Lower… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 42)