766 search results - page 51 / 154 » Online Variance Minimization |
101
click to vote
ECCC
2007
14 years 11 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
114
click to vote
DEDS
2010
14 years 9 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...
119
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
109
click to vote
ICML
2003
IEEE
16 years 19 days ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
108
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...