arXiv subjects

Ni Zhan

Publications and source records attributed to Ni Zhan.

8 recordsLinked to original sources

arXiv2025

AlgoTune: Can Language Models Speed Up General-Purpose Numerical Programs?

Despite progress in language model (LM) capabilities, evaluations have thus far focused on models' performance on tasks that humans have previously solved, including in programming (Jimenez et al., 2024) and mathematics (Glazer et al., 2024). We therefore propose testing models' ability to design and implement algorithms in an open-ended benchmark: We task LMs with writing code that efficiently solves computationally challenging problems in computer science, physics, and mathematics. Our AlgoTune benchmark consists of 154 coding tasks collected from domain experts and a framework for validating and timing LM-synthesized solution code, which is compared to reference implementations from popular open-source packages. In addition, we develop a baseline LM agent, AlgoTuner, and evaluate its performance across a suite of frontier models. AlgoTuner uses a simple, budgeted loop that edits code, compiles and runs it, profiles performance, verifies correctness on tests, and selects the fastest valid version. AlgoTuner achieves an average 1.72x speedup against our reference solvers, which use libraries such as SciPy, sk-learn and CVXPY. However, we find that current models fail to discover algorithmic innovations, instead preferring surface-level optimizations. We hope that AlgoTune catalyzes the development of LM agents exhibiting creative problem solving beyond state-of-the-art human performance.

cs.SE↗

arXiv2025

Space Group Equivariant Crystal Diffusion

Accelerating inverse design of crystalline materials with generative models has significant implications for a range of technologies. Unlike other atomic systems, 3D crystals are invariant to discrete groups of isometries called the space groups. Crucially, these space group symmetries are known to heavily influence materials properties. We propose SGEquiDiff, a crystal generative model which naturally handles space group constraints with space group invariant likelihoods. SGEquiD-iff consists of an SE(3)-invariant, telescoping discrete sampler of crystal lattices; permutation-invariant, transformer-based autoregressive sampling of Wyckoff positions, elements, and numbers of symmetrically unique atoms; and space group equivariant diffusion of atomic coordinates. We show that space group equivariant vector fields automatically live in the tangent spaces of the Wyckoff positions. SGEquiDiff achieves state-of-the-art performance on standard benchmark datasets as assessed by quantitative proxy metrics and quantum mechanical calculations. Our code is available at https://github.com/rees-c/sgequidiff.

cond-mat.mtrl-sci↗

arXiv2025

Expressivity of determinantal ansatzes for neural network wave functions

Neural network wave functions have shown promise as a way to achieve high accuracy on the many-body quantum problem. These wave functions most commonly use a determinant or sum of determinants to antisymmetrize many-body orbitals which are described by a neural network. In many cases, the wave function is projected onto a fixed-spin state. Such a treatment is allowed for spin-independent operators; however, it cannot be applied to spin-dependent problems, such as Hamiltonians containing spin-orbit interactions. We show that for spin-independent Hamiltonians, a strict upper bound property is obeyed between a traditional Hartree-Fock like determinant, full spinor wave function, the full determinant wave function, and a generalized spinor wave function. The relationship between a spinor wave function and the full determinant arises because the full determinant wave function is the spinor wave function projected onto a fixed-spin, after which antisymmetry is implicitly restored in the spin-independent case. For spin-dependent Hamiltonians, the full determinant wave function is not applicable, because it is not antisymmetric. Numerical experiments on the H$_3$ molecule and two-dimensional homogeneous electron gas confirm the bounds.

cond-mat.str-el↗

arXiv2025

Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger Equation

Incorporating group symmetries into neural networks has been a cornerstone of success in many AI-for-science applications. Diagonal groups of isometries, which describe the invariance under a simultaneous movement of multiple objects, arise naturally in many-body quantum problems. Despite their importance, diagonal groups have received relatively little attention, as they lack a natural choice of invariant maps except in special cases. We study different ways of incorporating diagonal invariance in neural network ansätze trained via variational Monte Carlo methods, and consider specifically data augmentation, group averaging and canonicalization. We show that, contrary to standard ML setups, in-training symmetrization destabilizes training and can lead to worse performance. Our theoretical and numerical results indicate that this unexpected behavior may arise from a unique computational-statistical tradeoff not found in standard ML analyses of symmetrization. Meanwhile, we demonstrate that post hoc averaging is less sensitive to such tradeoffs and emerges as a simple, flexible and effective method for improving neural network solvers.

cs.LG↗

arXiv2025

Revealing the proton slingshot mechanism in solid acid electrolytes through machine learning molecular dynamics

In solid acid solid electrolytes CsH$_2$PO$_4$ and CsHSO$_4$, mechanisms of fast proton conduction have long been debated and attributed to either local proton hopping or polyanion rotation. However, the precise role of polyanion rotation and its interplay with proton hopping remained unclear. Nanosecond-scale molecular dynamics simulations, driven by equivariant neural network force fields, reveal a nuanced proton slingshot mechanism: protons are initially carried by rotating polyanions, followed by O$-$H bond reorientation, and the combined motion enables long-range jumps. This challenges the conventional revolving paddlewheel model and reveals significant independent proton motion that is assisted by limited rotations. Despite structural similarities, we identify qualitative differences in transport mechanisms between CsH$_2$PO$_4$ and CsHSO$_4$, caused by different proton concentrations. CsH$_2$PO$_4$ exhibits two distinct rates of rotational motions with different activation energies, contrasting with CsHSO$_4$'s single-rate behavior. The higher proton concentration in CsH$_2$PO$_4$ correlates with frustrated PO$_4$ polyanion orientations and slower rotations compared to SO$_4$ in CsHSO$_4$. Additionally, we reveal a correlation between O-sharing and proton transport in CsH$_2$PO$_4$, a unique feature due to extra proton per polyanion compared to CsHSO$_4$. Our findings suggest that reducing proton concentration could accelerate rotations and enhance conductivity. This work provides a unified framework for understanding and optimizing ionic mobility in solid-acid compounds, offering new insights into the interplay between proton hopping and disordered dynamics in polyanion rotation.

cond-mat.mtrl-sci↗

arXiv2021

Graphical Models for Financial Time Series and Portfolio Selection

We examine a variety of graphical models to construct optimal portfolios. Graphical models such as PCA-KMeans, autoencoders, dynamic clustering, and structural learning can capture the time varying patterns in the covariance matrix and allow the creation of an optimal and robust portfolio. We compared the resulting portfolios from the different models with baseline methods. In many cases our graphical strategies generated steadily increasing returns with low risk and outgrew the S&P 500 index. This work suggests that graphical models can effectively learn the temporal dependencies in time series data and are proved useful in asset management.

cs.LG↗

arXiv2021

Where does the Stimulus go? Deep Generative Model for Commercial Banking Deposits

This paper examines deposits of individuals ("retail") and large companies ("wholesale") in the U.S. banking industry, and how these deposit types are impacted by macroeconomic factors, such as quantitative easing (QE). Actual data for deposits by holder are unavailable. We use a dataset on banks' financial information and probabilistic generative model to predict industry retail-wholesale deposit split from 2000 to 2020. Our model assumes account balances arise from separate retail and wholesale lognormal distributions and fit parameters of distributions by minimizing error between actual bank metrics and simulated metrics using the model's generative process. We use time-series regression to forward predict retail-wholesale deposits as function of loans, retail loans, and reserve balances at Fed banks. We find increase in reserves (representing QE) increases wholesale but not retail deposits, and increase in loans increase both wholesale and retail deposits evenly. The result shows that QE following the 2008 financial crisis benefited large companies more than average individuals, a relevant finding for economic decision making. In addition, this work benefits bank management strategy by providing forecasting capability for retail-wholesale deposits.

cs.LG↗

arXiv2018

Triplet-based Deep Similarity Learning for Person Re-Identification

In recent years, person re-identification (re-id) catches great attention in both computer vision community and industry. In this paper, we propose a new framework for person re-identification with a triplet-based deep similarity learning using convolutional neural networks (CNNs). The network is trained with triplet input: two of them have the same class labels and the other one is different. It aims to learn the deep feature representation, with which the distance within the same class is decreased, while the distance between the different classes is increased as much as possible. Moreover, we trained the model jointly on six different datasets, which differs from common practice - one model is just trained on one dataset and tested also on the same one. However, the enormous number of possible triplet data among the large number of training samples makes the training impossible. To address this challenge, a double-sampling scheme is proposed to generate triplets of images as effective as possible. The proposed framework is evaluated on several benchmark datasets. The experimental results show that, our method is effective for the task of person re-identification and it is comparable or even outperforms the state-of-the-art methods.

cs.CV↗