class_docstr: Maps unconstrained R^n to R^n in ascending order.
  
  Both the domain and the codomain of the mapping is `[-inf, inf]^n`, however,
  the input of the inverse mapping must be strictly increasing.
  
  On the last dimension of the tensor, the Ascending bijector performs:
  `y = tf.cumsum([x[0], tf.exp(x[1]), tf.exp(x[2]), ..., tf.exp(x[-1])])`
  
  #### Example Use:
  
  ```python
  bijectors.Ascending().inverse([2, 3, 4])
  # Result: [2., 0., 0.]
  
  bijectors.Ascending().forward([0.06428002, -1.07774478, -0.71530371])
  # Result: [0.06428002, 0.40464228, 0.8936858]
  ```
code: def _inverse(self, y):
      with tf.control_dependencies(self._assertions(y)):
          x0 = y[..., :1]
          xk = tf.math.log(y[..., 1:] - y[..., :-1])
          x = tf.concat([x0, xk], axis=-1)
          return x
  
file_path: probability/tensorflow_probability/python/bijectors/ascending.py
imports: import tensorflow.compat.v2
  from tensorflow_probability.python.bijectors import bijector
  from tensorflow_probability.python.internal import assert_util
label_desc: Use image node_id 4 for calling the Ascending obj's underlying member method code with example usage: obj._inverse(y) and returns: x