Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Is it possible to see gradient function? #587

Open
Samuel-Bachorik opened this issue Jan 7, 2023 · 2 comments
Open

Is it possible to see gradient function? #587

Samuel-Bachorik opened this issue Jan 7, 2023 · 2 comments

Comments

@Samuel-Bachorik
Copy link

Samuel-Bachorik commented Jan 7, 2023

Hi, when I use autograd, it is possible to see its gradient function? Or in other words, it is possible to see derivative of that function? Or is it possible to see computational graph?

For example, I want to see grad_tanh function

import autograd.numpy as np  # Thinly-wrapped numpy
from autograd import grad    # The only autograd function you may ever need

def tanh(x):                 # Define a function
       y = np.exp(-2.0 * x)
       return (1.0 - y) / (1.0 + y)

grad_tanh = grad(tanh)       # Obtain its gradient function

Thank you

@Bornesf
Copy link

Bornesf commented Feb 26, 2023

Have you got the answer? I have the same problem. I need to get the formula of the first derivative of the function

@99991
Copy link

99991 commented Jul 25, 2024

I do not know whether this is possible with autograd, but if your function is simple enough, https://www.matrixcalculus.org/ can give you both the mathematical formula and a Python program to compute the gradient.

Using your function (vector(1) - exp(-2 * x)) ./ (vector(1) + exp(-2 * x)):

Screenshot 2024-07-25 at 10-27-54 Matrix Calculus

I used the Jacobian here since grad only works for scalar-valued functions, but I wanted to show a more general case. You can also select x is a [scalar] from the list on the website to get the gradient for a scalar value.

import autograd.numpy as np
from autograd import jacobian

# Output from https://matrixcalculus.org
def fAndG(x):
    assert isinstance(x, np.ndarray)
    dim = x.shape
    assert len(dim) == 1
    x_rows = dim[0]

    t_0 = np.exp(-(2 * x))
    t_1 = (np.ones(x_rows) + t_0)
    t_2 = (np.ones(x_rows) - t_0)
    functionValue = (t_2 / t_1)
    gradient = ((2 * np.diag((t_0 / t_1))) + (2 * np.diag(((t_2 * t_0) / (t_1 * t_1)))))

    return functionValue, gradient

def tanh(x):
   y = np.exp(-2.0 * x)
   return (1.0 - y) / (1.0 + y)

x = np.array([0.1, 0.2, 0.3])

tanh_x, jacobian_tanh_x = fAndG(x)

# tanh(x) matches
assert np.allclose(tanh_x, tanh(x))

# Jacobian matches
assert np.allclose(jacobian_tanh_x, jacobian(tanh)(x))

You could also visualize the computational graph with Jax, but that is a bit more involved: https://bnikolic.co.uk/blog/python/jax/2020/10/20/jax-outputgraph.html

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants
@99991 @Samuel-Bachorik @Bornesf and others