138 search results - page 24 / 28 » Entropy Numbers of Linear Function Classes |
APPROX
2005
Springer
15 years 4 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
175
click to vote
ICDE
2008
IEEE
16 years 19 days ago
2008
IEEE
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
123
click to vote
LICS
1998
IEEE
15 years 2 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
118
click to vote
CDC
2008
IEEE
14 years 11 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...