user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: UNSUPERVISED METRIC LEARNING VIA NONLINEAR FEATURE SPACE TRANSFORMATIONS

Paper content:
In this paper, we propose a nonlinear unsupervised metric learning framework to boost of the performance of clustering algorithms.
Under our framework, nonlinear distance metric learning and manifold embedding are integrated and conducted simultaneously to increase the natural separations among data samples.
The metric learning component is implemented through feature space transformations, regulated by a nonlinear deformable model called Coherent Point Drifting (CPD).
Driven by CPD, data points can get to a higher level of linear separability, which is subsequently picked up by the manifold embedding component to generate well-separable sample projections for clustering.
Experimental results on synthetic and benchmark datasets show the effectiveness of our proposed approach over the state-of-the-art solutions in unsupervised metric learning.
Cluster analysis has broad applications in various disciplines.
Grouping data samples into categories with similar features is an efficient way to summarize the data for further processing.
In measuring the similarities among data samples, the Euclidean distance is the most common choice in clustering algorithms.
Under Euclidean distance, feature components are assigned with the same weight, which essentially assumes all features are equally important across the entire data space.
In practice, such setup is often not optimal.
Learning a customized metric function from the data samples can usually boost the performance of various machine learning algorithms BID1 .
While metric learning has been extensively researched under supervised BID19 BID18 BID17 BID14 and semi-supervised settings BID15 BID3 BID23 BID13 , unsupervised metric learning (UML) remains a challenge, in part due to the absence of ground-truth label information to define a learning optimality.
In this paper, we focus on the problem of UML for clustering.As the goal of clustering is to capture the natural separations among data samples, one common practice in the existing UML solutions is to increase the data separability and make the separations more identifiable for the ensuing clustering algorithm.
Such separability gain can be achieved by projecting data samples onto a carefully chosen low-dimensional manifold, where geometric relationships, such as the pairwise distances, are preserved.
The projections can be carried out linearly, as through the Principle Component Analysis, or nonlinearly, as via manifold learning solutions.
Under the dimension-reduced space, clustering algorithms, such as K-means, can then be applied.Recent years have seen the developments of UML solutions exploring different setups for the lowdimensional manifolds.
FME ) relies on the learning of an optimum linear regression function to specify the target low-dimensional space.
BID0 model local sample densities of the data to estimate a new metric space, and use the learned metric as the basis to construct graphs for manifold learning.
Application-specific manifolds, such as Grassmann space BID6 and Wasserstein geometry BID16 , have also been studied.
When utilized as a separate preprocessing step, dimensionality reduction UML solutions are commonly designed without considering the ensuing clustering algorithm and therefore cannot be fine-tuned accordingly.AML takes a different approach, performing clustering and distance metric learning simultaneously.
The joint learning under AML is formulated as a trace maximization problem, and numerically solved through an EM-like iterative procedure, where each iteration consists of a data projection step, followed by a clustering step via kernel K-means.
The projection is parameterized by an orthogonal, dimension-reducing matrix.
A kernelized extension of AML was proposed in BID2 .
As the projection models are built on linear transformations, their capabilities to deal with complex nonlinear structures are limited.
UML solutions performing under the original input space have also been proposed.
SSO BID7 learns a global similarity metric through a diffusion procedure that propagates smooth metrics through the data space.
CPCM BID4 relies on the ratio of within cluster variance over the total data variance to obtain a linear transformation, aiming to improved data separability.
As the original spaces are usually high-dimensional, UML solutions in this category tend to suffer from the local minima problem.In light of the aforementioned limitations and drawbacks, we propose a new nonlinear UML framework in this paper.
Our solution integrates nonlinear feature transformation and manifold embedding together to improve the data separability for K-means clustering.
Our model can be regarded as a fully nonlinear generalization of AML, in which the transformation model is upgraded to a geometric model called Coherent Point Drifting (CPD) BID8 .
Data points are driven by CPD to reach a higher level of linear separability, which will be subsequently picked up by the manifold embedding component to generate well-separable sample projections.
At the end, K-means is applied on the transformed, dimension-reduced embeddings to produce label predictions.
The choice of CPD is with the consideration of its capability of generating high-order yet smooth transformations.
The main contributions of this paper include the following.•
Our proposed fully nonlinear UML solution enhances data separability through the combination of CPD-driven deformation and spectral embeddings.•
To the best of our knowledge, this is the first work that utilizes dense, spatial varying deformations in unsupervised metric learning.•
The CPD optimization has a closed-form solution, therefore can be efficiently computed.•
Our model outperforms state-of-the-art UML methods on six benchmark databases, indicating promising performance in many real-world applications.The rest of this paper is organized as follows. Section
2 describes our proposed method in detail. It includes
the description of CPD model, formulation of our CPD based UML, optimization strategy and the approach to kernelize our model. Experimental
results are presented in Section 3 to validate our solutions with both synthetic and real-world datasets. Section 4 concludes
this paper.
The proposed CPD-UML model learns a nonlinear metric and the clusters for the given data simultaneously.
The nonlinear metric is achieved by a globally smooth nonlinear transformation, which improves the separability of given data during clustering.
CPD is used as the transformation model because of its capability in deforming feature space in sophisticated yet smooth manner.
Evaluations on synthetic and benchmark datasets demonstrate the effectiveness of our approach.
Applying the proposed approach to other computer vision and machine learning problems are in the direction of our future research.

assistant: text: a nonlinear unsupervised metric learning framework to boost the performance of clustering algorithms.