Sciweavers

30 search results - page 2 / 6
» An Algorithmic Theory of Learning: Robust Concepts and Rando...
Sort
View
COLT
2010
Springer
13 years 3 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
MM
2006
ACM
203views Multimedia» more  MM 2006»
13 years 11 months ago
Learning image manifolds by semantic subspace projection
In many image retrieval applications, the mapping between highlevel semantic concept and low-level features is obtained through a learning process. Traditional approaches often as...
Jie Yu, Qi Tian
SIGIR
2003
ACM
13 years 10 months ago
Text categorization by boosting automatically extracted concepts
Term-based representations of documents have found widespread use in information retrieval. However, one of the main shortcomings of such methods is that they largely disregard le...
Lijuan Cai, Thomas Hofmann
SODA
2010
ACM
208views Algorithms» more  SODA 2010»
14 years 2 months ago
Correlation Robust Stochastic Optimization
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
Shipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Y...
FOCS
2008
IEEE
13 years 11 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...