arXiv research

A new method learns multiple subspaces from data.

Paper proposes a deep subspace clustering method using multi-level representations.

Transforms data into separable subspaces for clustering.

Learning informative representations of data is one of the primary goals of deep learning, but there is still little understanding as to what representations a neural network actually learns. To better understand this, subspace match was recently proposed as a method for assessing the similarity of the representations …

Stochastic Sparse Subspace Clustering improves subspace clustering by reducing over-segmentation through dropout.

This work improves sample efficiency in meta-learning for nonlinear tasks.

Proposes a method to enforce nestedness in subspace learning methods.

Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse representation $x$ such that $b = A x$. It is known that under certain conditions on $A$, $x$ can be re…

LCRSR recovers latent row space for multi-view clustering.

RED-SC improves deep subspace clustering efficiency.

Variational autoencoders (VAEs) are widely used deep generative models capable of learning unsupervised latent representations of data. Such representations are often difficult to interpret or control. We consider the problem of unsupervised learning of features correlated to specific labels in a dataset. We propose a …

New method learns fair representations by separating out protected attributes.

A new framework for graph representation learning.

A new tensor-based method improves multi-dimensional data classification accuracy.

Paper extends ICA to ISA with auxiliary variables for better speech representation learning.

Algorithm removes spurious concepts from neural network representations without harming task performance.

It is a key to construct a similarity graph in graph-oriented subspace learning and clustering. In a similarity graph, each vertex denotes a data point and the edge weight represents the similarity between two points. There are two popular schemes to construct a similarity graph, i.e., pairwise distance based scheme an…

The paper tackles subspace-preserving recovery of sparse signals from overcomplete dictionaries.

The sparse representation classifier (SRC) has been utilized in various classification problems, which makes use of L1 minimization and works well for image recognition satisfying a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC und…

Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension. Spectral clustering, as one of the main approaches to subspace clustering, often takes on a sparse representation or a low-rank represent…

Proposes a tensor Laplacian-based method for better subspace clustering of non-uniformly distributed data.

High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to. Finding sparse representations of data points in a dictionary built using the collection of data helps to uncover low-dimensional subspaces and address problems such as clustering, classification, subset sele…

Proposes Neural Random Subspace for deep learning.

Despite the fact that nonlinear subspace learning techniques (e.g. manifold learning) have successfully applied to data representation, there is still room for improvement in explainability (explicit mapping), generalization (out-of-samples), and cost-effectiveness (linearization). To this end, a novel linearized subsp…

Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the arrangements themselves, and define when a collection of arrangements is "finitely genera…

A novel unsupervised feature selection method using subspace clustering and self-expressive model.

Subspace clustering refers to the task of finding a multi-subspace representation that best fits a collection of points taken from a high-dimensional space. This paper introduces an algorithm inspired by sparse subspace clustering (SSC) [In IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2009) 2790-27…

New method disentangles hidden data structures using HSIC and supervision.

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

In this paper, we introduce a study of prolongations of representations of Lie groups. We obtain a faithful (one-to-one) representation of TG where G is a finite-dimensional Lie group and TG is the tangent bundle of G, by using (not necessarily faithful) representations of G. We show that tangent functions of Lie group…

Unified framework for clustering with sparse convex combinations.

Bayesian SHMM models speech units from unannotated speech.

In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures corresponding to several classes or categories the data belongs to. In this paper, we…

Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.

We study the isotropy representation of real flag manifolds associated to simple Lie algebras that are split real forms of complex simple Lie algebras. For each Dynkin diagram the invariant irreducible subspaces for the compact part of the isotropy subgroup are described. Contrary to the complex flag manifolds the deco…

It is widely believed that learning good representations is one of the main reasons for the success of deep neural networks. Although highly intuitive, there is a lack of theory and systematic approach quantitatively characterizing what representations do deep neural networks learn. In this work, we move a tiny step to…

Orthogonal Matching Pursuit (OMP) plays an important role in data science and its applications such as sparse subspace clustering and image processing. However, the existing OMP-based approaches lack of data adaptiveness so that the data cannot be represented well enough and may lose the accuracy. This paper proposes a…

In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given group. Algebraically, such group-invariant subspaces are also referred to as su…

Efficiently extracts linear dynamics from complex observations.

We propose a neural network for unsupervised anomaly detection with a novel robust subspace recovery layer (RSR layer). This layer seeks to extract the underlying subspace from a latent representation of the given data and removes outliers that lie away from this subspace. It is used within an autoencoder. The encoder …

New framework explains neural network behavior through geometric postulates.

Analyzes word2vec-like models revealing linear subspaces learned during training.

A new method for anomaly detection using random subspaces and Gaussian mixture models.

Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.

Common Representation Learning (CRL), wherein different descriptions (or views) of the data are embedded in a common subspace, is receiving a lot of attention recently. Two popular paradigms here are Canonical Correlation Analysis (CCA) based approaches and Autoencoder (AE) based approaches. CCA based approaches learn …

Feature engineering plays an important role in the success of a machine learning model. Most of the effort in training a model goes into data preparation and choosing the right representation. In this paper, we propose a robust feature engineering method, Randomized Union of Locally Linear Subspaces (RULLS). We generat…

Transfer knowledge from multiple sources to improve matrix completion.

We study representation stability in the sense of Church and Farb of sequences of cohomology groups of complements of arrangements of linear subspaces in real and complex space as $S_n$-modules. We consider arrangement of linear subspaces defined by sets of diagonal equalities $x_i = x_j$ and invariant under the action…