Sciweavers

176 search results - page 15 / 36
» Optimal Sampling Strategies in Quicksort
Sort
View
NIPS
2004
15 years 6 months ago
A Second Order Cone programming Formulation for Classifying Missing Data
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distributio...
Chiranjib Bhattacharyya, Pannagadatta K. Shivaswam...
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 11 months ago
DCMA: yet another derandomization in covariance-matrix-adaptation
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
Olivier Teytaud, Sylvain Gelly
146
Voted
NIPS
2007
15 years 6 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
15 years 6 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 6 months ago
Aiming for a theoretically tractable CSA variant by means of empirical investigations
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Jens Jägersküpper, Mike Preuss