Sciweavers

NIPS
2001
14 years 10 days ago
Active Learning in the Drug Discovery Process
We investigate the following data mining problem from Computational Chemistry: From a large data set of compounds, find those that bind to a target molecule in as few iterations o...
Manfred K. Warmuth, Gunnar Rätsch, Michael Ma...
NIPS
2008
14 years 12 days ago
Clustered Multi-Task Learning: A Convex Formulation
In multi-task learning several related tasks are considered simultaneously, with the hope that by an appropriate sharing of information across tasks, each task may benefit from th...
Laurent Jacob, Francis Bach, Jean-Philippe Vert
COLT
2005
Springer
14 years 4 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
CEC
2008
IEEE
14 years 5 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva