Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Akihiro Yabe
@inproceedings{DBLP:conf/acml/MatsuokaOY21, author = {Tatsuya Matsuoka and Naoto Ohsaka and Akihiro Yabe}, editor = {Vineeth N. Balasubramanian and Ivor W. Tsang}, title = {On the Convex Combination of Determinantal Point Processes}, booktitle = {Asian Conference on Machine Learning, {ACML} 2021, 17-19 November 2021, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {157}, pages = {158--173}, publisher = {{PMLR}}, year = {2021}, url = {https://proceedings.mlr.press/v157/matsuoka21a.html}, timestamp = {Wed, 22 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/acml/MatsuokaOY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sdm/OhsakaSY20, author = {Naoto Ohsaka and Tomoya Sakai and Akihiro Yabe}, editor = {Carlotta Demeniconi and Nitesh V. Chawla}, title = {A Predictive Optimization Framework for Hierarchical Demand Matching}, booktitle = {Proceedings of the 2020 {SIAM} International Conference on Data Mining, {SDM} 2020, Cincinnati, Ohio, USA, May 7-9, 2020}, pages = {172--180}, publisher = {{SIAM}}, year = {2020}, url = {https://doi.org/10.1137/1.9781611976236.20}, doi = {10.1137/1.9781611976236.20}, timestamp = {Thu, 04 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sdm/OhsakaSY20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-12626, author = {Akihiro Yabe}, title = {Causality and Robust Optimization}, journal = {CoRR}, volume = {abs/2002.12626}, year = {2020}, url = {https://arxiv.org/abs/2002.12626}, eprinttype = {arXiv}, eprint = {2002.12626}, timestamp = {Tue, 05 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-12626.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2003-00248, author = {Akihiro Yabe and Takanori Maehara}, title = {Tightly Robust Optimization via Empirical Domain Reduction}, journal = {CoRR}, volume = {abs/2003.00248}, year = {2020}, url = {https://arxiv.org/abs/2003.00248}, eprinttype = {arXiv}, eprint = {2003.00248}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2003-00248.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-01576, author = {Akihiro Yabe and Takanori Maehara}, title = {Empirical Hypothesis Space Reduction}, journal = {CoRR}, volume = {abs/1909.01576}, year = {2019}, url = {http://arxiv.org/abs/1909.01576}, eprinttype = {arXiv}, eprint = {1909.01576}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-01576.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aistats/ItoHSYFKK18, author = {Shinji Ito and Daisuke Hatano and Hanna Sumita and Akihiro Yabe and Takuro Fukunaga and Naonori Kakimura and Ken{-}ichi Kawarabayashi}, editor = {Amos J. Storkey and Fernando P{\'{e}}rez{-}Cruz}, title = {Online Regression with Partial Information: Generalization and Linear Projection}, booktitle = {International Conference on Artificial Intelligence and Statistics, {AISTATS} 2018, 9-11 April 2018, Playa Blanca, Lanzarote, Canary Islands, Spain}, series = {Proceedings of Machine Learning Research}, volume = {84}, pages = {1599--1607}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v84/ito18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:22 +0200}, biburl = {https://dblp.org/rec/conf/aistats/ItoHSYFKK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/ItoYF18, author = {Shinji Ito and Akihiro Yabe and Ryohei Fujimaki}, editor = {Jennifer G. Dy and Andreas Krause}, title = {Unbiased Objective Estimation in Predictive Optimization}, booktitle = {Proceedings of the 35th International Conference on Machine Learning, {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July 10-15, 2018}, series = {Proceedings of Machine Learning Research}, volume = {80}, pages = {2181--2190}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v80/ito18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:30 +0200}, biburl = {https://dblp.org/rec/conf/icml/ItoYF18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/YabeHSIKFK18, author = {Akihiro Yabe and Daisuke Hatano and Hanna Sumita and Shinji Ito and Naonori Kakimura and Takuro Fukunaga and Ken{-}ichi Kawarabayashi}, editor = {Jennifer G. Dy and Andreas Krause}, title = {Causal Bandits with Propagating Inference}, booktitle = {Proceedings of the 35th International Conference on Machine Learning, {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July 10-15, 2018}, series = {Proceedings of Machine Learning Research}, volume = {80}, pages = {5508--5516}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v80/yabe18a.html}, timestamp = {Wed, 03 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/YabeHSIKFK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/ItoHSYFKK18, author = {Shinji Ito and Daisuke Hatano and Hanna Sumita and Akihiro Yabe and Takuro Fukunaga and Naonori Kakimura and Ken{-}ichi Kawarabayashi}, editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicol{\`{o}} Cesa{-}Bianchi and Roman Garnett}, title = {Regret Bounds for Online Portfolio Selection with a Cardinality Constraint}, booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr{\'{e}}al, Canada}, pages = {10611--10620}, year = {2018}, url = {https://proceedings.neurips.cc/paper/2018/hash/6c1e55ec7c43dc51a37472ddcbd756fb-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/ItoHSYFKK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-02252, author = {Akihiro Yabe and Daisuke Hatano and Hanna Sumita and Shinji Ito and Naonori Kakimura and Takuro Fukunaga and Ken{-}ichi Kawarabayashi}, title = {Causal Bandits with Propagating Inference}, journal = {CoRR}, volume = {abs/1806.02252}, year = {2018}, url = {http://arxiv.org/abs/1806.02252}, eprinttype = {arXiv}, eprint = {1806.02252}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-02252.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/YabeIF17, author = {Akihiro Yabe and Shinji Ito and Ryohei Fujimaki}, editor = {Carles Sierra}, title = {Robust Quadratic Programming for Price Optimization}, booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017}, pages = {4648--4654}, publisher = {ijcai.org}, year = {2017}, url = {https://doi.org/10.24963/ijcai.2017/648}, doi = {10.24963/IJCAI.2017/648}, timestamp = {Tue, 20 Aug 2019 16:16:54 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/YabeIF17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/ItoHSYFKK17, author = {Shinji Ito and Daisuke Hatano and Hanna Sumita and Akihiro Yabe and Takuro Fukunaga and Naonori Kakimura and Ken{-}ichi Kawarabayashi}, editor = {Isabelle Guyon and Ulrike von Luxburg and Samy Bengio and Hanna M. Wallach and Rob Fergus and S. V. N. Vishwanathan and Roman Garnett}, title = {Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation}, booktitle = {Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, {USA}}, pages = {4099--4108}, year = {2017}, url = {https://proceedings.neurips.cc/paper/2017/hash/6e5025ccc7d638ae4e724da8938450a6-Abstract.html}, timestamp = {Thu, 21 Jan 2021 13:58:27 +0100}, biburl = {https://dblp.org/rec/conf/nips/ItoHSYFKK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HiraiY15, author = {Hiroshi Hirai and Akihiro Yabe}, title = {A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications}, journal = {J. Comb. Theory, Ser. {A}}, volume = {133}, pages = {261--279}, year = {2015}, url = {https://doi.org/10.1016/j.jcta.2015.02.005}, doi = {10.1016/J.JCTA.2015.02.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/HiraiY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/MaeharaYK15, author = {Takanori Maehara and Akihiro Yabe and Ken{-}ichi Kawarabayashi}, editor = {Francis R. Bach and David M. Blei}, title = {Budget Allocation Problem with Multiple Advertisers: {A} Game Theoretic View}, booktitle = {Proceedings of the 32nd International Conference on Machine Learning, {ICML} 2015, Lille, France, 6-11 July 2015}, series = {{JMLR} Workshop and Conference Proceedings}, volume = {37}, pages = {428--437}, publisher = {JMLR.org}, year = {2015}, url = {http://proceedings.mlr.press/v37/maehara15.html}, timestamp = {Wed, 29 May 2019 08:41:45 +0200}, biburl = {https://dblp.org/rec/conf/icml/MaeharaYK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Yabe15, author = {Akihiro Yabe}, title = {Bi-polynomial rank and determinantal complexity}, journal = {CoRR}, volume = {abs/1504.00151}, year = {2015}, url = {http://arxiv.org/abs/1504.00151}, eprinttype = {arXiv}, eprint = {1504.00151}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Yabe15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.