No Arabic abstract
The many-body problem can in general not be solved exactly, and one of the most prominent approximations is to build perturbation expansions. A huge variety of expansions is possible, which differ by the quantity to be expanded, the expansion variable, the starting point, and ideas how to resum or terminate the series. Although much has been discussed and much has been done, some choices were made for historical reasons, in particular, limited computation or storage capacities. The present work aims at examining the justifications for different choices made in different contexts, by comparing ingredients of functionals based on GF s on one side, and on the charge density on the other side. Of particular interest will be the question of how to build an optimal starting point for the approximation of non-local quantities, making use of near- or far-sightedness, and daring to consider models beyond the homogeneous electron gas. This will include the use of connector approximations. We will also discuss why it is a good idea to build functionals of the density.
We present the simplest nuclear energy density functional (NEDF) to date, determined by only 4 significant phenomenological parameters, yet capable of fitting measured nuclear masses with better accuracy than the Bethe-Weizsacker mass formula, while also describing density structures (charge radii, neutron skins etc.) and time-dependent phenomena (induced fission, giant resonances, low energy nuclear collisions, etc.). The 4 significant parameters are necessary to describe bulk nuclear properties (binding energies and charge radii); an additional 2 to 3 parameters have little influence on the bulk nuclear properties, but allow independent control of the density dependence of the symmetry energy and isovector excitations, in particular the Thomas-Reiche-Kuhn sum rule. This Hohenberg-Kohn-style of density functional theory successfully realizes Weizsackers ideas and provides a computationally tractable model for a variety of static nuclear properties and dynamics, from finite nuclei to neutron stars, where it will also provide a new insight into the physics of the r-process, nucleosynthesis, and neutron star crust structure. This new NEDF clearly separates the bulk geometric properties - volume, surface, symmetry, and Coulomb energies which amount to 8MeV per nucleon or up to 2000MeV per nucleus for heavy nuclei - from finer details related to shell effects, pairing, isospin breaking, etc. which contribute at most a few MeV for the entire nucleus. Thus it provides a systematic framework for organizing various contributions to the NEDF. Measured and calculated physical observables - symmetry and saturation properties, the neutron matter equation of state, and the frequency of giant dipole resonances - lead directly to new terms not considered in current NEDF parameterizations.
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm whose output does not depend too heavily on any one input or specific training example? More precisely, we investigate learning algorithms that satisfy differential privacy, a notion that provides strong confidentiality guarantees in contexts where aggregate information is released about a database containing sensitive information about individuals. We demonstrate that, ignoring computational constraints, it is possible to privately agnostically learn any concept class using a sample size approximately logarithmic in the cardinality of the concept class. Therefore, almost anything learnable is learnable privately: specifically, if a concept class is learnable by a (non-private) algorithm with polynomial sample complexity and output size, then it can be learned privately using a polynomial number of samples. We also present a computationally efficient private PAC learner for the class of parity functions. Local (or randomized response) algorithms are a practical class of private algorithms that have received extensive investigation. We provide a precise characterization of local private learning algorithms. We show that a concept class is learnable by a local algorithm if and only if it is learnable in the statistical query (SQ) model. Finally, we present a separation between the power of interactive and noninteractive local learning algorithms.
Empirical fitting of parameters in approximate density functionals is common. Such fits conflate errors in the self-consistent density with errors in the energy functional, but density-corrected DFT (DC-DFT) separates these two. We illustrate with catastrophic failures of a toy functional applied to $H_2^+$ at varying bond lengths, where the standard fitting procedure misses the exact functional; Grimmes D3 fit to noncovalent interactions, which can be contaminated by large density errors such as in the WATER27 and B30 datasets; and double-hybrids trained on self-consistent densities, which can perform poorly on systems with density-driven errors. In these cases, more accurate results are found at no additional cost, by using Hartree-Fock (HF) densities instead of self-consistent densities. For binding energies of small water clusters, errors are greatly reduced. Range-separated hybrids with 100% HF at large distances suffer much less from this effect.
The nonlocal correlation energy in the van der Waals density functional (vdW-DF) method [Phys. Rev. Lett. 92, 246401 (2004); Phys. Rev. B 76, 125112 (2007); Phys. Rev. B 89, 035412 (2014)] can be interpreted in terms of a coupling of zero-point energies of characteristic modes of semilocal exchange-correlation (xc) holes. These xc holes reflect the internal functional in the framework of the vdW-DF method [Phys. Rev. B 82, 081101(2010)]. We explore the internal xc hole components, showing that they share properties with those of the generalized-gradient approximation. We use these results to illustrate the nonlocality in the vdW-DF description and analyze the vdW-DF formulation of nonlocal correlation.
Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accurate energies are achieved. Accurate {em constrained optimal densities} are found via a modified Euler-Lagrange constrained minimization of the total energy. A projected gradient descent algorithm is derived using local principal component analysis. Additionally, a sparse grid representation of the density can be used without degrading the performance of the methods. The implications for machine-learned density functional approximations are discussed.