System design tools are often only available as input-output blackboxes: for a given design as input they compute an output representing system behavior. Blackboxes are intended to be run in the forward direction. This paper presents a new method of solving the inverse design problem namely, given requirements or constraints on output, find an input that also optimizes an objective function. This problem is challenging for several reasons. First, blackboxes are not designed to be run in reverse. Second, inputs and outputs can be discrete and continuous. Third, finding designs concurrently satisfying a set of requirements is hard because designs satisfying individual requirements may conflict with each other. Fourth, blackbox evaluations can be expensive. Finally, blackboxes can sometimes fail to produce an output. This paper presents CNMA, a new method of solving the inverse problem that overcomes these challenges. CNMA tries to sample only the part of the design space relevant to solving the problem, leveraging the power of neural networks, Mixed Integer Linear Programs, and a new learning-from-failure feedback loop. The paper also presents a parallel version of CNMA that improves the efficiency and quality of solutions over the sequential version, and tries to steer it away from local optima. CNMA's performance is evaluated against conventional optimization methods for seven nonlinear design problems of 8 (two problems), 10, 15, 36 and 60 real-valued dimensions and one with 186 binary dimensions. Conventional methods evaluated are off-the-shelf implementations of Bayesian Optimization with Gaussian Processes, Nelder Mead and Random Search. The first two do not solve problems that are high-dimensional, have discrete and continuous variables or whose blackboxes can fail to return values. CNMA solves all problems, and surpasses the performance of conventional methods by up to 87%.
FAST-Q: Fast-track Exploration with Adversarially Balanced State Representations for Counterfactual Action Estimation in Offline Reinforcement Learning
LNUCB-TA: Linear-nonlinear Hybrid Bandit Learning with Temporal Attention
Department of Industrial & Management Systems Engineering West Virginia University(西弗吉尼亚大学工业与管理系统工程系);Department of Electrical Engineering Iran University of Science and Technology(伊朗科学技术大学电气工程系);School of Mathematical & Data Sciences West Virginia University(西弗吉尼亚大学数学与数据科学学院)
Fast Peer Adaptation with Context-aware Exploration
Academy for Advanced Interdisciplinary Studies, Peking University(北京大学前沿交叉学科研究院);Center on Frontiers of Computing Studies, School of Computer Science, Peking University(北京大学计算机学院计算前沿研究中心);School of Intelligence Science and Technology, Peking University(北京大学智能科学与技术学院);Inst. for Artificial Intelligence, Peking University(北京大学人工智能研究院);Nat’l Key Laboratory of General Artificial Intelligence, BIGAI&PKU(通用人工智能国家重点实验室(北京通用人工智能研究院与北京大学联合));Nat’l Eng. Research Center of Visual Technology, Peking University(北京大学视觉技术国家工程研究中心)
HSE University(高等经济大学);Artificial Intelligence Research Institute(人工智能研究院);Duisburg-Essen University(杜伊斯堡-埃森大学);Google DeepMind(谷歌DeepMind);École Polytechnique(巴黎综合理工学院);Mohamed Bin Zayed University of AI(穆罕默德·本·扎耶德人工智能大学);IDEMIA(艾德米亚);ENS Lyon(里昂高等师范学院)
Max Planck Institute for Human Cognitive and Brain Sciences(马克斯·普朗克人类认知与脑科学研究所);Leipzig Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)(莱比锡可扩展数据与人工智能研究中心);Dresden/Leipzig(德累斯顿/莱比锡)