國立虎尾科技大學 |

Monte Carlo Tree Methods for Nonlinear Optimization.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Monte Carlo Tree Methods for Nonlinear Optimization./
作者:	Zhai, Yaoguang.
面頁冊數:	1 online resource (176 pages)
附註:	Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
Contained By:	Dissertations Abstracts International85-10B.
標題:	Physical chemistry. -
電子資源:	click for full text (PQDT)
ISBN:	9798382303819

Monte Carlo Tree Methods for Nonlinear Optimization.
Zhai, Yaoguang.

Monte Carlo Tree Methods for Nonlinear Optimization. - 1 online resource (176 pages)

Source: Dissertations Abstracts International, Volume: 85-10, Section: B.

Thesis (Ph.D.)--University of California, San Diego, 2024.

Includes bibliographical references

As highly nonlinear continuous functions become the prevalent model of computation, NP-hard optimization problems over the continuous domain pose significant challenges to AI/ML algorithms and systems, especially in terms of their robustness and safety. The key to nonlinear optimization is to efficiently search through input regions with potentially widely varying numerical properties to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods have recently been introduced to improve global optimization by computing better partitioning of the search space that balances exploration and exploitation.This dissertation investigates the application of Monte Carlo tree methods for nonlinear optimization (encompassing black-box and non-convex optimization) to identify the global optimum, and the crafting of training datasets designed to boost transferability and reduce dataset size in computational molecular dynamics. To tackle global optimization challenges, the study integrates sampling strategies with MCTS frameworks, employing diverse local optimization techniques to highlight promising samples. These techniques span stochastic search, Gaussian Processes regression, numerical overapproximation of the objective function, and analysis of first- and second-order information. In the realm of training dataset development, computational simulations of water serve as a practical case study. An active learning framework is introduced to efficiently condense the size of the training dataset while preserving its quality and comprehensiveness. The research further explores model transferability by assessing various subsets for training set inclusion to the simulation of water molecules, thereby uncovering the model's adaptability challenges across different scenarios.The findings affirm that Monte Carlo tree methods provide cost-effective strategies for managing the complexities inherent in state space exploration. By applying these methods to a range of application areas, the dissertation underscores the robustness and utility of sampling techniques in advancing machine learning research.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2024

Mode of access: World Wide Web

ISBN: 9798382303819Subjects--Topical Terms:

1148725
Physical chemistry.
Subjects--Index Terms:

Global optimizationIndex Terms--Genre/Form:

554714
Electronic books.

Monte Carlo Tree Methods for Nonlinear Optimization.
LDR:03543ntm a22003977 4500 001 1146263
005 20240812064355.5
006 m o d
007 cr bn ---uuuuu
008 250605s2024 xx obm 000 0 eng d
020 $a 9798382303819
035 $a (MiAaPQ)AAI30994656
035 $a AAI30994656
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Zhai, Yaoguang. $3 1471624
245 1 0 $a Monte Carlo Tree Methods for Nonlinear Optimization.
264 0 $c 2024
300 $a 1 online resource (176 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 85-10, Section: B.
500 $a Advisor: Gao, Sicun;Paesani, Francesco.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2024.
504 $a Includes bibliographical references
520 $a As highly nonlinear continuous functions become the prevalent model of computation, NP-hard optimization problems over the continuous domain pose significant challenges to AI/ML algorithms and systems, especially in terms of their robustness and safety. The key to nonlinear optimization is to efficiently search through input regions with potentially widely varying numerical properties to achieve low-regret descent and fast progress toward the optima. Monte Carlo Tree Search (MCTS) methods have recently been introduced to improve global optimization by computing better partitioning of the search space that balances exploration and exploitation.This dissertation investigates the application of Monte Carlo tree methods for nonlinear optimization (encompassing black-box and non-convex optimization) to identify the global optimum, and the crafting of training datasets designed to boost transferability and reduce dataset size in computational molecular dynamics. To tackle global optimization challenges, the study integrates sampling strategies with MCTS frameworks, employing diverse local optimization techniques to highlight promising samples. These techniques span stochastic search, Gaussian Processes regression, numerical overapproximation of the objective function, and analysis of first- and second-order information. In the realm of training dataset development, computational simulations of water serve as a practical case study. An active learning framework is introduced to efficiently condense the size of the training dataset while preserving its quality and comprehensiveness. The research further explores model transferability by assessing various subsets for training set inclusion to the simulation of water molecules, thereby uncovering the model's adaptability challenges across different scenarios.The findings affirm that Monte Carlo tree methods provide cost-effective strategies for managing the complexities inherent in state space exploration. By applying these methods to a range of application areas, the dissertation underscores the robustness and utility of sampling techniques in advancing machine learning research.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2024
538 $a Mode of access: World Wide Web
650 4 $a Physical chemistry. $3 1148725
650 4 $a Computational chemistry. $3 1190332
650 4 $a Computer science. $3 573171
653 $a Global optimization
653 $a Machine learning
653 $a Monte Carlo Tree Search
653 $a Computational simulations
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0219
690 $a 0800
690 $a 0494
710 2 $a University of California, San Diego. $b Computer Science and Engineering. $3 1189479
710 2 $a ProQuest Information and Learning Co. $3 1178819
773 0 $t Dissertations Abstracts International $g 85-10B.
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=30994656 $z click for full text (PQDT)