Sciweavers

40 search results - page 4 / 8
» Random Descent
Sort
View
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 3 months ago
A robust continuous-time multi-dithering technique for laser communications using adaptive optics
A robust system architecture to achieve optical coherency free optimization. Several methods that had been proposed in the in multiple-beam free-space laser communication links wit...
Dimitrios N. Loizos, Paul-Peter Sotiriadis, Gert C...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 10 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
ICML
2008
IEEE
14 years 10 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio
ICML
2004
IEEE
14 years 10 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
ATAL
2008
Springer
13 years 11 months ago
Stochastic search methods for nash equilibrium approximation in simulation-based games
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
Yevgeniy Vorobeychik, Michael P. Wellman