Publication

Online Policy Adaptation for Ensemble Classifiers

Publications associées (49)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Rollout sampling approximate policy iteration

Christos Dimitrakakis

Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using class ...

2008

Keypoint Signatures for Fast Learning and Recognition

Pascal Fua, Vincent Lepetit, Michael Calonder

Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the training itself is usually relatively slow and performed offline. Although methods hav ...

2008

Principled Detection-by-Classification from Multiple Views

Pascal Fua, François Fleuret, Jérôme Berclaz

Machine-learning based classification techniques have been shown to be effective at detecting objects in complex scenes. However, the final results are often obtained from the alarms produced by the classifiers through a post-processing which typically rel ...

2008

Principled Detection-by-classification from Multiple Views

Pascal Fua, François Fleuret, Jérôme Berclaz

Machine-learning based classification techniques have been shown to be effective at detecting objects in com- plex scenes. However, the final results are often obtained from the alarms produced by the classifiers through a post-processing which typically r ...

2008

Promoting diversity in Gaussian mixture ensembles: an application to signature verification

Jonas Richiardi, Andrzej Drygajlo

Classifiers based on Gaussian mixture models are good performers in many pattern recognition tasks. Unlike decision trees, they can be described as stable classifier: a small change in the sampling of the training set will produce not a large change in the ...

Springer2008

Ensembles for sequence learning

Christos Dimitrakakis

This thesis explores the application of ensemble methods to sequential learning tasks. The focus is on the development and the critical examination of new methods or novel applications of existing methods, with emphasis on supervised and reinforcement lear ...

EPFL2007

Information theoretic combination of classifiers with application to face detection

Julien Meynet

Combining several classifiers has become a very active subdiscipline in the field of pattern recognition. For years, pattern recognition community has focused on seeking optimal learning algorithms able to produce very accurate classifiers. However, empiri ...

EPFL2007

Ensembles for Sequence Learning

Christos Dimitrakakis

École Polytechnique Fédérale de Lausanne2006

Online Policy Adaptation for Ensemble Classifiers

Samy Bengio, Christos Dimitrakakis

Ensemble algorithms can improve the performance of a given learning algorithm through the combination of multiple base classifiers into an ensemble. In this paper, the idea of using an adaptive policy for training and combining the base classifiers is put ...

2004

Boosting HMMs with an application to speech recognition

Samy Bengio, Christos Dimitrakakis

Boosting is a general method for training an ensemble of classifiers with a view to improving performance relative to that of a single classifier. While the original AdaBoost algorithm has been defined for classification tasks, the current work examines it ...

2004