The paper investigates the energy landscape of the t‑SNE algorithm, highlighting its non‑convexity and the resulting difficulty in understanding its behavior. It demonstrates that for a broad class of t‑SNE‑related energies and symmetric data densities, there exist infinite families of distinct critical points that preserve discrete symmetries in both feature and embedding spaces. These critical configurations explain empirical observations such as topology breaking and spurious clustering, and the authors support their claims with numerical and analytical examples.
By Nakul Haridas, Ryan Murray
arXiv:2609.36692v1 Announce Type: cross
Abstract: Matrix optimizers have emerged as a promising direction, with Muon standing out as a prominent design. Revisiting Muon through its full-Gram represen...
By Zixuan Gong, Zeyu Gan, Jiaye Teng, Yong Liu
arXiv:2605. 11428v2 Announce Type: replace Abstract: Exploratory analysis of high-dimensional data rarely stops at a single embedding.
By Hongmin Li
arXiv:2609.36074v1 Announce Type: new
Abstract: Memory-efficient scaling on clustering problems without sacrificing statistical accuracy is of central interest for large-scale data analysis and machi...
By Peng Xu, Nihar Koganti, Volodymyr Kindratenko, Xiaohui Chen
arXiv:2606. 02887v1 Announce Type: new Abstract: Symmetric nonnegative matrix factorization (Symmetric NMF) approximates a matrix as $WW^T$ with nonnegative rectangular factor $W$.
By Ryan Swart, Johannes Brust
arXiv:2604.02535v2 Announce Type: replace
Abstract: Dimensionality reduction (DR) involves two longstanding trade-offs. First, preserving local neighborhoods can come at the cost of global structure....
By Zeyang Huang, Angelos Chatzimparmpas, Thomas H\"ollt, Takanori Fujiwara
arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.
By Guoqing Zhang, Zhaixin Chen
arXiv:2607. 24518v1 Announce Type: new Abstract: Symmetric non-negative matrix factorization (SymNMF) recovers latent group structure from a dependence matrix, but its dense, quadratic-memory objective has confined prior work to moderate sizes.
By Lavinia Ghita, Dhruv Desai, Jake Goldberg, Roman Yokunda Enzmann
arXiv:2608. 15313v1 Announce Type: cross Abstract: In this paper, we propose SHOPCA (Shape Operator-based Principal Component Analysis), a novel method for unsupervised metric learning and dimensionality reduction that incorporates differential geometric information into the covariance structure of classical PCA.
By Alexandre L. M. Levada
arXiv:2607. 25295v2 Announce Type: replace Abstract: Tensorial multi-view clustering (TMC) has achieved strong performance due to its ability to capture high-order correlations across multiple views.
By Jintian Ji, Xingsu Li, Songhe Feng
arXiv:2606. 04451v1 Announce Type: new Abstract: Neighbor embedding algorithms reveal correlations in high-dimensional data by constructing an equivalent graph representation in a lower-dimensional space.
By Mohammad Tariqul Islam, Jason W. Fleischer
arXiv:2607. 24237v1 Announce Type: new Abstract: Many existing clustering methods are designed based on a set-oriented definition---a cluster is a set of similar points---relying a point-to-point similarity function to find similar points.
By Kai Ming Ting, Kaifeng Zhang, Sanjay Chawla