For all exoplanet candidates, the reliability of a claimed detection needs to be assessed through a careful study of systematic errors in the data to minimize the false positives rate. We present a method to investigate such systematics in microlensing data sets using the microlensing event OGLE-2013-BLG-0446 as a case study. The event was observed from multiple sites around the world and its high magnification (Amax ~ 3000) allowed us to investigate the effects of terrestrial and annual parallax. Real-time modeling of the event while it was still ongoing suggested the presence of an extremely low-mass companion (~3M⊕) to the lensing star, leading to substantial follow-up coverage of the light curve. We test and compare different models for the light curve and conclude that the data do not favor the planetary interpretation when systematic errors are taken into account.
We are studying the NFL Theorems with regard to relational optimization. In relational optimization, we represent the optimization problem by a formal relation, and the solution by the set of maximal (or non-dominated) elements of this relation. This appears to be a natural extension of standard optimization, and covers other notions of optimality as well. It will be shown that in this case, the NFL Theorems do not hold and that there are pairs of algorithms and a performance measure, where one always outperforms the other with regard to this performance measure if averaged over all possible relations. More specifically, the outperforming algorithm is an algorithm, where elements are checked one by one if they are dominated by any other element, while the outperformed algorithm is an algorithm, where elements are checked one by one if they dominate any other element. The proof is accompanied by a complete analysis of a special case, where also other performance measures are shown to be better when using the former algorithm.
Fully or nearly decomposable problems have been often used as test problems in genetic algorithm (GA) researches. The two types of problems have the common feature that all bits in each sub-problem are used for calculating its fitness value. The present model-based GAs appropriately decompose the whole of such a problem into parts and efficiently solve it. However, so far there has not been a test problem in which sub-problems are overlapped and bits of each sub-problem in the overlapped parts used for calculating a fitness value of the sub-problem vary depending on a bit pattern of a given solution candidate. This type of problems might cause difficulty in the decomposition to model-based GAs. In the study we propose the overlapped chains problem (OCP) as this type of problem. The results of applying several GAs to instances of the OCP show that some model-based GA cannot yield better search performance than a simple operator-based GA.