[1112.4323] Between theory and practice: guidelines for an optimization scheme with genetic algorithms - Part I: single-objective continuous global optimization
january 2012 by Vaguery
The rapid advances in the field of optimization methods in many pure and applied science pose the difficulty of keeping track of the developments as well as selecting an appropriate technique that best suits the problem in-hand. From a practitioner point of view is rightful to wander "which optimization method is the best for my problem?". Looking at the optimization process as a "system" of intercon- nected parts, in this paper are collected some ideas about how to tackle an optimization problem using a class of tools from evolutionary computations called Genetic Algorithms. Despite the number of optimization techniques available nowadays the author of this paper thinks that Genetic Algorithms still play a central role for their versatility, robustness, theoretical framework and simplicity of use. The paper can be considered a "collection of tips" (from literature and personal experience) for the non-computer-scientist that has to deal with optimization problems both in the science and engineering practice. No original methods or algorithms are proposed.
meta-optimization
pragmatism-almost
genetic-algorithm
agile-almost
project-management
january 2012 by Vaguery
[0812.3141] Choosing a penalty for model selection in heteroscedastic regression
june 2010 by Vaguery
"We consider the problem of choosing between several models in least-squares regression with heteroscedastic data. We prove that any penalization procedure is suboptimal when the penalty is a function of the dimension of the model, at least for some typical heteroscedastic model selection problems. In particular, Mallows' Cp is suboptimal in this framework. On the contrary, optimal model selection is possible with data-driven penalties such as resampling or $V$-fold penalties. Therefore, it is worth estimating the shape of the penalty from data, even at the price of a higher computational cost. Simulation experiments illustrate the existence of a trade-off between statistical accuracy and computational complexity. As a conclusion, we sketch some rules for choosing a penalty in least-squares regression, depending on what is known about possible variations of the noise-level."
statistics
statistical-tests
linear-regression
meta-optimization
nudge-targets
multiobjective-optimization
pragmatism-it-ain't
june 2010 by Vaguery
[1006.1681] Towards the Design of Heuristics by Means of Self-Assembly
june 2010 by Vaguery
"…This idea arises from previous works in which computational models of self-assembly were subject to evolutionary design in order to perform the automatic construction of user-defined structures. Then, the aim of this paper is to present a novel methodology for the automated design of heuristics by means of self-assembly."
hyperheuristics
meta-optimization
algorithms
engineering-design
design-automation
nudge-targets
nice
june 2010 by Vaguery
related tags
agile-almost ⊕ algorithms ⊕ design-automation ⊕ engineering-design ⊕ genetic-algorithm ⊕ hyperheuristics ⊕ linear-regression ⊕ meta-optimization ⊖ multiobjective-optimization ⊕ nice ⊕ nudge-targets ⊕ pragmatism-almost ⊕ pragmatism-it-ain't ⊕ project-management ⊕ statistical-tests ⊕ statistics ⊕Copy this bookmark: