SearcharxivSearch

arXiv · 1405.5854

Diferenciación Automática Anidada. Un enfoque algebraico

Abstract

En este trabajo se presenta una propuesta para realizar Diferenciación Automática Anidada utilizando cualquier biblioteca de Diferenciación Automática que permita sobrecarga de operadores. Para calcular las derivadas anidadas en una misma evaluación de la función, la cual se asume que sea anal'itica, se trabaja con el modo forward utilizando una nueva estructura llamada SuperAdouble, que garantiza que se aplique correctamente la diferenciación automática y se calculen el valor y la derivada que se requiera. También se presenta un enfoque algebraico de la Diferenciación Automática y en particular del espacio de los SuperAdoubles. This paper proposes a framework to apply Nested Automatic Differentiation using any library of Automatic Differentiation which allows operator overloading. To compute nested derivatives of a function while it is being evaluated, which is assumed to be analytic, a new structure called SuperAdouble is used in the forward mode. This new class guarantees the correct application of Automatic Differentiation to calculate the value and derivative of a function where is required. Also, an Automatic Differentiation algebraic point of view is presented with particular emphasis in Nested Automatic Differentiation.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan Luis Valerdi. 2014-05-22. Diferenciación Automática Anidada. Un enfoque algebraico. https://arxiv.org/abs/1405.5854

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Diversity of EML-type operators

The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific disciplines. However, most authors have focused on the binary EML itself, while numerous similar variants with slightly different properties are now known. This article attempts to close this gap by enumerating and classifying them. We also take this opportunity to clarify common misconceptions related to the EML operator. The principal goal, symbolic regression within an architecture as close as possible to proven neural networks which combine matrix multiplication with a single univariate non-linear activation function, remains beyond reach. Instead, we propose a M\"obius layer, with rational functions replacing matrix operations, and showcase the recently discovered activation function eml(x,1/x), which allows exp(x) and ln(x) to be recovered separately, and hence all elementary functions to be evaluated within a rational generalization of the neural network.

cs.SC

Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery

Every data-driven equation discovery method assumes (implicitly and without verification) that the target system obeys a single governing law ($K{=}1$). Here we show that this assumption is the primary bottleneck limiting scientific discovery in multi-mechanism systems, and introduce Physical Law Ecology, a framework that makes $K^*$ (the number of coexisting independent mechanisms) itself the first quantity to be determined from data. The framework automatically mines a pool of topologically distinct candidate equations, constructs a continuous dominance weight field across parameter space, and discovers analytic evolution laws governing mechanism succession---with optional monotonicity constraints encoding irreversible physics. Across four unrelated systems (elastomer mechanics, pool boiling, galactic dynamics, and droplet evaporation), BIC consistently identifies $K^*{=}3$ independent governing topologies. Applied to 163 SPARC galaxies (3,269 spatially resolved measurements), the framework autonomously recovers three gravitational laws whose coexistence provides evidence against the single-universal-acceleration hypothesis of MOND ($p<10^{-34}$). In engineering applications, multi-law weighted prediction reduces error by 67-72\% over single-equation baselines while retaining full interpretability. By establishing the determination of $K^*$ as the zeroth step of scientific discovery-prior to and independent of equation search---this work opens a direction orthogonal to existing symbolic regression: not finding better equations, but mapping the ecology of mechanisms that govern complex systems.

cs.SC