关于微分链式法则的计算复杂性
On the Computational Complexity of the Chain Rule of Differential Calculus
摘要:
计算科学和工程中的许多现代数值方法依赖于所研究现象的数学模型的导数。这些导数的计算通常是整体运行时性能的瓶颈。一阶和高阶导数张量需要有效地计算。微分的链式法则是计算复合函数精确导数的基本前提,复合函数执行潜在的非常大量的基本函数评估。基本功能之间的数据流依赖性引起组合优化问题。我们制定{ \sc链规则微分},我们证明它是NP-完全的。指出了研究其近似解的方向。
英文摘要:
Many modern numerical methods in computational science and engineering rely on derivatives of mathematical models for the phenomena under investigation. The computation of these derivatives often represents the bottleneck in terms of overall runtime performance. First and higher derivative tensors need to be evaluated efficiently. The chain rule of differentiation is the fundamental prerequisite for computing accurate derivatives of composite functions which perform a potentially very large number of elemental function evaluations. Data flow dependences amongst the elemental functions give rise to a combinatorial optimization problem. We formulate {\sc Chain Rule Differentiation} and we prove it to be NP-complete. Pointers to research on its approximate solution are given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。