262 0

Full metadata record

DC FieldValueLanguage
dc.contributor.author이상근-
dc.date.accessioned2018-03-19T02:02:27Z-
dc.date.available2018-03-19T02:02:27Z-
dc.date.issued2016-01-
dc.identifier.citationNEUROCOMPUTING, v. 173, Page. 9-23en_US
dc.identifier.issn0925-2312-
dc.identifier.issn1872-8286-
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0925231215010449-
dc.identifier.urihttp://hdl.handle.net/20.500.11754/48656-
dc.description.abstractMachine learning on resource-constrained ubiquitous devices suffers from high energy consumption and slow execution. The number of clock cycles that is consumed by arithmetic instructions has an immediate impact on both. In computer systems, the number of consumed cycles depends on particular operations and the types of their operands. We propose a new class of probabilistic graphical models that approximates the full joint probability distribution of discrete multivariate random variables by relying only on integer addition/multiplication and binary bit shift operations. This allows us to sample from high-dimensional generative models and to use structured discriminative classifiers even on computational devices with slow floating point units or in situations where energy has to be saved. While theory and experiments on random synthetic data suggest that hard instances (leading to a large approximation error) exist, experiments on benchmark and real-world data show that the integer models achieve qualitatively the same results as their double-precision counterparts. Moreover, clock cycle consumption on two hardware platforms is regarded, where our results show that resource savings due to integer approximation is even larger on low-end hardware. The integer models consume half of the clock cycles and a small fraction of memory compared to ordinary undirected graphical models. (C) 2015 Elsevier B.V. All rights reserved.en_US
dc.description.sponsorshipThis work has been supported by Deutsche Forschungsgemeinschaft (DFG) within the Collaborative Research Center SFB 876, projects A1 and C1.en_US
dc.language.isoen_USen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.subjectGraphical modelen_US
dc.subjectInteger parameteren_US
dc.subjectInteger computationen_US
dc.subjectCONVERGENCEen_US
dc.titleInteger undirected graphical models for resource-constrained systemsen_US
dc.typeArticleen_US
dc.relation.volume173-
dc.identifier.doi10.1016/j.neucom.2015.01.091-
dc.relation.page9-23-
dc.relation.journalNEUROCOMPUTING-
dc.contributor.googleauthorPiatkowski, Nico-
dc.contributor.googleauthorLee, Sangkyun-
dc.contributor.googleauthorMorik, Katharina-
dc.relation.code2016010059-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF COMPUTING[E]-
dc.sector.departmentDIVISION OF COMPUTER SCIENCE-
dc.identifier.pidsangkyun-
Appears in Collections:
ETC[S] > 연구정보
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE