<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=perceptron">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=perceptron]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for perceptron]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/840/Team-UMBC-FEVER-Claim-verification-using-Semantic-Lexical-Resources"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/932/Convexification-and-Deconvexification-for-Training-Artificial-Neural-Networks"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/934/A-pairwise-algorithm-for-training-multilayer-perceptrons-with-the-normalized-risk-averting-error-criterion"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/937/Overcoming-the-Local-Minimum-Problem-in-Training-Multilayer-Perceptrons-with-the-NRAE-Training-Method"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/840/Team-UMBC-FEVER-Claim-verification-using-Semantic-Lexical-Resources">
  <title><![CDATA[Team UMBC-FEVER: Claim verification using Semantic Lexical Resources]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/840/Team-UMBC-FEVER-Claim-verification-using-Semantic-Lexical-Resources</link>
  <description><![CDATA[We describe our system used in the 2018 FEVER shared task. The system employed a frame-based information retrieval approach to select Wikipedia sentences that provide evidence and a two-layer multilayer perceptron to classify a claim as correct or incorrect. Our submission achieved a score of 0.3966 on the Evidence F1 metric with an accuracy of 44.79% and a FEVER score of 0.2628 F1 points.]]></description>
  <dc:date>2018-11-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/932/Convexification-and-Deconvexification-for-Training-Artificial-Neural-Networks">
  <title><![CDATA[Convexification and Deconvexification for Training Artificial Neural Networks]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/932/Convexification-and-Deconvexification-for-Training-Artificial-Neural-Networks</link>
  <description><![CDATA[The purpose of this dissertation research is to overcome a fundamental problem in the theory and application of artificial neural networks (ANNs). The problem, called the local minimum problem in training ANNs, has plagued the ANN community since the middle of 1980s.  ANNs trained with backpropagation are extensively utilized to solve various tasks in artificial intelligence fields for decades. The computing power of ANNs is derived through its particularly distributed structure together with...]]></description>
  <dc:date>2016-05-01</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/934/A-pairwise-algorithm-for-training-multilayer-perceptrons-with-the-normalized-risk-averting-error-criterion">
  <title><![CDATA[A pairwise algorithm for training multilayer perceptrons with the normalized risk-averting error criterion]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/934/A-pairwise-algorithm-for-training-multilayer-perceptrons-with-the-normalized-risk-averting-error-criterion</link>
  <description><![CDATA[Proper use of the normalized risk-averting error (NRAE) criterion has been shown to avoid nonglobal local minima effectively in the mean squared error (MSE) criterion. For training on large datasets, a pairwise algorithm for the NRAE criterion similar to the widely-used least mean square algorithm for the MSE criterion is proposed. The gradual deconvexification method employing this pairwise algorithm is tested on examples with built-in nonglobal local minima that are difficult to avoid and o...]]></description>
  <dc:date>2014-07-07</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/937/Overcoming-the-Local-Minimum-Problem-in-Training-Multilayer-Perceptrons-with-the-NRAE-Training-Method">
  <title><![CDATA[Overcoming the Local-Minimum Problem in Training Multilayer Perceptrons with the NRAE Training Method]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/937/Overcoming-the-Local-Minimum-Problem-in-Training-Multilayer-Perceptrons-with-the-NRAE-Training-Method</link>
  <description><![CDATA[A method of training multilayer perceptrons (MLPs) to reach a global or nearly global minimum of the standard mean squared error (MSE) criterion is proposed. It has been found that the region in the
weight space that does not have a local minimum of the normalized risk-averting error (NRAE) criterion expands strictly to the entire weight space as the risk-sensitivity index increases to infinity. If the MLP under training has enough hidden neurons, the MSE and NRAE criteria are both equal to ...]]></description>
  <dc:date>2012-07-11</dc:date>
 </item>
</rdf:RDF>
