Sciweavers

2681 search results - page 230 / 537
» Learning to learn with the informative vector machine
Sort
View
COLT
2006
Springer
15 years 8 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
AGENTS
1999
Springer
15 years 11 months ago
A Personal News Agent That Talks, Learns and Explains
Most work on intelligent information agents has thus far focused on systems that are accessible through the World Wide Web. As demanding schedules prohibit people from continuous ...
Daniel Billsus, Michael J. Pazzani
PRL
2008
118views more  PRL 2008»
15 years 6 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
ICML
2008
IEEE
16 years 7 months ago
Predicting diverse subsets using structural SVMs
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
Yisong Yue, Thorsten Joachims