- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper deals with an interesting problem of adapting time series foundation models for improved financial forecasting under missing historical input data and changing statistical properties. To address these challenges, the authors propose COIN, an ensemble-based framework that incorporates eight conventional imputation strategies with feedback-based forecast weighting and LoRA-based adaptation of time series foundation models. The proposed framework dynamically combines forecasts from different imputation methods and selects suitable adaptation mechanisms based on previously observed forecasting errors. The authors evaluate their framework using four time series foundation models across multiple financial time series datasets and demonstrate improved forecasting performance compared to several existing baselines.
Critical strengths
-
The paper addresses an interesting and relevant problem of handling missing historical observations in financial time series forecasting using foundation models. The problem is reasonably well motivated, particularly considering the challenges associated with missing input data and changing statistical properties in financial time series.
-
The authors evaluate the proposed framework across several financial time series datasets using four different foundation models. The paper also includes some additional ablation studies and computational cost analyses to investigate the effects of different components of the proposed framework.
Critical weaknesses
- The proposed framework appears to be a complicated ensemble of several existing techniques rather than a fundamentally novel methodological contribution. The technical justification for integrating multiple imputation, forecast-weighting, and adaptation mechanisms into one framework is not sufficiently convincing.
- The proposed framework introduces substantial computational overhead due to multiple imputation-conditioned forecasting evaluations and adaptation mechanisms, while the improvements in forecasting performance appear relatively marginal. The necessity of such a complicated framework is not sufficiently justified, particularly when simpler configurations demonstrate comparable average forecasting performance.
- The experimental evaluation lacks systematic comparisons across different forecasting horizons and look-back windows within the same datasets, which limits the assessment of the method's robustness. Furthermore, direct comparisons with established deep learning-based imputation methods and explicitly missingness-aware forecasting approaches are missing, making it difficult to fully establish the effectiveness of the proposed framework.
- The proposed adaptation mechanism is not sufficiently clear or convincingly justified from a technical perspective. It appears to primarily rely on conventional LoRA-based fine-tuning followed by selecting among multiple parallel forecasting and residual correction branches based on historical prediction errors. It is not clear what the fundamental technical novelty of this adaptation strategy is, or why such a complicated mechanism is necessary compared to existing simpler adaptation approaches.
Questions for authors
- Given that the proposed framework primarily combines existing imputation, ensemble weighting, and adaptation techniques, and considering that much simpler configurations achieve comparable average forecasting accuracy, what is the fundamental technical advantage of the proposed hierarchical design that justifies its significantly higher computational complexity?
- Could the authors clarify the main technical novelty of COIN beyond an ensemble of multiple imputation-conditioned forecasting outputs followed by adaptation selection? What makes the proposed hierarchical coordination fundamentally different from existing ensemble learning or online expert-weighting approaches?
- How was the number of eight imputation methods decided? Why were these particular methods selected, and why not a smaller or larger number of imputation strategies? Given that the pruning experiments demonstrate comparable average forecasting performance with fewer candidates, how do the authors justify the necessity of the full framework?
- Considering the substantial additional computational overhead and relatively marginal forecasting improvements, what is the practical advantage of using COIN over simpler adaptation or ensemble-based forecasting approaches?
- Since the primary motivation is to address missingness in financial time series, could comparable improvements be achieved through missingness-aware fine-tuning or domain adaptation of the foundation models themselves, rather than introducing a computationally expensive ensemble framework?
- Why were different forecasting horizons and look-back window lengths not systematically explored within the same datasets? How can the authors establish that the improvements remain consistent across different short-term and long-term forecasting configurations?
- What was the rationale behind selecting the four particular foundation models used in the experiments? How representative are these models of existing time series foundation models, particularly in terms of their capabilities to handle missing input observations?
- Why were established deep learning-based imputation methods such as BRITS, SAITS, and CSDI not included as direct experimental baselines? Additionally, how would COIN compare against forecasting models that explicitly incorporate observation masks or are adapted to handle missing historical inputs?
- Could the authors provide a clearer technical explanation of how the proposed adaptation mechanism fundamentally differs from conventional LoRA-based fine-tuning combined with ensemble or output-selection strategies? Since the LoRA parameters remain fixed during online forecasting, in what sense does the proposed framework achieve model adaptation beyond dynamically selecting or correcting forecasting outputs based on historical prediction errors?
11 comments
Response to Reviewer YXDQ(Part 2 of 7)
To W4, Q2 and Q9. Discounted weighting scores completions by base forecast losses on arriving observed targets. The shared mixture weights produce and for the base and LoRA models. LoRA is fitted once. Online feedback updates candidate weights, stepwise residuals and branch scores. The selector chooses among , two residual corrections of , , and . This is output-level adaptation with fixed model parameters. Matched-warm-up ML-Poly scores 98.467 versus COIN's 98.478, showing that alternative weighting can be used within the same design (Sections 3–4, Table 29).
The branch selector compares outputs built from the same mixture of completed histories. For the dynamic residual branch, each forecast step gets its own smoothed error state, updated from the base mixture when observed targets arrive. That state changes the correction applied to the next forecast. The selector scores all five branch outputs on arriving targets and uses those scores for the next choice. The online updates therefore cover both the correction itself and the choice of output.
Response to Reviewer YXDQ(Part 3 of 7)
To Q3. Linear and nearest neighbor cover local structure, mean and median cover levels, directional fills carry observations forward or backward, and seasonal median and blend cover seasonality. Across 57 balanced configurations, one, three and eight candidates score 98.884, 98.613 and 98.478. Eight versus one or two gives Holm each, and eight versus three gives . The 1–8 sweep suggests diminishing gains within that range (Table 31).
To vary pool size, we tested eight balanced compositions at each size from one to seven, plus the full pool. The separate three-candidate configuration selected on development cuts rolling latency by 38.9%, with a 0.262-point increase in the worst-three mean. The sweep measures the trade-off through eight candidates. Larger pools remain untested (Tables 24–25 and 31).
Response to Reviewer YXDQ(Part 1 of 7)
Overview. Thank you for asking how the design holds up against simpler alternatives. Safeguards lower positive excess in the matched comparison. Pruning cuts latency but raises error in the worst scenes. The CSDI gap narrows with longer training. rMAE sets same-scene Linear to 100.
The online feedback changes the forecast output through candidate weights, residuals, and branch choice. LoRA is fitted once on the initial history. We compare native-mask LoRA at a common training budget and report the lookback and horizon grid by backbone. In the exploratory grid, three backbones favor COIN by point estimate in all four cells, while Sundial favors the control (Tables 37, 39 and 41).
To W1, W2, Q1 and Q4. The hierarchy separates candidate weighting from output adaptation. In a fixed flat policy, the safeguards reduce mean positive excess from 0.508 to 0.318 (Holm p=0.020), while rMAE changes from 98.353 to 98.511. With safeguards fixed, flat and hierarchical rMAE are 98.511 and 98.478 (CI for the difference [-0.114, 0.225]). The isolated runtime cost of the hierarchy remains open (Table 30).
Preparation plus 20 windows takes 31.336 s for full COIN and 8.870 s for STL with dedicated LoRA. Pruning cuts rolling latency 38.9% (862.74 to 527.17 ms/window) with rMAE 98.407 versus 98.478, and raises the worst-three mean per source by 0.262. Static input aggregation uses two evaluations per window. It is faster on three backbones and close on TimesFM-2.5. Full COIN lowers mean rMAE by 0.709 versus equal-weight input aggregation (Holm p=0.109). A three-window feedback delay raises the development composite from 98.720 to 99.202 (Section 5.4). See Sections 5.6–5.7 and Tables 23–25, 32–33.