{"paper_id":"2310.13029","title":"Blending gradient boosted trees and neural networks for point and probabilistic forecasting of hierarchical time series","authors":["Ioannis Nasios","Konstantinos Vogklis"],"paper_date":"2023-10-19","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2310.13029v1","page_url":"https://thequant.space/flowcharts/blending-gradient-boosted-trees-and-neural-networks-for-poin/","scores":{"empirical_rigor":8.5,"math_complexity":3,"quadrant":"Street Traders"},"proposes":{"status":"available","statement":"The paper proposes a blending methodology that combines gradient boosted trees and neural networks for point and probabilistic forecasting of hierarchical time series.","quote":"In this paper we tackle the problem of point and probabilistic forecasting by describing a blending methodology of machine learning models that belong to gradient boosted trees and neural networks families.","summary":"In this paper we tackle the problem of point and probabilistic forecasting by describing a blending methodology of machine learning models that belong to gradient boosted trees and neural networks families. These principles were successfully applied in the recent M5 Competition on both Accuracy and…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The hierarchical structure of the data is not exploited in the forecasting models.","type":"model","stated":"explicit","quote":"Although forecasting data had an inherent hierarchy structure (12 levels), none of our proposed solutions exploited that hierarchical scheme."},{"assumption":"Sales counts are intermittent with many zeros, justifying the use of a Tweedie loss function.","type":"data","stated":"explicit","quote":"Since the target quantity (sales count) is intermittent and has a lot of zeros (≈68% of daily sales are zeros), using the MSE loss function may lead to suboptimal solutions."},{"assumption":"Weighted RMSSE uses price‑related weights based on the last 28 observations of the training sample.","type":"statistical","stated":"explicit","quote":"weight is computed based on the last 28 observations of the training sample of the dataset, i.e., the cumulative actual dollar sales that each series displayed in that particular period."},{"assumption":"Symmetric distributions are assumed for aggregation levels 1‑9 and skewed distributions for levels 10‑12 in probabilistic forecasting.","type":"model","stated":"explicit","quote":"We assumed symmetric distributions on levels 1-9 and skewed distributions on levels 10-12."},{"assumption":"A simple exponential smoothing (α = 0.96) per product and store improves forecast accuracy.","type":"model","stated":"explicit","quote":"In the final solution we employed a simple exponential smoothing (α = 0.96) per product and store id (Level 12 - 30, 490) that lead to substantial improvement in both validation sets and the final evaluation."}]},"datasets":{"status":"available","items":[{"name":"M5 competition dataset","provider":"Walmart","kind":"benchmark","access":"public","period":"February 2011 to April 2016","universe":"42,840 hierarchical series (stores, departments, products, etc.)","quote":"The dataset provided contains 42, 840 hierarchical sales data from Walmart. It covers stores in three US states"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"forecast-accuracy","findings":[{"finding":"The blended model achieved a validation WRMSSE of 0.549 and a final competition score of 0.552, placing the team within the gold‑medal range on both Accuracy and Uncertainty tracks.","kind":"performance","quote":"The mean validation WRMSSE score using the final blend of Eq. 4 is 0.549, while our final submission score was 0.552 - only 0.003 units apart."},{"finding":"Post‑processing exponential smoothing improved validation and private leaderboard scores, and would have raised the Accuracy track rank by three positions if applied.","kind":"performance","quote":"We notice that, although this post-processing should be performed for both competition tracks, we were able to only use it for the Uncertainty track ... as it"},{"finding":"Gradient boosted trees and neural networks outperformed traditional statistical time‑series methods in the M5 competition.","kind":"predictive-accuracy","quote":"... was the superiority of Machine Learning methods, particularly the Gradient Boosted Trees and Neural Networks, against statistical time series methods."}],"reported_performance":null,"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":11,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/IoannisNasios/M5_Uncertainty_3rd_place","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T18:20:33Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}