2014 IEEE Conference on Computer Vision and Pattern Recognition 2014
DOI: 10.1109/cvpr.2014.192
|View full text |Cite
|
Sign up to set email alerts
|

Fast and Robust Archetypal Analysis for Representation Learning

Abstract: We revisit a pioneer unsupervised learning technique called archetypal analysis [5], which is related to successful data analysis methods such as sparse coding [18] and non-negative matrix factorization [19]. Since it was proposed, archetypal analysis did not gain a lot of popularity even though it produces more interpretable models than other alternatives. Because no efficient implementation has ever been made publicly available, its application to important scientific problems may have been severely limited.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
79
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 72 publications
(79 citation statements)
references
References 26 publications
0
79
0
Order By: Relevance
“…Note that the L-PET based estimation and the MRI based estimation can both be obtained with different number of levels for common space learning. The optimal values for ω 1 and ω 2 can be efficiently computed using a recently proposed active-set algorithm [32]. …”
Section: Methodsmentioning
confidence: 99%
“…Note that the L-PET based estimation and the MRI based estimation can both be obtained with different number of levels for common space learning. The optimal values for ω 1 and ω 2 can be efficiently computed using a recently proposed active-set algorithm [32]. …”
Section: Methodsmentioning
confidence: 99%
“…The simplex constraints inherently enforces sparseness i.e., only a few of the archetypes in D will contribute to a t [8].…”
Section: Proposed Sparse Convex Sequence Kernel For Badmentioning
confidence: 99%
“…In order to select a suitable subset, we used the Fast Exemplar Selection (FES) algorithm as proposed in [20], which extracts a linearly independent subset of signals which captures the full range of the training dataset. AA is performed using fast implementations provided by SPAMS toolbox [8], where the tolerance of 10 −3 is used as the stopping criteria. For SVM training, Libsvm toolbox [24] is used.…”
Section: B Experimental Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…Archetypal analysis assumes that archetypes are convex combinations of all band points and all band points are approximated in terms of convex combinations of archetypes [49]. Therefore, selecting a proper band subset is then explained as finding archetypes of the minimal convex hull of the high-dimensional band points [50]. The coefficient matrices B and A in Equation (5) are unknown, and that makes the un-convex optimization problem challenging to solve.…”
Section: The Solution Of Ssr Model For Band Selectionmentioning
confidence: 99%