Towards an automated method based on Iterated Local Search optimization for tuning the parameters of Support Vector Machines

07/11/2017
by   Sergio Consoli, et al.
0

We provide preliminary details and formulation of an optimization strategy under current development that is able to automatically tune the parameters of a Support Vector Machine over new datasets. The optimization strategy is a heuristic based on Iterated Local Search, a modification of classic hill climbing which iterates calls to a local search routine.

READ FULL TEXT

page 1

page 2

page 3

research
03/13/2023

Tuning support vector machines and boosted trees using optimization algorithms

Statistical learning methods have been growing in popularity in recent y...
research
10/26/2018

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

We present computational results with a heuristic algorithm for the para...
research
05/12/2017

A Formal Characterization of the Local Search Topology of the Gap Heuristic

The pancake puzzle is a classic optimization problem that has become a s...
research
12/24/2019

PILS: Exploring high-order neighborhoods by pattern mining and injection

We introduce pattern injection local search (PILS), an optimization stra...
research
03/03/2023

EZtune: A Package for Automated Hyperparameter Tuning in R

Statistical learning models have been growing in popularity in recent ye...
research
04/26/2019

A Novel Orthogonal Direction Mesh Adaptive Direct Search Approach for SVM Hyperparameter Tuning

In this paper, we propose the use of a black-box optimization method cal...
research
08/02/2021

Machine Learning Constructives and Local Searches for the Travelling Salesman Problem

The ML-Constructive heuristic is a recently presented method and the fir...

Please sign up or login with your details

Forgot password? Click here to reset