- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work proposes a formulation of maximum variance unfolding for data sampled from disjoint manifolds. This provides a more flexible formulation of maximum variance unfolding that is faster because it can be run in parallel on different manifolds. This method is verified an many different datasets on computation speed and a variety of standard dimensionality reduction embedding quality metrics.
Critical strengths
The paper is clear and descriptive with a nice recipe-based introduction to the proposed method.
Furthermore, the paper offers extensive experimental validation against a wide variety of baselines.
Critical weaknesses
-
Interesting idea, but would be stronger with some theory backing the algorithms. This would also clarify/ inform critical mathematical decisions in the algorithm design.
-
The paper is missing disjoint-manifold dimensionality reduction baselines.
Questions for authors
- Theoretical backing:
- What kind of data can be embedded faithfully by this method?
- If this embedding doesn’t maximize variance, what optimization problem does it solve on the set of disjoint manifolds?
- L162 Algorithm 1 Are we guaranteed that each of Y_p are mapped to the same space by MVU? If not, how can we measure distances between points in different R^n?
- L198 How do you choose the node to begin the breadth first search? Or do you just assume that the k-nearest neighbors graph results in more than 1 connected component?
- 214 Why do you sample uniformly at random? You could sample from a different distribution. The following sentence sounds like it could be used as an optimization problem that could be solved for optimal representative point sets. “The goal is to choose a sample from each component that both adequately represents its large-scale geometry and that is small enough to keep the component connection step computationally cheap”
- Related works:
- This seems like a valuable related work/ baseline method for embedding data on disjoint manifolds or clustered on one manifold. Isometric Multi-manifold Learning for Feature Extraction by Fan et al.
- L042 Mention other graph-based methods like Laplacian Eigenmaps for Dimensionality Reduction and Data Representation by Belkin et al?
Other questions
- L031 Distinguish between feature extraction vs feature selection in dimensionality reduction
- L067 This is a plot of maximum variance unfolding which is not the algorithm that is proposed in this paper. It seems out of place as a choice for figure 1. Normally figure 1 explains the novel algorithm or workflow. I would expect to see a visual representation of Algorithm 1.