Stochastic Shadow-Cutting Machine
dc.contributor | Aalto-yliopisto | fi |
dc.contributor | Aalto University | en |
dc.contributor.author | Uykan, Zekeriya | |
dc.contributor.author | Jantti, Riku | |
dc.contributor.department | Department of Information and Communications Engineering | en |
dc.contributor.groupauthor | Communication Engineering | en |
dc.date.accessioned | 2025-02-12T06:29:10Z | |
dc.date.available | 2025-02-12T06:29:10Z | |
dc.date.issued | 2024-01-01 | |
dc.description | Publisher Copyright: © 2023 IEEE. | |
dc.description.abstract | Recently, a new concept called shadow-cuts has recently been proposed for a fully-connected graph whose edge matrix is Hermitian with arbitrary complex numbers. Each neuron is associated with a phase and the sum of shadow cuts is defined as the sum of inter-cluster phased edges. However, the shadow-cut machine is 100% deterministic and therefore its modeling capacity is relatively limited. In this brief, we (i) extend it to stochastic domain which yields the so-called 'Stochastic Shadow-Cutting Machine' (SSCM), and (ii) show that choosing the energy function of the SSCM as the sum of shadow-cuts yields similar phenomena as in those from the statistical mechanics like Ising model, xy-model, pott model, Stochastic Hopfield Networks, etc., Thus, the proposed SSCM provides a general framework to examine various phenomena like the phase changes of the SSCM as the temperature increases. Because the SSCM in low temperatures behaves as an Associative Memory system (i.e., 'ferro-magnet'), it is possible to examine the critical temperatures when the SSCM cannot 'recover/remember' the patterns any more (i.e. 'anti-ferromagnet'), which we define as 'phase change' of the SSCM. | en |
dc.description.version | Peer reviewed | en |
dc.format.extent | 4 | |
dc.format.mimetype | application/pdf | |
dc.identifier.citation | Uykan, Z & Jantti, R 2024, Stochastic Shadow-Cutting Machine. in 2023 31st Telecommunications Forum, TELFOR 2023 - Proceedings. 2023 31st Telecommunications Forum, TELFOR 2023 - Proceedings, IEEE, Telecommunications Forum, Belgrade, Serbia, 21/11/2023. https://doi.org/10.1109/TELFOR59449.2023.10372707 | en |
dc.identifier.doi | 10.1109/TELFOR59449.2023.10372707 | |
dc.identifier.isbn | 979-8-3503-0313-1 | |
dc.identifier.other | PURE UUID: cfde3b12-2286-43fa-a337-94d2d4b948ae | |
dc.identifier.other | PURE ITEMURL: https://research.aalto.fi/en/publications/cfde3b12-2286-43fa-a337-94d2d4b948ae | |
dc.identifier.other | PURE LINK: http://www.scopus.com/inward/record.url?scp=85183472800&partnerID=8YFLogxK | |
dc.identifier.other | PURE FILEURL: https://research.aalto.fi/files/172699301/jrnl_Uykan_Jantti_2023_TELFOR.pdf | |
dc.identifier.uri | https://aaltodoc.aalto.fi/handle/123456789/134145 | |
dc.identifier.urn | URN:NBN:fi:aalto-202502122424 | |
dc.language.iso | en | en |
dc.relation.ispartof | Telecommunications Forum | en |
dc.relation.ispartofseries | 2023 31st Telecommunications Forum, TELFOR 2023 - Proceedings | en |
dc.rights | openAccess | en |
dc.subject.keyword | associative memory systems | |
dc.subject.keyword | Graphs with complex-valued edges | |
dc.subject.keyword | inter-cluster phased edges | |
dc.subject.keyword | Ising model | |
dc.subject.keyword | statistical mechanics | |
dc.subject.keyword | Stochastic Shadow-Cutting Machine | |
dc.title | Stochastic Shadow-Cutting Machine | en |
dc.type | A4 Artikkeli konferenssijulkaisussa | fi |
dc.type.version | acceptedVersion |