An Efficient and Generalizable Symbolic Regression Method for Time Series Analysis
Yi Xie, Tianyu Qiu, Yun Xiong, Xiuqi Huang, Xiaofeng Gao, Chao Chen

TL;DR
This paper introduces NEMoTS, a neural-enhanced Monte Carlo tree search method for symbolic regression in time series analysis, improving interpretability, efficiency, and generalizability over existing techniques.
Contribution
The paper proposes NEMoTS, a novel approach combining neural networks and MCTS to enhance symbolic regression for time series, addressing computational efficiency and applicability to diverse real-world data.
Findings
NEMoTS outperforms existing methods in accuracy and efficiency.
It demonstrates superior interpretability and reliability on real-world datasets.
The approach scales well to large-scale time series data.
Abstract
Time series analysis and prediction methods currently excel in quantitative analysis, offering accurate future predictions and diverse statistical indicators, but generally falling short in elucidating the underlying evolution patterns of time series. To gain a more comprehensive understanding and provide insightful explanations, we utilize symbolic regression techniques to derive explicit expressions for the non-linear dynamics in the evolution of time series variables. However, these techniques face challenges in computational efficiency and generalizability across diverse real-world time series data. To overcome these challenges, we propose \textbf{N}eural-\textbf{E}nhanced \textbf{Mo}nte-Carlo \textbf{T}ree \textbf{S}earch (NEMoTS) for time series. NEMoTS leverages the exploration-exploitation balance of Monte-Carlo Tree Search (MCTS), significantly reducing the search space in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsMonte-Carlo Tree Search
