English
Related papers

Related papers: Per-run Algorithm Selection with Warm-starting usi…

200 papers

Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initial state towards states with better values of the optimand,…

Quantum Physics · Physics 2026-04-30 Phillip C. Lotshaw , Titus Morris , Stuart Hadfield , Ryan Bennink

Algorithm selection (AS) deals with selecting an algorithm from a fixed set of candidate algorithms most suitable for a specific instance of an algorithmic problem, e.g., choosing solvers for SAT problems. Benchmark suites for AS usually…

Machine Learning · Computer Science 2020-10-23 Alexander Tornede , Marcel Wever , Eyke Hüllermeier

The identification of performance-optimizing parameter settings is an important part of the development and application of algorithms. We describe an automatic framework for this algorithm configuration problem. More formally, we provide…

Artificial Intelligence · Computer Science 2014-01-16 Frank Hutter , Thomas Stuetzle , Kevin Leyton-Brown , Holger H. Hoos

An automatic machine learning (AutoML) task is to select the best algorithm and its hyper-parameters simultaneously. Previously, the hyper-parameters of all algorithms are joint as a single search space, which is not only huge but also…

Machine Learning · Computer Science 2019-06-03 Yi-Qi Hu , Yang Yu , Jun-Da Liao

Relevant and high-quality data are critical to successful development of machine learning applications. For machine learning applications on dynamic systems equipped with a large number of sensors, such as connected vehicles and robots, how…

Machine Learning · Computer Science 2021-08-31 Alp Sahin , Xiangrui Zeng

Feature selection is a process of choosing a subset of relevant features so that the quality of prediction models can be improved. An extensive body of work exists on information-theoretic feature selection, based on maximizing Mutual…

Machine Learning · Computer Science 2016-12-05 Jilin Wu , Soumyajit Gupta , Chandrajit Bajaj

Suppose we have a memory storing $0$s and $1$s and we want to estimate the frequency of $1$s by sampling. We want to do this I/O-efficiently, exploiting that each read gives a block of $B$ bits at unit cost; not just one bit. If the input…

Data Structures and Algorithms · Computer Science 2024-10-21 Shyam Narayanan , Václav Rozhoň , Jakub Tětek , Mikkel Thorup

Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithms. Machine learning can be a useful approach in practice by…

Data Structures and Algorithms · Computer Science 2021-12-07 Antonios Antoniadis , Peyman Jabbarzade Ganje , Golnoosh Shahkarami

Offline reinforcement learning algorithms often require careful hyperparameter tuning. Before deployment, we need to select amongst a set of candidate policies. However, there is limited understanding about the fundamental limits of this…

Machine Learning · Computer Science 2026-02-17 Vincent Liu , Prabhat Nagarajan , Andrew Patterson , Martha White

Pure methods generally perform excellently in either recommendation accuracy or diversity, whereas hybrid methods generally outperform pure cases in both recommendation accuracy and diversity, but encounter the dilemma of optimal…

Information Retrieval · Computer Science 2012-07-26 Tian Qiu , Zi-Ke Zhang , Guang Chen

In this paper, we develop a recommender system for a game that suggests potential items to players based on their interactive behaviors to maximize revenue for the game provider. Our approach is built on a reinforcement learning-based…

Artificial Intelligence · Computer Science 2021-11-18 Hung Nguyen , Minh Nguyen , Long Pham , Jennifer Adorno Nieves

In evolutionary algorithms, a preselection operator aims to select the promising offspring solutions from a candidate offspring set. It is usually based on the estimated or real objective values of the candidate offspring solutions. In a…

Neural and Evolutionary Computing · Computer Science 2017-08-04 Jinyuan Zhang , Aimin Zhou , Ke Tang , Guixu Zhang

One way to speed up the algorithm configuration task is to use short runs instead of long runs as much as possible, but without discarding the configurations that eventually do well on the long runs. We consider the problem of selecting the…

Artificial Intelligence · Computer Science 2018-03-28 Daniel Karapetyan , Andrew J. Parkes , Thomas Stützle

Feature selection in machine learning is subject to the intrinsic randomness of the feature selection algorithms (for example, random permutations during MDA). Stability of selected features with respect to such randomness is essential to…

Machine Learning · Computer Science 2020-05-27 Xin Man , Ernest Chan

Data-efficient learning algorithms are essential in many practical applications where data collection is expensive, e.g., in robotics due to the wear and tear. To address this problem, meta-learning algorithms use prior experience about…

Machine Learning · Computer Science 2020-10-26 Jean Kaddour , Steindór Sæmundsson , Marc Peter Deisenroth

The typical offline protocol to evaluate recommendation algorithms is to collect a dataset of user-item interactions and then use a part of this dataset to train a model, and the remaining data to measure how closely the model…

Information Retrieval · Computer Science 2026-05-15 Maria João Lavoura , Robert Jungnickel , João Vinagre

It is typical for a machine learning system to have numerous hyperparameters that affect its learning rate and prediction quality. Finding a good combination of the hyperparameters is, however, a challenging job. This is mainly because…

Machine Learning · Computer Science 2019-08-08 Dobromir Marinov , Daniel Karapetyan

Predictive models are often used for real-time decision making. However, typical machine learning techniques ignore feature evaluation cost, and focus solely on the accuracy of the machine learning models obtained utilizing all the features…

Machine Learning · Computer Science 2014-08-19 Leilani Battle , Edward Benson , Aditya Parameswaran , Eugene Wu

We demonstrate that, for a range of state-of-the-art machine learning algorithms, the differences in generalisation performance obtained using default parameter settings and using parameters tuned via cross-validation can be similar in…

Machine Learning · Computer Science 2017-03-21 Anthony Bagnall , Gavin C. Cawley

For tackling the well known cold-start user problem in model-based recommender systems, one approach is to recommend a few items to a cold-start user and use the feedback to learn a profile. The learned profile can then be used to make good…

Information Retrieval · Computer Science 2017-03-02 Sampoorna Biswas , Laks V. S. Lakshmanan , Senjuti Basu Ray
‹ Prev 1 3 4 5 6 7 10 Next ›