<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:title>Error correcting codes for distributed non-linear function computation</dc:title><dc:creator>Tapha, Thitiwat </dc:creator><dc:subject>Communication system</dc:subject><dc:subject>optimization</dc:subject><dc:subject>gradient descent</dc:subject><dc:subject>alternating optimization</dc:subject><dc:subject>logistic regression</dc:subject><dc:subject>loss function</dc:subject><dc:subject>matrix-multiplication</dc:subject><dc:coverage>Electrical Engineering</dc:coverage><dc:relation>B S</dc:relation><dc:description>We provide novel coded computational strategies for distributed non-linear function computation. We utilize the idea of previous studies on coded matrix-multiplication computation and extend our study to achieve optimal error in non-linear distributed logistic regression. We consider the system of P computation nodes where each node receives two one-dimension input matrices. Our computation system reduces the error from stragglers via encoding and decoding. Our experiment with a random set of the number of worker nodes, threshold, and number of inputs has yielded conclusions on the effect of parameters on the loss function. Moreover, we develop an optimization framework based on alternating minimization that enables the discovery of new codes to achieve optimal coefficients to minimize the error in non-linear functions.</dc:description><dc:contributor>Viveck Ramesh Cadambe, Thesis Supervisor</dc:contributor><dc:contributor>Julio Urbina, Thesis Honors Advisor</dc:contributor><dc:rights>open_access</dc:rights><dc:date>2024-04-03T21:24:49Z</dc:date><dc:identifier>https://honors.libraries.psu.edu/catalog/8948tft5219</dc:identifier></oai_dc:dc>