Sciweavers

263 search results - page 30 / 53
» Regret Bounds for Prediction Problems
Sort
View
COLT
2001
Springer
14 years 2 months ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
14 years 1 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
RECOMB
2007
Springer
14 years 10 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
ICASSP
2010
IEEE
13 years 10 months ago
On unbiased estimation of sparse vectors corrupted by Gaussian noise
We consider the estimation of a sparse parameter vector from measurements corrupted by white Gaussian noise. Our focus is on unbiased estimation as a setting under which the difï¬...
Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Y...
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
14 years 4 months ago
Predicting the navigation performance of underwater vehicles
— In this paper we present a general framework for predicting the positioning uncertainty of underwater vehicles. We apply this framework to common examples from marine robotics:...
Brian Bingham