Skip to main content
Artificial Intelligence

Large-scale semidefinite programming with graphics processing units.

| Source: Proceedings of the National Academy of Sciences of the United States of America

Semidefinite programming (SDP) provides a powerful framework in applied mathematics with applications spanning optimization, machine learning, quantum computing, and beyond. However, the computational cost of solving large-scale SDP problems remains a significant practical limitation. We break this long-standing computational bottleneck through a synergistic codesign of low-rank algorithms and graphics processing unit (GPU) architectures, developing accelerated first-order methods that leverage

Semidefinite programming (SDP) provides a powerful framework in applied mathematics with applications spanning optimization, machine learning, quantum computing, and beyond. However, the computational cost of solving large-scale SDP problems remains a significant practical limitation. We break this long-standing computational bottleneck through a synergistic codesign of low-rank algorithms and graphics processing unit (GPU) architectures, developing accelerated first-order methods that leverage both algorithmic innovations and hardware-aware implementation to achieve up to 4 orders of magnitude improvements in speed and scalability for large-scale SDPs with sparse and low-rank structure, thereby opening frontiers in large-scale scientific computing. Our solver, GPU-accelerated Low-Rank Alternating Direction Method of Multipliers Splitting (cuLoRADS), exemplifies this approach, combining the Burer-Monteiro method with a splitting scheme to efficiently solve massive-scale SDPs. Specifically, it can solve a set of MaxCut problems whose matrix variables have dimensions of [Formula: see text] in 10 s to 1 min each on an NVIDIA H100 GPU with 80 GB of memory, whereas previously reported central processing unit solvers required dozens of hours. Additionally, cuLoRADS shows exceptional scalability by solving 1) a MaxCut problem with a [Formula: see text] matrix variable and 2) a Minimum-Rank Matrix Completion problem with a [Formula: see text] million [Formula: see text] 20 million matrix variable and approximately [Formula: see text] million constraints, both in a matter of minutes. It also resolves a long-standing SDP computational barrier in the quantum ordered search problem, which had remained unsolved for 18 y.

Read the original source →

Related Stories

Artificial Intelligence

Plant fiber exploitation contributed to the emergence of ground-edged cutting tools in North China.

Ground-edged cutting tools are widely regarded as technological hallmarks of early agriculture in North China, commonly hypothesized to have been developed primarily for cereal harvesting. Yet the functional foundations of this innovation remain insufficiently tested. This study integrates use-wear and microfossil analyses of 140 stone tools from the Peiligang site, with experimental data, to reassess their roles within long-term trajectories of technological change from the Late Paleolithic to

Continue reading
Artificial Intelligence

Transient chaos in the self-organization of dissipative optical solitons.

Transient chaos is a hallmark of complex dynamics in nonlinear systems. Governed by chaotic saddles, it manifests as short-lived yet rich chaotic behavior preceding an abrupt transition to a stable attractor. However, real-time capture and quantitative characterization of such inherently unpredictable and nonrepetitive dynamics remain challenging, obscuring their physical origins. Here, we experimentally demonstrate transient chaos during the self-organization of dissipative optical solitons in

Continue reading
Artificial Intelligence

Neural network-augmented Pfaffian wave-functions for scalable simulations of interacting fermions.

Developing accurate numerical methods for strongly interacting fermions is crucial for improving our understanding of various quantum many-body phenomena, especially unconventional superconductivity. Recently, neural quantum states have emerged as a promising approach for studying correlated fermions, highlighted by the hidden fermion and backflow methods, which use neural networks to model corrections to fermionic quasiparticle orbitals. In this work, we expand these ideas to the space of Pfaff

Continue reading
Artificial Intelligence

Why friends in common reveal network stars.

The Friendship Paradox states that, on average, your friends have more friends than you do. We extend this to common friends-those who appear in multiple people's friend lists. We show that the more people who share a common friend, the more connected that person tends to be, and we derive an expression quantifying this progression. In a regional Facebook network, a common friend to three randomly sampled individuals has on average more friends than 99.9% of the network. In a citation network, a

Continue reading
Artificial Intelligence

Sensory context improves language prediction in humans and LLMs.

Language is a fundamental human capacity. Large language models (LLMs) have presented the first viable model of language outside of humans, yet how these models learn and use language differs significantly from humans. Here, we compare LLMs and humans predicting language with varying levels of sensory information-from disembodied written text to audiovisual videos of speakers-to demonstrate that, in both humans and LLMs, sensory context is critical for optimal performance. We asked human partici

Continue reading