اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNon-parametric inversion of gravitational lensing systems with few images using a multi-objective genetic algorithm
48
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Galaxies acting as gravitational lenses are surrounded by, at most, a handful of images. This apparent paucity of information forces one to make the best possible use of what information is available to invert the lens system. In this paper, we explore the use of a genetic algorithm to invert in a non-parametric way strong lensing systems containing only a small number of images. Perhaps the most important conclusion of this paper is that it is possible to infer the mass distribution of such gravitational lens systems using a non-parametric technique. We show that including information about the null space (i.e. the region where no images are found) is prerequisite to avoid the prediction of a large number of spurious images, and to reliably reconstruct the lens mass density. While the total mass of the lens is usually constrained within a few percent, the fidelity of the reconstruction of the lens mass distribution depends on the number and position of the images. The technique employed to include null space information can be extended in a straightforward way to add additional constraints, such as weak lensing data or time delay information.
قيم البحث
اقرأ أيضاً
We have conceived and implemented a multi-objective genetic algorithm (GA) code for the optimisation of an array of Imaging Atmospheric Cherenkov Telescopes (IACTs). The algorithm takes as input a series of cost functions (metrics) each describing a
different objetive of the optimisation (such as effective area, angular resolution, etc.), all of which are expressed in terms of the relative position of the telescopes in the plane. The output of the algorithm is a family of geometrical arrangements which correspond to the complete set of solutions to the array optimisation problem, and differ from each other according to the relative weight given to each of the (maybe conflicting) objetives of the optimisation. Since the algorithm works with parallel optimisation it admits as many cost functions as desired, and can incorporate constraints such as budget (cost cap) for the array and topological limitations of the terrain, like geographical accidents where telescopes cannot be installed. It also admits different types of telescopes (hybrid arrays) and the number of telescopes of each type can be treated as a parameter to be optimised - constrained, for example, by the cost of each type or the energy range of interest. The purpose of the algorithm, which converges fast to optimised solutions (if compared to the time for a complete Monte Carlo Simulation of a single configuration), is to provide a tool to investigate the full parameter space of possible geometries, and help in designing complex arrays. It does not substitute a detailed Monte Carlo study, but aims to guide it. In the examples of arrays shown here we have used as metrics simple heuristic expressions describing the fundamentals of the IAC technique, but these input functions can be made as detailed or complex as desired for a given experiment.
Crystal structure prediction (CSP) has emerged as one of the most important approaches for discovering new materials. CSP algorithms based on evolutionary algorithms and particle swarm optimization have discovered a great number of new materials. How
ever, these algorithms based on ab initio calculation of free energy are inefficient. Moreover, they have severe limitations in terms of scalability. We recently proposed a promising crystal structure prediction method based on atomic contact maps, using global optimization algorithms to search for the Wyckoff positions by maximizing the match between the contact map of the predicted structure and the contact map of the true crystal structure. However, our previous contact map based CSP algorithms have two major limitations: (1) the loss of search capability due to getting trapped in local optima; (2) it only uses the connection of atoms in the unit cell to predict the crystal structure, ignoring the chemical environment outside the unit cell, which may lead to unreasonable coordination environments. Herein we propose a novel multi-objective genetic algorithms for contact map-based crystal structure prediction by optimizing three objectives, including contact map match accuracy, the individual age, and the coordination number match. Furthermore, we assign the age values to all the individuals of the GA and try to minimize the age aiming to avoid the premature convergence problem. Our experimental results show that compared to our previous CMCrystal algorithm, our multi-objective crystal structure prediction algorithm (CMCrystalMOO) can reconstruct the crystal structure with higher quality and alleviate the problem of premature convergence.
The surrogate-assisted optimization algorithm is a promising approach for solving expensive multi-objective optimization problems. However, most existing surrogate-assisted multi-objective optimization algorithms have three main drawbacks: 1) cannot
scale well for solving problems with high dimensional decision space, 2) cannot incorporate available gradient information, and 3) do not support batch optimization. These drawbacks prevent their use for solving many real-world large scale optimization problems. This paper proposes a batched scalable multi-objective Bayesian optimization algorithm to tackle these issues. The proposed algorithm uses the Bayesian neural network as the scalable surrogate model. Powered with Monte Carlo dropout and Sobolov training, the model can be easily trained and can incorporate available gradient information. We also propose a novel batch hypervolume upper confidence bound acquisition function to support batch optimization. Experimental results on various benchmark problems and a real-world application demonstrate the efficiency of the proposed algorithm.
Owing to the ever-increasing demand in wireless spectrum, Cognitive Radio (CR) was introduced as a technique to attain high spectral efficiency. As the number of secondary users (SUs) connecting to the cognitive radio network is on the rise, there is
an imminent need for centralized algorithms that provide high throughput and energy efficiency of the SUs while ensuring minimum interference to the licensed users. In this work, we propose a multi-stage algorithm that - 1) effectively assigns the available channel to the SUs, 2) employs a non-parametric learning framework to estimate the primary traffic distribution to minimize sensing, and 3) proposes an adaptive framework to ensure that the collision to the primary user is below the specified threshold. We provide comprehensive empirical validation of the method with other approaches.
Modeling of interacting galaxies suffers from an extended parameter space prohibiting traditional grid based search strategies. As an alternative approach a combination of a Genetic Algorithm (GA) with fast restricted N-body simulations can be applie
d. A typical fit takes about 3-6 CPU-hours on a PentiumII processor. Here we present a parallel implementation of our GA which reduces the CPU-requirement of a parameter determination to a few minutes on 100 nodes of a CRAY T3E.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
