<spanid="hl_maxout_forward__realCP.realP.iP.s.s.s.s"></span><spanclass="target"id="paddlehl__cnn_8h_1a194fd1a9bed05cb00bf7bf59b649b053"></span>void <codeclass="descname">hl_maxout_forward</code><spanclass="sig-paren">(</span><emclass="property">const</em> real *<em>inData</em>, real *<em>outData</em>, int *<em>idData</em>, size_t <em>batchSize</em>, size_t <em>size</em>, size_t <em>featLen</em>, size_t <em>groups</em><spanclass="sig-paren">)</span><aclass="headerlink"href="#_CPPv217hl_maxout_forwardPK4realP4realPi6size_t6size_t6size_t6size_t"title="Permalink to this definition">¶</a></dt>
<spanid="hl_maxout_backward__realP.realCP.iCP.s.s.s.s"></span><spanclass="target"id="paddlehl__cnn_8h_1a258d5fbc3c34047d5dc6ac068e81730e"></span>void <codeclass="descname">hl_maxout_backward</code><spanclass="sig-paren">(</span>real *<em>inGrad</em>, <emclass="property">const</em> real *<em>outGrad</em>, <emclass="property">const</em> int *<em>idData</em>, size_t <em>batchSize</em>, size_t <em>size</em>, size_t <em>featLen</em>, size_t <em>groups</em><spanclass="sig-paren">)</span><aclass="headerlink"href="#_CPPv218hl_maxout_backwardP4realPK4realPKi6size_t6size_t6size_t6size_t"title="Permalink to this definition">¶</a></dt>
<dd><p>MaxOut backward. </p>
<p><dlclass="docutils">
<dt><strong>Parameters</strong></dt>
<dd><ulclass="breatheparameterlist first last">
<li><codeclass="first docutils literal"><spanclass="pre">inGrad</span></code> - <p>input grad data. </p>
</li>
<li><codeclass="first docutils literal"><spanclass="pre">outGrad</span></code> - <p>output grad data. </p>
<dd><p>Get the top k elements of each column of this matrix. </p>
<p>The row ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<dd><p>Get the top k elements of each row of this matrix. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. Note that the top k elements are not sorted. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
</dd></dl>
<dl class="function">
...
...
@@ -2748,12 +2766,30 @@ where bit(i, j) = ((codes(i) + numClasses) & 2^j) ? 1 : 0
<dd><p>Get the top k elements of each row of this matrix. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. Note that the top k elements are not sorted. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<dd><p>Get the top k elements of each column of this matrix. </p>
<p>The row ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<dd><p>Get the top k elements of each row of this matrix. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. Note that the top k elements are not sorted. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<dd><p>Get the top k elements of each column of this matrix. </p>
<p>The row ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<dd><p>Get the top k elements of each row of this matrix. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. Note that the top k elements are not sorted. </p>
<p>The column ids and values of these elements are stored in maxIds and max respectively. where k is the size of maxIds. And note that the top k elements are not sorted. </p>
<li>Multi-digit Number Recognition from Street View Imagery using Deep Convolutional Neural Networks: <aclass="reference external"href="https://arxiv.org/pdf/1312.6082v4.pdf">https://arxiv.org/pdf/1312.6082v4.pdf</a></li>