{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360848655628362240.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1007/978-3-642-40935-6_3"}},{"identifier":{"@type":"URI","@value":"http://link.springer.com/content/pdf/10.1007/978-3-642-40935-6_3"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@value":"Efficient Algorithms for Combinatorial Online Prediction"}],"description":[{"notation":[{"@value":"We study online linear optimization problems over concept classes which are defined in some combinatorial ways. Typically, those concept classes contain finite but exponentially many concepts and hence the complexity issue arises. In this paper, we survey some recent results on universal and efficient implementations of low-regret algorithmic frameworks such as Follow the Regularized Leader FTRL and Follow the Perturbed Leader FPL."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1420001326221324160","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50236395"},{"@type":"NRID","@value":"1000050236395"},{"@type":"NRID","@value":"9000017682855"},{"@type":"NRID","@value":"9000403557114"},{"@type":"NRID","@value":"9000019096537"},{"@type":"NRID","@value":"9000299517109"},{"@type":"NRID","@value":"9000006588997"},{"@type":"NRID","@value":"9000403558409"},{"@type":"NRID","@value":"9000396103803"},{"@type":"NRID","@value":"9000243893439"},{"@type":"NRID","@value":"9000287144058"},{"@type":"NRID","@value":"9000378058471"},{"@type":"NRID","@value":"9000107318932"},{"@type":"NRID","@value":"9000414200602"},{"@type":"NRID","@value":"9000403556876"},{"@type":"NRID","@value":"9000308048418"},{"@type":"NRID","@value":"9000405860457"},{"@type":"NRID","@value":"9000403556880"},{"@type":"NRID","@value":"9000403559591"},{"@type":"NRID","@value":"9000414200604"},{"@type":"NRID","@value":"9000403558412"},{"@type":"NRID","@value":"9000403559595"},{"@type":"NRID","@value":"9000413547421"},{"@type":"NRID","@value":"9000403558817"},{"@type":"NRID","@value":"9000383088051"},{"@type":"NRID","@value":"9000398137823"},{"@type":"NRID","@value":"9000308048533"},{"@type":"NRID","@value":"9000397687882"},{"@type":"NRID","@value":"9000402285513"},{"@type":"NRID","@value":"9000321620786"},{"@type":"NRID","@value":"9000356603906"},{"@type":"NRID","@value":"9000403556872"},{"@type":"NRID","@value":"9000331084218"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/eiji_takimoto"}],"foaf:name":[{"@value":"Eiji Takimoto"}]},{"@id":"https://cir.nii.ac.jp/crid/1420282801210591872","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"60404026"},{"@type":"NRID","@value":"1000060404026"},{"@type":"ORCID","@value":"0000-0002-1536-1269"},{"@type":"NRID","@value":"9000403557113"},{"@type":"NRID","@value":"9000019096536"},{"@type":"NRID","@value":"9000018481548"},{"@type":"NRID","@value":"9000406388185"},{"@type":"NRID","@value":"9000017194808"},{"@type":"NRID","@value":"9000403558407"},{"@type":"NRID","@value":"9000403557109"},{"@type":"NRID","@value":"9000396103802"},{"@type":"NRID","@value":"9000404313888"},{"@type":"NRID","@value":"9000243893438"},{"@type":"NRID","@value":"9000287144056"},{"@type":"NRID","@value":"9000378058470"},{"@type":"NRID","@value":"9000107318931"},{"@type":"NRID","@value":"9000404313897"},{"@type":"NRID","@value":"9000414200601"},{"@type":"NRID","@value":"9000331444779"},{"@type":"NRID","@value":"9000331084081"},{"@type":"NRID","@value":"9000399248847"},{"@type":"NRID","@value":"9000403957215"},{"@type":"NRID","@value":"9000403556874"},{"@type":"NRID","@value":"9000308048416"},{"@type":"NRID","@value":"9000405860456"},{"@type":"NRID","@value":"9000403556879"},{"@type":"NRID","@value":"9000403559590"},{"@type":"NRID","@value":"9000019056252"},{"@type":"NRID","@value":"9000414200605"},{"@type":"NRID","@value":"9000303992340"},{"@type":"NRID","@value":"9000403558411"},{"@type":"NRID","@value":"9000403558404"},{"@type":"NRID","@value":"9000404314181"},{"@type":"NRID","@value":"9000403559594"},{"@type":"NRID","@value":"9000413547420"},{"@type":"NRID","@value":"9000403558816"},{"@type":"NRID","@value":"9000383088050"},{"@type":"NRID","@value":"9000398137821"},{"@type":"NRID","@value":"9000399247832"},{"@type":"NRID","@value":"9000308048531"},{"@type":"NRID","@value":"9000397687881"},{"@type":"NRID","@value":"9000402285512"},{"@type":"NRID","@value":"9000321620785"},{"@type":"NRID","@value":"9000356603905"},{"@type":"NRID","@value":"9000107323000"},{"@type":"NRID","@value":"9000403957217"},{"@type":"NRID","@value":"9000403556871"},{"@type":"NRID","@value":"9000403556870"},{"@type":"NRID","@value":"9000403559585"},{"@type":"NRID","@value":"9000405913775"},{"@type":"NRID","@value":"9000405914415"},{"@type":"NRID","@value":"9000021655056"},{"@type":"NRID","@value":"9000331084217"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/kohei_hatano"}],"foaf:name":[{"@value":"Kohei Hatano"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"03029743"},{"@type":"EISSN","@value":"16113349"},{"@type":"ISBN","@value":"9783642409349"},{"@type":"ISBN","@value":"9783642409356"}],"prism:publicationName":[{"@value":"Lecture Notes in Computer Science"}],"dc:publisher":[{"@value":"Springer Berlin Heidelberg"}],"prism:publicationDate":"2013","prism:startingPage":"22","prism:endingPage":"32"},"reviewed":"false","url":[{"@id":"http://link.springer.com/content/pdf/10.1007/978-3-642-40935-6_3"}],"createdAt":"2013-09-27","modifiedAt":"2023-07-04","project":[{"@id":"https://cir.nii.ac.jp/crid/1040282257122648448","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"23300003"},{"@type":"JGN","@value":"JP23300003"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-23300003/"}],"notation":[{"@language":"ja","@value":"凸最適化の手法を用いたオンライン意思決定に関する研究"},{"@language":"en","@value":"Online Decision Making by Convex Optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1040282257166345344","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"24106010"},{"@type":"JGN","@value":"JP24106010"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PLANNED-24106010/"}],"notation":[{"@language":"ja","@value":"学習理論からの計算限界解明へのアプローチ"},{"@language":"en","@value":"Approach from learning theory toward understanding the limitations of computation"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360002214930435200","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Online Linear Optimization over Permutations"}]},{"@id":"https://cir.nii.ac.jp/crid/1360283689915860608","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Online Prediction under Submodular Constraints"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292620568194560","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Lectures on Polytopes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298343465921152","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The Convex Optimization Approach to Regret Minimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855568656105728","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Randomized metarounding"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855569309982592","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418521466140672","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"On the spanning tree polyhedron"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699996331183360","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Efficient algorithms for online decision problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262945595159040","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Aggregation of Partial Rankings, p-Ratings and Top-m Lists"}]},{"@id":"https://cir.nii.ac.jp/crid/1362544419034715392","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Submodular function minimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1362544420379568000","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Playing Games with Approximation Algorithms"}]},{"@id":"https://cir.nii.ac.jp/crid/1362544421152208768","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Matroids and the greedy algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825895527072640","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"New  $\\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107369549627392","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Improved approximations of packing and covering problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107370996352256","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Aggregating inconsistent information"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233269247328640","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1007/978-3-642-40935-6_3"},{"@type":"KAKEN","@value":"PRODUCT-13835839"},{"@type":"KAKEN","@value":"PRODUCT-14456003"},{"@type":"OPENAIRE","@value":"doi_dedup___::781708229359ee0ee9c5900924590d31"}]}