English
Related papers

Related papers: How Sequential Algorithm Portfolios can benefit Bl…

200 papers

Compared with the fixed-run designs, the sequential adaptive designs (SAD) are thought to be more efficient and effective. Efficient global optimization (EGO) is one of the most popular SAD methods for expensive black-box optimization…

Machine Learning · Computer Science 2020-10-22 Jianhui Ning , Yao Xiao , Zikang Xiong

We formulate selecting the best optimizing system (SBOS) problems and provide solutions for those problems. In an SBOS problem, a finite number of systems are contenders. Inside each system, a continuous decision variable affects the…

Methodology · Statistics 2025-11-04 Nian Si , Yifu Tang , Zeyu Zheng

Many challenges in science and engineering, such as drug discovery and communication network design, involve optimizing complex and expensive black-box functions across vast search spaces. Thus, it is essential to leverage existing data to…

Machine Learning · Computer Science 2024-12-04 Juncheng Dong , Zihao Wu , Hamid Jafarkhani , Ali Pezeshki , Vahid Tarokh

Exactly solving multi-objective integer programming (MOIP) problems is often a very time consuming process, especially for large and complex problems. Parallel computing has the potential to significantly reduce the time taken to solve such…

Optimization and Control · Mathematics 2018-11-02 William Pettersson , Melih Ozlen

A constant rebalanced portfolio is an asset allocation algorithm which keeps the same distribution of wealth among a set of assets along a period of time. Recently, there has been work on on-line portfolio selection algorithms which are…

Portfolio Management · Quantitative Finance 2013-02-01 Yoram Singer

Black-box optimization (BBO) has a broad range of applications, including automatic machine learning, experimental design, and database knob tuning. However, users still face challenges when applying BBO methods to their problems at hand…

Machine Learning · Computer Science 2024-05-17 Huaijun Jiang , Yu Shen , Yang Li , Beicheng Xu , Sixian Du , Wentao Zhang , Ce Zhang , Bin Cui

We present an end-to-end pipeline for large-scale portfolio selection with cardinality constraints and experimentally demonstrate it on trapped-ion quantum processors using hardware-aware decomposition. Building on RMT-based…

Bayesian optimization with Gaussian processes has become an increasingly popular tool in the machine learning community. It is efficient and can be used when very little is known about the objective function, making it popular in expensive…

Machine Learning · Computer Science 2011-03-08 Eric Brochu , Matthew W. Hoffman , Nando de Freitas

In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-13 Darko Bozidar , Tomaz Dobravec

Recent approaches to training algorithm selectors in the black-box optimisation domain have advocated for the use of training data that is algorithm-centric in order to encapsulate information about how an algorithm performs on an instance,…

Machine Learning · Computer Science 2025-01-22 Quentin Renau , Emma Hart

It is commonly believed that Bayesian optimization (BO) algorithms are highly efficient for optimizing numerically costly functions. However, BO is not often compared to widely different alternatives, and is mostly tested on narrow sets of…

Optimization and Control · Mathematics 2021-10-01 Rodolphe Le Riche , Victor Picheny

The `spotoptim` package implements surrogate-model-based optimization of expensive black-box functions in Python. Building on two decades of Sequential Parameter Optimization (SPO) methodology, it provides a Kriging-based optimization loop…

Machine Learning · Computer Science 2026-04-16 Thomas Bartz-Beielstein

Bayesian optimization (BO) developed as an approach for the efficient optimization of expensive black-box functions without gradient information. A typical BO paper introduces a new approach and compares it to some alternatives on simulated…

Computation · Statistics 2023-10-17 Jiajie Kong , Tony Pourmohamad , Herbert K. H. Lee

The artificial segmentation of an investment management process into a workflow with silos of offline human operators can restrict silos from collectively and adaptively pursuing a unified optimal investment goal. To meet the investor's…

Portfolio Management · Quantitative Finance 2020-09-08 Andrew Paskaramoorthy , Terence van Zyl , Tim Gebbie

Some real problems require the evaluation of expensive and noisy objective functions. Moreover, the analytical expression of these objective functions may be unknown. These functions are known as black-boxes, for example, estimating the…

Machine Learning · Statistics 2021-07-12 Lucia Asencio Martín , Eduardo C. Garrido-Merchán

Optimizing discrete black-box functions is key in several domains, e.g. protein engineering and drug design. Due to the lack of gradient information and the need for sample efficiency, Bayesian optimization is an ideal candidate for these…

Portfolio optimization is an important process in finance that consists in finding the optimal asset allocation that maximizes expected returns while minimizing risk. When assets are allocated in discrete units, this is a combinatorial…

Statistical Mechanics · Physics 2022-10-04 Álvaro Rubio-García , Juan José García-Ripoll , Diego Porras

Stratifying commercial product portfolios into multiple classes of decreasing priority, ABCD analysis, is a common supply chain tool. Key planning parameters that drive strategic and execution priorities are tied to the resulting…

Optimization and Control · Mathematics 2021-06-08 Vikram Govindan , Wei Xie

Bandit methods for black-box optimisation, such as Bayesian optimisation, are used in a variety of applications including hyper-parameter tuning and experiment design. Recently, \emph{multi-fidelity} methods have garnered considerable…

Machine Learning · Statistics 2017-03-21 Kirthevasan Kandasamy , Gautam Dasarathy , Jeff Schneider , Barnabas Poczos

We derive an optimal policy for adaptively restarting a randomized algorithm, based on observed features of the run-so-far, so as to minimize the expected time required for the algorithm to successfully terminate. Given a suitable Bayesian…

Machine Learning · Computer Science 2019-02-25 Matthew Streeter