Sciweavers

275 search results - page 5 / 55
» Online Stochastic and Robust Optimization
Sort
View
NIPS
2008
13 years 9 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
MP
2008
100views more  MP 2008»
13 years 7 months ago
Selected topics in robust convex optimization
Robust Optimization is a rapidly developing methodology for handling optimization problems affected by non-stochastic "uncertain-butbounded" data perturbations. In this p...
Aharon Ben-Tal, Arkadi Nemirovski
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 11 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ICVGIP
2004
13 years 9 months ago
Robust Segmentation of Unconstrained Online Handwritten Documents
A segmentation algorithm, which can detect different regions of a handwritten document such as text lines, tables and sketches will be extremely useful in a variety of application...
Anoop M. Namboodiri, Anil K. Jain
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis