Sciweavers

COLT
2008
Springer
13 years 6 months ago
Learning Coordinate Gradients with Multi-Task Kernels
Coordinate gradient learning is motivated by the problem of variable selection and determining variable covariation. In this paper we propose a novel unifying framework for coordi...
Yiming Ying, Colin Campbell
COLT
2008
Springer
13 years 6 months ago
Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs
Prediction from expert advice is a fundamental problem in machine learning. A major pillar of the field is the existence of learning algorithms whose average loss approaches that ...
Elad Hazan, Satyen Kale
COLT
2008
Springer
13 years 6 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
COLT
2008
Springer
13 years 6 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
COLT
2008
Springer
13 years 6 months ago
Injective Hilbert Space Embeddings of Probability Measures
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing and independence testing. ...
Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fu...
COLT
2008
Springer
13 years 6 months ago
Polynomial Regression under Arbitrary Product Distributions
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...
Eric Blais, Ryan O'Donnell, Karl Wimmer
COLT
2008
Springer
13 years 6 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor
COLT
2008
Springer
13 years 6 months ago
On the Power of Membership Queries in Agnostic Learning
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
Vitaly Feldman
COLT
2008
Springer
13 years 6 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
COLT
2008
Springer
13 years 6 months ago
Combining Expert Advice Efficiently
We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficientl...
Wouter M. Koolen, Steven de Rooij