Sciweavers

4 search results - page 1 / 1
» Approximating Subdifferentials by Random Sampling of Gradien...
Sort
View
MOR
2002
46views more  MOR 2002»
13 years 7 months ago
Approximating Subdifferentials by Random Sampling of Gradients
James V. Burke, Adrian S. Lewis, Michael L. Overto...
CDC
2009
IEEE
150views Control Systems» more  CDC 2009»
14 years 5 days ago
Cooperative adaptive sampling via approximate entropy maximization
— This work deals with a group of mobile sensors sampling a spatiotemporal random field whose mean is unknown and covariance is known up to a scaling parameter. The Bayesian pos...
Rishi Graham, Jorge Cortés
ICANN
2007
Springer
13 years 11 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
ML
2006
ACM
13 years 7 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári