Brief

Researchers have developed a new randomized approximation algorithm for Sparse Principal Component Analysis (SPCA), a technique crucial for dimensionality reduction that is known to be NP-hard. The algorithm leverages a basic Semidefinite Programming (SDP) relaxation to construct both deterministic and randomized sparse solutions, selecting the best among them. This approach offers an approximation ratio bounded by the sparsity constant with high probability, and under certain technical assumptions, an average approximation ratio of O(log d), where d is the number of features. AI

Researchers have developed a new neural network framework designed to predict two-particle reduced density matrices (2-RDMs) with improved accuracy and efficiency. This framework incorporates representability conditions directly into its architecture and loss function, allowing it to operate across different momentum meshes. The approach was applied to study fractional Chern insulators in twisted bilayer MoTe$_2$, where it achieved highly accurate predictions for the 2-RDM and ground-state energy, outperforming traditional semidefinite programming methods in terms of parameter count and energy accuracy. AI