LGB+: A Macroeconomic Forecasting Road Test

• URL: http://arxiv.org/abs/2605.09740v1
• Date: Sun, 10 May 2026 20:27:50 GMT
• Title: LGB+: A Macroeconomic Forecasting Road Test
• Abstract summary: This paper proposes LGB+, a boosting procedure operating on a more inclusive set of basis functions.<n>LGB+ evaluates a tree and a linear candidate at each step against out-of-bag data.<n>Because the prediction is the sum of a linear and a tree component, forecasts decompose into linear and nonlinear contributions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Needless to say, linear dynamics are pervasive in economic time series, particularly autoregressive ones. While gradient boosting with trees excels at capturing nonlinearities, it is inefficient in small samples when much of the predictive content is linear, expending splits to approximate relationships better captured by simple linear terms. This paper proposes LGB+, a boosting procedure operating on a more inclusive set of basis functions. The idea comes in two flavors. LGB+ evaluates a tree and a linear candidate at each step against out-of-bag data; only the winner advances. The simpler variant, LGB^A+, alternates on a fixed schedule: a block of tree updates, then a greedy linear correction, repeat. Both designs avoid ex ante commitments to any particular functional form or predictor selection. Because the prediction is the sum of a linear and a tree component, forecasts decompose natively into linear and nonlinear contributions, and so does permutation-based variable importance and historical proximity weights. In a quarterly U.S. macroeconomic forecasting exercise, LGB+ delivers strong gains for targets with pronounced autoregressive dynamics or mixed linear-nonlinear signals. Variables dominating the linear channel are those operating through autoregressive persistence or near-accounting relationships to the target (e.g., initial claims for unemployment and building permits for housing starts).

Related papers

• PRISM: Parallel Residual Iterative Sequence Model [52.26239951489612]
  We propose PRISM (Parallel Residual Iterative Sequence Model) to resolve this tension.<n>PRISM introduces a solver-inspired inductive bias that captures key structural properties of multi-step refinement in a parallelizable form.<n>We prove that this formulation achieves Rank-$L$ accumulation, structurally expanding the update manifold beyond the single-step Rank-$1$ bottleneck.
  arXiv  Detail & Related papers  (2026-02-11T12:39:41Z)
• Jacobian Aligned Random Forests [0.0]
  We present Jacobian-Aligned Random Forests (JARF) as an alternative to oblique forests for axis-aligned decision trees.<n>We show that JARF consistently improves axis-aligned forests and often matches or surpasses baselines while improving training time.<n>Our experimental results and theoretical analysis together indicate that supervised preconditioning can recover much of the accuracy of oblique forests while retaining the simplicity and robustness of axis-aligned trees.
  arXiv  Detail & Related papers  (2025-12-09T07:08:04Z)
• Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update [70.38810219913593]
  We study the generalized linear bandit (GLB) problem, a contextual multi-armed bandit framework that extends the classical linear model by incorporating a non-linear link function.<n>GLBs are widely applicable to real-world scenarios, but their non-linear nature introduces significant challenges in achieving both computational and statistical efficiency.<n>We propose a jointly efficient algorithm that attains a nearly optimal regret bound with $mathcalO(1)$ time and space complexities per round.
  arXiv  Detail & Related papers  (2025-07-16T02:24:21Z)
• Fidelity Isn't Accuracy: When Linearly Decodable Functions Fail to Match the Ground Truth [0.0]
  A linearity score $lambda(f)$ measures how well a regression network's output can be mimicked by a linear model.<n>This framework is evaluated on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2025-06-13T18:55:37Z)
• NIMO: a Nonlinear Interpretable MOdel [5.128077543874915]
  NIMO is a framework that combines inherent interpretability with the expressive power of neural networks.<n>We show that our model can provide faithful and intelligible feature effects while maintaining good predictive performance.
  arXiv  Detail & Related papers  (2025-06-05T14:02:55Z)
• Self-Boost via Optimal Retraining: An Analysis via Approximate Message Passing [58.52119063742121]
  Retraining a model using its own predictions together with the original, potentially noisy labels is a well-known strategy for improving the model performance.<n>This paper addresses the question of how to optimally combine the model's predictions and the provided labels.<n>Our main contribution is the derivation of the Bayes optimal aggregator function to combine the current model's predictions and the given labels.
  arXiv  Detail & Related papers  (2025-05-21T07:16:44Z)
• A Powerful Random Forest Featuring Linear Extensions (RaFFLE) [1.2233362977312945]
  RaFFLE is a novel framework that integrates PILOT trees as base learners within a random forest ensemble.<n> PILOT trees combine the computational efficiency of traditional decision trees with the flexibility of linear model trees.<n>RaFFLE proves to be a versatile tool for tackling a wide variety of regression problems.
  arXiv  Detail & Related papers  (2025-02-14T14:22:51Z)
• Joint Optimization of Piecewise Linear Ensembles [11.34717731050474]
  Tree ensembles achieve state-of-the-art performance on numerous prediction tasks. We propose $textbfJ$oint $textbfO$ptimization of $textbfL$inear $textbfEn$sembles (JOPLEn) JOPLEn allows several common penalties, including sparsity-promoting and subspace-norms, to be applied to nonlinear prediction.
  arXiv  Detail & Related papers  (2024-05-01T03:59:06Z)
• Bayesian Nonlinear Regression using Sums of Simple Functions [0.0]
  This paper proposes a new Bayesian machine learning model that can be applied to large datasets arising in macroeconomics. In simulations, we show that our approach produces accurate point and density forecasts.
  arXiv  Detail & Related papers  (2023-12-04T13:24:46Z)
• Fast Linear Model Trees by PILOT [0.0]
  Linear model trees are regression trees that incorporate linear models in the leaf nodes. Most existing methods for fitting linear model trees are time consuming and therefore not scalable to large data sets. We introduce PILOT, a new algorithm for linear model trees that is fast, regularized, stable and interpretable.
  arXiv  Detail & Related papers  (2023-02-08T08:11:10Z)
• Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes [80.89852729380425]
  We propose the first computationally efficient algorithm that achieves the nearly minimax optimal regret $tilde O(dsqrtH3K)$. Our work provides a complete answer to optimal RL with linear MDPs, and the developed algorithm and theoretical tools may be of independent interest.
  arXiv  Detail & Related papers  (2022-12-12T18:58:59Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)
• Understanding self-supervised Learning Dynamics without Contrastive Pairs [72.1743263777693]
  Contrastive approaches to self-supervised learning (SSL) learn representations by minimizing the distance between two augmented views of the same data point. BYOL and SimSiam, show remarkable performance it without negative pairs. We study the nonlinear learning dynamics of non-contrastive SSL in simple linear networks.
  arXiv  Detail & Related papers  (2021-02-12T22:57:28Z)
• LQF: Linear Quadratic Fine-Tuning [114.3840147070712]
  We present the first method for linearizing a pre-trained model that achieves comparable performance to non-linear fine-tuning. LQF consists of simple modifications to the architecture, loss function and optimization typically used for classification.
  arXiv  Detail & Related papers  (2020-12-21T06:40:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.