A self-consistent systematic optimization of range-separated hybrid functionals from first principles

• URL: http://arxiv.org/abs/2205.11250v1
• Date: Wed, 18 May 2022 16:23:37 GMT
• Title: A self-consistent systematic optimization of range-separated hybrid functionals from first principles
• Abstract summary: We represent a self-consistent systematic optimization procedure for the development of optimally tuned (OT) range-separated hybrid (RSH) functionals. We make use of the size-dependency based ansatz i.e., RS parameter, $gamma$, is a functional of density, $rho(mathbfr)$, of which not much is known. It is found that the parameter $gamma_mathrmOT$ can show better performance in predicting properties than conventional respective RSH functionals.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this communication, we represent a self-consistent systematic optimization procedure for the development of optimally tuned (OT) range-separated hybrid (RSH) functionals from \emph{first principles}. This is an offshoot of our recent work, which employed a purely numerical approach for efficient computation of exact exchange contribution in the conventional global hybrid functionals through a range-separated (RS) technique. We make use of the size-dependency based ansatz i.e., RS parameter, $\gamma$, is a functional of density, $\rho(\mathbf{r})$, of which not much is known. To be consistent with this ansatz, a novel procedure is presented that relates the characteristic length of a given system (where $\rho(\mathbf{r})$ exponentially decays to zero) with $\gamma$ self-consistently via a simple mathematical constraint. In practice, $\gamma_{\mathrm{OT}}$ is obtained through an optimization of total energy as follows: $\gamma_{\mathrm{OT}} \equiv \underset{\gamma }{\mathrm{opt}} \ E_{\mathrm{tot},\gamma}$. It is found that the parameter $\gamma_{\mathrm{OT}}$, estimated as above can show better performance in predicting properties (especially from frontier orbital energies) than conventional respective RSH functionals, of a given system. We have examined the nature of highest fractionally occupied orbital from exact piece-wise linearity behavior, which reveals that this approach is sufficient to maintain this condition. A careful statistical analysis then illustrates the viability and suitability of the current approach. All the calculations are done in a Cartesian-grid based pseudopotential (G)KS-DFT framework.

Related papers

• $γ$-weakly $θ$-up-concavity: Linearizable Non-Convex Optimization with Applications to DR-Submodular and OSS Functions [52.031993908548294]
  We introduce and $$-weakly $$-up-concavity, a novel first-orderizing condition that characterizes a broad approximation of such functions.<n>Our framework recovers the optimal coefficient for DR-submodular class and significantly improves existing approximation coefficients.
  arXiv  Detail & Related papers  (2026-02-13T22:34:44Z)
• Exploiting Hankel-Toeplitz Structures for Fast Computation of Kernel Precision Matrices [14.25435308779899]
  Hilbert-space Gaussian Process (HGP) approach offers hyper-independent basis function approximation for speeding up GP inference. In this paper, we lower this dominating computational complexity to $mathcalO(NM)$ with no additional approximations. Our contribution provides a pure speed-up of several existing, widely used, GP approximations, without further approximations.
  arXiv  Detail & Related papers  (2024-08-05T09:45:31Z)
• Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency [53.90687548731265]
  We study optimal procedures for estimating a linear functional based on observational data. For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
  arXiv  Detail & Related papers  (2023-01-16T02:57:37Z)
• Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization [116.89941263390769]
  We consider the smooth convex-concave bilinearly-coupled saddle-point problem, $min_mathbfxmax_mathbfyF(mathbfx) + H(mathbfx,mathbfy)$, where one has access to first-order oracles for $F$, $G$ as well as the bilinear coupling function $H$. We present a emphaccelerated gradient-extragradient (AG-EG) descent-ascent algorithm that combines extragrad
  arXiv  Detail & Related papers  (2022-06-17T06:10:20Z)
• Reducing the Variance of Gaussian Process Hyperparameter Optimization with Preconditioning [54.01682318834995]
  Preconditioning is a highly effective step for any iterative method involving matrix-vector multiplication. We prove that preconditioning has an additional benefit that has been previously unexplored. It simultaneously can reduce variance at essentially negligible cost.
  arXiv  Detail & Related papers  (2021-07-01T06:43:11Z)
• An Online Riemannian PCA for Stochastic Canonical Correlation Analysis [37.8212762083567]
  We present an efficient algorithm (RSG+) for canonical correlation analysis (CCA) using a reparametrization of the projection matrices. While the paper primarily focuses on the formulation and technical analysis of its properties, our experiments show that the empirical behavior on common datasets is quite promising.
  arXiv  Detail & Related papers  (2021-06-08T23:38:29Z)
• Parameter-free Stochastic Optimization of Variationally Coherent Functions [19.468067110814808]
  We design and analyze an algorithm for first-order optimization of a class of functions on $mathbbRdilon. It is the first to achieve both these at the same time.
  arXiv  Detail & Related papers  (2021-01-30T15:05:34Z)
• Finding Global Minima via Kernel Approximations [90.42048080064849]
  We consider the global minimization of smooth functions based solely on function evaluations. In this paper, we consider an approach that jointly models the function to approximate and finds a global minimum.
  arXiv  Detail & Related papers  (2020-12-22T12:59:30Z)
• Interpolating Log-Determinant and Trace of the Powers of Matrix $\mathbf{A} + t \mathbf{B}$ [1.5002438468152661]
  We develop methods for the functions $t mapsto log det left( mathbfA + t mathbfB right)$ and $t mapsto nametraceleft (mathbfA + t mathbfB)p right)$ where the matrices $mathbfA$ and $mathbfB$ are Hermitian and positive (semi) definite and $p$ and $t$ are real variables.
  arXiv  Detail & Related papers  (2020-09-15T23:11:17Z)
• Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension [124.7752517531109]
  We establish a provably efficient reinforcement learning algorithm with general value function approximation. We show that our algorithm achieves a regret bound of $widetildeO(mathrmpoly(dH)sqrtT)$ where $d$ is a complexity measure. Our theory generalizes recent progress on RL with linear value function approximation and does not make explicit assumptions on the model of the environment.
  arXiv  Detail & Related papers  (2020-05-21T17:36:09Z)
• Multi-Scale Zero-Order Optimization of Smooth Functions in an RKHS [19.252319300590653]
  A black-box function $f:mathcalX mapsto mathbbR$ is optimized under the assumption that $f$ is H"older smooth and has bounded norm in the RKHS associated with a given kernel $K$. In this paper, we propose a new algorithm (textttLP-GP-UCB) where the usual GP surrogate model is augmented with Local Polynomial (LP) estimators of the H" smooth parameter $f$.
  arXiv  Detail & Related papers  (2020-05-11T01:55:39Z)
• Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions [84.49087114959872]
  We provide the first non-asymptotic analysis for finding stationary points of nonsmooth, nonsmooth functions. In particular, we study Hadamard semi-differentiable functions, perhaps the largest class of nonsmooth functions.
  arXiv  Detail & Related papers  (2020-02-10T23:23:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.