Execution Time Optimization Through Feature and Temporal Reduction in Asset Pricing

ABSTRACT High‐dimensional financial machine learning (ML) pipelines are computational workloads as much as predictive models: their practical value depends on runtime, memory footprint, scalability, and the ability to retrain under resource constraints. This paper treats empirical asset pricing as a demanding real‐world workload and proposes Cost‐Aware Adaptive Optimization , using XGBoost (extreme gradient boosting), as a systems‐aware framework to improve the computational efficiency of gradient‐boosted tree pipelines while preserving application‐level predictive utility. The framework uses computational feedback; optimization is driven by training time, prediction time, memory footprint, feature dimensionality, temporal training‐window depth, model complexity, and marginal utility per unit of computation. We first profile 10 ML algorithms in a controlled high‐performance computing setting and decompose execution cost into training and prediction components. XGBoost is then selected as the optimization target because it offers a strong cost–utility baseline on the asset‐pricing workload. The proposed framework adaptively controls feature‐dimensionality and temporal‐depth choices, evaluates memory‐ and execution‐aware trade‐offs, and analyzes scalability through runtime growth, parallel speed‐up, and parallel efficiency. Application‐level utility measures, including out‐of‐sample R 2 , mean squared error (MSE), and the Sharpe ratio of decile‐sorted long–short portfolios, are retained as application‐level validation metrics rather than as the sole objective. The results show that meaningful computational savings can be obtained by treating dimensionality, temporal depth, and model complexity as controllable workload variables. The study therefore contributes a computational feedback‐driven optimization framework for scalable financial ML execution, framing workload adaptation and configuration selection as runtime‐, memory‐, and utility‐aware system problems.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2026-07-27
DOI
https://doi.org/10.1002/cpe.70881
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Execution Time Optimization Through Feature and Temporal Reduction in Asset Pricing

Evrim Güler, Ümit Demirbaga, Yue Xu
Concurrency and Computation Practice and Experience
Cloud Computing and Resource Management
article

Execution Time Optimization Through Feature and Temporal Reduction in Asset Pricing

Evrim Güler, Ümit Demirbaga, Yue Xu
article en

Abstract

ABSTRACT High‐dimensional financial machine learning (ML) pipelines are computational workloads as much as predictive models: their practical value depends on runtime, memory footprint, scalability, and the ability to retrain under resource constraints. This paper treats empirical asset pricing as a demanding real‐world workload and proposes Cost‐Aware Adaptive Optimization , using XGBoost (extreme gradient boosting), as a systems‐aware framework to improve the computational efficiency of gradient‐boosted tree pipelines while preserving application‐level predictive utility. The framework uses computational feedback; optimization is driven by training time, prediction time, memory footprint, feature dimensionality, temporal training‐window depth, model complexity, and marginal utility per unit of computation. We first profile 10 ML algorithms in a controlled high‐performance computing setting and decompose execution cost into training and prediction components. XGBoost is then selected as the optimization target because it offers a strong cost–utility baseline on the asset‐pricing workload. The proposed framework adaptively controls feature‐dimensionality and temporal‐depth choices, evaluates memory‐ and execution‐aware trade‐offs, and analyzes scalability through runtime growth, parallel speed‐up, and parallel efficiency. Application‐level utility measures, including out‐of‐sample R 2 , mean squared error (MSE), and the Sharpe ratio of decile‐sorted long–short portfolios, are retained as application‐level validation metrics rather than as the sole objective. The results show that meaningful computational savings can be obtained by treating dimensionality, temporal depth, and model complexity as controllable workload variables. The study therefore contributes a computational feedback‐driven optimization framework for scalable financial ML execution, framing workload adaptation and configuration selection as runtime‐, memory‐, and utility‐aware system problems.

Concurrency and Computation Practice and ExperienceVol. 38(15)
Ankara University (TR), Durham University (GB), Bartin University (TR)
Openalex Percentile: Top 3%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.