Exploiting Active Subspaces in Global Optimization: How Complex is your Problem?
When applying optimization method to a real-world problem, the possession of prior knowledge and preliminary analysis on the landscape of a global optimization problem can give us an insight into the complexity of the problem. This knowledge can better inform us in deciding what optimization method should be used to tackle the problem. However, this analysis becomes problematic when the dimensionality of the problem is high. This paper presents a framework to take a deeper look at the global optimization problem to be tackled: by analyzing the low-dimensional representation of the problem through discovering the active subspaces of the given problem. The virtue of this is that the problem's complexity can be visualized in a one or two-dimensional plot, thus allow one to get a better grip about the problem's difficulty. One could then have a better idea regarding the complexity of their problem to determine the choice of global optimizer or what surrogate-model type to be used. Furthermore, we also demonstrate how the active subspaces can be used to perform design exploration and analysis.
Code (0)
등록된 구현이 없습니다.
Tasks
global-optimizationSimilar Papers 제목 키워드 기반
Domain Knowledge Guided Bayesian Optimization For Autonomous Alignment Of Complex Scientific Instruments
Bayesian Optimization (BO) is a powerful tool for optimizing complex non-linear systems. However, its performance degrades in high-dimensional problems with tightly coupled parameters and highly asymmetric objective land…
Identifying Policy Gradient Subspaces
Policy gradient methods hold great potential for solving complex continuous control tasks. Still, their training efficiency can be improved by exploiting structure within the optimization problem. Recent work indicates t…
continuous-controlContinuous ControlPolicy Gradient Methodsreinforcement-learning+1From Complexity to Simplicity: Adaptive ES-Active Subspaces for Blackbox Optimization
We present a new algorithm ASEBO for optimizing high-dimensional blackbox functions. ASEBO adapts to the geometry of the function and learns optimal sets of sensing directions, which are used to probe it, on-the-fly. It …
compressed sensingMulti-Armed BanditsReinforcement LearningA local approach to parameter space reduction for regression and classification tasks
Parameter space reduction has been proved to be a crucial tool to speed-up the execution of many numerical tasks such as optimization, inverse problems, sensitivity analysis, and surrogate models' design, especially when…
ClusteringDimensionality ReductionregressionLow-Complexity Joint Active and Passive Beamforming Design for IRS-Assisted MIMO
In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiple input multiple output (MIMO) communication and we optimize the joint active and passive beamforming by exploiting the geometrical stru…