{"links":{},"id":232505,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00232505","sets":["1164:5159:11541:11549"]},"path":["11549"],"owner":"44499","recid":"232505","title":["スパース係数の秘匿を考慮した深層展開でのISTAによるLASSO解推定"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-02-22"},"_buckets":{"deposit":"f29bfb36-f270-4a11-b26a-64768a74b003"},"_deposit":{"id":"232505","pid":{"type":"depid","value":"232505","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"スパース係数の秘匿を考慮した深層展開でのISTAによるLASSO解推定","author_link":["629444","629445","629446","629443"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"スパース係数の秘匿を考慮した深層展開でのISTAによるLASSO解推定"},{"subitem_title":"Privacy preserving deep unrolling ISTA method for sparse representation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ポスターセッション1 SIP/EA","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-02-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"琉球大学理工学研究科知能情報プログラム"},{"subitem_text_value":"琉球大学情報基盤統括センター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, University of the Ryukyus","subitem_text_language":"en"},{"subitem_text_value":" Information Technology Center, University of the Ryukyus ","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/232505/files/IPSJ-SLP24151035.pdf","label":"IPSJ-SLP24151035.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLP24151035.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"22"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"903f1e23-e4e9-4ba6-90f1-1a2cb69047c1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"由解, 仁知翔"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"仲地, 孝之"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Nichika, Yuge","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takayuki, Nakachi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10442647","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8663","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年，エッジ・クラウドコンピューティングの活用が広まっており，それに伴いスパースモデリングという手法が注目されている．スパースモデリングは，深層学習 に対して 1) 少量データでの学習が可能，2) 低い演算量，3) 説明可能な AI といった側面を持ち，特にエッジコンピューティングと相性が良いアルゴリズムである．一方，エッジ・クラウドコンピューティングでは攻撃や事故によるデータの流出によってプライバシーを侵害する問題の発生が危惧されている．このような背景から，スパースモデリングの係数推定法の一つである ISTA とランダムユニタリ変換による秘匿演算手法を組み合わせた secure ISTA が提案されている．著者らはこの秘匿演算手法を ISTA よりも解への収束が早い TISTA に組み合わせた secure TISTA を提案した．本稿では，secure TISTA に置換行列を組み合わせることによってスパース係数の秘匿を考慮した secure permutation TISTA を提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In recent years, the use of edge and cloud computing has expanded. Along with this, a method called sparse modeling is attracting attention. Sparse modeling is an algorithm that aligns very well with edge computing. In edge/cloud computing, there are concerns that privacy may be violated due to data leakage due to attacks or accidents. Against this background, secure ISTA, which combines ISTA, one of the sparse modeling coefficient estimation methods, and a secure operation method using random unitary transformation, has been proposed. The authors proposed secure TISTA, which is an adaptation of this secure operation method to TISTA, which converges to a solution faster than secure ISTA. In this study, we propose secure permutation TISTA, an algorithm that combines secure TISTA with permutation matrix encryption.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告音声言語情報処理（SLP）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-02-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"35","bibliographicVolumeNumber":"2024-SLP-151"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:33:24.745131+00:00","updated":"2025-01-19T10:25:31.114090+00:00"}