Project Grant 2327013
- This Project Grant award from the National Science Foundation (NSF) Division of Information and Intelligent Systems supports research to significantly increase the scalability of algorithms for solving large-scale, multi-step, imperfect-information strategic interactions. Specifically, the $854,896 award to Carnegie Mellon University (CMU) from August 1, 2023 to July 31, 2026 will fund the design, implementation, and testing of novel techniques in three main areas: Scalable subtree solving...
- This National Science Foundation (NSF) Office of Advanced Cyberinfrastructure grant, awarded under the Computer and Information Science and Engineering program (CFDA 47.070), provides $150,000 from October 1, 2023 to September 30, 2026 to the University of California, Los Angeles (UCLA) to conduct collaborative research on developing efficient and provably effective exploration strategies for sequential decision-making problems in artificial intelligence applications. The key products and...
- This Project Grant award from the National Science Foundation (NSF) Office of Advanced Cyberinfrastructure under the CFDA program "Computer and Information Science and Engineering" provides $150,000 to Duke University to conduct collaborative research on developing efficient and provable algorithms for approximate sampling-based exploration strategies in sequential decision-making problems. The key objectives are to unify exploration strategies across different applications like...
- This $398,990 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program supports research at the University of California, Irvine (UCI) to explore fundamental principles underlying how groups of intelligent agents interact and learn within shared environments. The research project aims to develop efficient algorithms and theoretical frameworks for analyzing learning processes in multi-agent systems, with a focus on...
- This National Science Foundation project grant of $487,371 will support research at the University of California, Santa Barbara from May 2022 through April 2025 under the Computer and Information Science and Engineering program. The grant will fund the development of new techniques for proving optimal convergence rates of Markov chain Monte Carlo algorithms. Specifically, the researchers will strengthen and extend the technique of spectral independence to establish optimal mixing time bounds for...
- This Project Grant award from the National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) Program (CFDA 47.070) provides $300,000 to the Regents of the University of California at Riverside to conduct research on adapting foundation models for multimodal sequential decision-making. The project aims to develop novel techniques and methods to leverage foundation models, which are complex neural networks trained on large datasets, to improve the performance of...
- This National Science Foundation (NSF) Project Grant, awarded under the Computer and Information Science and Engineering program (CFDA 47.070), will fund a collaborative research project to study human planning and decision-making through the analysis of a massive dataset of chess games. The $562,614 award to New York University, with a project period from September 1, 2023 to August 31, 2026, will leverage artificial intelligence techniques to gain insights into how individuals form complex...
- This Project Grant from the National Science Foundation's $250,000 Computer and Information Science and Engineering program will support research at Purdue University from March 2022 to February 2025. The research aims to develop novel strategies for sequential decision-making under uncertainty with submodular rewards. Specifically, the university researchers will create provably good algorithms for multi-armed bandit problems involving combinatorial action spaces and submodular rewards, without...
- The National Science Foundation awarded $175,000 under the Computer and Information Science and Engineering federal grant program (CFDA 47.070) to the Regents of the University of Michigan for a two-year project grant titled "Analysis and Applications of Multi-Level Games." The project aims to advance empirical game-theoretic analysis methodology to incorporate features of underlying game tree models into empirical game models. Specifically, the university researchers will adapt...
- This $600,000 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research at North Carolina State University to explore advanced sampling and optimization techniques for decentralized machine learning. The key objectives are to: Enhance the sampling efficiency of interacting nonlinear Markov chains through adaptive spatio-temporal repellency among multiple "self-repellent random walks",...
CIF: SMALL: THEORY AND ALGORITHMS FOR EFFICIENT AND LARGE-SCALE MONTE CARLO TREE SEARCH -MONTE CARLO TREE SEARCH (MCTS) IS A VERSATILE ONLINE PLANNING METHODOLOGY FOR SEQUENTIAL DECISION-MAKING PROBLEMS SUCH AS REINFORCEMENT LEARNING THAT HAS RECENTLY SHOWN EMPIRICAL SUCCESS IN REAL-WORLD PROBLEMS INCLUDING GAMES, CHEMICAL SYNTHESIS, MATERIALS/DRUG DISCOVERY, AND NUMERICAL ALGORITHMS. HOWEVER, THERE IS A HUGE GAP BETWEEN EXISTING MCTS THEORY AND PRACTICE BECAUSE (I) THE DE FACTO STANDARD MCTS ALGORITHM CALLED UPPER CONFIDENCE BOUND FOR TREES (UCT) IS KNOWN TO BE PROVABLY SUBOPTIMAL, (II) EXISTING THEORIES ARE LIMITED TO ASYMPTOTIC OR WORST-CASE ANALYSES, AND (III) THE OPTIMAL PERFORMANCE RATES OF MCTS ALGORITHMS ARE NOT KNOWN. THIS IMPLIES THAT THE STATE-OF-THE-ART MCTS METHODS MIGHT STILL BE FAR FROM REALIZING THEIR FULL POTENTIAL, AND FURTHER DEVELOPMENTS ARE REQUIRED TO PREPARE FOR THE NEXT GENERATIONS OF MUCH LARGER AND MORE COMPLEX DECISION-MAKING PROBLEMS. THIS PROJECT FOCUSES ON BRIDGING THE GAP BETWEEN THEORY AND PRACTICE IN MCTS METHODOLOGY BY DEVELOPING NOVEL MCTS ALGORITHMS WITH STRONG MATHEMATICAL PERFORMANCE GUARANTEES, ESTABLISHING THE OPTIMAL PERFORMANCE RATES, AND EVALUATING THEM IN REAL-WORLD APPLICATIONS. THIS PROJECT INTEGRATES EDUCATION INTO RESEARCH BY DEVELOPING A COURSE MODULE AND BUILDING INTERDISCIPLINARY TEAMS OF UNDERGRADUATES WHO WILL WORK CLOSELY WITH MATERIAL SCIENTISTS TO EVALUATE THE DEVELOPED ALGORITHMS ON MATERIALS DISCOVERY TASKS. THE PROJECT CONSISTS OF THREE MAIN DIRECTIONS: THE FOUNDATIONS OF MCTS, LARGE-SCALE MCTS, AND THE DESIGN OF EXPERIMENTS FOR MCTS. EACH DIRECTION CONTAINS SEVERAL MAIN OBJECTIVES: (I) FOR THE FOUNDATIONS OF MCTS, THE FOCUS IS TO IMPROVE MAXIMUM MEAN ESTIMATOR AND LEVERAGE TOOLS FROM A RELATED PROBLEM CALLED PURE EXPLORATION TO DEVELOP ALGORITHMS WITH STRONG GUARANTEES AND STUDY INFORMATION-THEORETIC LIMITS OF MCTS; (II) FOR THE LARGE-SCALE MCTS, THE FOCUS IS TO ANALYZE AND IMPROVE EXISTING HEURISTICS FOR LARGE-SCALE MCTS PROBLEMS SUCH AS PROGRESSIVE WIDENING, INCREMENTAL DEPTH EXPANSION, AND FUNCTION APPROXIMATIONS; (III) FOR THE DESIGN OF EXPERIMENTS FOR MCTS, THE FOCUS IS TO DEVELOP EXPERIMENTAL DESIGN METHODS TO EFFICIENTLY TRAIN FUNCTION APPROXIMATIONS FOR MCTS WITH A SMALL NUMBER OF SAMPLES. IN ADDITION TO THEORETICAL AND ALGORITHMIC DEVELOPMENTS, THE PROJECT ALSO AIMS AT IMPLEMENTING ALL ALGORITHMS DEVELOPED AS OPEN-SOURCE SOFTWARE, EVALUATING THEM USING BENCHMARK DATASETS, AND APPLYING THEM TO MATERIAL SCIENCE TASKS VIA THE INTERDISCIPLINARY TEAMS OF UNDERGRADUATES AS PART OF THE EDUCATIONAL AIM. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.
Mod # | Description | ReasonForModification | Federal Obligation | Date |
|---|---|---|---|---|
| Not listed | $0 | 1/5/26 | ||
| Not listed | $599.2k | 11/28/23 |