Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality

Research output: Contribution to journalLetterpeer-review

2 Citations (Scopus)
31 Downloads (Pure)


We study a multi-instance (MI) learning dimensionality-reduction algorithm through sparsity and orthogonality, which is especially useful for high-dimensional MI data sets. We develop a novel algorithm to handle both sparsity and orthogonality constraints that existing methods do not handle well simultaneously. Our main idea is to formulate an optimization problem where the sparse term appears in the objective function and the orthogonality term is formed as a constraint. The resulting optimization problem can be solved by using approximate augmented Lagrangian iterations as the outer loop and inertial proximal alternating linearized minimization (iPALM) iterations as the inner loop. The main advantage of this method is that both sparsity and orthogonality can be satisfied in the proposed algorithm. We show the global convergence of the proposed iterative algorithm. We also demonstrate that the proposed algorithm can achieve high sparsity and orthogonality requirements, which are very important for dimensionality reduction. Experimental results on both synthetic and real data sets show that the proposed algorithm can obtain learning performance comparable to that of other testedMI learning algorithms.

Original languageEnglish
Pages (from-to)3281-3308
Number of pages28
JournalNeural Computation
Issue number12
Publication statusPublished - 1 Dec 2018

Scopus Subject Areas

  • Arts and Humanities (miscellaneous)
  • Cognitive Neuroscience


Dive into the research topics of 'Multi-Instance Dimensionality Reduction via Sparsity and Orthogonality'. Together they form a unique fingerprint.

Cite this