SearcharxivSearch

arXiv subjects

Cannada A. Lewis

Publications and source records attributed to Cannada A. Lewis.

5 recordsLinked to original sources

Amortized Planning with Large-Scale Transformers: A Case Study on Chess

This paper uses chess, a landmark planning problem in AI, to assess transformers' performance on a planning task where memorization is futile $\unicode{x2013}$ even at a large scale. To this end, we release ChessBench, a large-scale benchmark dataset of 10 million chess games with legal move and value annotations (15 billion data points) provided by Stockfish 16, the state-of-the-art chess engine. We train transformers with up to 270 million parameters on ChessBench via supervised learning and perform extensive ablations to assess the impact of dataset size, model size, architecture type, and different prediction targets (state-values, action-values, and behavioral cloning). Our largest models learn to predict action-values for novel boards quite accurately, implying highly non-trivial generalization. Despite performing no explicit search, our resulting chess policy solves challenging chess puzzles and achieves a surprisingly strong Lichess blitz Elo of 2895 against humans (grandmaster level). We also compare to Leela Chess Zero and AlphaZero (trained without supervision via self-play) with and without search. We show that, although a remarkably good approximation of Stockfish's search-based algorithm can be distilled into large-scale transformers via supervised learning, perfect distillation is still beyond reach, thus making ChessBench well-suited for future research.

cs.LG

Efficient Evaluation of Exact Exchange for Periodic Systems via Concentric Atomic Density Fitting

The evaluation of exact (Hartree--Fock, HF) exchange operator is a crucial ingredient for the accurate description of electronic structure in periodic systems through ab initio and hybrid density functional approaches. An efficient formulation of periodic HF exchange in LCAO representation presented here is based on the concentric atomic density fitting (CADF) approximation, a domain-free local density fitting approach in which the product of two atomic orbitals (AOs) is approximated using a linear combination of fitting basis functions centered at the same nuclei as the AOs in that product. Significant reduction in the computational cost of exact exchange is demonstrated relative to the conventional approach due to avoiding the need to evaluate four-center two-electron integrals, with sub-millihartree/atom errors in absolute Hartree-Fock energies and good cancellation of fitting errors in relative energies. Novel aspects of the evaluation of the Coulomb contribution to the Fock operator, such as the use of real two-center multipole expansions and spheropole-compensated unit cell densities are also described.

physics.chem-ph

Optimized pair natural orbitals for the coupled cluster methods

We present the coupled-cluster singles and doubles method formulated in terms of truncated pair-natural orbitals (PNO) that are optimized to minimize the effect of truncation. Compared to the standard ground-state PNO coupled-cluster approaches, in which truncated PNOs derived from first-order Møller-Plesset (MP1) amplitudes are used to compress the CC wave operator, the iteratively-optimized PNOs ("iPNOs") offer moderate improvement for small PNO ranks but rapidly increase their effectiveness for large PNO ranks. The error introduced by PNO truncation in the CCSD energy is reduced by orders of magnitude in the asymptotic regime, with an insignificant increase in PNO ranks. The effect of PNO optimization is particularly effective when combined with Neese's perturbative correction for the PNO incompleteness of the CCSD energy. The use of the perturbative correction in combination with the PNO optimization procedure seems to produce the most precise approximation to the canonical CCSD energies for small and large PNO ranks. For the standard benchmark set of noncovalent binding energies remarkable improvements with respect to standard PNO approach range from a factor of 3 with PNO truncation threshold $τ_\text{PNO}=10^{-6}$ (with the maximum PNO truncation error in the binding energy of only 0.1 kcal/mol) to more than 2 orders of magnitude with $τ_\text{PNO}=10^{-9}$.

physics.chem-ph

Scalable Task-Based Algorithm for Multiplication of Block-Rank-Sparse Matrices

A task-based formulation of Scalable Universal Matrix Multiplication Algorithm (SUMMA), a popular algorithm for matrix multiplication (MM), is applied to the multiplication of hierarchy-free, rank-structured matrices that appear in the domain of quantum chemistry (QC). The novel features of our formulation are: (1) concurrent scheduling of multiple SUMMA iterations, and (2) fine-grained task-based composition. These features make it tolerant of the load imbalance due to the irregular matrix structure and eliminate all artifactual sources of global synchronization.Scalability of iterative computation of square-root inverse of block-rank-sparse QC matrices is demonstrated; for full-rank (dense) matrices the performance of our SUMMA formulation usually exceeds that of the state-of-the-art dense MM implementations (ScaLAPACK and Cyclops Tensor Framework).

cs.DC

Clustered Low-Rank Tensor Format: Introduction and Application to Fast Construction of Hartree-Fock Exchange

Clustered Low Rank (CLR) framework for block-sparse and block-low-rank tensor representation and computation is described. The CLR framework depends on 2 parameters that control precision: one controlling the CLR block rank truncation and another that controls screening of small contributions in arithmetic operations on CLR tensors. As these parameters approach zero CLR representation and arithmetic become exact. There are no other ad-hoc heuristics, such as domains. Use of the CLR format for the order-2 and order-3 tensors that appear in the context of density fitting (DF) evaluation of the Hartree-Fock (exact) exchange significantly reduced the storage and computational complexities below their standard $\mathcal{O}(N^3)$ and $\mathcal{O}(N^4)$ figures. Even for relatively small systems and realistic basis sets CLR-based DF HF becomes more efficient than the standard DF approach, and significantly more efficient than the conventional non-DF HF, while negligibly affecting molecular energies and properties.

physics.chem-ph