Sciweavers

28 search results - page 6 / 6
» colt 2003
Sort
View
COLT
2005
Springer
13 years 10 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
JCSS
2006
77views more  JCSS 2006»
13 years 4 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
ML
2008
ACM
13 years 4 months ago
A linear fit gets the correct monotonicity directions
Let f be a function on Rd that is monotonic in every variable. There are 2d possible assignments to the directions of monotonicity (two per variable). We provide sufficient condit...
Malik Magdon-Ismail, Joseph Sill