Sciweavers

2040 search results - page 352 / 408
» Approximate Expectation Maximization
Sort
View
191
Voted
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 4 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
BMCBI
2010
158views more  BMCBI 2010»
15 years 3 months ago
Validation of differential gene expression algorithms: Application comparing fold-change estimation to hypothesis testing
Background: Sustained research on the problem of determining which genes are differentially expressed on the basis of microarray data has yielded a plethora of statistical algorit...
Corey M. Yanofsky, David R. Bickel
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 3 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 3 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
SIAMSC
2010
270views more  SIAMSC 2010»
15 years 1 months ago
High Order Numerical Methods to Three Dimensional Delta Function Integrals in Level Set Methods
In this paper we propose a class of high order numerical methods to delta function integrals appearing in level set methods in the three dimensional case by extending the idea for ...
Xin Wen