MDDAG: learning deep decision DAGs in a Markov decision process setup - IN2P3 - Institut national de physique nucléaire et de physique des particules Access content directly
Conference Poster Year : 2011

MDDAG: learning deep decision DAGs in a Markov decision process setup

Abstract

In this paper we propose an algorithm that builds sparse decision DAGs (directed acyclic graphs) out of a list of features or base classifiers. The basic idea is to cast the DAG design task as a Markov decision process. Each instance can decide to use or to skip each base classifier, based on the current state of the classifier being built. The result is a sparse decision DAG where the base classifiers are selected in a data-dependent way. The development of algorithm was directly motivated by improving the traditional cascade design in applications where the computational requirements of classifying a test instance are as important as the performance of the classifier itself. Beside outperforming classical cascade designs on benchmark data sets, the algorithm also produces interesting deep structures where similar input data follows the same path in the DAG, and subpaths of increasing length represent features of increasing complexity.
Fichier principal
Vignette du fichier
Benbouzid.pdf (466.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

in2p3-00935607 , version 1 (23-01-2014)

Identifiers

  • HAL Id : in2p3-00935607 , version 1

Cite

D. Benbouzid, Róbert Busa-Fekete, Balázs Kégl. MDDAG: learning deep decision DAGs in a Markov decision process setup. 25th Annual Conference on Neural Information Processing Systems (NIPS 2011), Dec 2011, Granada, Spain. ⟨in2p3-00935607⟩
103 View
95 Download

Share

Gmail Facebook X LinkedIn More