AI & ML
Neural Realized Measures: Forecast-Supervised Intraday Aggregation for Volatility Forecasting
arXiv stat.ML0 views
arXiv:2611.07287v1 Announce Type: cross Abstract: High-frequency volatility forecasting typically separates measurement from prediction: intraday observations are first compressed into a daily realized measure using a fixed aggregation rule, and the resulting statistic is then passed to a forecasting model. This conventional pipeline therefore treats measure construction as forecast-agnostic preprocessing. We ask whether the aggregation stage itself can instead be learned from the downstream forecasting objective while preserving the statistical structure of established realized measures. We propose Neural Realized Measures (NRM), a primitive-preserving, forecast-supervised aggregation framework that retains the original measure-specific intraday contributions but replaces uniform aggregation with positive, mean-normalized context-dependent weights. Uniform weights exactly recover the corresponding raw realized measure (RRM), so the classical construction is nested as a special case. Because NRM remains an explicit weighted sum of established primitive contributions, it also retains direct bar-level attribution. Across SF, HAR, and MIDAS forecasting specifications, NRM is evaluated against corresponding RRM specifications under controlled comparisons. In Heston simulations, NRM reduces RMSE for both contemporaneous and next-day latent integrated variance across all evaluated primitive--regime combinations. On six cryptocurrencies using five-minute data, NRM improves QLIKE in all 54 paired out-of-sample comparisons, with mean gains of 7.23\%, 8.15\%, and 9.22\% under SF, HAR, and MIDAS, respectively. Validation-selected NRM specifications also achieve the lowest mean QLIKE across the six assets among the evaluated approaches. Ablation and SHAP analyses reveal systematic time-of-day and nonlinear local-context effects in the learned allocation.
Source:https://arxiv.org/abs/2611.07287PreviousSatisficing as competitive Bayesian weighting: a minimal model of goal-directed choice under an unattained targetNextLast-Iterate Convergence of Stochastic Gradient Methods for Unbounded Problems
Related posts
From Reference Image to 3D Asset: A Practical Workflow for Developers
0dev.to
Cut one conflicting rule before you trim anything else
0dev.to
Eine App darf deinen Kalender lesen und deine Mails zusammenfassen – und trotzde
0dev.to

Hugging Face’s 70k-Word MoE Handbook After 800k GPU Hours — Why Sparsity Still Wins for Local Real-Time Tools
0dev.to
Talk to Your Coding Agent: What Cursor's Realtime Voice Chat Actually Changes
0dev.to
How to add a Request a Quote button to Wix Stores
0dev.to Tutorial