Sciweavers

263 search results - page 32 / 53
» Regret Bounds for Prediction Problems
Sort
View
ALT
1999
Springer
14 years 2 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
WINE
2009
Springer
179views Economy» more  WINE 2009»
14 years 4 months ago
Betting on the Real Line
We study the problem of designing prediction markets for random variables with continuous or countably infinite outcomes on the real line. Our interval betting languages allow tra...
Xi Gao, Yiling Chen, David M. Pennock
INFOCOM
2006
IEEE
14 years 3 months ago
Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
Farinaz Koushanfar, Nina Taft, Miodrag Potkonjak
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 11 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
CSDA
2008
94views more  CSDA 2008»
13 years 10 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst