https://github.com/uquh/tsroots
공식 코드Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Expensive black-box functions are a common problem in many disciplines, including tuning the parameters of machine learning algorithms, robotics, and other engineering design problems. Bayesian Optimisation is a principled and efficient technique for the global optimisation of these functions. The idea behind Bayesian Optimisation is to place a prior distribution over the target function and then update that prior with a set of “true” observations of the target function by expensively evaluating it in order to produce a posterior predictive distribution. The posterior then informs where to make the next observation of the target function through the use of an acquisition function, which balances the exploitation of regions known to have good performance with the exploration of regions where there is little information about the function’s response.
Source: A Bayesian Approach for the Robust Optimisation of Expensive-to-Evaluate Functions
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Optimizing Posterior Samples for Bayesian Optimization via Rootfinding
Constrained Bayesian Optimization for Automatic Underwater Vehicle Hull Design
Quality-Weighted Vendi Scores And Their Application To Diverse Experimental Design
Unsupervised Sampling Promoting for Stochastic Human Trajectory Prediction
Sample-efficient Multi-objective Molecular Optimization with GFlowNets
Demystifying the Adversarial Robustness of Random Transformation Defenses
This Too Shall Pass: Removing Stale Observations in Dynamic Bayesian Optimization
Black-Box Optimization with Implicit Constraints for Public Policy
Towards Autonomous Cybersecurity: An Intelligent AutoML Framework for Autonomous Intrusion Detection
ProBO: Versatile Bayesian Optimization Using Any Probabilistic Programming Language
How Useful is Intermittent, Asynchronous Expert Feedback for Bayesian Optimization?
Promises and Pitfalls of the Linearized Laplace in Bayesian Optimization
Deep Boltzmann Machines in Estimation of Distribution Algorithms for Combinatorial Optimization
The Parallel Knowledge Gradient Method for Batch Bayesian Optimization
Multiple-Source Localization from a Single-Snapshot Observation Using Graph Bayesian Optimization
Pareto Set Learning for Expensive Multi-Objective Optimization
Tuning-Free Structured Sparse PCA via Deep Unfolding Networks
Deep Neural Network Hyperparameter Optimization with Orthogonal Array Tuning
Adversarial Attacks on Graph Classification via Bayesian Optimisation
Use Your INSTINCT: INSTruction optimization for LLMs usIng Neural bandits Coupled with Transformers
Attacking Vision-based Perception in End-to-End Autonomous Driving Models
Standard Gaussian Process Can Be Excellent for High-Dimensional Bayesian Optimization
Efficient Black-box Adversarial Attacks via Bayesian Optimization Guided by a Function Prior
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.