Chaos Search in Fourier Amplitude Sensitivity Test
Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. In this paper, we investigate the Fourier Amplitude Sensitivity Test (FAST) as...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Utara Malaysia Press
2012
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/30416/1/JICT%2011%2000%202012%201-16.pdf https://repo.uum.edu.my/id/eprint/30416/ https://www.e-journal.uum.edu.my/index.php/jict/article/view/8121 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. In this paper, we investigate the Fourier Amplitude Sensitivity Test (FAST) as an example of a global sensitivity analysis tool for complex, non-linear dynamical systems. FAST was originally developed based on the Fourier series expansion of a model output and on the assumption that samples of model inputs are uniformly distributed in a high dimensional parameter space. In order to compute sensitivity indices, the parameter space needs to be searched utilizing an appropriate (space-filling) search curve. In FAST, search curves are defined through learning functions, selection of which will heavily affect the global searching capacity and computational efficiency. This paper explores the characterization of learning functions involved in FAST and derives the underlying dynamical relationships with chaos search, which can provide new learning algorithms. This contribution has proven the general link that exists between chaos search and FAST, which helps us exploit the ergodicity of chaos search in AI applications. |
|---|