Path: blob/master/translate_cache/adaptive_computation/parity.zh.json
4928 views
{1"<h1>Parity Task</h1>\n<p>This creates data for Parity Task from the paper <a href=\"https://arxiv.org/abs/1603.08983\">Adaptive Computation Time for Recurrent Neural Networks</a>.</p>\n<p>The input of the parity task is a vector with <span translate=no>_^_0_^_</span>'s <span translate=no>_^_1_^_</span>'s and <span translate=no>_^_2_^_</span>'s. The output is the parity of <span translate=no>_^_3_^_</span>'s - one if there is an odd number of <span translate=no>_^_4_^_</span>'s and zero otherwise. The input is generated by making a random number of elements in the vector either <span translate=no>_^_5_^_</span> or <span translate=no>_^_6_^_</span>'s.</p>\n": "<h1>\u5947\u5076\u6821\u9a8c\u4efb\u52a1</h1>\n<p>\u8fd9\u5c06\u4ece\u8bba\u6587\u300a<a href=\"https://arxiv.org/abs/1603.08983\">\u5faa\u73af\u795e\u7ecf\u7f51\u7edc\u7684\u81ea\u9002\u5e94\u8ba1\u7b97\u65f6\u95f4\u300b\u4e2d\u4e3a</a>\u5947\u5076\u6821\u9a8c\u4efb\u52a1\u521b\u5efa\u6570\u636e\u3002</p>\n<p>\u5947\u5076\u6821\u9a8c\u4efb\u52a1\u7684\u8f93\u5165\u662f\u4e00\u4e2a\u5e26\u6709<span translate=no>_^_0_^_</span>'s \u548c<span translate=no>_^_1_^_</span>'s \u7684\u5411\u91cf\u3002\u8f93\u51fa\u662f<span translate=no>_^_2_^_</span>'s \u7684<span translate=no>_^_3_^_</span>\u5947\u5076\u6821\u9a8c\u2014\u2014\u5982\u679c\u6709\uff0c\u5219\u4e3a 1\u662f\u7684\u5947\u6570<span translate=no>_^_4_^_</span>\uff0c\u5426\u5219\u4e3a\u96f6\u3002\u8f93\u5165\u662f\u901a\u8fc7\u4f7f\u77e2\u91cf\u4e2d\u7684\u968f\u673a\u6570\u91cf\u7684\u5143\u7d20\u4e3a<span translate=no>_^_5_^_</span>\u6216\u800c\u751f\u6210<span translate=no>_^_6_^_</span>\u7684\u3002</p>\n",2"<h3>Parity dataset</h3>\n": "<h3>\u5947\u5076\u6821\u9a8c\u6570\u636e</h3>\n",3"<p> </p>\n": "<p></p>\n",4"<p> Generate a sample</p>\n": "<p>\u751f\u6210\u6837\u672c</p>\n",5"<p> Size of the dataset</p>\n": "<p>\u6570\u636e\u96c6\u7684\u5927\u5c0f</p>\n",6"<p>Empty vector </p>\n": "<p>\u7a7a\u5411\u91cf</p>\n",7"<p>Fill non-zero elements with <span translate=no>_^_0_^_</span>'s and <span translate=no>_^_1_^_</span>'s </p>\n": "<p>\u7528<span translate=no>_^_0_^_</span> \u201c\u548c<span translate=no>_^_1_^_</span>\u201d \u586b\u5145\u975e\u96f6\u5143\u7d20</p>\n",8"<p>Number of non-zero elements - a random number between <span translate=no>_^_0_^_</span> and total number of elements </p>\n": "<p>\u975e\u96f6\u5143\u7d20\u7684\u6570\u91cf-\u4ecb\u4e8e<span translate=no>_^_0_^_</span>\u548c\u5143\u7d20\u603b\u6570\u4e4b\u95f4\u7684\u968f\u673a\u6570</p>\n",9"<p>Randomly permute the elements </p>\n": "<p>\u968f\u673a\u6392\u5217\u5143\u7d20</p>\n",10"<p>The parity </p>\n": "<p>\u5947\u5076\u6821\u9a8c</p>\n",11"<ul><li><span translate=no>_^_0_^_</span> is the number of samples </li>\n<li><span translate=no>_^_1_^_</span> is the number of elements in the input vector</li></ul>\n": "<ul><li><span translate=no>_^_0_^_</span>\u662f\u6837\u672c\u7684\u6570\u91cf</li>\n<li><span translate=no>_^_1_^_</span>\u662f\u8f93\u5165\u5411\u91cf\u4e2d\u7684\u5143\u7d20\u6570</li></ul>\n",12"Parity Task": "\u5947\u5076\u6821\u9a8c\u4efb\u52a1",13"This creates data for Parity Task from the paper Adaptive Computation Time for Recurrent Neural Networks": "\u8fd9\u5c06\u4ece\u8bba\u6587\u300a\u5faa\u73af\u795e\u7ecf\u7f51\u7edc\u7684\u81ea\u9002\u5e94\u8ba1\u7b97\u65f6\u95f4\u300b\u4e2d\u4e3a\u5947\u5076\u6821\u9a8c\u4efb\u52a1\u521b\u5efa\u6570\u636e"14}1516