Call for Papers
Special Issue on Automated Design of Machine Learning and Search Algorithms
Aims and Scope
Industry is faced with solving complex optimization problems on a day to day basis in different domains including transportation, data mining, computer vision, computer security, robotics and scheduling amongst others. Machine learning and search algorithms play an important role in solving such problems. Given the growing complexity of optimization problems, the design of effective algorithms to solve complex optimization problems has become more challenging and time consuming. Hence, there is a demand, especially from industry and business, to automate the design process, thereby to remove the heavy reliance on human experts and to reduce the man hours involved in designing machine learning and search algorithms for solving these problems.
The aim is to develop out of the box tools that can be used by practitioners and researchers to make design decisions that are made by human experts when applying machine learning and search algorithms to complex optimization problems. Examples of design decisions include determining parameter and hyperparameter values, operator selection, choosing a good data representation, generating construction heuristics, creating new operators, identifying the algorithm or combination of algorithms to solve the problem at hand.
Machine learning and search algorithms require parameters, e.g. genetic operator probabilities for genetic algorithms, and hyperparameters, e.g. learning rate in deep learning, to be tuned, with the most appropriate parameter values being problem dependent. There are usually many options for hyper-parameters and automating the selection of these values reduces the time and human expertise required for this. Automating parameter selection allows for the parameter values to be configured and adapted dynamically during execution of the algorithm, resulting in parameter-less algorithms. For some algorithms, e.g. evolutionary algorithms, it is also necessary to select which operators to use, automating this process allows for different operators to be applied at different points in the algorithm. In machine learning, the way in which data are represented has a crucial impact on the algorithm's performance.
Automated design includes the generation of new constructs used by machine learning and search algorithms. For example, in solving optimization problems certain algorithms require an initial solution or set of solutions which the algorithm optimizes further. Construction heuristics, usually derived based on human intuition, are used to create these solutions. There has been a number of research initiatives into automating the derivation of these heuristics which have resulted in the creation of heuristics that perform better than human derived heuristics. The automated creation of operators used by search algorithms to improve initial solutions has also proven to be promising. Similarly, in the domain of machine learning there have been efforts to generate machine learning workplans and architectures, e.g. deep learning is capable of inferring rich data representations from raw sensor signals in so-called end-to-end learning, Bayesian modeling enables a structured inference along meta-parameters.
A further example of a design decision is identifying the appropriate algorithm to solve the problem at hand, e.g. which classification algorithm should be used, if a genetic algorithm or simulated annealing is more appropriate. In some instances it may also be necessary to decide which algorithms to combine and how these can be hybridized to solve the problem.
In some applications it may be sufficient for techniques used to automate these design decisions to operate as black-boxes, however in other instances users may require an explanation of how these decisions were arrived at before they can accept them as reliable. Thus, it is necessary to develop techniques that can explain the design decision reached.
Research into automating such design decisions has led to the development of areas such as self*-search and auto-ML, with various approaches including self-adaption, self-configuration, algorithm portfolios, adaptive metaheuristics, multilevel meta-heuristics and hyper-heuristics successfully being used for automation. A wide range of techniques, including for example those in machine learning, have been employed to effectively and automatically configure or design adaptive machine learning and search algorithms, utilizing either online or offline knowledge extracted. Explainable machine learning is a current hot topic, aimed at improving machine learning techniques to explain the decisions they have arrived at. The aim of this special issue is to collect and examine recent developments in the field, thus to promote and identify future directions and challenges, and demonstrate how these may be addressed.
The topics covered include, but are not limited to, the following:
· Adaptive metaheuristics
· Algorithm portfolios
· Automated design of operators
· Automated hybridization of algorithms
· Automated operator selection
· Automated parameter configuration and adaptation
· Automated hyperparameter selection
· Automated feature selection
· Automated model selection
· Automated heuristic generation
· Automated operator creation
· Automated machine learning workplan and architecture generation
· Bayesian model design
· Multilevel metaheuristics
· Representation learning
· Reactive search
· Explainable machine learning
All manuscripts must be submitted electronically in PDF format. Manuscripts must be typed in 12 point font, double spaced in single column format and adhere to a maximum length of 20 pages. Additional information on manuscript details and submission guidelines can be accessed from the IEEE CIM website (http://cis.ieee.org/images/files/Documents/CIM/cim-authors-guidelines.pdf). Submissions must be made via the EasyChair link https://easychair.org/conferences/?conf=cimada2017 .
15<x-apple-data-detectors://3>th<x-apple-data-detectors://3> July 2017<x-apple-data-detectors://3>: Submission of manuscripts
30<x-apple-data-detectors://4>th<x-apple-data-detectors://4> September 2017<x-apple-data-detectors://4>: Notification of review results
31<x-apple-data-detectors://5>st<x-apple-data-detectors://5> October 2017<x-apple-data-detectors://5>: Submission of revised manuscripts
15<x-apple-data-detectors://6>th<x-apple-data-detectors://6> December 2017<x-apple-data-detectors://6>: Submission of final manuscripts
Publication: May 2018
School of Mathematics, Statistics and Computer Science
University of KwaZulu-Natal, South Africa
School of Computer Science
University of Nottingham, UK
Department of Electrical & Computer Engineering
National University of Singapore, Singapore
CITEC Centre of Excellence
Bielefeld University, Germany
Department of Engineering Management
University of Antwerp, Belgium
Department of Computer Science and Intelligence Systems
Osaka Prefecture University, Japan
This message and any attachment are intended solely for the addressee
and may contain confidential information. If you have received this
message in error, please send it back to me, and immediately delete it.
Please do not use, copy or disclose the information contained in this
message or in any attachment. Any views or opinions expressed by the
author of this email do not necessarily reflect the views of the
University of Nottingham.
This message has been checked for viruses but the contents of an
attachment may still contain software viruses which could damage your
computer system, you are advised to perform your own checks. Email
communications with the University of Nottingham may be monitored as
permitted by UK legislation.
* Contributions to be spread via DMANET are submitted to
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)