You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

grad_manager.py 13 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335
  1. import weakref
  2. from typing import Callable, Iterable
  3. from ..core._imperative_rt.core2 import pop_scope, push_scope, set_option
  4. from ..core.autodiff.grad import Grad
  5. from ..logger import get_logger
  6. from ..tensor import Tensor
  7. from ..utils.future import Future
  8. logger = get_logger(__name__)
  9. backwarding_grad_manager = None
  10. def get_backwarding_grad_manager():
  11. return backwarding_grad_manager
  12. class AttachSpec:
  13. __slots__ = "tensor", "callbacks"
  14. class GradManager:
  15. r"""
  16. GradManager computes gradients or more generally, vector-Jacobian product, by reverse mode
  17. automatic differentiation (a.k.a. back propagation).
  18. Reverse mode autodiff normally reuses many intermediate tensors for best computation efficiency.
  19. In a read-eval-print-loop (REPL) environment however, it is impossible to known how the user
  20. would take gradients later thus which tensors to keep. To solve this problem, the user must
  21. somehow declare beforehand which gradient could possibly be taken. With GradManager, users are
  22. required to call the :meth:`attach` method on a tensor if they want to take gradients with
  23. respect to it later. Furthermore, any computation on a tensor before it is attached is
  24. completely ignored from the autodiff perspective, so :meth:`attach` must be called before any
  25. computation that needs differentiation.
  26. For example, the following symbolic differentiation code
  27. .. code-block::
  28. x = get_x()
  29. y = f(x)
  30. dy = ones_like(y)
  31. dx = vjp(y, x, dy) # vector-Jacobian product
  32. can be rewriten using GradManager for REPL environment as
  33. .. code-block::
  34. with GradManager() as gm:
  35. x = get_x()
  36. gm.attach(x) # must be placed before any computation on x that needs differentiation
  37. y = f(x)
  38. dy = ones_like(y)
  39. gm.backward(y, dy) # doesn't need x, already known via attach()
  40. dx = x.grad # backward() saves result to .grad attribute
  41. A more realistic example of training a neural network would be like
  42. .. code-block::
  43. gm = GradManager()
  44. gm.attach(model.parameters())
  45. for data in dataset:
  46. with gm:
  47. loss = model(data)
  48. gm.backward(loss)
  49. # gradients w.r.t. parameters is accumulated into their .grad attributes
  50. You can also use ``record()`` and ``release()`` method instead of ``with`` context:
  51. .. code-block::
  52. gm = GradManager()
  53. gm.attach(model.parameters())
  54. for data in dataset:
  55. gm.record()
  56. loss = model(data)
  57. gm.backward(loss)
  58. # backward() will clear recorded history and free resources
  59. # call release() if backward() is not called
  60. # gm.release()
  61. For your convenience, GradManager may (not must) be reused. As shown in the examples, you
  62. only need to attach a tensor once and GradManager will remember it afterwards.
  63. However, a single GradManager can record only one computation history at a time. To run
  64. multiple differentiations simultaneously or perform high order differentiation, create
  65. as many GradManager as you need.
  66. .. note::
  67. Mutable tensors introduce ambiguities when doing symbolic differentiation: which version
  68. of the tensor are we referring to? For attached tensors, GradManager resolves this
  69. ambiguity by "snapshoting" them on first encounter, either on :meth:`record` (or entering
  70. with statement) if tensor is attached before :meth:`record`, or on :meth:`attach` if
  71. GradManager is already recording. Attached tensors will then be interpreted as their
  72. snapshotted version for differentiation purpose. The same ambiguity on the first parameter
  73. of :meth:`backward` is simply resolved by using the latest version.
  74. Typically, in data parallel, we would like to average the gradients across
  75. processes. Users will finally get the averaged gradients if an "AllReduce"
  76. callback is registered as follows:
  77. .. code-block::
  78. import megengine.distributed as dist
  79. gm = GradManager()
  80. gm.attach(model.parameters(), callback=dist.make_allreduce_cb("MEAN"))
  81. """
  82. def __init__(self):
  83. self._attach_specs = {} # id(Tensor) -> AttachSpec
  84. self._recording = False
  85. self._grad = None
  86. self._after_backward_callback = []
  87. self._gradients = {}
  88. def attach(self, tensors: Iterable[Tensor], callbacks=None):
  89. r"""
  90. Instruct GradManager to track operations on tensors, so that gradients with respect
  91. to those tensors could be evaluated later.
  92. :meth:`attach` also accepts a list of callbacks, which will be called with the tensor and
  93. its gradient during :meth:`backward`. The signature of callbacks should look like:
  94. .. code-block::
  95. def callback(tensor: Tensor, grad: Tensor) -> Tensor:
  96. ...
  97. # returned grad is passed to subsequent callbacks
  98. # and finally accumulated to the .grad attribute of tensor
  99. return grad
  100. :meth:`attach` calls with overlapping tensors will result in their callbacks concatenated,
  101. independently for each tensor. For example,
  102. .. code-block::
  103. gm.attach([x, y], callbacks=[f])
  104. gm.attach([y], callbacks=[g])
  105. is equivalent to
  106. .. code-block::
  107. gm.attach([x], callbacks=[f])
  108. gm.attach([y], callbacks=[f, g])
  109. The effect of :meth:`attach` will persist across multiple uses of the GradManager. When
  110. reusing a GradManager, it is likely a mistake to call :meth:`attach` on the same set of
  111. tensors and callbacks repeatedly, which may grow the callback list indefinitely.
  112. .. note::
  113. When reusing a GradManager, it is sometimes desirable to attach temporary tensors each
  114. time, e.g. for computing gradients of inputs of a neural network. GradManager tries to
  115. accommodate such usages by holding weak references to attached tensors. Most of the
  116. times, this should be enough to prevent resource leak. Unfortunately, there are still
  117. some pitfalls left:
  118. - Callbacks should not hold strong references, directly or indirectly, to attached
  119. tensors. Any strong reference, including those from callbacks, will prevent
  120. garbage collection (even by the cycle collector!) of a attached tensor, until
  121. the GradManager object is garbage collected.
  122. Please also note that GradManager might hold additional strong references to attached
  123. tensors when it is in use. This note only covers potential resource leaks across
  124. multiple uses of a GradManager, which is unrelated to whether resources is timely
  125. released within a single use.
  126. :param tensors: tensor or list of tensors to track
  127. :param callbacks: callback or list of callbacks
  128. """
  129. if callbacks is None:
  130. callbacks = []
  131. if isinstance(callbacks, Callable):
  132. callbacks = [callbacks]
  133. if isinstance(tensors, Tensor):
  134. tensors = [tensors]
  135. def make_spec(tensor):
  136. selfref = weakref.ref(self)
  137. key = id(tensor)
  138. def deleter(_):
  139. self = selfref()
  140. if self is not None:
  141. del self._attach_specs[key]
  142. spec = AttachSpec()
  143. spec.tensor = weakref.ref(tensor, deleter)
  144. spec.callbacks = []
  145. return spec
  146. for x in tensors:
  147. assert isinstance(x, Tensor), "Object to be attached should be Tensor"
  148. spec = self._attach_specs.get(id(x))
  149. new_attach = spec is None
  150. if spec is None:
  151. spec = make_spec(x)
  152. self._attach_specs[id(x)] = spec
  153. spec.callbacks.extend(callbacks)
  154. if new_attach and self._recording:
  155. self._do_record(spec)
  156. return self
  157. def _register_after_backward_callback(self, callback):
  158. self._after_backward_callback.append(callback)
  159. return self
  160. def backward(self, y=None, dy=None):
  161. r"""
  162. Compute gradients (or vector-Jacobian product) for all attached tensors, accumulate to
  163. corresponding .grad attribute, and release resources along the way.
  164. :meth:`backward` computes the vector-Jacobian product :math:`dx_j = \sum_{i} dy_i J_{ij}`
  165. where :math:`J_{ij} = ∂y_i/∂x_j` is the Jacobian matrix between vector variables :math:`y`
  166. and :math:`x`, with all vectors involved represented as a list of tensors, in the sense of
  167. direct sums (or flatten-and-concatenate). :math:`y` and :math:`dy` are passed as the first
  168. and second parameter respectively, whereas :math:`x` is directly taken from the list of
  169. all attached tensors. The result :math:`dx` is also not returned. Instead, it is directly
  170. accumulated into the .grad attribute of matching attached tensors (a.k.a. :math:`x`). This
  171. can be done unambiguously since :math:`dx` as a list of tensors has the same structure as
  172. :math:`x`.
  173. If :math:`y` is a scalar and :math:`dy` is chosen to be 1, the vector-Jacobian product
  174. yield gradient of :math:`y` with repect to :math:`x` as a special case. In that case,
  175. you will be able to omit the :math:`dy` parameter and :meth:`backward` will automatically
  176. use 1 for it and compute the gradient.
  177. :meth:`backward` consumes all resources held by this GradManager and releases them in the
  178. process of this call. When the call successfully finishes, the GradManager will be put back
  179. to an inactive state.
  180. :param y: tensor or list of tensors
  181. :param dy: tensor or list of tensors. Defaults to 1 if y is scalar
  182. """
  183. push_scope("backward")
  184. set_option("record_computing_path", 0)
  185. from ..functional import ones_like
  186. global backwarding_grad_manager
  187. cache = backwarding_grad_manager
  188. backwarding_grad_manager = self
  189. if not self._recording:
  190. raise RuntimeError(
  191. "no computation history. "
  192. "did you forget record() or "
  193. "call a method that clears the history?"
  194. )
  195. assert self._grad is not None
  196. if y is None:
  197. ys = []
  198. elif isinstance(y, (tuple, list)):
  199. ys = y
  200. else:
  201. ys = [y]
  202. if dy is None:
  203. dys = [ones_like(y) for y in ys]
  204. elif isinstance(dy, (tuple, list)):
  205. dys = ys
  206. else:
  207. dys = [dy]
  208. try:
  209. self._grad(ys, dys)
  210. for callback in self._after_backward_callback:
  211. callback()
  212. for id_, grad in self._gradients.items():
  213. if isinstance(grad, Future):
  214. grad = grad.get()
  215. spec = self._attach_specs.get(id_)
  216. tensor = spec and spec.tensor()
  217. if tensor is not None:
  218. if tensor.grad is None:
  219. tensor.grad = grad
  220. else:
  221. tensor.grad += grad
  222. if tensor._isscalar() and tensor.grad is not None:
  223. tensor.grad._setscalar()
  224. finally:
  225. self.release()
  226. backwarding_grad_manager = cache
  227. set_option("record_computing_path", 1)
  228. pop_scope("backward")
  229. def record(self):
  230. r"""
  231. Start recording operations
  232. After this call, you will be able to call :meth:`backward`.
  233. """
  234. if self._recording:
  235. raise RuntimeError("already recording")
  236. grad = Grad()
  237. self._recording = True
  238. self._grad = grad
  239. for spec in self._attach_specs.values():
  240. self._do_record(spec)
  241. grad.__enter__()
  242. def _do_record(self, spec):
  243. tensor = spec.tensor()
  244. if tensor is None:
  245. return
  246. def callback(grad, callbacks=spec.callbacks):
  247. for cb in callbacks:
  248. grad = cb(tensor, grad)
  249. self._gradients[id(tensor)] = grad
  250. # NOTE: override prev callback wrt when called serval times
  251. self._grad.wrt(tensor, callback=callback)
  252. def release(self):
  253. r"""
  254. Stop recording operations and release resources kept for gradient computation
  255. After this call, you will not be able to call :meth:`backward`.
  256. """
  257. if self._grad is not None:
  258. self._grad.__exit__(None, None, None)
  259. self._grad = None
  260. self._recording = False
  261. self._gradients = dict()
  262. def __enter__(self):
  263. self.record()
  264. return self
  265. def __exit__(self, exc_type, exc_val, exc_tb):
  266. self.release()

MegEngine 安装包中集成了使用 GPU 运行代码所需的 CUDA 环境,不用区分 CPU 和 GPU 版。 如果想要运行 GPU 程序,请确保机器本身配有 GPU 硬件设备并安装好驱动。 如果你想体验在云端 GPU 算力平台进行深度学习开发的感觉,欢迎访问 MegStudio 平台