Sciweavers

613 search results - page 26 / 123
» Some Observations on Holographic Algorithms
Sort
View
SIAMCO
2002
71views more  SIAMCO 2002»
13 years 7 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
AAAI
2007
13 years 10 months ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...
NIPS
2007
13 years 9 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
ICC
2007
IEEE
14 years 2 months ago
Weighted Fairness in Resilient Packet Rings
— The IEEE 802.17 is a standardized ring topology network architecture, called the Resilient Packet Ring (RPR), to be used mainly in metropolitan and wide area networks. This pap...
Mete Yilmaz, Nirwan Ansari
ALT
2005
Springer
14 years 4 months ago
An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
Adam Kowalczyk, Olivier Chapelle