412 search results - page 47 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
106
click to vote
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we introduce a new genetic representation -- a splicing/decomposable (S/D) binary encoding, which was proposed based on some theoretical guidance and existing recom...
MMS
2006
14 years 11 months ago
2006
Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important tha...
111
click to vote
JMLR
2010
14 years 6 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
116
click to vote
TSP
2010
14 years 6 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...