SearcharxivSearch

arXiv · 2411.09452

Sparse Interval-valued Time Series Modeling with Machine Learning

Abstract

By treating intervals as inseparable sets, this paper proposes sparse machine learning regressions for high-dimensional interval-valued time series. With LASSO or adaptive LASSO techniques, we develop a penalized minimum distance estimation, which covers point-based estimators are special cases. We establish the consistency and oracle properties of the proposed penalized estimator, regardless of whether the number of predictors is diverging with the sample size. Monte Carlo simulations demonstrate the favorable finite sample properties of the proposed estimation. Empirical applications to interval-valued crude oil price forecasting and sparse index-tracking portfolio construction illustrate the robustness and effectiveness of our method against competing approaches, including random forest and multilayer perceptron for interval-valued data. Our findings highlight the potential of machine learning techniques in interval-valued time series analysis, offering new insights for financial forecasting and portfolio management.

Explore related subjects

Keep this discovery

BibTeXRIS

Haowen Bao, Yongmiao Hong, Yuying Sun, Shouyang Wang. 2024-11-14. Sparse Interval-valued Time Series Modeling with Machine Learning. https://arxiv.org/abs/2411.09452

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Identification in Linear Quantile Panel Models

This paper studies identification in linear quantile panel models with unrestricted individual heterogeneity when the number of time periods is fixed and small. We impose strict exogeneity, whereby the conditional quantile restriction holds given the individual's complete regressor history and latent individual effect, but otherwise allow the disturbances to be arbitrarily dependent over time.

econ.EM

Experimental Design for Policy Choice

We show how to optimally design experiments when the resulting data will be used to choose a welfare-maximizing policy subject to constraints. A decision maker seeks to maximize Bayes expected welfare by choosing a policy whose effects depend on an unknown finite-dimensional parameter. The decision maker has access to a first wave of experimental data with a fixed design but may choose the design of a second wave that will be collected before choosing the policy. The resulting experimental design--policy choice problem is a very high-dimensional dynamic program that is generally intractable in finite samples. We propose a tractable approximation based on the limit experiment and show it is asymptotically optimal using a new asymptotic representation theorem for adaptive experiments with continuous treatments. We apply the method to a conditional cash transfer experiment and demonstrate the potential for large gains from tailoring the experiment to the policy choice.

econ.EM

Designing Spatial Treatments

Spatial treatments are interventions assigned to locations potentially distinct from those of the responding units. We study their optimal design under a general model in which a unit's response diminishes with distance to a treated site. Our estimand of interest is an ``uncontaminated'' effect equal to the average impact of a single intervention site over all hypothetical sites. We propose a novel design based on a Mat\'{e}rn point process which separates treatments by a distance of at least $r$. A larger choice of $r$ reduces bias by separating interventions but increases variance by reducing their numerosity. We choose $r$ to maximize the rate of convergence of a Horvitz-Thompson estimator and prove that this is minimax rate-optimal. We provide weak conditions under which the estimator is asymptotically normal and propose a variance estimator.

econ.EM