Sciweavers

109 search results - page 5 / 22
» Algorithm Selection as a Bandit Problem with Unbounded Losse...
Sort
View
ALT
2005
Springer
14 years 2 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
13 years 10 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
13 years 8 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ICDE
2008
IEEE
178views Database» more  ICDE 2008»
14 years 6 months ago
On the Optimal Selection of k in the k-Anonymity Problem
When disseminating data involving human subjects, researchers have to weigh in the requirements of privacy of the individuals involved in the data. A model widely used for enhancin...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
13 years 11 months ago
Addressing sampling errors and diversity loss in UMDA
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
Jürgen Branke, Clemens Lode, Jonathan L. Shap...