Sónia Carvalho Teixeira

Abstract
We present an online optimization method for time-evolving data streams that can automatically adapt the hyper-parameters of an embedding model. More specifically, we employ the Nelder-Mead algorithm, which uses a set of heuristics to produce and exploit several potentially good configurations, from which the best one is selected and deployed. This step is repeated whenever the distribution of the data is changing. We evaluate our approach on streams of real-world as well as synthetic data, where the latter is generated in such way that its characteristics change over time (concept drift). Overall, we achieve good performance in terms of accuracy compared to state-of-the-art AutoML techniques.

Abstract

Abstract
In order to improve their competitive performance, airline companies often adopt as a strategy to establish arrangement between two or more organizations agreeing to cooperate on a substantial level. This strategy is often known as airline alliances. A paradigm to analyze the collective intelligence behavior which emerges from a group, as a strategic alliance, is the flocking behavior. Inspired by the Cucker and Smale algorithm (C-S) we propose a new version of the flocking behavior algorithm applied to airline alliances. Our goal is to understand the link between strategic alliances and flocks. For this new approach, metrics were obtained for the parameters of C-S algorithm, namely position, velocity and influence, where the latter uses cooperative games. Besides, reinforcement learning mechanisms have been explored. Some relevant outputs for airline alliances as the permanence rate and the growth rate were computed for each of the five configurations in analysis.