Global Optimization Networks
원문 초록
We consider the problem of estimating a good maximizer of a black-box function given noisy examples. To solve such problems, we propose to fit a new type of function which we call a global optimization network (GON), defined as any composition of an invertible function and a unimodal function, whose unique global maximizer can be inferred in $\mathcal{O}(D)$ time. In this paper, we show how to construct invertible and unimodal functions by using linear inequality constraints on lattice models. We also extend to \emph{conditional} GONs that find a global maximizer conditioned on specified inputs of other dimensions. Experiments show the GON maximizers are statistically significantly better predictions than those produced by convex fits, GPR, or DNNs, and are more reasonable predictions for real-world problems.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Fast ground penetrating radar dual-parameter full waveform inversion method accelerated by hybrid compilation of CUDA kernel function and PyTorch
NeRF-based CBCT Reconstruction needs Normalization and Initialization
Trustworthy Prediction with Gaussian Process Knowledge Scores
Overcoming Overfitting in Reinforcement Learning via Gaussian Process Diffusion Policy
A Hybrid GA LLM Framework for Structured Task Optimization
Fast Derivative Valuation from Volatility Surfaces using Machine Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.