An Op is a graph object that defines and performs computations in a graph.

It has to define the following methods.


This method is responsible for creating output Variables of a suitable symbolic Type to serve as the outputs of this Op’s application. The Variables found in *inputs must be operated on using Aesara’s symbolic language to compute the symbolic output Variables. This method should put these outputs into an Apply instance, and return the Apply instance.

This method creates an Apply node representing the application of the Op on the inputs provided. If the Op cannot be applied to these inputs, it must raise an appropriate exception.

The inputs of the Apply instance returned by this call must be ordered correctly: a subsequent self.make_node(*apply.inputs) must produce something equivalent to the first apply.

perform(node, inputs, output_storage)#

This method computes the function associated to this Op. node is an Apply node created by the Op’s Op.make_node() method. inputs is a list of references to data to operate on using non-symbolic statements, (i.e., statements in Python, NumPy). output_storage is a list of storage cells where the variables of the computation must be put.

More specifically:

  • node: This is a reference to an Apply node which was previously obtained via the Op.make_node() method. It is typically not used in simple Ops, but it contains symbolic information that could be required for complex Ops.

  • inputs: This is a list of data from which the values stored in output_storage are to be computed using non-symbolic language.

  • output_storage: This is a list of storage cells where the output is to be stored. A storage cell is a one-element list. It is forbidden to change the length of the list(s) contained in output_storage. There is one storage cell for each output of the Op.

    The data put in output_storage must match the type of the symbolic output. This is a situation where the node argument can come in handy.

    A function Mode may allow output_storage elements to persist between evaluations, or it may reset output_storage cells to hold a value of None. It can also pre-allocate some memory for the Op to use. This feature can allow Op.perform() to reuse memory between calls, for example. If there is something preallocated in the output_storage, it will be of the good dtype, but can have the wrong shape and have any stride pattern.

This method must be determined by the inputs. That is to say, if it is evaluated once on inputs A and returned B, then if ever inputs C, equal to A, are presented again, then outputs equal to B must be returned again.

You must be careful about aliasing outputs to inputs, and making modifications to any of the inputs. See Views and inplace operations before writing a Op.perform() implementation that does either of these things.


other is also an Op.

Returning True here is a promise to the rewrite system that the other Op will produce exactly the same graph effects (e.g. from its Op.perform()) as this one, given identical inputs. This means it will produce the same output values, it will destroy the same inputs (same Op.destroy_map), and will alias outputs to the same inputs (same Op.view_map). For more details, see Views and inplace operations.


If you set __props__, this will be automatically generated.


If two Op instances compare equal, then they must return the same hash value.

Equally important, this hash value must not change during the lifetime of self. Op instances should be immutable in this sense.


If you set Op.__props__, this will be automatically generated.

Optional methods or attributes#


Default: Undefined

Must be a tuple. Lists the name of the attributes which influence the computation performed. This will also enable the automatic generation of appropriate __eq__, __hash__ and __str__ methods. Should be set to () if you have no attributes that are relevant to the computation to generate the methods.

New in version 0.7.


Default: None

If this member variable is an integer, then the default implementation of __call__ will return node.outputs[self.default_output], where node was returned by Op.make_node(). Otherwise, the entire list of outputs will be returned, unless it is of length 1, where the single element will be returned by itself.

make_thunk(node, storage_map, compute_map, no_recycling, impl=None)#

This function must return a thunk, that is a zero-arguments function that encapsulates the computation to be performed by this Op on the arguments of the node.

  • nodeApply instance The node for which a thunk is requested.

  • storage_map – dict of lists This maps variables to a one-element lists holding the variable’s current value. The one-element list acts as pointer to the value and allows sharing that “pointer” with other nodes and instances.

  • compute_map – dict of lists This maps variables to one-element lists holding booleans. If the value is 0 then the variable has not been computed and the value should not be considered valid. If the value is 1 the variable has been computed and the value is valid. If the value is 2 the variable has been garbage-collected and is no longer valid, but shouldn’t be required anymore for this call.

  • no_recycling – WRITEME WRITEME

  • impl – None, ‘c’ or ‘py’ Which implementation to use.

The returned function must ensure that is sets the computed variables as computed in the compute_map.

Defining this function removes the requirement for perform() or C code, as you will define the thunk for the computation yourself.

__call__(*inputs, **kwargs)#

By default this is a convenience function which calls make_node() with the supplied arguments and returns the result indexed by default_output. This can be overridden by subclasses to do anything else, but must return either an Aesara Variable or a list of Variables.

If you feel the need to override __call__ to change the graph based on the arguments, you should instead create a function that will use your Op and build the graphs that you want and call that instead of the Op instance directly.

infer_shape(fgraph, node, shapes)#

This function is needed for shape rewrites. shapes is a list with one tuple for each input of the Apply node (which corresponds to the inputs of the Op). Each tuple contains as many elements as the number of dimensions of the corresponding input. The value of each element is the shape (number of items) along the corresponding dimension of that specific input.

While this might sound complicated, it is nothing more than the shape of each input as symbolic variables (one per dimension).

The function should return a list with one tuple for each output. Each tuple should contain the corresponding output’s computed shape.

Implementing this method will allow Aesara to compute the output’s shape without computing the output itself, potentially sparing you a costly recomputation.

flops(inputs, outputs)#

It is only used to have more information printed by the memory profiler. It makes it print the mega flops and giga flops per second for each apply node. It takes as inputs two lists: one for the inputs and one for the outputs. They contain tuples that are the shapes of the corresponding inputs/outputs.


This allows you to specify a more informative string representation of your Op. If an Op has parameters, it is highly recommended to have the __str__ method include the name of the Op and the Op’s parameters’ values.


If you set __props__, this will be automatically generated. You can still override it for custom output.

do_constant_folding(fgraph, node)#

Default: Return True

By default when rewrites are enabled, we remove during function compilation Apply nodes whose inputs are all constants. We replace the Apply node with an Aesara constant variable. This way, the Apply node is not executed at each function call. If you want to force the execution of an Op during the function call, make do_constant_folding return False.

As done in the Alloc Op, you can return False only in some cases by analyzing the graph from the node parameter.

debug_perform(node, inputs, output_storage)#

Undefined by default.

If you define this function then it will be used instead of C code or Op.perform() to do the computation while debugging (currently DebugMode, but others may also use it in the future). It has the same signature and contract as Op.perform().

This enables Ops that cause trouble with DebugMode with their normal behaviour to adopt a different one when run under that mode. If your Op doesn’t have any problems, don’t implement this.

If you want your Op to work with aesara.gradient.grad() you also need to implement the functions described below.


These are the function required to work with aesara.gradient.grad().

grad(inputs, output_gradients)#

If the Op being defined is differentiable, its gradient may be specified symbolically in this method. Both inputs and output_gradients are lists of symbolic Aesara Variables and those must be operated on using Aesara’s symbolic language. The Op.grad() method must return a list containing one Variable for each input. Each returned Variable represents the gradient with respect to that input computed based on the symbolic gradients with respect to each output.

If the output is not differentiable with respect to an input then this method should be defined to return a variable of type NullType for that input. Likewise, if you have not implemented the gradient computation for some input, you may return a variable of type NullType for that input. aesara.gradient contains convenience methods that can construct the variable for you: aesara.gradient.grad_undefined() and aesara.gradient.grad_not_implemented(), respectively.

If an element of output_gradient is of type aesara.gradient.DisconnectedType, it means that the cost is not a function of this output. If any of the Op’s inputs participate in the computation of only disconnected outputs, then Op.grad() should return DisconnectedType variables for those inputs.

If the Op.grad() method is not defined, then Aesara assumes it has been forgotten. Symbolic differentiation will fail on a graph that includes this Op.

It must be understood that the Op.grad() method is not meant to return the gradient of the Op’s output. aesara.grad() computes gradients; Op.grad() is a helper function that computes terms that appear in gradients.

If an Op has a single vector-valued output y and a single vector-valued input x, then the Op.grad() method will be passed x and a second vector z. Define J to be the Jacobian of y with respect to x. The Op.grad() method should return dot(J.T,z). When aesara.grad() calls the Op.grad() method, it will set z to be the gradient of the cost C with respect to y. If this Op is the only Op that acts on x, then dot(J.T,z) is the gradient of C with respect to x. If there are other Ops that act on x, aesara.grad() will have to add up the terms of x’s gradient contributed by the other Op.grad() method.

In practice, an Op’s input and output are rarely implemented as single vectors. Even if an Op’s output consists of a list containing a scalar, a sparse matrix, and a 4D tensor, you can think of these objects as being formed by rearranging a vector. Likewise for the input. In this view, the values computed by the Op.grad() method still represent a Jacobian-vector product.

In practice, it is probably not a good idea to explicitly construct the Jacobian, which might be very large and very sparse. However, the returned value should be equal to the Jacobian-vector product.

So long as you implement this product correctly, you need not understand what aesara.gradient.grad() is doing, but for the curious the mathematical justification is as follows:

In essence, the Op.grad() method must simply implement through symbolic Variables and operations the chain rule of differential calculus. The chain rule is the mathematical procedure that allows one to calculate the total derivative \frac{d C}{d x} of the final scalar symbolic Variable C with respect to a primitive symbolic Variable x found in the list inputs. The Op.grad() method does this using output_gradients which provides the total derivative \frac{d C}{d f} of C with respect to a symbolic Variable that is returned by the Op (this is provided in output_gradients), as well as the knowledge of the total derivative \frac{d f}{d x} of the latter with respect to the primitive Variable (this has to be computed).

In mathematics, the total derivative of a scalar variable C with respect to a vector of scalar variables x, i.e. the gradient, is customarily represented as the row vector of the partial derivatives, whereas the total derivative of a vector of scalar variables f with respect to another x, is customarily represented by the matrix of the partial derivatives, i.e. the Jacobian matrix. In this convenient setting, the chain rule says that the gradient of the final scalar variable C with respect to the primitive scalar variables in x through those in f is simply given by the matrix product: \frac{d C}{d x} = \frac{d C}{d f} * \frac{d f}{d x}.

Here, the chain rule must be implemented in a similar but slightly more complex setting: Aesara provides in the list output_gradients one gradient for each of the Variables returned by the Op. Where f is one such particular Variable, the corresponding gradient found in output_gradients and representing \frac{d C}{d f} is provided with a shape similar to f and thus not necessarily as a row vector of scalars. Furthermore, for each Variable x of the Op’s list of input variables inputs, the returned gradient representing \frac{d C}{d
x} must have a shape similar to that of Variable x.

If the output list of the Op is [f_1, ... f_n], then the list output_gradients is [grad_{f_1}(C), grad_{f_2}(C),
... , grad_{f_n}(C)]. If inputs consists of the list [x_1, ..., x_m], then Op.grad should return the list [grad_{x_1}(C), grad_{x_2}(C), ..., grad_{x_m}(C)], where (grad_{y}(Z))_i = \frac{\partial Z}{\partial y_i} (and i can stand for multiple dimensions).

In other words, Op.grad() does not return \frac{d f_i}{d
x_j}, but instead the appropriate dot product specified by the chain rule: \frac{d C}{d x_j} = \frac{d C}{d f_i} \cdot
\frac{d f_i}{d x_j}. Both the partial differentiation and the multiplication have to be performed by Op.grad().

Aesara currently imposes the following constraints on the values returned by the Op.grad() method:

  1. They must be Variable instances.

  2. When they are types that have dtypes, they must never have an integer dtype.

The output gradients passed to Op.grad() will also obey these constraints.

Integers are a tricky subject. Integers are the main reason for having DisconnectedType, NullType or zero gradient. When you have an integer as an argument to your Op.grad() method, recall the definition of a derivative to help you decide what value to return:

\frac{d f}{d x} = \lim_{\epsilon \rightarrow 0} (f(x+\epsilon)-f(x))/\epsilon.

Suppose your function f has an integer-valued output. For most functions you’re likely to implement in Aesara, this means your gradient should be zero, because f(x+epsilon) = f(x) for almost all x. (The only other option is that the gradient could be undefined, if your function is discontinuous everywhere, like the rational indicator function)

Suppose your function f has an integer-valued input. This is a little trickier, because you need to think about what you mean mathematically when you make a variable integer-valued in Aesara. Most of the time in machine learning we mean “f is a function of a real-valued x, but we are only going to pass in integer-values of x”. In this case, f(x+\epsilon) exists, so the gradient through f should be the same whether x is an integer or a floating point variable. Sometimes what we mean is “f is a function of an integer-valued x, and f is only defined where x is an integer.” Since f(x+\epsilon) doesn’t exist, the gradient is undefined. Finally, many times in Aesara, integer valued inputs don’t actually affect the elements of the output, only its shape.

If your function f has both an integer-valued input and an integer-valued output, then both rules have to be combined:

  • If f is defined at x + \epsilon, then the input gradient is defined. Since f(x+\epsilon) would be equal to f(x) almost everywhere, the gradient should be zero (first rule).

  • If f is only defined where x is an integer, then the gradient is undefined, regardless of what the gradient with respect to the output is.


  1. f(x,y) is a dot product between x and y. x and y are integers. Since the output is also an integer, f is a step function. Its gradient is zero almost everywhere, so Op.grad() should return zeros in the shape of x and y.

  2. f(x,y) is a dot product between x and y. x is floating point and y is an integer. In this case the output is floating point. It doesn’t matter that y is an integer. We consider f to still be defined at f(x,y+\epsilon). The gradient is exactly the same as if y were floating point.

  3. f(x,y) is the argmax of x along axis y. The gradient with respect to y is undefined, because f(x,y) is not defined for floating point y. How could you take an argmax along a fractional axis? The gradient with respect to x is 0, because f(x+\epsilon, y) = f(x) almost everywhere.

  4. f(x,y) is a vector with y elements, each of which taking on the value x The Op.grad() method should return DisconnectedType for y, because the elements of f don’t depend on y. Only the shape of f depends on y. You probably also want to implement a connection_pattern method to encode this.

  5. f(x) = int(x) converts float x into an integer. g(y) = float(y) converts an integer y into a float. If the final cost C = 0.5 *
g(y) = 0.5 g(f(x)), then the gradient with respect to y will be 0.5, even if y is an integer. However, the gradient with respect to x will be 0, because the output of f is integer-valued.


Sometimes needed for proper operation of aesara.gradient.grad().

Returns a list of list of booleans.

Op.connection_pattern[input_idx][output_idx] is true if the elements of inputs[input_idx] have an effect on the elements of outputs[output_idx].

The node parameter is needed to determine the number of inputs. Some Ops such as Subtensor take a variable number of inputs.

If no connection_pattern is specified, aesara.gradient.grad() will assume that all inputs have some elements connected to some elements of all outputs.

This method conveys two pieces of information that are otherwise not part of the Aesara graph:

  1. Which of the Op’s inputs are truly ancestors of each of the Op’s outputs. Suppose an Op has two inputs, x and y, and outputs f(x) and g(y). y is not really an ancestor of f, but it appears to be so in the Aesara graph.

  2. Whether the actual elements of each input/output are relevant to a computation. For example, the shape Op does not read its input’s elements, only its shape metadata. \frac{d shape(x)}{dx} should thus raise a disconnected input exception (if these exceptions are enabled). As another example, the elements of the Alloc Op’s outputs are not affected by the shape arguments to the Alloc Op.

Failing to implement this function for an Op that needs it can result in two types of incorrect behavior:

  1. aesara.gradient.grad() erroneously raising a TypeError reporting that a gradient is undefined.

  2. aesara.gradient.grad() failing to raise a ValueError reporting that an input is disconnected.

Even if connection_pattern is not implemented correctly, if aesara.gradient.grad() returns an expression, that expression will be numerically correct.

R_op(inputs, eval_points)#

Optional, to work with aesara.gradient.R_op().

This function implements the application of the R-operator on the function represented by your Op. Let assume that function is f, with input x, applying the R-operator means computing the Jacobian of f and right-multiplying it by v, the evaluation point, namely: \frac{\partial f}{\partial x} v.

inputs are the symbolic variables corresponding to the value of the input where you want to evaluate the Jacobian, and eval_points are the symbolic variables corresponding to the value you want to right multiply the Jacobian with.

Same conventions as for the Op.grad() method hold. If your Op is not differentiable, you can return None. Note that in contrast to the method Op.grad(), for Op.R_op() you need to return the same number of outputs as there are outputs of the Op. You can think of it in the following terms. You have all your inputs concatenated into a single vector x. You do the same with the evaluation points (which are as many as inputs and of the shame shape) and obtain another vector v. For each output, you reshape it into a vector, compute the Jacobian of that vector with respect to x and multiply it by v. As a last step you reshape each of these vectors you obtained for each outputs (that have the same shape as the outputs) back to their corresponding shapes and return them as the output of the Op.R_op() method.

List of op with r op support.