Sciweavers

3624 search results - page 503 / 725
» Learning to learn: From smart machines to intelligent machin...
Sort
View
COLT
2010
Springer
15 years 4 months ago
Nonparametric Bandits with Covariates
We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random cov...
Philippe Rigollet, Assaf Zeevi
ML
2010
ACM
138views Machine Learning» more  ML 2010»
15 years 1 months ago
Mining adversarial patterns via regularized loss minimization
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Wei Liu, Sanjay Chawla
CVPR
2004
IEEE
16 years 8 months ago
Detecting and Reading Text in Natural Scenes
This paper gives an algorithm for detecting and reading text in natural images. The algorithm is intended for use by blind and visually impaired subjects walking through city scen...
Xiangrong Chen, Alan L. Yuille
ICML
2006
IEEE
16 years 7 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...
ICML
2002
IEEE
16 years 7 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison