.png){kind=icon}
.png){kind=icon}
Return
Distributed randomized model structure selection for NARX models
.png){kind=icon}
PRE
AI
DOI：10.1002/acs.2803.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Model structure selection (MSS) is a critical problem in the nonlinear identification field. In the framework of polynomial nonlinear autoregressive [moving average] models with exogenous input variables, it is formulated as the combinatorial problem of finding the subset of regressors that yields optimal model accuracy. Increasing the set of potential model terms improves the flexibility of the model but results in a computational overload and may even jeopardize the ability of the MSS algorithm to find the optimal model. In this work, a distributed optimization scheme is developed to tackle the MSS task for large-sized candidate regressor sets. The regressor set is split among a group of independent processors, and each of them executes an MSS routine on its local subset. Then, the processors exchange information regarding the selected models, and the corresponding regressors are distributed among all the units for a new MSS round. The procedure is repeated until convergence of all processors to the same solution. Besides a drastic reduction in the computational time, thanks to the inherent parallelizability of the algorithm execution, the proposed distributed optimization scheme can also be beneficial in terms of model accuracy, due to a more efficient exploration of the search space.
Keywords:
distributed optimization
model structure selection
nonlinear model identification
parallel processing
polynomial NARX models
randomized algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
2.6K
Citations:
3.6K