2011
DOI: 10.1007/978-3-642-23780-5_34
|View full text |Cite
|
Sign up to set email alerts
|

Datum-Wise Classification: A Sequential Approach to Sparsity

Abstract: We propose a novel classification technique whose aim is to select an appropriate representation for each datapoint, in contrast to the usual approach of selecting a representation encompassing the whole dataset. This datum-wise representation is found by using a sparsity inducing empirical risk, which is a relaxation of the standard L 0 regularized risk. The classification problem is modeled as a sequential decision process that sequentially chooses, for each datapoint, which features to use before classifyin… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
29
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(29 citation statements)
references
References 10 publications
0
29
0
Order By: Relevance
“…This motivates the development of a framework in which a controller can select the rankers to be evaluated based on the characteristics of individual queries (Cambazoglu et al 2010). Our future goal here is to model the problem as a Markov decision process, and solve it using standard reinforcement learning techniques (Dulac-Arnold et al 2011;Benbouzid et al 2011Benbouzid et al , 2012a. For the formal description, let X = (x 1 , .…”
Section: Discussionmentioning
confidence: 99%
“…This motivates the development of a framework in which a controller can select the rankers to be evaluated based on the characteristics of individual queries (Cambazoglu et al 2010). Our future goal here is to model the problem as a Markov decision process, and solve it using standard reinforcement learning techniques (Dulac-Arnold et al 2011;Benbouzid et al 2011Benbouzid et al , 2012a. For the formal description, let X = (x 1 , .…”
Section: Discussionmentioning
confidence: 99%
“…We mathematically describe the Markov Decision Process (MDP) with similar notations of [9,17] as follows:…”
Section: Problem Definitionmentioning
confidence: 99%
“…We mathematically describe the Markov Decision Process (MDP) with similar notations of [7,15] as follows:…”
Section: Problem Definitionmentioning
confidence: 99%