Online learning over distributed networks

Simple item page
buir.advisorKozat, Süleyman Serdar
dc.contributor.authorSayın, Muhammed Ömer
dc.date.accessioned2016-07-01T11:10:54Z
dc.date.available2016-07-01T11:10:54Z
dc.date.issued2015
dc.descriptionCataloged from PDF version of article.en_US
dc.description.abstractWe study online learning strategies over distributed networks. Here, we have a distributed collection of agents with learning and cooperation capabilities. These agents observe a noisy version of a desired state of the nature through a linear model. The agents seek to learn this state by also interacting with each other yet the communication load plays significant role. To this end, we propose compressive diffusion strategies that extract the compressed information from the diffused data. Agents can compress the information into a scalar or a single bit, i.e., a substantial reduction in the communication load. Importantly, we show that agents can achieve a comparable performance to the conventional diffusion strategies that require the direct diffusion of information without compression and with infinite precision. We also examine which information to disclose and how to utilize them optimally in the mean-square-error (MSE) sense. Note that all the well-known distributed learning strategies achieve suboptimal learning performance in the MSE sense. Hence, we provide algorithms that achieve distributed minimum MSE (MMSE) performance over an arbitrary network topology based on the aggregation of information at each agent. This approach differs from the diffusion of information across network, i.e., exchange of local estimates. Notably, exchange of local estimates is sufficient only over the certain network topologies. For these networks, we also propose strategies that achieve the distributed MMSE performance through the diffusion of information. Hence, we can substantially reduce the communication load while achieving the best possible MSE performance. Finally, for practical implementations we provide approaches to reduce the complexity of the algorithms through the time-windowing of the observations.en_US
dc.description.provenanceMade available in DSpace on 2016-07-01T11:10:54Z (GMT). No. of bitstreams: 1 0006952.pdf: 2568547 bytes, checksum: 6efe179779b5277c37444500254e8023 (MD5) Previous issue date: 2015en
dc.description.statementofresponsibilitySayın, Muhammed Ömeren_US
dc.format.extentxi, 106 leavesen_US
dc.identifier.itemidB150670
dc.identifier.urihttp://hdl.handle.net/11693/30028
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectOnline learningen_US
dc.subjectCompressive diffusionen_US
dc.subjectDistributed networksen_US
dc.subjectBig dataen_US
dc.subject.lccB150670en_US
dc.titleOnline learning over distributed networksen_US
dc.title.alternativeDağıtılmış ağ üzerinde online öğrenmeen_US
dc.typeThesisen_US
thesis.degree.disciplineElectrical and Electronic Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelMaster's
thesis.degree.nameMS (Master of Science)

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
0006952.pdf
Size:
2.45 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Graduate School of Engineering and Science