backward.html



<!DOCTYPE html>
<!--[if IE 8]><html class="no-js lt-ie9" lang="en" > <![endif]-->
<!--[if gt IE 8]><!--> <html class="no-js" lang="en" > <!--<![endif]-->
<head>
  <meta charset="utf-8">
  
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  
  <title>Backward Building &mdash; PaddlePaddle  文档</title>
  

    <link rel="stylesheet" href="../_static/css/theme.css" type="text/css" />
  

        <link rel="index" title="索引"
              href="../genindex.html"/>
        <link rel="search" title="搜索" href="../search.html"/>
    <link rel="top" title="PaddlePaddle  文档" href="../index.html"/> 
<script>
var _hmt = _hmt || [];
(function() {
  var hm = document.createElement("script");
  hm.src = "//hm.baidu.com/hm.js?b9a314ab40d04d805655aab1deee08ba";
  var s = document.getElementsByTagName("script")[0]; 
  s.parentNode.insertBefore(hm, s);
})();
</script>


  <script src="../_static/js/modernizr.min.js"></script>

</head>

<body class="wy-body-for-nav" role="document">

  <div class="wy-grid-for-nav">

    
    <nav data-toggle="wy-nav-shift" class="wy-nav-side">
      <div class="wy-side-scroll">
        <div class="wy-side-nav-search">
          

            <a href="../index_cn.html" class="icon icon-home"> PaddlePaddle
          

          </a>

          
<div role="search">
  <form id="rtd-search-form" class="wy-form" action="../search.html" method="get">
    <input type="text" name="q" placeholder="Search docs" />
    <input type="hidden" name="check_keywords" value="yes" />
    <input type="hidden" name="area" value="default" />
  </form>
</div>

          
        </div>

        <div class="wy-menu wy-menu-vertical" data-spy="affix" role="navigation" aria-label="main navigation">
          
<nav class="doc-menu-vertical" role="navigation">

<ul>
<li class="toctree-l1"><a class="reference internal" href="../getstarted/index_cn.html">新手入门</a><ul>
<li class="toctree-l2"><a class="reference internal" href="../getstarted/quickstart_cn.html">快速开始</a></li>
<li class="toctree-l2"><a class="reference internal" href="../getstarted/concepts/use_concepts_cn.html">基本使用概念</a></li>
</ul>
</li>
<li class="toctree-l1"><a class="reference internal" href="../build_and_install/index_cn.html">安装与编译</a><ul>
<li class="toctree-l2"><a class="reference internal" href="../build_and_install/pip_install_cn.html">使用pip安装</a></li>
<li class="toctree-l2"><a class="reference internal" href="../build_and_install/docker_install_cn.html">使用Docker安装运行</a></li>
<li class="toctree-l2"><a class="reference internal" href="../build_and_install/build_from_source_cn.html">从源码编译</a></li>
</ul>
</li>
<li class="toctree-l1"><a class="reference internal" href="../howto/index_cn.html">进阶使用</a><ul>
<li class="toctree-l2"><a class="reference internal" href="../howto/cmd_parameter/index_cn.html">命令行参数设置</a><ul>
<li class="toctree-l3"><a class="reference internal" href="../howto/cmd_parameter/use_case_cn.html">使用案例</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/cmd_parameter/arguments_cn.html">参数概述</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/cmd_parameter/detail_introduction_cn.html">细节描述</a></li>
</ul>
</li>
<li class="toctree-l2"><a class="reference internal" href="../howto/cluster/index_cn.html">分布式训练</a><ul>
<li class="toctree-l3"><a class="reference internal" href="../howto/cluster/preparations_cn.html">环境准备</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/cluster/cmd_argument_cn.html">启动参数说明</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/cluster/multi_cluster/index_cn.html">在不同集群中运行</a><ul>
<li class="toctree-l4"><a class="reference internal" href="../howto/cluster/multi_cluster/k8s_cn.html">Kubernetes单机训练</a></li>
<li class="toctree-l4"><a class="reference internal" href="../howto/cluster/multi_cluster/k8s_distributed_cn.html">Kubernetes分布式训练</a></li>
<li class="toctree-l4"><a class="reference internal" href="../howto/cluster/multi_cluster/openmpi_cn.html">在OpenMPI集群中启动训练</a></li>
<li class="toctree-l4"><a class="reference internal" href="../howto/cluster/multi_cluster/fabric_cn.html">使用fabric启动集群训练</a></li>
<li class="toctree-l4"><a class="reference internal" href="../howto/cluster/multi_cluster/k8s_aws_cn.html">Kubernetes on AWS</a></li>
</ul>
</li>
</ul>
</li>
<li class="toctree-l2"><a class="reference internal" href="../howto/capi/index_cn.html">C-API预测库</a><ul>
<li class="toctree-l3"><a class="reference internal" href="../howto/capi/compile_paddle_lib_cn.html">安装与编译C-API预测库</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/capi/organization_of_the_inputs_cn.html">输入/输出数据组织</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/capi/workflow_of_capi_cn.html">C-API使用流程</a></li>
</ul>
</li>
<li class="toctree-l2"><a class="reference internal" href="../howto/rnn/index_cn.html">RNN模型</a><ul>
<li class="toctree-l3"><a class="reference internal" href="../howto/rnn/rnn_config_cn.html">RNN配置</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/rnn/recurrent_group_cn.html">Recurrent Group教程</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/rnn/hierarchical_layer_cn.html">支持双层序列作为输入的Layer</a></li>
<li class="toctree-l3"><a class="reference internal" href="../howto/rnn/hrnn_rnn_api_compare_cn.html">单双层RNN API对比介绍</a></li>
</ul>
</li>
<li class="toctree-l2"><a class="reference internal" href="../howto/optimization/gpu_profiling_cn.html">GPU性能调优</a></li>
</ul>
</li>
<li class="toctree-l1"><a class="reference internal" href="../dev/index_cn.html">开发标准</a><ul>
<li class="toctree-l2"><a class="reference internal" href="../dev/contribute_to_paddle_cn.html">如何贡献代码</a></li>
<li class="toctree-l2"><a class="reference internal" href="../dev/write_docs_cn.html">如何贡献文档</a></li>
</ul>
</li>
<li class="toctree-l1"><a class="reference internal" href="../faq/index_cn.html">FAQ</a><ul>
<li class="toctree-l2"><a class="reference internal" href="../faq/build_and_install/index_cn.html">编译安装与单元测试</a></li>
<li class="toctree-l2"><a class="reference internal" href="../faq/model/index_cn.html">模型配置</a></li>
<li class="toctree-l2"><a class="reference internal" href="../faq/parameter/index_cn.html">参数设置</a></li>
<li class="toctree-l2"><a class="reference internal" href="../faq/local/index_cn.html">本地训练与预测</a></li>
<li class="toctree-l2"><a class="reference internal" href="../faq/cluster/index_cn.html">集群训练与预测</a></li>
</ul>
</li>
</ul>

</nav>

        </div>
      </div>
    </nav>

    <section data-toggle="wy-nav-shift" class="wy-nav-content-wrap">

      
      <nav class="wy-nav-top" role="navigation" aria-label="top navigation">
        <i data-toggle="wy-nav-top" class="fa fa-bars"></i>
        <a href="../index_cn.html">PaddlePaddle</a>
      </nav>


      <div class="wy-nav-content">
        <div class="rst-content">
          

<div role="navigation" aria-label="breadcrumbs navigation">
  <ul class="wy-breadcrumbs">
    <li><a href="../index_cn.html">Docs</a> &raquo;</li>
      
    <li>Backward Building</li>
      <li class="wy-breadcrumbs-aside">
        
          
            <a href="../_sources/design/backward.md.txt" rel="nofollow"> View page source</a>
          
        
      </li>
  </ul>
  <hr/>
</div>
          <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
           <div itemprop="articleBody">
            
  <div class="section" id="backward-building">
<span id="backward-building"></span><h1>Backward Building<a class="headerlink" href="#backward-building" title="永久链接至标题">¶</a></h1>
<div class="section" id="motivation">
<span id="motivation"></span><h2>Motivation<a class="headerlink" href="#motivation" title="永久链接至标题">¶</a></h2>
<p>In Neural Network, most models are solved by the backpropagation algorithm(known as <strong>BP</strong>) at present. Technically, BP calculates the gradient of the loss function, then propagates it back through the networks following the chain rule. However, when configuring the model structure, users do not need to define the backward part. So a mechanism is required by the framework which can complete the model&#8217;s backward part automatically according to the given forward part.</p>
<p>When implementing a specific <code class="docutils literal"><span class="pre">op</span></code>, the developer is also asked to implement its backward version, called <code class="docutils literal"><span class="pre">grad_op</span></code>. A <code class="docutils literal"><span class="pre">grad_op</span></code> takes gradients of its corresponding <code class="docutils literal"><span class="pre">op</span></code>&#8216;s outputs, and calculate gradients of the <code class="docutils literal"><span class="pre">op</span></code>&#8216;s inputs. During the building of a model&#8217;s backward part, the framework creates each forward <code class="docutils literal"><span class="pre">op</span></code>&#8216;s <code class="docutils literal"><span class="pre">grad_op</span></code>, and then string them together in reverse order of forwarding part. In this way, gradients spread from the end to the beginning of the model, in another word, from the loss to parameters.</p>
</div>
<div class="section" id="challenges">
<span id="challenges"></span><h2>Challenges<a class="headerlink" href="#challenges" title="永久链接至标题">¶</a></h2>
<p>The motivation of backward building is apparent. However, implementation it correctly is not so easy. In the <strong>Fluid</strong> design, a deep learning model is described by <code class="docutils literal"><span class="pre">Program</span></code>, <code class="docutils literal"><span class="pre">Block</span></code>, <code class="docutils literal"><span class="pre">Op</span></code> and <code class="docutils literal"><span class="pre">Variable</span></code>. The <code class="docutils literal"><span class="pre">Block</span></code> itself can be nested. It means that the <code class="docutils literal"><span class="pre">op</span></code>s and <code class="docutils literal"><span class="pre">variable</span></code>s are scattered across different blocks rather than all be gathered in a single graph. Our backward building algorithm shall visit blocks in recursive order and be able to insert <code class="docutils literal"><span class="pre">grad_op</span></code>s and new created <code class="docutils literal"><span class="pre">variable</span></code>s into the right place.</p>
</div>
<div class="section" id="usage">
<span id="usage"></span><h2>Usage<a class="headerlink" href="#usage" title="永久链接至标题">¶</a></h2>
<p>Although the whole algorithm is comprised of many functions, only one is exposed as API:</p>
<div class="highlight-python"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">append_backward</span><span class="p">(</span><span class="n">loss</span><span class="p">,</span> <span class="n">parameter_list</span><span class="o">=</span><span class="bp">None</span><span class="p">,</span> <span class="n">no_grad_set</span><span class="o">=</span><span class="bp">None</span><span class="p">):</span>
    <span class="sd">&quot;&quot;&quot;</span>
<span class="sd">    Append backward part to main_program</span>

<span class="sd">    Args:</span>
<span class="sd">        loss(Variable): The variable generated by the cost function.</span>
<span class="sd">        parameter_list(list): Parameters that need to be updated by optimizers.</span>
<span class="sd">            If None, it means all parameters need to be updated.</span>

<span class="sd">        no_grad_set(set): Variables that have no gradients in Block 0. </span>
<span class="sd">            If None, the set will be generated inside the function and </span>
<span class="sd">            contains all variables with `step_gradient=True` from all blocks.</span>
<span class="sd">        </span>
<span class="sd">    Return:</span>
<span class="sd">        (list[Variable]): list of (parameters, gradients) pair.</span>
<span class="sd">    &quot;&quot;&quot;</span>
</pre></div>
</div>
<p>By invoking this API, the framework appends backward part of the program where the <code class="docutils literal"><span class="pre">loss</span></code> is. It takes three arguments. <code class="docutils literal"><span class="pre">loss</span></code> means the final loss value. It must be a scalar and is usually the output of the loss layer. It is also where the gradient generated and backpropagation starts. <code class="docutils literal"><span class="pre">parameter_list</span></code> marks all parameters needs updating. If it&#8217;s <code class="docutils literal"><span class="pre">None</span></code>, all parameter will be updated by optimizers. <code class="docutils literal"><span class="pre">no_grad_set</span></code> marks variables without gradient. if all outputs of some <code class="docutils literal"><span class="pre">grad_op</span></code> are in <code class="docutils literal"><span class="pre">no_grad_set</span></code>, the <code class="docutils literal"><span class="pre">grad_op</span></code> will not be run.</p>
<p>This API will be invoked automatically before optimizer building.
As a result, in most cases, users do not need to invoke the API by themselves to append backward part.</p>
</div>
<div class="section" id="implementation">
<span id="implementation"></span><h2>Implementation<a class="headerlink" href="#implementation" title="永久链接至标题">¶</a></h2>
<p>The implementation of backward building algorithm is in <code class="docutils literal"><span class="pre">backward.py</span></code> file. The whole algorithm can be divided into two independent parts: creating <code class="docutils literal"><span class="pre">grad_op</span></code>s and creating new variables.</p>
<div class="section" id="creating-grad-ops">
<span id="creating-grad-ops"></span><h3>Creating <code class="docutils literal"><span class="pre">grad_op</span></code>s<a class="headerlink" href="#creating-grad-ops" title="永久链接至标题">¶</a></h3>
<p>The creating of <code class="docutils literal"><span class="pre">grad_op</span></code>s is implemented by:</p>
<div class="highlight-python"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">_append_backward_ops_</span><span class="p">(</span><span class="n">target</span><span class="p">,</span>
                          <span class="n">block</span><span class="p">,</span>
                          <span class="n">target_block</span><span class="p">,</span>
                          <span class="n">no_grad_dict</span><span class="p">,</span>
                          <span class="n">grad_to_var</span><span class="p">):</span>
    <span class="sd">&quot;&quot;&quot;</span>
<span class="sd">    Create all grad ops, and insert them into given block</span>

<span class="sd">    Args:</span>
<span class="sd">        target(Variable): the target variable of forward pass</span>
<span class="sd">        block(Block): the block where forward ops are</span>
<span class="sd">        target_block(Block): the block which is going to hold new generated grad ops</span>
<span class="sd">        no_grad_dict(dict): </span>
<span class="sd">            key(int)  block index</span>
<span class="sd">            val(set) a set of varibale names. These varibales have no gradient</span>
<span class="sd">        grad_to_var(dict)(output argument):</span>
<span class="sd">            key(str): grad variable name</span>
<span class="sd">            val(str): corresponding forward variable name</span>
<span class="sd">    &quot;&quot;&quot;</span>
</pre></div>
</div>
<p>Given a <code class="docutils literal"><span class="pre">block</span></code>, the function will traverses all <code class="docutils literal"><span class="pre">op</span></code>s in this block in reverse order, gets corresponding <code class="docutils literal"><span class="pre">grad_op</span></code> from the C++ core via <code class="docutils literal"><span class="pre">core.get_grad_op_desc()</span></code>, then append it to <code class="docutils literal"><span class="pre">target_block</span></code>.</p>
<p>However, some specific <code class="docutils literal"><span class="pre">op</span></code>(e.g. <code class="docutils literal"><span class="pre">while_op</span></code>, <code class="docutils literal"><span class="pre">if_else_op</span></code>) can hold its own sub-block. For these sub-blocks contains <code class="docutils literal"><span class="pre">op</span></code>s as well, the <code class="docutils literal"><span class="pre">grad_op</span></code> creating should be recursive.</p>
<p>During the reverse traversal, we check each <code class="docutils literal"><span class="pre">op</span></code> whether it has an attribute named <code class="docutils literal"><span class="pre">sub_block</span></code>. If so, it means there is a sub-block and we need to deal with it first. After creating a new block whose father is the one in <code class="docutils literal"><span class="pre">op</span></code>&#8216;s attribute, we invoke <code class="docutils literal"><span class="pre">_append_backward_ops_()</span></code> recursively, assigning the new block to parameter <code class="docutils literal"><span class="pre">target_block</span></code> and the one in <code class="docutils literal"><span class="pre">op</span></code>&#8216;s attribute to <code class="docutils literal"><span class="pre">block</span></code>. The <em>pseudo-code</em> shows this process:</p>
<div class="highlight-default"><div class="highlight"><pre><span></span>******* pseudo-code ********
for op in reversed(block.ops):
    if op has an attribute named &#39;sub_block&#39;:
        Get the sub-block(`s_block`) from op&#39;s attribute.
        Create a new block(`grad_s_block`), whose father is `s_block`.
        Invoke _append_backward_ops_(), with `block=s_block` and `target_block=grad_s_block`
    
    Invoke `core.get_grad_op_desc()` to get op&#39;s grad_op.
    Insert name correspondings between variables and their gradients of the grad_op to grad_to_var
    Assign grad_s_block to grad_op as it&#39;s &#39;sub_block&#39; attribute.
    Append grad_op to current target_block.
</pre></div>
</div>
<p>The first invoking of <code class="docutils literal"><span class="pre">_append_backward_ops_()</span></code> is initiated by <code class="docutils literal"><span class="pre">append_backward()</span></code>, in which parameters <code class="docutils literal"><span class="pre">block</span></code> and <code class="docutils literal"><span class="pre">target_block</span></code> are all assigned with root block(the block with index 0).</p>
</div>
<div class="section" id="corner-cases-of-grad-op-creating">
<span id="corner-cases-of-grad-op-creating"></span><h3>Corner Cases of <code class="docutils literal"><span class="pre">grad_op</span></code> Creating<a class="headerlink" href="#corner-cases-of-grad-op-creating" title="永久链接至标题">¶</a></h3>
<p>In the previous section, we show the regular process of <code class="docutils literal"><span class="pre">grad_op</span></code> creating. However, in some corner cases, the conventional algorithm is not enough to get the correct result and appending handling is required. These additional processes run after the algorithm mentioned above and do some special adjusts on its output <code class="docutils literal"><span class="pre">grad_op</span></code>s.</p>
<div class="section" id="shared-variables">
<span id="shared-variables"></span><h4>Shared Variables<a class="headerlink" href="#shared-variables" title="永久链接至标题">¶</a></h4>
<p>If a variable is read by more than one <code class="docutils literal"><span class="pre">op</span></code> in the forward pass, its gradient is likely to be written by more than one <code class="docutils literal"><span class="pre">grad_op</span></code>s in the next backward pass. To make the gradient result being the sum of all <code class="docutils literal"><span class="pre">grad_op</span></code>s&#8217; outputs instead of the last running one, we assign each output with a temporary variable and then add a <code class="docutils literal"><span class="pre">sum_op</span></code> to add them up.</p>
<p>For the debug convenience, if the final gradient name is <code class="docutils literal"><span class="pre">w&#64;GRAD</span></code>, it&#8217;s corresponding temporary variables will be named as <code class="docutils literal"><span class="pre">w&#64;GRAD&#64;RENAME&#64;0</span></code>, <code class="docutils literal"><span class="pre">w&#64;GRAD&#64;RENAME&#64;1</span></code>...</p>
<p>See function <code class="docutils literal"><span class="pre">_addup_repetitive_outputs_</span></code> in <code class="docutils literal"><span class="pre">backward.py</span></code> for implementation details.</p>
</div>
<div class="section" id="no-gradient-variables">
<span id="no-gradient-variables"></span><h4>No Gradient Variables<a class="headerlink" href="#no-gradient-variables" title="永久链接至标题">¶</a></h4>
<p>In our framework, variables can be marked as <em>no_gradient</em>, it means that the gradient of this variable is unnecessary and can be considered as zero in model training. Apparently, when all the outputs of some <code class="docutils literal"><span class="pre">grad_op</span></code> are marked as <em>no_gradient</em>, the <code class="docutils literal"><span class="pre">grad_op</span></code> itself can be skipped in backward pass.</p>
<p>Another situation is all the gradient inputs of some <code class="docutils literal"><span class="pre">grad_op</span></code> are marked as <em>no_gradient</em>, which means all of them can be considered as zeros. For <code class="docutils literal"><span class="pre">grad_op</span></code>s are in essence the propagation of gradients, all the outputs are definitely zeros when all gradient inputs are zeros. Therefore the <code class="docutils literal"><span class="pre">grad_op</span></code> can also be skipped.</p>
<p>It should be noted that all these zero gradients still need to be creating and initialized by something, otherwise following <code class="docutils literal"><span class="pre">grad_op</span></code>s who take these gradients as inputs take the risk of using uninitialized memory. In our code, we employ <code class="docutils literal"><span class="pre">fill_zeros_like_op</span></code> to initialize them as all zeros.</p>
<p>This features are implemented in function <code class="docutils literal"><span class="pre">_remove_no_grad_branch_</span></code>. It checks new created <code class="docutils literal"><span class="pre">grad_op</span></code>s one-by-one, removes who can be skipped and inserts <code class="docutils literal"><span class="pre">fill_zeros_like_op</span></code> when its necessary. We can get the <code class="docutils literal"><span class="pre">no_grad_set</span></code> from the <code class="docutils literal"><span class="pre">_append_backward_ops_</span></code> argument <code class="docutils literal"><span class="pre">no_grad_dict</span></code> or generate it on the fly by scanning all variables&#8217; <code class="docutils literal"><span class="pre">no_gradient</span></code> attribute(True or False).</p>
</div>
</div>
<div class="section" id="creating-backward-variables">
<span id="creating-backward-variables"></span><h3>Creating Backward Variables<a class="headerlink" href="#creating-backward-variables" title="永久链接至标题">¶</a></h3>
<p>Up to now, we have completed all creating and adjusting jobs of <code class="docutils literal"><span class="pre">grad_op</span></code>s. However, backward variables have not been created. Now they are only represented by <code class="docutils literal"><span class="pre">grad_op</span></code>&#8216;s input and output arguments. The backward variable creating job will be done by:</p>
<div class="highlight-python"><div class="highlight"><pre><span></span><span class="k">def</span> <span class="nf">_append_backward_vars_</span><span class="p">(</span><span class="n">block</span><span class="p">,</span> 
                           <span class="n">start_op_idx</span><span class="p">,</span> 
                           <span class="n">grad_to_var</span><span class="p">,</span> 
                           <span class="n">grad_info_map</span><span class="p">):</span>
    <span class="sd">&quot;&quot;&quot;</span>
<span class="sd">    Create new variables required by backward pass.</span>

<span class="sd">    Args:</span>
<span class="sd">        block(Block): the block where new variables will be created</span>
<span class="sd">        start_op_idx(int): Only variables required by ops in block.ops[start_op_idx : ] will be created</span>
<span class="sd">        grad_to_var(dict):</span>
<span class="sd">            key(str): grad variable name</span>
<span class="sd">            val(str): corresponding forward variable name</span>
<span class="sd">            In most cases, this dict is generated by _append_backward_ops_()</span>
<span class="sd">        grad_info_map(dict)(output argument):</span>
<span class="sd">            key(str): forward variable name</span>
<span class="sd">            val(tuple): a tuple of (str, int), str is the corresponding grad name, int is the block index</span>
<span class="sd">    &quot;&quot;&quot;</span>
</pre></div>
</div>
<p>Given a <code class="docutils literal"><span class="pre">block</span></code>, this function traverses all the <code class="docutils literal"><span class="pre">grad_op</span></code>s in it(The argument <code class="docutils literal"><span class="pre">start_op_idx</span></code> indicates where the grad_op sequence starts.) and creates all the uncreated outputs. The <em>pseudo-code</em> shows this process:</p>
<div class="highlight-default"><div class="highlight"><pre><span></span>for op in block.ops[start_op_idx : ]:

    if op has an attribute named &#39;sub_block&#39;:
        Get the sub-block(`s_block`) from op&#39;s attribute.
        Invoke _append_backward_vars_(), with `block=s_block`
        
    for var_name in op.all_output_names():
        if block.has_var_recursive(var_name) or var_name is the name of empty variable:
            continue
        create a new variable named &#39;var_name&#39; in block
        if grad_to_var.has_key(var_name):
            set grad_info_map[grad_to_var[var_name]] as a tuple of (var_name. block)
            
    do op&#39;s var type inference
    do op&#39;s shape inference
</pre></div>
</div>
</div>
</div>
</div>


           </div>
          </div>
          <footer>
  

  <hr/>

  <div role="contentinfo">
    <p>
        &copy; Copyright 2016, PaddlePaddle developers.

    </p>
  </div>
  Built with <a href="http://sphinx-doc.org/">Sphinx</a> using a <a href="https://github.com/snide/sphinx_rtd_theme">theme</a> provided by <a href="https://readthedocs.org">Read the Docs</a>. 

</footer>

        </div>
      </div>

    </section>

  </div>
  

    <script type="text/javascript">
        var DOCUMENTATION_OPTIONS = {
            URL_ROOT:'../',
            VERSION:'',
            COLLAPSE_INDEX:false,
            FILE_SUFFIX:'.html',
            HAS_SOURCE:  true
        };
    </script>
      <script type="text/javascript" src="../_static/jquery.js"></script>
      <script type="text/javascript" src="../_static/underscore.js"></script>
      <script type="text/javascript" src="../_static/doctools.js"></script>
      <script type="text/javascript" src="../_static/translations.js"></script>
      <script type="text/javascript" src="https://cdn.bootcss.com/mathjax/2.7.0/MathJax.js"></script>

  
    <script type="text/javascript" src="../_static/js/theme.js"></script>
  

  <script type="text/javascript">
      jQuery(function () {
          SphinxRtdTheme.StickyNav.enable();
      });
  </script>
   

</body>
</html>