{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00218594","sets":["1164:2735:10865:10962"]},"path":["10962"],"owner":"44499","recid":"218594","title":["組合せバンディット問題におけるInformation Directed SamplingのDC緩和について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-06-20"},"_buckets":{"deposit":"705b4ebe-1f17-4c30-bd77-25ead3efdd00"},"_deposit":{"id":"218594","pid":{"type":"depid","value":"218594","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"組合せバンディット問題におけるInformation Directed SamplingのDC緩和について","author_link":["568884","568885","568882","568886","568883","568881"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"組合せバンディット問題におけるInformation Directed SamplingのDC緩和について"},{"subitem_title":"On DC Relaxation of Information-directed Sampling in Combinatorial Multi-armed Bandit Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-06-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"京都大学"},{"subitem_text_value":"京都大学／理化学研究所"},{"subitem_text_value":"京都大学／理化学研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Kyoto University","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University/RIKEN","subitem_text_language":"en"},{"subitem_text_value":"Kyoto University/RIKEN","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/218594/files/IPSJ-MPS22138024.pdf","label":"IPSJ-MPS22138024.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS22138024.pdf","filesize":[{"value":"3.9 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"9b46e9fb-ce79-4eab-b714-d7e80c3f2068","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":[{}]},{"creatorNames":[{"creatorName":"土屋, 平"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Junta, Fujinaga","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Junya, Honda","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Taira, Tsuchiya","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"多腕バンディット問題では，選択肢集合の中から一つの要素を選択してその確率的な報酬を得るというプロセスを繰り返し，報酬和を最大化することを目指す．この問題の方策の一つである Information Directed Sampling (IDS) は，各選択肢の報酬の期待値だけでなく，最適な選択肢の情報量に着目するので，複雑な設定に適している．しかし，各時刻で最適化問題を解くので，選択肢が組合せ的な形で表される組合せバンディットに適用すると計算量が爆発的に増大してしまう．そこで，最適化問題を DC 計画問題に連続緩和する方法を提案し，緩和による計算量削減の効果と報酬和最大化に対する影響について比較する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-06-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"24","bibliographicVolumeNumber":"2022-MPS-138"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":218594,"updated":"2025-01-19T15:06:55.508686+00:00","links":{},"created":"2025-01-19T01:18:56.994003+00:00"}