… We extended the PFP algorithm to a kernel verison, which we called Kernel Polytope Faces
Pursuit (KPFP). We showed the utility of this algorithm by providing a novel generalisation …

… To the best of our knowledge the problem of finding the number of vertices of the latent
polytope has not been studied. The problem of enumerating all the vertices of a polytope, …

… For any face F of a polytope, we define its rank as the length … types of polytopes, started by
Euler and pursued with much … space of vectors orthogonal to the kernel of the projection. (Or, …

… kernel for learning classifiers. This kernel and its variants such as the pyramid match kernel
[16] … solver such as the nonnegative polytope faces pursuit. The complete recognition system …

… the measurement matrix, compressive sampling matching pursuit (CoSaMP) [14], orthogonal
matching pursuit (OMP) [16], basis pursuit (BP) [17] and polytope faces pursuit (PFP) [21] …

… These algorithms are equipped with carefully designed parallel computational kernels in order
… 4.2 Polytope faces pursuit solver The polytope faces pursuit (PFP) algorithm developed in …

… algorithms, such as orthogonal matching pursuit (OMP) and polytope faces pursuit (PFP) [23]…
kernel for learning classifiers. This kernel and its variants such as the pyramid match kernel […

… size regime have been intensively pursued in recent years. Such … that the kernel can be
single crystalline (eg, face-centered … The observed polyhedron-based kernels, such as the M 4 …

… [19] extends the results of [5] to the case where the polytope … collection of polytopes, provided
that the set of face-normals … The kernel of A is the set of all points z ∈ A such that A is star…

… Kernel Basis Pursuit (KBP) [6]. Other classes of sparse methods include greedy methods such
as Kernel Matching Pursuit (… the relative interior faces of the polar polytope. The first step is …