1449 search results - page 74 / 290 » Self-Randomized Exponentiation Algorithms |
140
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
169
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...
163
click to vote
JMLR
2010
15 years 26 days ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
164
click to vote
COLT
1992
Springer
15 years 10 months ago
1992
Springer
We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal...
179
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....