Anning Yang | Searcharxiv

arXiv2026

Curvature-driven revival of charge density waves in non-Euclidean space

Strongly correlated quantum states, such as charge density waves (CDWs), are exquisitely sensitive to Fermi surface topology and lattice symmetry, and are typically quenched by heavy carrier doping. In two-dimensional (2D) systems, however, macroscopic geometric curvature emerges as a novel structural degree of freedom to modulate microscopic quantum coherence. This raises a compelling physical question: can non-Euclidean geometric deformations compete with extreme electronic perturbations to reshape, or even revive, a quenched macroscopic quantum order? Here, by constructing monolayer TiSe$_2$-NbSe$_2$ heterostructure on a BLG/SiC substrate for the first time, we report the curvature-driven revival of a frustrated charge order in a non-Euclidean space. Low-temperature angle-resolved photoemission spectroscopy (ARPES) reveals a massive interfacial charge transfer, which destroys the global Fermi surface nesting and completely suppresses the long-range CDW order in Euclidean flat regions. Strikingly, high-resolution scanning tunneling microscopy (STM) reveals that a novel, non-linear CDW state miraculously survives, remaining strictly localized within morphologically distorted, non-Euclidean nanoscale curved regions. Atomistic simulations unravel the structural origin of this phenomenon, demonstrating that interfacial twist and lattice mismatch spontaneously generate a corrugated superlattice.

cond-mat.mtrl-sci↗

arXiv2025

Enhancing Unsupervised Feature Selection via Double Sparsity Constrained Optimization

Unsupervised feature selection (UFS) is widely applied in machine learning and pattern recognition. However, most of the existing methods only consider a single sparsity, which makes it difficult to select valuable and discriminative feature subsets from the original high-dimensional feature set. In this paper, we propose a new UFS method called DSCOFS via embedding double sparsity constrained optimization into the classical principal component analysis (PCA) framework. Double sparsity refers to using $\ell_{2,0}$-norm and $\ell_0$-norm to simultaneously constrain variables, by adding the sparsity of different types, to achieve the purpose of improving the accuracy of identifying differential features. The core is that $\ell_{2,0}$-norm can remove irrelevant and redundant features, while $\ell_0$-norm can filter out irregular noisy features, thereby complementing $\ell_{2,0}$-norm to improve discrimination. An effective proximal alternating minimization method is proposed to solve the resulting nonconvex nonsmooth model. Theoretically, we rigorously prove that the sequence generated by our method globally converges to a stationary point. Numerical experiments on three synthetic datasets and eight real-world datasets demonstrate the effectiveness, stability, and convergence of the proposed method. In particular, the average clustering accuracy (ACC) and normalized mutual information (NMI) are improved by at least 3.34% and 3.02%, respectively, compared with the state-of-the-art methods. More importantly, two common statistical tests and a new feature similarity metric verify the advantages of double sparsity. All results suggest that our proposed DSCOFS provides a new perspective for feature selection.

math.OC↗