通过积极学习提高 DFT 功能基准测试的可靠性和信心
Javier E Alfonso-Ramos1, Carlo Adamo1, Éric Brémond2
1Ecole Nationale Supérieure de Chimie de Paris, Université PSL, CNRS, i-CLeHS, 75 005 Paris, France.
Journal of chemical theory and computation
|February 2, 2025
概括
积极学习有效地整理了密度函数理论 (DFT) 计算的基准测试数据. 这种方法识别了具有挑战性的化学反应,提高了跨不同化学空间的DFT功能验证的可靠性.
科学领域:
- 计算化学的计算化学
- 量子化学 是一个量子化学.
- 方法开发 方法开发
背景情况:
- 密度函数理论 (DFT) 的计算需要对交换相关函数的可靠验证.
- 当前的DFT基准分析数据集往往没有明确的策略来组装,导致化学偏差和有限的可转移性.
- 改进数据采集过程对于提高DFT方法的准确性和适用性至关重要.
研究的目的:
- 开发一种数据效率高的方法,用于对DFT函数的基准测试数据集进行策划.
- 在现有的验证方法中解决无原则数据汇集的局限性.
- 创建一个更具代表性和具有挑战性的数据集,用于评估环周反应计算.
主要方法:
- 采用积极学习策略来指导新数据点的选择.
- 通过在初始数据集 (BH9) 周围组合反应模板和替代剂来设计化学反应空间.
- 训练了一个代用模型来预测20个DFT函数的激活能量的分歧.
主要成果:
- 确定了导致显著的DFT功能分歧的分子结构.
- 证明了分子结构和功能分歧之间的关系是高度可学习的.
- 在不到100个已获取的反应中实现了趋同,大大增强了数据集.
- 策划了一个新的,更具代表性的环周反应基准测试数据集.
结论:
- 积极学习提供了一种数据效率高的解决方案,用于创建强大的DFT基准测试数据集.
- 开发的方法显著提高了验证数据的质量和代表性.
- 与原始子集相比,精选的数据集显示了DFT功能性能的实质性变化.
更多相关视频
07:31A Computerized Functional Skills Assessment and Training Program Targeting Technology Based Everyday Functional Skills
Published on: February 13, 2020
6.7K
11:29Measuring the Functional Abilities of Children Aged 3-6 Years Old with Observational Methods and Computer Tools
Published on: June 20, 2020
9.0K
相关概念视频
01:15Discrete Fourier Transform
211
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
211
01:10Fast Fourier Transform
258
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
258
02:07Improving Translational Accuracy
2.5K
2.5K
01:20Discrete-Time Fourier Series
213
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
213
01:24Confidence Coefficient
7.5K
The confidence coefficient is also known as the confidence level or degree of confidence. It is the percent expression for the probability, 1-α, that the confidence interval contains the true population parameter assuming that the confidence interval is obtained after sufficient unbiased sampling; for example, if the CL = 90%, then in 90 out of 100 samples the interval estimate will enclose the true population parameter. Here α is the area under the curve, distributed equally under...
7.5K
01:26Discrete-time Fourier transform
257
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
257