Sciweavers

835 search results - page 39 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
NIPS
2003
14 years 9 hour ago
Online Learning of Non-stationary Sequences
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
Claire Monteleoni, Tommi Jaakkola
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 5 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
ESA
2003
Springer
81views Algorithms» more  ESA 2003»
14 years 3 months ago
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting
We consider the transmission of a movie over a broadcast network to support several viewers who start watching at arbitrary times, after a wait of at most twait minutes. A recent a...
Therese C. Biedl, Erik D. Demaine, Alexander Golyn...
WWW
2005
ACM
14 years 11 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
CICLING
2010
Springer
14 years 2 months ago
Adaptive Term Weighting through Stochastic Optimization
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on s...
Michael Granitzer