Sciweavers

236 search results - page 26 / 48
» Bias and Variance Approximation in Value Function Estimates
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
GRAPP
2007
13 years 10 months ago
Fitting 3D morphable models using implicit representations
We consider the problem of approximating the 3D scan of a real object through an affine combination of examples. Common approaches depend either on the explicit estimation of poi...
Curzio Basso, Alessandro Verri
WSC
2004
13 years 10 months ago
Retrospective Approximation Algorithms for the Multidimensional Stochastic Root-Finding Problem
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
Raghu Pasupathy, Bruce W. Schmeiser
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 10 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson
CDC
2009
IEEE
128views Control Systems» more  CDC 2009»
14 years 18 days ago
The entropy penalized minimum energy estimator
This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...
Sergio Daniel Pequito, A. Pedro Aguiar, Diogo A. G...