Sciweavers

27 search results - page 4 / 6
» New Constraints on Generation of Uniform Random Samples from...
Sort
View
ICML
2009
IEEE
14 years 6 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
13 years 10 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 1 days ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
SDM
2008
SIAM
122views Data Mining» more  SDM 2008»
13 years 6 months ago
Type-Independent Correction of Sample Selection Bias via Structural Discovery and Re-balancing
Sample selection bias is a common problem in many real world applications, where training data are obtained under realistic constraints that make them follow a different distribut...
Jiangtao Ren, Xiaoxiao Shi, Wei Fan, Philip S. Yu
AMAI
2005
Springer
13 years 5 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter