Enhancing Evolutionary Conversion Rate Optimization via Multi-armed Bandit Algorithms

Conversion rate optimization means designing web interfaces such that more visitors perform a desired action (such as register or purchase) on the site. One promising approach, implemented in Sentient Ascend, is to optimize the design using evolutionary algorithms, evaluating each candidate design online with actual visitors. Because such evaluations are costly and noisy, several challenges emerge: How can available visitor traffic be used most efficiently? How can good solutions be identified most reliably? How can a high conversion rate be maintained during optimization? This paper proposes a new technique to address these issues. Traffic is allocated to candidate solutions using a multi-armed bandit algorithm, using more traffic on those evaluations that are most useful. In a best-arm identification mode, the best candidate can be identified reliably at the end of evolution, and in a campaign mode, the overall conversion rate can be optimized throughout the entire evolution process. Multi-armed bandit algorithms thus improve performance and reliability of machine discovery in noisy real-world environments.Comment: The Thirty-First Innovative Applications of Artificial Intelligence Conferenc

MaaSim: A Liveability Simulation for Improving the Quality of Life in Cities

Urbanism is no longer planned on paper thanks to powerful models and 3D simulation platforms. However, current work is not open to the public and lacks an optimisation agent that could help in decision making. This paper describes the creation of an open-source simulation based on an existing Dutch liveability score with a built-in AI module. Features are selected using feature engineering and Random Forests. Then, a modified scoring function is built based on the former liveability classes. The score is predicted using Random Forest for regression and achieved a recall of 0.83 with 10-fold cross-validation. Afterwards, Exploratory Factor Analysis is applied to select the actions present in the model. The resulting indicators are divided into 5 groups, and 12 actions are generated. The performance of four optimisation algorithms is compared, namely NSGA-II, PAES, SPEA2 and eps-MOEA, on three established criteria of quality: cardinality, the spread of the solutions, spacing, and the resulting score and number of turns. Although all four algorithms show different strengths, eps-MOEA is selected to be the most suitable for this problem. Ultimately, the simulation incorporates the model and the selected AI module in a GUI written in the Kivy framework for Python. Tests performed on users show positive responses and encourage further initiatives towards joining technology and public applications.Comment: 16 page

Enhanced genetic algorithm-based fuzzy multiobjective strategy to multiproduct batch plant design

This paper addresses the problem of the optimal design of batch plants with imprecise demands in product amounts. The design of such plants necessary involves how equipment may be utilized, which means that plant scheduling and production must constitute a basic part of the design problem. Rather than resorting to a traditional probabilistic approach for modeling the imprecision on product demands, this work proposes an alternative treatment by using fuzzy concepts. The design problem is tackled by introducing a new approach based on a multiobjective genetic algorithm, combined wit the fuzzy set theory for computing the objectives as fuzzy quantities. The problem takes into account simultaneous maximization of the fuzzy net present value and of two other performance criteria, i.e. the production delay/advance and a flexibility index. The delay/advance objective is computed by comparing the fuzzy production time for the products to a given fuzzy time horizon, and the flexibility index represents the additional fuzzy production that the plant would be able to produce. The multiobjective optimization provides the Pareto's front which is a set of scenarios that are helpful for guiding the decision's maker in its final choices. About the solution procedure, a genetic algorithm was implemented since it is particularly well-suited to take into account the arithmetic of fuzzy numbers. Furthermore because a genetic algorithm is working on populations of potential solutions, this type of procedure is well adapted for multiobjective optimization

Interactive product catalogue with user preference tracking

In the context of m-commerce, small screen size poses serious difficulty for users to browse effectively through a product catalogue, given the limited number of products that may be presented on-screen. Despite the availability of search engines, filters and recommender systems to aid users, these techniques focus on a narrow segment of product offering. The users are thus denied the opportunity to do a more expansive exploration of the products available. This paper describes a novel approach to overcome the constraints of small screen size. Through integration of a product catalogue with a recommender system, an adaptive system has been created that guides users through the process of product browsing. An original technique has been developed to cluster similar positive examples together to identify areas of interest of a user. The performance of this technique has been evaluated and the results proved to be promising

Integrating continuous differential evolution with discrete local search for meander line RFID antenna design

The automated design of meander line RFID antennas is a discrete self-avoiding walk(SAW) problem for which efficiency is to be maximized while resonant frequency is to beminimized. This work presents a novel exploration of how discrete local search may beincorporated into a continuous solver such as differential evolution (DE). A prior DE algorithmfor this problem that incorporates an adaptive solution encoding and a bias favoringantennas with low resonant frequency is extended by the addition of the backbite localsearch operator and a variety of schemes for reintroducing modified designs into the DEpopulation. The algorithm is extremely competitive with an existing ACO approach and thetechnique is transferable to other SAW problems and other continuous solvers. The findingsindicate that careful reintegration of discrete local search results into the continuous populationis necessary for effective performance

Agent-Based Model of Price Competition and Product Differentiation on Congested Networks

Using consistent agent-based techniques, this research models the decision-making processes of users and infrastructure owner/operators to explore the welfare consequence of price competition, capacity choice, and product differentiation on congested transportation networks. Component models include: (1) An agent-based travel demand model wherein each traveler has learning capabilities and unique characteristics (e.g. value of time); (2) Econometric facility provision cost models; and (3) Representations of road authorities making pricing and capacity decisions. Different from small-network equilibrium models in prior literature, this agent-based model is applicable to pricing and investment analyses on large complex networks. The subsequent economic analysis focuses on the source, evolution, measurement, and impact of product differentiation with heterogeneous users on a mixed ownership network (with tolled and untolled roads). Two types of product differentiation in the presence of toll roads, path differentiation and space differentiation, are defined and measured for a base case and several variants with different types of price and capacity competition and with various degrees of user heterogeneity. The findings favor a fixed-rate road pricing policy compared to complete pricing freedom on toll roads. It is also shown that the relationship between net social benefit and user heterogeneity is not monotonic on a complex network with toll roads.Network dynamics, road pricing, autonomous links, privatization, price competition, product differentiation, agent-based transportation model

Where creativity comes from: the social spaces of embodied minds

This paper explores creative design, social interaction and perception. It proposes that creativity at a social level is not a result of many individuals trying to be creative at a personal level, but occurs naturally in the social interaction between comparatively simple minds embodied in a complex world. Particle swarm algorithms can model group interaction in shared spaces, but design space is not necessarily one pre-defined space of set parameters on which everyone can agree, as individual minds are very different. A computational model is proposed that allows a similar swarm to occur between spaces of different description and even dimensionality. This paper explores creative design, social interaction and perception. It proposes that creativity at a social level is not a result of many individuals trying to be creative at a personal level, but occurs naturally in the social interaction between comparatively simple minds embodied in a complex world. Particle swarm algorithms can model group interaction in shared spaces, but design space is not necessarily one pre-defined space of set parameters on which everyone can agree, as individual minds are very different. A computational model is proposed that allows a similar swarm to occur between spaces of different description and even dimensionality

Search based software engineering: Trends, techniques and applications

© ACM, 2012. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version is available from the link below.In the past five years there has been a dramatic increase in work on Search-Based Software Engineering (SBSE), an approach to Software Engineering (SE) in which Search-Based Optimization (SBO) algorithms are used to address problems in SE. SBSE has been applied to problems throughout the SE lifecycle, from requirements and project planning to maintenance and reengineering. The approach is attractive because it offers a suite of adaptive automated and semiautomated solutions in situations typified by large complex problem spaces with multiple competing and conflicting objectives. This article provides a review and classification of literature on SBSE. The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.EPSRC and E