Skip to content

Latest commit

 

History

History
152 lines (77 loc) · 7.07 KB

publications.rst

File metadata and controls

152 lines (77 loc) · 7.07 KB

Publications

See also: Google Scholar, DBLP, Researchmap

Refereed Journals and Conferences

.. rst-class:: cardlist

    - **Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds** [`Proceedings <https://papers.nips.cc/paper/2020/hash/0163cceb20f5ca7b313419c068abd9dc-Abstract.html>`_]

      with Chris Liaw and Nick Harvey

      `Advances in Neural Information Processing Systems (NeurIPS), 2020 <https://nips.cc/Conferences/2020>`_.

    - **Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits** [`Proceedings <https://papers.nips.cc/paper/2020/hash/15bb63b28926cd083b15e3b97567bbea-Abstract.html>`_]

      with Shinji Ito, Shuichi Hirahara, and Yuichi Yoshida

      `Advances in Neural Information Processing Systems (NeurIPS), 2020 <https://nips.cc/Conferences/2020>`_, **spotlight**.

    - **No-regret algorithms for online k-submodular maximization** [`Proceedings <http://proceedings.mlr.press/v89/soma19a.html>`_] [`ArXiv <https://arxiv.org/abs/1807.04965>`_]

      `The 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), 2019 <https://www.aistats.org/>`_.

    - **Spectral Sparsification of Hypergraphs** [`Proceedings <https://epubs.siam.org/doi/abs/10.1137/1.9781611975482.159>`_]

      with Yuichi Yoshida

      `ACM-SIAM Symposium on Discrete Algorithms (SODA), 2019 <https://www.siam.org/conferences/CM/Main/soda19>`_.

    - **Fast greedy algorithms for dictionary selection with generalized sparsity constraints**  [`Proceedings <https://papers.nips.cc/paper/7724-fast-greedy-algorithms-for-dictionary-selection-with-generalized-sparsity-constraints>`_]

      with Kaito Fujii

      `Advances in Neural Information Processing Systems (NeurIPS), 2018 <https://nips.cc/Conferences/2018>`_, **spotlight**.

    - **Maximizing Monotone Submodular Functions over the Integer Lattice** [`ArXiv <http://arxiv.org/abs/1503.01218v2>`_] [`full text <https://rdcu.be/5thr>`_]

      with Yuichi Yoshida

      `Mathematical Programming, 172, pp.539--563, 2018 <https://doi.org/10.1007/s10107-018-1324-y>`_.

      `Integer Programming and Combinatorial Optimization (IPCO), 2016 <http://events.ulg.ac.be/ipco2016/>`_

    - **A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity** [`ArXiv <https://arxiv.org/abs/1709.02910>`_]

      with Yuichi Yoshida

      `The 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018 <https://iuuk.mff.cuni.cz/~icalp2018>`_.

    - **Maximally Invariant Data Perturbation as Explanation** [`ArXiv <https://arxiv.org/abs/1806.07004>`_]

      with Satoshi Hara, Kouichi Ikeno, and Takanori Maehara

      ICML Workshop on Human Interpretability in Machine Learning (WHI), 2018

    - **On orthogonal tensors and best rank-one approximation ratio** [`ArXiv <https://arxiv.org/abs/1707.02569>`_]

      with Zhening Li, Yuji Nakatsukasa, André Uschmajew

      `SIAM Jounal on Matrix Analysis and Applications, 39 (1), pp. 400--425, 2018 <https://epubs.siam.org/doi/abs/10.1137/17M1144349>`_.

    - **Regret Ratio Minimization in Multi-objective Submodular Function Maximization** [`PDF <http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14477/13859>`_]

      with Yuichi Yoshida

      `The 31st AAAI Conference on Artificial Inteligence, 2017 <http://www.aaai.org/Conferences/AAAI/aaai17.php>`_

    - **Non-monotone DR-Submodular Function Maximization** [`ArXiv <https://arxiv.org/abs/1612.00960v1>`_]

      with Yuichi Yoshida

      `The 31st AAAI Conference on Artificial Inteligence, 2017 <http://www.aaai.org/Conferences/AAAI/aaai17.php>`_

    - **Finding a low-rank basis in a matrix subspace**  [`Full text <http://rdcu.be/nmLj>`_] [`ArXiv <https://arxiv.org/abs/1503.08601v2>`_]

      with Yuji Nakatsukasa and André Uschmajew

      `Mathematical Programming, 162(1), pp. 325--361, 2017 <http://link.springer.com/article/10.1007/s10107-016-1042-2>`_.


    - **Non-Convex Compressed Sensing with the Sum-of-Squares Method** [`Proceedings <http://epubs.siam.org/doi/abs/10.1137/1.9781611974331.ch42>`_] [`PDF <papers/soda2016.pdf>`_]

      with Yuichi Yoshida

      `ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016 <https://www.siam.org/meetings/da16/>`_


    - **Multicasting in Linear Deterministic Relay Network by Matrix Completion** [`PDF(technical report) <http://www.keisu.t.u-tokyo.ac.jp/research/techrep/data/2013/METR13-34.pdf>`_]

      `IEEE Transactions on Information Theory, 62(2), pp. 870--875, 2016 <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7358153>`_.

      `IEEE International Symposium on Information Theory (ISIT), 2014 <http://www.isit2014.org>`_

    - **A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice** [`Proceedings <http://papers.nips.cc/paper/5927-a-generalization-of-submodular-cover-via-the-diminishing-return-property-on-the-integer-lattice>`_]

      with Yuichi Yoshida

      `Advances in Neural Information Processing Systems (NIPS), 2015 <https://nips.cc/Conferences/2015>`_,
      poster


    - **Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm**  [`PDF(extended version) <papers/icml2014.pdf>`_]

      with Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi

      `International Conference on Machine Learning (ICML), 2014, <http://icml.cc/2014>`_ **Cycle 1 (acceptance rate: 27%)**



    - **Fast Deterministic Algorithms for Matrix Completion Problems**, [`PDF <papers/sidma2015.pdf>`_]

      `SIAM Journal on Discrete Mathematics, 28(1), pp. 490--502, 2014 <http://epubs.siam.org/doi/abs/10.1137/130909214>`_.

      `Integer Programming and Combinatorial Optimization (IPCO), 2013 <https://www.cec.uchile.cl/~ipco2013>`_

Preprints

.. rst-class:: cardlist

    - **Information Geometry of Operator Scaling** [`ArXiv <https://arxiv.org/abs/2005.01453>`_]

      with Takeru Matsuda

      arxiv, 2020.

    - **Statistical Learning with Conditional Value at Risk** [`ArXiv <https://arxiv.org/abs/2002.05826>`_]

      with Yuichi Yoshida

      arxiv, 2020.

    - **Polynomial-Time Algorithms for Submodular Laplacian Systems** [`ArXiv <https://arxiv.org/abs/1803.10923>`_]

      with Kaito Fujii, Yuichi Yoshida

      arxiv, 2018.

Thesis

.. rst-class:: cardlist

    - Master: "Faster Deterministic Algorithms for Matrix Completion Problems,” Kyoto University, 2013, supervised by Satoru Iwata.

      **Operation Research Society Japan Student Paper Award (第31回日本オペレーションズ・リサーチ学会学生論文賞)**

    - Doctor: "Submodular and Sparse Optimization Methods for Machine Learning and Communication," 2016, supervised by Satoru Iwata.

      **Department Award (情報理工学系研究科研究科長賞)**