TEMPER: Temporal Encoder-Masked Probabilistic Ensemble Regressor for Time-Series Forecasting
Giancarlo Vercellino
Abstract
Probabilistic forecasting requires accurate central predictions and
calibrated uncertainty estimates. This paper presents TEMPER, the
Temporal Encoder-Masked Probabilistic Ensemble Regressor, a univariate
time-series forecasting algorithm that combines a temporal
autoencoder, a differentiable masked neural decision forest, continuous
ranked probability score (CRPS) training, and Gaussian-mixture
post-processing. The R implementation is built on torch for R and
returns horizon-wise density, distribution, quantile, and sampler functions.
We evaluate TEMPER on three deterministic synthetic level
series with trend, periodic, regime-switching, nonlinear-threshold, and
heteroskedastic components. Across 96 rolling-origin forecasts at horizons
t + 1, t + 5, t + 20, and t + 60, TEMPER obtains 2.824% mean
CRPS normalized by origin level, 3.635% median absolute error, and
68.8% empirical 90% interval coverage after training with a 300-epoch
cap and early-stopping patience of 100. A naive persistence bootstrap
has the best aggregate CRPS, 2.763%, while TEMPER has the best
median absolute error and the best CRPS at t+1 and t+5. The ablation
study uses matched series-origin-horizon cells, horizon-wise CRPS
deltas, endpoint sensitivity summaries, and a calibration-specific interval
study. Relaxing the learned mask improves average CRPS by 0.472
percentage points on the ablation subset, mainly through long-horizon
gains. A twofold interval inflation improves held-out coverage from
54.2% to 91.7% and gives the best 90% interval score among tested
calibration rules. The results identify calibration, horizon-specific tuning,
and component selection as the central research priorities.
Review reports
Reviewer3 (AI review)
AI Review (reviewer3.com)
Comments (9)
1. Inconsistent width delta for latent dimension — Editorial
Table 5: Endpoint sensitivity summary derived from the paired ablation runs. The table separates parameter axes from the component interpretation in Table 2.
In Table 5, the 'Latent dimension' row lists a width delta (\u0394 width) of +0.21. However, comparing the 90% width values in Table 2 for 'No latent bottleneck' (7.26%) and 'Full TEMPER' (7.04%) yields a difference of +0.22 percentage points.
2. Inconsistent coverage delta for forest capacity — Editorial
Table 5: Endpoint sensitivity summary derived from the paired ablation runs. The table separates parameter axes from the component interpretation in Table 2.
In Table 5, the 'Forest capacity' row lists a coverage delta (\u0394 cov.) of +18.8. However, comparing the 90% coverage values in Table 2 for 'Reduced forest head' (83.3%) and 'Full TEMPER' (64.6%) yields a difference of +18.7 percentage points.
3. Overfitting risk in Gaussian mixture smoothing — Major
For each horizon, the resulting finite sample is smoothed by a Gaussian mix- ture. The implementation fits candidate k -means partitions, chooses a com- ponent count by an elbow-style curvature heuristic, estimates component means, standard deviations, and weights, and returns density, distribution, quantile, and random-generation functions.
The paper applies Gaussian mixture smoothing to the ensemble predictions at each horizon, fitting up to 8 components on an ensemble of only 80 paths (or 30 in the reduced variant). Fitting a GMM with many components on such a small sample is highly prone to overfitting and numerical instability (such as singular covariance matrices). The authors should discuss how they handle these risks or justify why such a high number of components is appropriate for small ensemble sizes.
4. Ablation results contradict the core architectural design — Critical
Table 2 shows that the default full configuration is not optimal for this syn- thetic setting. Relaxing the learned mask gives the best average CRPS, 2.551%, a paired improvement of 0.472 percentage points relative to the full model.
The headline claim presents TEMPER as an architecture that combines temporal encoding, differentiable masked forests, and reconstruction regularization to achieve competitive performance. However, the ablation study in Table 2 shows that removing every single one of these key components actually improves the overall CRPS. Specifically, relaxing the learned mask improves CRPS by 0.472 percentage points, removing the latent bottleneck improves it by 0.369 points, and removing reconstruction regularization improves it by 0.348 points. This indicates that the proposed combination of components is suboptimal and actually degrades performance compared to simpler variants. The authors should address this contradiction by either finding a hyperparameter configuration where the full model outperforms the ablated versions, or revising the core architectural claims to reflect that these components are counter-productive in this setting.
5. Insufficient sample size for calibration evaluation — Major
origins are used as an evaluation block. All calibration rules are evaluated on the same 3 × 2 × 4 = 24 held-out forecast-horizon cells.
The calibration study is evaluated on only 24 held-out forecast-horizon cells (3 series x 2 evaluation origins x 4 horizons). With such a small sample size, the empirical coverage estimates are highly volatile (each cell represents approximately 4.17% of the total), making it difficult to draw reliable conclusions about the generalizability or performance of the calibration rules. The authors should expand the evaluation block to include more origins or series to increase the statistical power of the calibration analysis.
6. Contradictory description of stochastic series as deterministic — Major
The benchmark uses three deterministic synthetic positive level series of length 900. Each series is generated through clipped log returns
The authors describe the synthetic datasets as 'deterministic synthetic level series'. However, the data-generating process described in Equation 11 explicitly includes a Gaussian noise term, which makes the series stochastic by definition. Calling these series deterministic is mathematically incorrect and confusing to readers. The authors should correct the terminology throughout the manuscript to clarify that these are stochastic processes generated with fixed random seeds.
7. Unspecified bootstrap baseline construction details — Major
We compare against three simple probabilistic baselines [19]: a naive per- sistence bootstrap, a random-walk bootstrap, and an AR(1) residual boot- strap. Metrics are normalized by the level at the forecast origin. We report
The paper compares TEMPER against three bootstrap baselines (naive persistence, random-walk, and AR(1) residual bootstrap) but does not explain how these bootstrap distributions are constructed. For instance, it is unclear how the naive persistence bootstrap generates a distribution, or whether the residuals are sampled with replacement or block-bootstrapped. To ensure reproducibility and a fair comparison, the authors should provide a clear mathematical or algorithmic description of these baselines in the main text.
8. Selection bias in evaluated forecast horizons — Major
February 8, 2022; March 15, 2022; and April 19, 2022. At each origin and
Although the model produces 60-step forecasts, the evaluation and the aggregate CRPS are computed using only four selected horizons (t+1, t+5, t+20, t+60). Evaluating only a few arbitrary horizons instead of the entire forecast path or a continuous average can introduce selection bias and may not accurately reflect the model's overall multi-horizon performance. The authors should report the mean CRPS across all 60 horizons to provide a complete and unbiased evaluation.
9. Potential data leakage in validation split — Major
The main benchmark uses the following TEMPER configuration: lookback
The model is trained using early stopping with a 75% training split. In a sliding-window time-series setup, if this split is performed randomly across overlapping windows, there will be severe data leakage between the training and validation sets because adjacent windows share substantial input and target history. The authors should clarify whether a temporal split was used and how they prevented temporal leakage between the training and validation sets.
xPeerd (AI review)
AI Review (xPeerd — DAReview)
Summary
TEMPER presents a technically coherent probabilistic forecasting architecture that combines a temporal autoencoder, a differentiable masked neural decision forest, CRPS-based training, and Gaussian-mixture smoothing for univariate time-series forecasting. The manuscript is strongest when it is read as a methodological proof-of-concept with careful ablation analysis rather than as a demonstrated state-of-the-art forecasting system. Its main strengths are architectural clarity, explicit probabilistic evaluation, horizon-wise analysis, and a commendable effort to report calibration weaknesses rather than hide them. The main weaknesses are external validity, benchmark insufficiency, under-calibrated predictive intervals, and an internal tension between claimed contributions and the empirical evidence, which remains limited to three synthetic series and relatively weak baselines. The study is reproducibility-oriented in description, but several implementation choices still require stronger operational detail for full independent verification. I do not see strong signs of paper-mill style fabrication; the manuscript is coherent, technically aligned with recognized probabilistic forecasting literature, and openly acknowledges limitations. However, the evidence base is currently too narrow to support broad performance claims beyond the specific synthetic setting used here.
Potential Major Revisions
- The manuscript’s central empirical support is too narrow for the strength of its framing.
The abstract states that TEMPER is “a univariate time-series forecasting algorithm” and reports benchmark results across “three deterministic synthetic level series” with 96 evaluated forecast-horizon pairs. It then concludes that “The results identify calibration, horizon-specific tuning, and component selection as the central research priorities.” The manuscript itself also concedes in Section 8 that “it is synthetic, so it tests whether TEMPER can exploit controlled temporal structure rather than whether it generalizes to real operational forecasting domains” and that “the synthetic panel contains only three series and one data-generating design family.”
I think the problem is not that the paper uses synthetic data, but that the manuscript’s title and abstract imply a broader forecasting contribution than the evidence supports. At present, the paper validates that the method can learn under a tailored synthetic design; it does not yet validate robustness across realistic datasets, nonstationary regimes, varying scale structures, or standard public benchmarks. The claims should therefore be narrowed, or the experiments expanded substantially.
- The comparative baseline design is too weak for a method paper positioned within modern probabilistic forecasting.
The introduction places TEMPER in the context of DeepAR, deep state-space models, TFT, N-BEATS, N-HiTS, and GluonTS-style forecasting systems. The manuscript writes that these references are “architectural context rather than as direct empirical baselines.” Later, Section 8 explicitly admits that “the benchmark does not yet compare against standard neural forecasting systems such as DeepAR, TFT, N-BEATS, or N-HiTS on common datasets.”
This omission materially weakens the paper. Because the method is introduced as a new forecasting architecture, readers need to know whether it is competitive against recognized modern alternatives, not only naive persistence, random-walk bootstrap, and AR(1) bootstrap baselines. The current result that “A naive persistence bootstrap has the best aggregate CRPS, 2.763%, while TEMPER is second at 2.824%” is actually sobering rather than persuasive. If the best overall comparator is a simple naive bootstrap, then the manuscript must either (a) reframe itself as an exploratory architectural note, or (b) add stronger benchmarking.
- The manuscript’s probabilistic claims are undermined by substantial under-coverage.
The abstract reports “68.8% empirical 90% interval coverage” for TEMPER under the main configuration. Section 4.3 reinforces that “its 90% intervals cover only 68.8% of realized outcomes” and that “The shorter interval width, 6.74% of the origin level, confirms that TEMPER is too sharp in this configuration.” Section 6 is more severe on the held-out calibration block: “Raw TEMPER intervals” reach only “54.2” percent coverage.
For a paper centered on probabilistic forecasting, this is a first-order issue, not a minor caveat. The manuscript itself says that “the current TEMPER distributional output has useful central forecasts but needs explicit calibration control.” I agree. But that means the manuscript should not foreground the distributional output as a success without stronger caveating. Major revision should either incorporate calibration into the core method rather than as post hoc inflation, or clearly reposition the contribution as strong point forecasting plus incomplete uncertainty quantification.
- Some contribution claims appear stronger than the results warrant.
The conclusion states that “TEMPER is competitive with the best naive baseline in aggregate CRPS, achieves the best MdAE, and has the best CRPS at t + 1 and t + 5.” That is factually consistent with the reported numbers, but the overall empirical picture is more mixed than the prose suggests. Table 1 shows the naive persistence bootstrap is best in aggregate CRPS; AR(1) is best at t+20; and naive persistence is best at t+60. The paired ablation study then shows that the “Full TEMPER” reference is itself not optimal: “Relaxing the learned mask gives the best average CRPS” and several ablations improve on the default configuration.
This creates an internal tension. The paper introduces a named integrated architecture, yet much of the manuscript’s own evidence suggests that important parts of the integrated design may be over-restrictive in this setting. The paper should discuss more directly whether TEMPER’s default form is actually the main contribution, or whether the more defensible contribution is a framework for analyzing design tradeoffs among masking, bottlenecking, reconstruction, and forest capacity.
- Reproducibility is promising but still incomplete at the level needed for exact independent replication.
Section 9 says: “The ancillary directory contains the experiment script, the derived-analysis script, raw forecast metrics, summary tables, metadata, a CSV export of the generated synthetic data, and the implementation file used by the run. The exact benchmark origins, hyperparameters, generator seeds, package versions, and baseline definitions are recorded in the ancillary metadata and experiment scripts.” This is good practice. However, key operational details remain underspecified in the body text, including the precise early-stopping criterion, validation split procedure, k-means mixture-selection heuristic stability, and whether multiple random restarts were used for model fitting or mixture estimation. Section 3.4 states that the implementation “fits candidate k-means partitions, chooses a component count by an elbow-style curvature heuristic,” but this heuristic is too vaguely described for exact duplication from the paper alone.
A stronger revision should make the method reproducible even if ancillary files are unavailable or become stale. At minimum, the main text or appendix should fully specify algorithmic decision rules.
- The calibration study is useful diagnostically, but methodologically thin.
Section 6 uses a very small block: “The first six rolling origins are used as a calibration block, and the last two origins are used as an evaluation block,” producing “24 held-out forecast-horizon cells.” The paper itself notes that “Because the calibration block is small, the split-conformal quantile is deliberately conservative.” While I appreciate the honesty, the study is too limited to justify much confidence in the reported calibration remedies. The finding that “A 2.0-fold inflation reaches 91.7% coverage with the best interval score” is practically interesting but scientifically fragile given the tiny evaluation design.
If calibration is one of the paper’s main conclusions, it deserves a more substantial experiment, ideally with additional origins, repeated designs, and time-series-aware calibration procedures evaluated under distribution shift.
- The paper would benefit from a clearer novelty argument relative to existing hybrid forecasting architectures.
The manuscript states that TEMPER “uses a different inductive bias” because it “forecasts through a differentiable decision-forest ensemble in a learned latent return space” with “a horizon-wise Gaussian-mixture smoother over ensemble paths.” That is plausible, but the novelty remains partly compositional: autoencoding, differentiable forests, CRPS learning, and mixture smoothing are each established ideas. The manuscript needs a sharper argument explaining whether novelty lies in the integration, the training objective, the probabilistic output layer, the ablation framework, or the inspectability claim. At present, the reader can understand what TEMPER is, but not fully why this exact combination constitutes a sufficiently distinct methodological contribution for publication in a methods-oriented venue.
- Some mathematical and methodological choices need justification beyond implementation convenience.
Section 3 converts levels to relative changes via “rt = st/st−1 − 1” after imputing missing values when needed. Yet the paper does not explain why simple returns are preferred over log returns in the modeled learning space, especially when the synthetic generator itself uses clipped log returns in Section 4.1. This mismatch is not necessarily wrong, but it deserves justification. Similarly, at evaluation time “the implementation uses the deterministic sign of log αj” for the mask. That discrete transition from stochastic training relaxation to deterministic evaluation can materially affect behavior; the manuscript should explain why this choice is stable and whether alternatives were tested.
Potential Minor Revisions
- Typographic and formatting issues
There are several visible formatting and typesetting artifacts in the extracted text that should be corrected in the final PDF source. For example, section headers appear merged with page numbers, such as “11 Introduction,” “74.3 Benchmark Results,” and “53.4 Level-Space Predictive Distributions,” which likely reflect pagination or OCR/PDF encoding problems but still signal a presentation issue in the distributed document.
There are also hyphenation/encoding artifacts throughout, including broken words such as “hyperparameter,” “forecasting,” “regularization,” and “Temporal.” These may arise from PDF text extraction, but they should be checked carefully in the actual manuscript source to ensure the published PDF is clean.
- Writing clarity and local phrasing
The sentence “The paper is framed for statistical machine learning rather than as an application-specific forecasting claim” is conceptually helpful but stylistically awkward. It would read more clearly if rewritten in direct terms, e.g., that the manuscript is a methodological study rather than an applied forecasting benchmark.
Similarly, the phrase “The exact benchmark origins, hyperparameters, generator seeds, package versions, and baseline definitions are recorded...” is informative but dense and could be split for readability. Across the manuscript, long multi-clause sentences could be shortened to improve accessibility without sacrificing rigor.
- Terminology consistency
The manuscript alternates between emphasizing “probabilistic forecasting,” “distributional output,” “ensemble paths,” and “Gaussian-mixture smoothing.” These are related but not interchangeable. A short terminology note would help distinguish:
- ensemble sample generation,
- post hoc mixture smoothing,
- predictive interval construction,
- and final probabilistic forecast object returned by the package.
This matters because some readers may otherwise misread the mixture smoother as intrinsic to model training rather than part of the output reconstruction layer. Section 3.4 would benefit from slightly sharper terminology.
- Presentation of ablation findings
The ablation section is one of the manuscript’s strongest parts, but the presentation could still improve. Table 2 shows that the “default full configuration is not optimal,” while Table 3 shows horizon dependence very clearly. I think the manuscript should visually foreground this as a central result, perhaps by moving the horizon-wise interpretation earlier or by explicitly distinguishing:
- aggregate average improvements,
- horizon-specific reversals,
- and cellwise win-rate non-dominance.
That separation would prevent readers from overinterpreting mean CRPS improvements.
- AI content analysis
Estimated AI-generated content: low to moderate, approximately 10–20%.
Rationale: the manuscript is stylistically polished, structurally regular, and highly uniform in tone, but it also contains field-appropriate specificity, non-generic technical detail, and a self-critical limitations section that is better grounded than typical synthetic AI-generated prose. The text repeatedly cites exact hyperparameters, equations, evaluation cells, and ablation deltas in ways that are coherent with the broader argument. For example, the manuscript gives specific claims such as “Relaxing the learned mask improves average CRPS by 0.472 percentage points” and “A twofold interval inflation improves held-out coverage from 54.2% to 91.7%.” These are not, by themselves, evidence against AI assistance, but they are integrated consistently with tables and later interpretation.
Potentially AI-assisted sections: the abstract and parts of the introduction/conclusion may have been stylistically machine-assisted because of their smooth compression, balanced clause structure, and repetitive rhetorical framing around “contributions,” “priorities,” and “controlled setting.” See, for example, the abstract’s compact sequence of contribution-summary-result-summary-priority statements and the conclusion’s highly symmetrical recap of strengths and next steps.
Assessed epistemic impact: limited to moderate. Even if AI assistance was used in drafting, I do not see obvious signs that it has introduced fabricated citations, incoherent technical claims, or false disciplinary alignment. The larger epistemic issue is not possible AI authorship assistance but the limited empirical basis of the claims.
- Anti-fraud / coherence warning
I do not find strong paper-mill traits. The manuscript fits a recognized scientific paradigm in probabilistic time-series forecasting, cites canonical literature, includes equations aligned with the narrative, reports negative as well as positive findings, and openly acknowledges limitations. The main caution is evidential narrowness, not apparent fabrication. However, because all experiments are synthetic and the author is listed as an independent researcher, editorial review should still verify that the ancillary scripts and raw metrics mentioned in Section 9 are actually available and executable.
Recommendations
-
Reframe the manuscript more narrowly unless major new experiments are added. The current evidence best supports a claim like: TEMPER is a promising hybrid probabilistic forecasting architecture that performs competitively on a controlled synthetic benchmark and reveals informative component tradeoffs through paired ablation.
-
Add at least one real-world benchmark suite and include modern competitive baselines. The manuscript itself names DeepAR, TFT, N-BEATS, and N-HiTS as relevant comparators; a revised version should test against some subset of these on standard datasets.
-
Treat calibration as a core methodological issue. Since “raw TEMPER intervals are too narrow” and under-cover materially, the revision should either integrate calibration into the method or clearly demote probabilistic interval quality claims.
-
Clarify novelty. State explicitly what is new: the architectural coupling, the training setup, the probabilistic reconstruction method, the ablation framework, or the interpretability angle.
-
Expand reproducibility details in the manuscript itself. Spell out the exact early-stopping protocol, validation logic, mixture-component selection rule, random seed handling, and any restart strategy.
-
Justify design choices that currently look ad hoc, especially return representation, deterministic mask evaluation, and Gaussian-mixture post-processing.
-
Preserve the paired ablation analysis and strengthen it. This is one of the paper’s strongest contributions because it reveals that aggregate gains can mask horizon-specific reversals and non-dominant win rates.
Overall, my judgment is that the manuscript is coherent, technically serious, and potentially publishable after substantial revision, but not yet empirically strong enough in its current form for a high-standard methods venue.
XSci (AI review)
Referee Report
Manuscript: TEMPER: Temporal Encoder-Masked Probabilistic Ensemble Regressor for Time-Series Forecasting Field: Statistical machine learning / probabilistic time-series forecasting Recommendation: Major revision
Summary and Recommendation
This manuscript introduces TEMPER, a univariate probabilistic forecasting architecture that reframes a level series as lagged relative changes, compresses each lookback window through a feed-forward autoencoder, gates the latent vector with a learnable stochastic mask, routes it through an ensemble of soft decision trees whose leaves hold free multi-horizon forecast vectors, trains under an ensemble continuous ranked probability score objective with reconstruction regularization, and converts ensemble paths into horizon-wise Gaussian mixtures exposing density, distribution, quantile, and sampling functions. The implementation is an R package on the torch stack. Evaluation proceeds through a rolling-origin benchmark on three synthetic series of length 900 at eight origins and four horizons, giving 96 cells per model, followed by a paired ablation on 48 matched cells and a calibration study on 24 held-out cells. TEMPER attains 2.824% mean normalized CRPS against 2.763% for a naive persistence bootstrap, the best median absolute error at 3.635%, and 68.8% coverage of nominal 90% intervals; every ablation variant improves mean paired CRPS over the default, and twofold inflation raises held-out coverage from 54.2% to 91.7%.
The manuscript has uncommon virtues. The paired ablation on matched cells is sounder than the aggregate comparisons common in this literature, the reported win rates actively undercut the author's own headline, the horizon-wise decomposition is the right diagnostic, and the Limitations section is specific rather than ritual. What prevents publication in the present form is that the inferential apparatus cannot support the comparisons made with it, that several load-bearing specifications in the algorithm section are ambiguous or appear internally inconsistent, and that the framing has not caught up with results pointing consistently against the configuration being proposed. These problems are serious but tractable, and most remedies require only re-scoring existing forecasts or additional fits whose total cost, estimable from the reported timings at roughly three CPU-hours for the whole study, is modest.
Major Concern Category 1: Inferential Validity of the Empirical Comparison
1.1 No uncertainty quantification over strongly dependent cells
Every comparative claim is small and unaccompanied by any measure of reliability. The gap between the naive bootstrap at 2.763% and TEMPER at 2.824% is 0.061 percentage points, and the ablation deltas run from 0.472 down to 0.137, yet no standard error, interval, paired test, or replication appears anywhere. Three features make this decisive. Origins are spaced 35 days apart while the horizon is 60 steps, so evaluation windows overlap by roughly 25 observations and the 96 cells are far from exchangeable. The panel contains three series from a single generator family with fixed seeds, so independent replications number three, not 96. And training is stochastic through Adam initialization, batch ordering, and the Gumbel noise of Equation 5, yet one fit is reported per cell; the spread in mean epochs across variants, from 263.4 to 300.0, itself suggests that trajectories differ materially between runs. Repeating each configuration across several seeds and applying a paired accuracy test suited to overlapping multi-step forecasts would show which orderings survive.
1.2 Aggregates are determined almost entirely by the longest horizon
The summary statistics are equal-weighted means over horizons differing roughly twentyfold in magnitude, and the implication is never stated. With 24 cells at each horizon, the aggregate is the equally weighted mean of four horizon means; from the reported 0.353% at and 0.867% at against an aggregate of 2.824%, the two long horizons contribute 10.076 of 11.296 points, about 89%. The Table 1 ranking is therefore in substance a statement about and , consistent with the text's own observation that naive persistence wins at the longest horizon, and the same holds more strongly for the ablation, where the term alone supplies roughly 83% of the no-mask variant's mean delta. Resolution compounds this: with 48 cells, coverage moves in quanta of 2.083 points, so the point differences in Table 5 each represent one cell changing status yet sit beside a nine-cell difference presented identically. Promoting the horizon-wise table to primary, with a scale-free summary such as a horizon-specific skill score, would prevent the mean from being read as a verdict it cannot deliver.
1.3 Training budget is an uncontrolled covariate across variants
Table 2 reports mean epochs of 276.6, 263.4, 270.0, 300.0, and 270.5 under a cap of 300 with patience 100. The reduced forest reports exactly 300.0, meaning every one of its fits ran to the cap without early stopping firing; it therefore received more gradient updates than any other variant while carrying the smallest parameter count, so the row producing the paper's most striking coverage result, a rise from 64.6% to 83.3%, confounds capacity with budget. More generally, patience 100 against a cap of 300 cannot fire before epoch 101, so with means in the 263 to 277 range the rule acts less as a convergence criterion than as a fixed budget with occasional truncation. Because the monitored quantity is never stated, a further asymmetry arises: if it is the combined objective, the zero-reconstruction variant is stopped on a different criterion from every other row. Re-running at a fixed epoch or wall-clock budget would resolve this.
1.4 Baselines are misaligned with the generators, and no attainable frontier is established
The comparison set is persistence, random walk, and AR(1) bootstraps, while the generators are explicitly periodic: sinusoidal drift at periods 20 and 60, a 45-observation cycle with regimes alternating every 150 and 120 observations, and a thresholded 36-observation sinusoid with a 90-observation cosine term. None of the three baselines can represent any of this, and the CycleTrend 60-period component aligns exactly with the forecast horizon. Neither direction of the headline comparison is therefore informative: a loss to persistence may reflect only long-horizon dominance of the aggregate, and a win at the short horizons may reflect only short-memory autocorrelation that a seasonal method would capture at negligible cost. Seasonal naive with bootstrapped residuals, an ETS or STL forecaster, and an auto-ARIMA on the identical 96 cells would cost a small fraction of 135.10 seconds per fit. Equally cheap and more informative would be an oracle: since Equation 11 is fully specified, the true conditional distribution can be simulated to give the minimum attainable CRPS per cell, the only way to tell whether the near-tie reflects a largely unpredictable regime or a large unexploited gap.
Major Concern Category 2: Specification of the Model and Alignment of the Objective
2.1 The feature mask behaves differently at training and evaluation
Equation 5 makes a sigmoid output lying in the open unit interval, a soft multiplicative gate. Section 3.2 then states that at evaluation the implementation uses the deterministic sign of , which takes values in . A coordinate the model has learned to suppress would therefore not be switched off but multiplied by $-1$, reversing its contribution to the routing form of Equation 6 and presenting downstream nodes with inputs the training distribution never produced. If a threshold indicator is what the code implements, the text needs correcting; if the sign rule is literal, this affects all reported results. Two specification points compound it. The cited relaxations require logistic noise for a binary gate, whereas Equation 5 adds a single Gumbel variate whose mean of roughly 0.577 introduces a keep-bias amplified by division by . And although Section 3.2 says each tree starts with its own mask, Equation 6 carries no tree index, leaving unclear whether the architecture has any per-tree diversity mechanism at all.
2.2 The training objective is misaligned with the evaluated quantity in two distinct ways
Equation 8 is the energy-form ensemble CRPS estimator, with dispersion normalized by and the diagonal included. This estimator is biased downward in dispersion at finite ensemble size and, used as a training objective, is minimized when all members coincide with the median of the target, so it actively rewards under-dispersion; the fair variant, normalized by with the diagonal excluded, removes the degenerate optimum. Separately, the objective is computed on horizon-marginal relative changes while every metric is computed in level space after the cumulative product of Equation 10, so long-horizon level dispersion, which depends on within-path dependence among ensemble members, is never scored at all. Both patterns are visible in the results: the mean 90% width of 6.74% against 10.93% and 11.45% for the baselines indicates systematic over-sharpness shared by every ablation variant, while Table 3 shows all variants degrading CRPS at and , where the level transformation is nearly linear, and improving it substantially where path dependence dominates. A re-fit under the fair estimator and a path-aware scoring rule such as the energy or variogram score would address both at source, making the calibration machinery a refinement rather than a repair.
2.3 Capacity is large relative to independent information, and both regularizers hurt
With 80 trees of depth 5, latent dimension 10, and horizon 60, the forest head carries roughly 27,280 routing and 153,600 leaf parameters, approaching 181,000 before encoder, decoder, and mask; no parameter count is reported and the hidden widths are never specified. Each series yields 899 returns and hence 780 window pairs, about 585 after the split, but consecutive windows share 119 of 120 returns and only seven fully non-overlapping windows exist. The architecture offers exactly two regularizing devices, the bottleneck and the reconstruction penalty, with no weight decay or dropout reported, and Table 2 shows that removing either improves paired CRPS by 0.369 and 0.348 points. Both safeguards therefore hurt, which together with the gain from a smaller forest suggests a capacity regime in which the default is poorly chosen rather than well motivated. Reporting parameter counts and a single-axis capacity sweep would distinguish an overfitting account from the component-specific interpretation currently offered.
2.4 The mixture smoother mediates every number but is neither specified nor validated
Section 3.4 describes the post-processing in two sentences: k-means candidates, an unspecified elbow-style curvature heuristic capped at eight components, and estimated means, standard deviations, and weights. This layer determines every quantile, interval, coverage figure, and CRPS value in the paper. With 80 ensemble paths per horizon and up to eight components, as many as 23 parameters are fitted to 80 points, separately for each of 60 horizons, with no diagnostic reported for degenerate components whose near-zero standard deviations would produce exactly the observed over-sharpness. The components are also symmetric while the level distribution induced by a sixty-fold product is right-skewed, which bears additionally on the decision to inflate intervals symmetrically about the median. Most tellingly, this is the one named component the ablation never varies. Scoring the raw ensemble paths through their empirical distribution function, against a kernel estimate and a BIC-selected mixture, would establish whether the smoother earns its place.
Major Concern Category 3: Attribution, Calibration, and Scope of the Claims
3.1 Ablation variants are bundled manipulations presented as single-component effects
Neither Table 2 nor the axis framing of Table 5 isolates the components it names. The "No learned mask" row changes the keep probability from 0.8 to 0.999 and the temperature from 0.5 to 0.1 together, and these interact: the large positive shift in divided by the smaller temperature saturates the sigmoid, so the variant both sets the mask near keep-all and removes its capacity to move. The "Reduced forest head" row changes three quantities at once, the tree count from 80 to 30, the leaves per tree from 32 to 16, and the mixture component cap from 8 to 6; the third is not a forest parameter, so the row's eighteen-point coverage gain could be produced by the smoother alone. Table 5 nonetheless presents these as four separate axes and Section 7 draws tuning conclusions from them, which are therefore attributions to manipulations that were not performed. A modest one-factor-at-a-time grid would make those conclusions readable; failing that, the variants should be renamed descriptively and the axis framing withdrawn.
3.2 The calibration block is unrepresentative, and the winning rule is chosen on the evaluation set
The manuscript's own figures establish the first point. Coverage across 96 cells is 68.8%, or 66 covered cells, and across the 24 evaluation cells is 54.2%, or 13 cells, so the 72-cell calibration block runs at roughly 73.6%. Coverage falls by about nineteen points between the block on which rules are estimated and the block where they are applied, a regime shift in precisely the quantity being corrected and a more convincing explanation of the conformal rules' performance than the block-size account given. Second, five rules are compared on 24 dependent cells and the best is reported as a finding with no further confirmation, while the winner sits at the boundary of a two-point inflation grid and coverage is quantized at 4.167 points, so the two best-covering rules differ by a single cell. A rolling scheme re-estimating the rule at each origin from all prior origins would respect temporal ordering and yield a substantially larger evaluation set from forecasts already in hand.
3.3 Reporting pools away the two dimensions the study was designed to examine
The Introduction motivates the work by appeal to tail risk, scenario dispersion, and threshold-crossing probabilities, and the package returns four functional interfaces per horizon, yet the evaluation reduces this to coverage and width of one central interval with no horizon-wise breakdown anywhere. A model uniformly twenty points short and one well calibrated at short horizons but not long ones would both report 68.8%, and they call for different remedies; that pooling conceals heterogeneity is not speculative, since the paper's own numbers imply a nineteen-point difference between origin blocks. The second pooling is across series. Considerable care went into constructing three processes differing in kind, a smooth trending series, a piecewise series with alternating drift and volatility regimes, and a nonlinear threshold series, yet every table marginalizes out the one factor the design exists to vary. A reader cannot tell whether the short-horizon advantage arises where a partition-based predictor might genuinely help or where it would be far less interesting. Per-series and per-horizon columns, coverage at several nominal levels, and probability integral transform diagnostics would cost three columns and some re-scoring.
3.4 No falsifiable proposition is stated, and the implementation contribution is not usable
The work is positioned as statistical machine learning and the architecture described as using a different inductive bias from recurrent, attention, or residual decoders, but nowhere is it said what that bias should buy, under what conditions, or what would count against it, so the empirical sections have no proposition to test. The evidence meanwhile points one way: the default loses aggregate CRPS to a zero-parameter baseline running in no measurable time, and all four tested simplifications improve on it. The text concedes the default is not optimal yet the Conclusion calls the method promising, and the abstract's closing sentence presents research priorities as results. A stated hypothesis, for instance that latent-space soft partitions should be advantaged where the conditional mean is discontinuous, could be tested using the ThresholdWave and CycleTrend contrast already present. The second stated contribution, documenting the reference implementation, is likewise not actionable: the package is never named, no repository, version, license, or archived identifier appears, the materials reside in an arXiv ancillary directory that is neither durable nor installable, and no hardware is specified, which leaves the 135.10 second figure and the entire Time column uninterpretable.
Minor Issues
-
The split is described as a "training rate 0.75" without stating whether it is chronological or random. Since windows overlap by 119 of 120 positions, a random split would place near-duplicates on both sides of the partition and would invalidate early stopping. The quantity the stopping rule monitors is also never stated, so it is unclear whether the zero-reconstruction variant is stopped on a comparable criterion.
-
Several details needed for reimplementation are missing: encoder and decoder hidden widths, latent-layer activation, the routing convention and whether any path-balancing penalty is applied, and the functional form mapping keep probability to the mask logit. The reconstruction weight is also not dimensionless, balancing a squared norm against an absolute-deviation score, so its default does not transfer to other return scales.
-
The mixture layer needs fuller specification: the elbow heuristic is undefined with no criterion such as BIC reported, "bases" is used in two tables without introduction, the nominal interval endpoints are never identified as particular mixture percentiles, and the interval score appears without a formula or statement of its normalization.
-
The claim that each predictive distribution is evaluated with 300 samples is ambiguous given an 80-member ensemble; the draws must come from the fitted mixture, and the Monte Carlo error this induces in every CRPS and coverage figure is neither quantified nor bounded.
-
Baseline documentation is thin. The number of bootstrap replicates is not given, nor the space in which AR(1) is fitted, although that baseline attains the best coverage. Horizon-wise results are reported numerically only for TEMPER, so the decomposition carrying much of the argument is available for the baselines only through a figure.
-
The ablation table would gain from four additions: a median absolute error column, since that is the principal claimed strength; a wall-clock column, since the quadratic ensemble cost motivates the reduced-ensemble variant; a baseline anchor on the same 48 cells, to establish whether the later origins are intrinsically harder; and explicit statement of the win-rate denominator and tie handling. The CRPS objective itself, one of four named pillars, is never ablated against an alternative loss.
-
The calibration study needs several specifications: the conformal quantile level, described only as deliberately conservative; the rationale for absolute median errors as a conformity score when a high quantile is conventional at 90%; at least one inflation factor beyond the current boundary; acknowledgment that residuals pool across six separately refitted models; and ideally a parallel study on the reduced-forest configuration, which already covers at 83.3%.
-
Presentation would benefit from consistency fixes. The full configuration appears as 2.824% in one table and 3.022% in another without cross-reference, and the abstract gives 68.8% and 54.2% within a few sentences without noting that they refer to different cell sets. The series are called deterministic although the generator includes a Gaussian innovation. The illustrative fan chart and loss curve are introduced inside the benchmark subsection despite coming from a different protocol, Figure 4 duplicates Table 3, and Section 7 largely restates Table 2.
-
The complexity analysis covers the forest pass and the pairwise CRPS term but omits the autoencoder and the per-horizon mixture fitting, the latter running sixty times per forecast. The total compute budget is also unstated although estimable, which is worth reporting precisely because it shows the requested replications to be affordable. The abstract runs to roughly 290 words with eleven numerical results, and only three keywords are supplied, one of them nonstandard.
-
Availability and declarations need attention: an installable source for the package, a license and archived identifier, explicit seeds, and data availability, code availability, funding, and competing interests statements. The ggplot2 version used is cited to a book predating it by several major releases, and the reference to imputing missing values should either be documented or removed. Finally, the three conclusions drawn from the sensitivity summary are stated without hedging; framing them as hypotheses would better match 48 cells, one seed, and bundled manipulations.
Missing and Inadequately Integrated Literature
Cited but Inadequately Integrated
Gneiting, Balabdaoui, and Raftery [3] is cited as foundational for distributional evaluation, but its central prescription, maximizing sharpness subject to calibration and diagnosing calibration through the probability integral transform, is never operationalized; computing PIT values per horizon from objects the package already returns would be nearly free and would turn the calibration section from repair into diagnosis. Gneiting and Raftery [2] is cited for propriety but is also the source of the interval score reported in Table 4, which is neither attributed nor defined, and its treatment of score aggregation across heterogeneous cases bears on the horizon-weighting problem above. Jang et al. [13] and Maddison et al. [14] are cited for the mask relaxation without their technical content being carried through: both specify logistic rather than single-Gumbel noise for binary gates, both discuss temperature annealing rather than a fixed value, and both address the train-to-evaluation discretization gap the manuscript leaves open. Breiman [18] is cited to motivate forest aggregation without engaging why forests work, namely decorrelation through resampling and feature subsetting; TEMPER trains all eighty trees jointly on identical data, so if the mask is shared no decorrelation mechanism exists, which would explain the under-dispersion directly. Kontschieder et al. [12] is cited for differentiable routing without discussion of its alternating optimization with closed-form leaf updates, although TEMPER learns 153,600 leaf parameters by gradient descent. Angelopoulos and Bates [17] is cited as conformal background while its guidance on quantile levels and conformity score design goes unused, and Lim et al. [7] is treated as context although its variable selection networks and multi-horizon quantile head are the closest prior art for two of TEMPER's four components.
Truly Missing Papers
Five absences matter for the technical argument. Ferro (2014) and Zamo and Naveau (2018) together establish that the energy-form CRPS estimator of Equation 8 is biased and is minimized when all members equal the median, and give the fair correction; they are the formal basis for the under-dispersion diagnosis above. Gibbs and Candès (2021) and Xu and Xie (2021) provide the two canonical approaches to conformal prediction under time dependence, the former adapting the miscoverage level online and the latter wrapping an ensemble estimator without requiring exchangeability or data splitting; either would replace ad hoc twofold inflation with a principled rule suited to the regime shift the paper's own numbers reveal. Kuleshov, Fenner, and Ermon (2018) supplies a simple post-hoc recalibration procedure demonstrated on forecasting tasks and would be a better-grounded addition to Table 4.
Four further absences bear on design and framing. Tashman (2000) is the standard reference on rolling-origin evaluation and addresses how origin spacing and window overlap affect out-of-sample reliability. Diebold and Mariano (1995), with the small-sample correction of Harvey, Leybourne, and Newbold (1997), supplies exactly the inferential apparatus the comparison tables lack. Makridakis, Spiliotis, and Assimakopoulos (2018) documents machine learning forecasters being dominated by statistical methods at far higher computational cost, which is the interpretive frame for a result in which a 135-second method narrowly loses to a zero-second one. And Popov, Morozov, and Babenko (2020) is the most directly comparable differentiable tree-ensemble architecture, including a feature selection mechanism analogous to TEMPER's mask, so the absence of positioning against it leaves the novelty of the forest component undefined. Two further suggestions are offered as opportunities rather than omissions: the Monash archive of Godahewa et al. (2021) supplies precisely the public benchmark suite the Limitations section calls for, and Januschowski et al. (2020) would let the author argue rigorously, through the global-versus-local distinction, why the cited neural systems are not directly comparable baselines.
Diebold, F. X., and R. S. Mariano. 1995. Comparing Predictive Accuracy. Journal of Business and Economic Statistics 13(3):253-263.
Ferro, C. A. T. 2014. Fair scores for ensemble forecasts. Quarterly Journal of the Royal Meteorological Society 140(683):1917-1923.
Gibbs, I., and E. J. Candès. 2021. Adaptive Conformal Inference Under Distribution Shift. Advances in Neural Information Processing Systems 34:1660-1672.
Godahewa, R., C. Bergmeir, G. I. Webb, R. J. Hyndman, and P. Montero-Manso. 2021. Monash Time Series Forecasting Archive. Proceedings of the NeurIPS Track on Datasets and Benchmarks 1.
Harvey, D., S. Leybourne, and P. Newbold. 1997. Testing the equality of prediction mean squared errors. International Journal of Forecasting 13(2):281-291.
Januschowski, T., J. Gasthaus, Y. Wang, D. Salinas, V. Flunkert, M. Bohlke-Schneider, and L. Callot. 2020. Criteria for classifying forecasting methods. International Journal of Forecasting 36(1):167-177.
Kuleshov, V., N. Fenner, and S. Ermon. 2018. Accurate Uncertainties for Deep Learning Using Calibrated Regression. Proceedings of the 35th International Conference on Machine Learning, PMLR 80:2796-2804.
Makridakis, S., E. Spiliotis, and V. Assimakopoulos. 2018. Statistical and Machine Learning forecasting methods: Concerns and ways forward. PLoS ONE 13(3):e0194889.
Popov, S., S. Morozov, and A. Babenko. 2020. Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data. International Conference on Learning Representations. arXiv:1909.06312.
Tashman, L. J. 2000. Out-of-sample tests of forecasting accuracy: an analysis and review. International Journal of Forecasting 16(4):437-450.
Xu, C., and Y. Xie. 2021. Conformal Prediction Interval for Dynamic Time-Series. Proceedings of the 38th International Conference on Machine Learning, PMLR 139:11559-11569.
Zamo, M., and P. Naveau. 2018. Estimation of the Continuous Ranked Probability Score with Limited Information and Applications to Ensemble Weather Forecasts. Mathematical Geosciences 50(2):209-234.
Conclusion and Path Forward
The question posed here, whether a differentiable decision forest operating in a learned latent return space is a useful inductive bias for probabilistic forecasting, is worth asking, and much of the work is more careful than the norm. The paired ablation on matched cells, the reported win rates that undercut the author's own aggregate story, the horizon-wise decomposition, and the candid Limitations section are all practices worth preserving. The obstacles lie in three places. The comparative design cannot distinguish any reported ordering from run-to-run and sampling variation, and its aggregates are long-horizon results presented as overall verdicts. Several load-bearing specifications are ambiguous or appear inconsistent, and the objective is computed on a different quantity from the one measured, with the biased ensemble estimator offering a direct explanation of the under-dispersion that is currently treated as a downstream calibration problem. And the framing advances no testable proposition while the evidence points consistently against the configuration proposed.
Most of what would resolve these is affordable. Re-fitting under the fair CRPS estimator costs almost nothing and may dissolve much of the calibration issue at source. Replicating each configuration across several seeds, adding seasonal and ARIMA-class baselines, and computing an oracle from the known generator would give every table an error bar, a fair comparison set, and a denominator. Reporting per series and per horizon would let the design's central contrast between smooth, regime-switching, and threshold processes finally be read. Varying one hyperparameter at a time, fixing the training budget, and adding a median-absolute-error column would make the component attributions defensible, while re-scoring the raw ensemble paths without mixture smoothing would show whether that layer earns its place and a rolling calibration scheme would use existing forecasts far more efficiently. Naming and depositing the package with a license and an archived identifier, and reframing the contribution around what the ablation revealed about horizon-dependent component interactions rather than around the method's promise, would align the claims with the evidence. A revision of this kind could yield either a defensible positive result or an unusually well-documented negative one, and the field would benefit from either.