63,550 research outputs found
Recommended from our members
Local search: A guide for the information retrieval practitioner
There are a number of combinatorial optimisation problems in information retrieval in which the use of local search methods are worthwhile. The purpose of this paper is to show how local search can be used to solve some well known tasks in information retrieval (IR), how previous research in the field is piecemeal, bereft of a structure and methodologically flawed, and to suggest more rigorous ways of applying local search methods to solve IR problems. We provide a query based taxonomy for analysing the use of local search in IR tasks and an overview of issues such as fitness functions, statistical significance and test collections when conducting experiments on combinatorial optimisation problems. The paper gives a guide on the pitfalls and problems for IR practitioners who wish to use local search to solve their research issues, and gives practical advice on the use of such methods. The query based taxonomy is a novel structure which can be used by the IR practitioner in order to examine the use of local search in IR
A Survey on Software Testing Techniques using Genetic Algorithm
The overall aim of the software industry is to ensure delivery of high
quality software to the end user. To ensure high quality software, it is
required to test software. Testing ensures that software meets user
specifications and requirements. However, the field of software testing has a
number of underlying issues like effective generation of test cases,
prioritisation of test cases etc which need to be tackled. These issues demand
on effort, time and cost of the testing. Different techniques and methodologies
have been proposed for taking care of these issues. Use of evolutionary
algorithms for automatic test generation has been an area of interest for many
researchers. Genetic Algorithm (GA) is one such form of evolutionary
algorithms. In this research paper, we present a survey of GA approach for
addressing the various issues encountered during software testing.Comment: 13 Page
Functional Generative Design: An Evolutionary Approach to 3D-Printing
Consumer-grade printers are widely available, but their ability to print
complex objects is limited. Therefore, new designs need to be discovered that
serve the same function, but are printable. A representative such problem is to
produce a working, reliable mechanical spring. The proposed methodology for
discovering solutions to this problem consists of three components: First, an
effective search space is learned through a variational autoencoder (VAE);
second, a surrogate model for functional designs is built; and third, a genetic
algorithm is used to simultaneously update the hyperparameters of the surrogate
and to optimize the designs using the updated surrogate. Using a car-launcher
mechanism as a test domain, spring designs were 3D-printed and evaluated to
update the surrogate model. Two experiments were then performed: First, the
initial set of designs for the surrogate-based optimizer was selected randomly
from the training set that was used for training the VAE model, which resulted
in an exploitative search behavior. On the other hand, in the second
experiment, the initial set was composed of more uniformly selected designs
from the same training set and a more explorative search behavior was observed.
Both of the experiments showed that the methodology generates interesting,
successful, and reliable spring geometries robust to the noise inherent in the
3D printing process. The methodology can be generalized to other functional
design problems, thus making consumer-grade 3D printing more versatile.Comment: 8 pages, 12 figures, GECCO'1
A Survey on Compiler Autotuning using Machine Learning
Since the mid-1990s, researchers have been trying to use machine-learning
based approaches to solve a number of different compiler optimization problems.
These techniques primarily enhance the quality of the obtained results and,
more importantly, make it feasible to tackle two main compiler optimization
problems: optimization selection (choosing which optimizations to apply) and
phase-ordering (choosing the order of applying optimizations). The compiler
optimization space continues to grow due to the advancement of applications,
increasing number of compiler optimizations, and new target architectures.
Generic optimization passes in compilers cannot fully leverage newly introduced
optimizations and, therefore, cannot keep up with the pace of increasing
options. This survey summarizes and classifies the recent advances in using
machine learning for the compiler optimization field, particularly on the two
major problems of (1) selecting the best optimizations and (2) the
phase-ordering of optimizations. The survey highlights the approaches taken so
far, the obtained results, the fine-grain classification among different
approaches and finally, the influential papers of the field.Comment: version 5.0 (updated on September 2018)- Preprint Version For our
Accepted Journal @ ACM CSUR 2018 (42 pages) - This survey will be updated
quarterly here (Send me your new published papers to be added in the
subsequent version) History: Received November 2016; Revised August 2017;
Revised February 2018; Accepted March 2018
Comparative Studies on Decentralized Multiloop PID Controller Design Using Evolutionary Algorithms
Decentralized PID controllers have been designed in this paper for
simultaneous tracking of individual process variables in multivariable systems
under step reference input. The controller design framework takes into account
the minimization of a weighted sum of Integral of Time multiplied Squared Error
(ITSE) and Integral of Squared Controller Output (ISCO) so as to balance the
overall tracking errors for the process variables and required variation in the
corresponding manipulated variables. Decentralized PID gains are tuned using
three popular Evolutionary Algorithms (EAs) viz. Genetic Algorithm (GA),
Evolutionary Strategy (ES) and Cultural Algorithm (CA). Credible simulation
comparisons have been reported for four benchmark 2x2 multivariable processes.Comment: 6 pages, 9 figure
Multi-criteria Evolution of Neural Network Topologies: Balancing Experience and Performance in Autonomous Systems
Majority of Artificial Neural Network (ANN) implementations in autonomous
systems use a fixed/user-prescribed network topology, leading to sub-optimal
performance and low portability. The existing neuro-evolution of augmenting
topology or NEAT paradigm offers a powerful alternative by allowing the network
topology and the connection weights to be simultaneously optimized through an
evolutionary process. However, most NEAT implementations allow the
consideration of only a single objective. There also persists the question of
how to tractably introduce topological diversification that mitigates
overfitting to training scenarios. To address these gaps, this paper develops a
multi-objective neuro-evolution algorithm. While adopting the basic elements of
NEAT, important modifications are made to the selection, speciation, and
mutation processes. With the backdrop of small-robot path-planning
applications, an experience-gain criterion is derived to encapsulate the amount
of diverse local environment encountered by the system. This criterion
facilitates the evolution of genes that support exploration, thereby seeking to
generalize from a smaller set of mission scenarios than possible with
performance maximization alone. The effectiveness of the single-objective
(optimizing performance) and the multi-objective (optimizing performance and
experience-gain) neuro-evolution approaches are evaluated on two different
small-robot cases, with ANNs obtained by the multi-objective optimization
observed to provide superior performance in unseen scenarios
- …