arXiv research

A method to visualize multidimensional local subspaces using implicit differentiation.

Axis-aligned subspace clustering generally entails searching through enormous numbers of subspaces (feature combinations) and evaluation of cluster quality within each subspace. In this paper, we tackle the problem of identifying subsets of features with the most significant contribution to the formation of the local n…

New method discovers concepts in hidden feature layers using sparse subspace clustering.

We present a simple and fast geometric method for modeling data by a union of affine subspaces. The method begins by forming a collection of local best-fit affine subspaces, i.e., subspaces approximating the data in local neighborhoods. The correct sizes of the local neighborhoods are determined automatically by the Jo…

A manifold is locally \emph{$k$-fold symmetric}, if for any point and any $k$-dimensional vector subspace tangent to this point there exists a local isometry such that this point is a fixed point and the differential of the isometry restricted to that $k$-dimensional vector subspace is minus the identity. We show that …

We describe a model for capturing the statistical structure of local amplitude and local spatial phase in natural images. The model is based on a recently developed, factorized third-order Boltzmann machine that was shown to be effective at capturing higher-order structure in images by modeling dependencies among squar…

GPS model predicts subspace-valued functions efficiently.

A recent theoretical analysis shows the equivalence between non-negative matrix factorization (NMF) and spectral clustering based approach to subspace clustering. As NMF and many of its variants are essentially linear, we introduce a nonlinear NMF with explicit orthogonality and derive general kernel-based orthogonal m…

The paper improves conditions for unique recovery in homomorphic sensing of subspaces.

Transforms data into separable subspaces for clustering.

Understanding and characterizing the subspaces of adversarial examples aid in studying the robustness of deep neural networks (DNNs) to adversarial perturbations. Very recently, Ma et al. (ICLR 2018) proposed to use local intrinsic dimensionality (LID) in layer-wise hidden representations of DNNs to study adversarial s…

This paper investigates the generalization of Principal Component Analysis (PCA) to Riemannian manifolds. We first propose a new and general type of family of subspaces in manifolds that we call barycentric subspaces. They are implicitly defined as the locus of points which are weighted means of $k+1$ reference points.…

KSS method converges and recovers correct clustering under certain conditions.

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

Paper proposes CLAIR for efficient LLM fine-tuning across clients.

For an infinite cardinal $κ$ let $\ell_2(κ)$ be the linear hull of the standard othonormal base of the Hilbert space $\ell_2(κ)$ of density $κ$. We prove that a non-separable convex subset $X$ of density $κ$ in a locally convex linear metric space if homeomorphic to the space (i) $\ell_2^f(κ)$ if and only if $X$ can be…

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…

A geometric string solution has background fields in overlapping coordinate patches related by diffeomorphisms and gauge transformations, while for a non-geometric background this is generalised to allow transition functions involving duality transformations. Non-geometric string backgrounds arise from T-duals and mirr…

Novel PairNet speeds up ANN training with fast hyperparameter optimization.

Neural network models of early sensory processing typically reduce the dimensionality of streaming input data. Such networks learn the principal subspace, in the sense of principal component analysis (PCA), by adjusting synaptic weights according to activity-dependent learning rules. When derived from a principled cost…

Develops a method for causal inference with noisy confounders.

SBMs learn manifold-like structures by mixing samples with a non-conservative field.

This work presents a fast and non-convex algorithm for robust subspace recovery. The data sets considered include inliers drawn around a low-dimensional subspace of a higher dimensional ambient space, and a possibly large portion of outliers that do not lie nearby this subspace. The proposed algorithm, which we refer t…

A new method reduces high-dimensional parameter spaces for faster numerical tasks.

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…

Proves local bi-integrability of bi-Hamiltonian systems on real smooth manifolds.

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…

Proposes a method for multi-view clustering that considers local structures and feature weights.

Study analyzes perturbations in singular subspaces under random noise.

Rare data in a large-scale database are called outliers that reveal significant information in the real world. The subspace-based outlier detection is regarded as a feasible approach in very high dimensional space. However, the outliers found in subspaces are only part of the true outliers in high dimensional space, in…

GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an incremental algorithm for identifying a subspace of Rn from a sequence of vectors in this subspace, where only a subset of components of each vector is revealed at each iteration. Recent analysis has shown that GROUSE converges locally at an expected linea…

Detects domain shifts in datasets using interpretable feature subspaces.

New examples of austere submanifolds and hypersurfaces with specific curvature properties.

In this paper we analyze and classify the totally geodesic subspaces of finite volume quaternionic hyperbolic orbifolds and their generalizations, locally symmetric orbifolds arising from irreducible lattices in Lie groups of the form $(\mathbf{Sp}_{2n}(\mathbb{R}))^q \times \prod_{i=1}^r \mathbf{Sp}(p_i,n-p_i) \times …

We present a mathematical analysis of a non-convex energy landscape for robust subspace recovery. We prove that an underlying subspace is the only stationary point and local minimizer in a specified neighborhood under a deterministic condition on a dataset. If the deterministic condition is satisfied, we further show t…

New method estimates high-dimensional GoM models efficiently.

Datasets with significant proportions of noisy (incorrect) class labels present challenges for training accurate Deep Neural Networks (DNNs). We propose a new perspective for understanding DNN generalization for such datasets, by investigating the dimensionality of the deep representation subspace of training samples. …

New method solves subspace optimization problems efficiently.

MISA combines multiple datasets for better feature extraction.

DKLM learns adaptive kernels for robust nonlinear subspace clustering.

Proposes methods for local clustering in attributed graphs.

We obtain two in a sense dual to each other results: First, that the capacity dimension of every compact, locally self-similar metric space coincides with the topological dimension, and second, that the asymptotic dimension of a metric space, which is asymptotically similar to its compact subspace coincides with the to…

We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While there is vast literature on heuristics for this kind of problem, such approaches are known to be susceptible to poor initializations and getting…

We study the Dictionary Learning (aka Sparse Coding) problem of obtaining a sparse representation of data points, by learning \emph{dictionary vectors} upon which the data points can be written as sparse linear combinations. We view this problem from a geometry perspective as the spanning set of a subspace arrangement,…

GAME improves matrix completion by considering subgroup-specific latent structures.

We show local rigidity of hyperbolic triangle groups generated by reflections in pairs of $n$-dimensional subspaces of $R^{2n}$ obtained by composition of the geometric representation in $PGL(2, R)$ with the diagonal embeddings into $PGL(2n, R)$ and $PSp^\pm(2n, R)$.

SMAVE optimizes SDR by projecting onto a low-dimensional subspace on a Riemannian manifold.

TMDA aligns subdomain data distribution discrepancies across domains using manifold representations.