180 search results - page 17 / 36 » On the Convergence Rate of Good-Turing Estimators |
COLT
2008
Springer
15 years 13 days ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
CSDA
2007
14 years 10 months ago
2007
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
102
click to vote
BMCBI
2006
14 years 10 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
ICML
2007
IEEE
15 years 11 months ago
2007
IEEE
Intuitively, learning should be easier when the data points lie on a low-dimensional submanifold of the input space. Recently there has been a growing interest in algorithms that ...
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper is devoted to the subspace DoA estimation using a large antennas array when the number of available snapshots is of the same order of magnitude than the number of senso...