PapersWithELO
← ICLR 2024 leaderboard

Conditional Information Bottleneck Approach for Time Series Imputation

MinGyu Choi, Changhee Lee

general MLtime series imputationtime series interpolationinformation bottleneck
64.90100
Fused
band ≈ ±13 pct pts (from σ = 0.27)
69.50100
Mimo
band ≈ ±20 pct pts (from σ = 0.41)
61.60100
DeepSeek
band ≈ ±18 pct pts (from σ = 0.36)

OpenReview ground truth

Accepted

Abstract

Time series imputation presents a significant challenge because it requires capturing the underlying temporal dynamics from partially observed time series data. Among the recent successes of imputation methods based on generative models, the information bottleneck (IB) framework offers a well-suited theoretical foundation for multiple imputations, allowing us to account for the uncertainty associated with the imputed values. However, directly applying the IB framework to time series data without considering their temporal context can lead to a substantial loss of temporal dependencies, which, in turn, can degrade the overall imputation performance. To address such a challenge, we propose a novel conditional information bottleneck (CIB) approach for time series imputation, which aims to mitigate the potentially negative consequences of the regularization constraint by focusing on reducing the redundant information conditioned on the temporal context. We provide a theoretical analysis of its effect by adapting variational decomposition. We use the resulting insight and propose a novel deep learning method that can approximately achieve the proposed CIB objective for time series imputation as a combination of evidence lower bound and novel temporal kernel-enhanced contrastive optimization. Our experiments, conducted on multiple real-world datasets, consistently demonstrate that our method significantly improves imputation performance (including both interpolation and extrapolation), and also enhances classification performance based on the imputed values.

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 — 40 comparisons

Ranked above opponent in 51% of matchups.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 40)