Sciweavers

4 search results - page 1 / 1
» Approximating Subdifferentials by Random Sampling of Gradien...
Sort
View
62
Voted
MOR
2002
46views more  MOR 2002»
15 years 13 hour 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»
15 years 5 months 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
15 years 4 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
101
Voted
ML
2006
ACM
15 years 9 days 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