Maximum Entropy Linear Manifold for Learning Discriminative Low-dimensional Representation

2015-04-10 · Wojciech Marian Czarnecki, Rafał Józefowicz, Jacek Tabor

Representation learning is currently a very hot topic in modern machine learning, mostly due to the great success of the deep learning methods. In particular low-dimensional representation which discriminates classes can not only enhance the classification procedure, but also make it faster, while contrary to the high-dimensional embeddings can be efficiently used for visual based exploratory data analysis. In this paper we propose Maximum Entropy Linear Manifold (MELM), a multidimensional generalization of Multithreshold Entropy Linear Classifier model which is able to find a low-dimensional linear data projection maximizing discriminativeness of projected classes. As a result we obtain a linear embedding which can be used for classification, class aware dimensionality reduction and data visualization. MELM provides highly discriminative 2D projections of the data which can be used as a method for constructing robust classifiers. We provide both empirical evaluation as well as some interesting theoretical properties of our objective function such us scale and affine transformation invariance, connections with PCA and bounding of the expected balanced accuracy error.

📄 PDF Abstract BibTeX arXiv:1504.02622

Code (0)

등록된 구현이 없습니다.

Tasks

Data VisualizationDimensionality Reduction General Classification Representation Learning

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Dimensionality Reduction on SPD Manifolds: The Emergence of Geometry-Aware Methods

2016-05-20 · Mehrtash Harandi, Mathieu Salzmann, Richard Hartley

Representing images and videos with Symmetric Positive Definite (SPD) matrices, and considering the Riemannian geometry of the resulting space, has been shown to yield high discriminative power in many visual recognition…

Dimensionality Reduction

From Manifold to Manifold: Geometry-Aware Dimensionality Reduction for SPD Matrices

2014-07-04 · Mehrtash T. Harandi, Mathieu Salzmann, Richard Hartley

Representing images and videos with Symmetric Positive Definite (SPD) matrices and considering the Riemannian geometry of the resulting space has proven beneficial for many recognition tasks. Unfortunately, computation o…

Dimensionality Reduction

Dimensionality Reduction on Grassmannian via Riemannian Optimization: A Generalized Perspective

2017-11-17 · Tianci Liu, Zelin Shi, Yun-Peng Liu

This paper proposes a generalized framework with joint normalization which learns lower-dimensional subspaces with maximum discriminative power by making use of the Riemannian geometry. In particular, we model the simila…

Dimensionality Reduction Riemannian optimization

Latent Space Non-Linear Statistics

2018-05-19 · Line Kuhnel, Tom Fletcher, Sarang Joshi, Stefan Sommer

Given data, deep generative models, such as variational autoencoders (VAE) and generative adversarial networks (GAN), train a lower dimensional latent representation of the data space. The linear Euclidean geometry of da…

Generative Maximum Entropy Learning for Multiclass Classification

2012-05-03 · Ambedkar Dukkipati, Gaurav Pandey, Debarghya Ghoshdastidar, Paramita Koley 외

Maximum entropy approach to classification is very well studied in applied statistics and machine learning and almost all the methods that exists in literature are discriminative in nature. In this paper, we introduce a …

Binary Classification Classification feature selection General Classification