Sciweavers

548 search results - page 43 / 110
» Optimization of Convex Risk Functions
Sort
View
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
15 years 6 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
CDC
2010
IEEE
215views Control Systems» more  CDC 2010»
15 years 1 months ago
Consensus with robustness to outliers via distributed optimization
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
Jixin Li, Ehsan Elhamifar, I.-Jeng Wang, Ren&eacut...
ECML
2007
Springer
16 years 5 days ago
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
Mark Schmidt, Glenn Fung, Rómer Rosales
CIMAGING
2010
202views Hardware» more  CIMAGING 2010»
15 years 7 months ago
An optimal algorithm for reconstructing images from binary measurements
We have studied a camera with a very large number of binary pixels referred to as the gigavision camera [1] or the gigapixel digital film camera [2, 3]. Potential advantages of th...
Feng Yang, Yue M. Lu, Luciano Sbaiz, Martin Vetter...
NIPS
2001
15 years 7 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...