Sciweavers

509 search results - page 56 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
NIPS
2008
15 years 3 months ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
COLT
2006
Springer
15 years 6 months ago
Unifying Divergence Minimization and Statistical Inference Via Convex Duality
Abstract. In this paper we unify divergence minimization and statistical inference by means of convex duality. In the process of doing so, we prove that the dual of approximate max...
Yasemin Altun, Alexander J. Smola
ESANN
2003
15 years 3 months ago
Approximately unbiased estimation of conditional variance in heteroscedastic kernel ridge regression
In this paper we extend a form of kernel ridge regression for data characterised by a heteroscedastic noise process (introduced in Foxall et al. [1]) in order to provide approxima...
Gavin C. Cawley, Nicola L. C. Talbot, Robert J. Fo...
AIIA
2007
Springer
15 years 8 months ago
Reinforcement Learning in Complex Environments Through Multiple Adaptive Partitions
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...
Andrea Bonarini, Alessandro Lazaric, Marcello Rest...
ECCV
2010
Springer
15 years 4 months ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...