研究成果
査読付論文誌・会議録
Fast and numerically stable implementation of rate constant matrix contraction method
Shinichi Hemmi, Satoru Iwata, and Taihei Oki
Proceedings of the 10th International Council for Industrial and Applied Mathematics (ICIAM '23), to appear.
Virtual ligand-assisted optimization: a rational strategy for ligand engineering
Wataru Matsuoka, Taihei Oki, Ren Yamada, Tomohiko Yokoyama, Shinichi Suda, Carla M. Saunders, Bastian B. Skjelstad, Yu Harabuchi, Natalie Fey, Satoru Iwata, and Satoshi Maeda
ACS Catalysis, 14(21):16297–16312, 2024.
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, and Tasuku Soma
Mathematical Programming, 2024.
No-regret M${}^\natural$-concave function maximization: stochastic bandit algorithms and NP-hardness of adversarial full-information setting
Taihei Oki and Shinsaku Sakaue
Advances in Neural Information Processing Systems 37 (NeurIPS '24), pp. 57418–57438, 2024.
Data-driven projection for reducing dimensionality of linear programs: generalization bound and learning methods
Shinsaku Sakaue and Taihei Oki
Advances in Neural Information Processing Systems 37 (NeurIPS '24), pp. 12825–12846, 2024.
Fractional linear matroid matching is in quasi-NC
Rohit Gurjar, Taihei Oki, and Roshan Raj
Proceedings of the 32nd Annual European Symposium on Algorithms (ESA ’24), LIPIcs 308, pp. 63:1–63:14, 2024.
Structural preprocessing method for nonlinear differential-algebraic equations using linear symbolic matrices
Taihei Oki and Yujin Song
Proceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC ’24), pp. 143–152, 2024.
Online structured prediction with Fenchel–Young losses and improved surrogate regret for online multiclass classification with logistic loss
Shinsaku Sakaue, Han Bao, Taira Tsuchiya, and Taihei Oki
Proceedings of the 37th Conference on Learning Theory (COLT ’24), PMLR 247, pp. 4458–4486, 2024.
Problems on group-labeled matroid bases
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz
Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP ’24), LIPIcs 297, pp. 86:1–86:20, 2024.
Differentiating the yield of chemical reactions using parameters in first-order kinetic equations to identify elementary steps that control the reactivity from complicated reaction path networks
Yu Harabuchi, Tomohiko Yokoyama, Wataru Matsuoka, Taihei Oki, Satoru Iwata, and Satoshi Maeda
The Journal of Physical Chemistry, 128(14):2883–2890, 2024.
Faster discrete convex function minimization with predictions: the M-Convex case
Taihei Oki and Shinsaku Sakaue
Advances in Neural Information Processing Systems 36 (NeurIPS '23), pp. 68576–68588, 2023.
Rethinking warm-starts with predictions: learning predictions close to sets of optimal solutions for faster $\text{L}$-/$\text{L}^\natural$-convex function minimization
Shinsaku Sakaue and Taihei Oki
Proceedings of the 40th International Conference on Machine Learning (ICML '23), PMLR 202, pp. 29760–29776, 2023.
Improved generalization bound and learning of sparsity patterns for data-driven low-rank approximation
Shinsaku Sakaue and Taihei Oki
Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS '23), PMLR 206, pp. 1–10, 2023.
Algebraic algorithms for fractional linear matroid parity via noncommutative rank
SIAM Journal on Computing, 54(1):134–162, 2025.
Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '23), pp. 4188–4204, 2023. (会議録におけるタイトル: “Algebraic algorithms for fractional linear matroid parity via non-commutative rank”)
Discrete-convex-analysis-based framework for warm-starting algorithms with predictions
Shinsaku Sakaue and Taihei Oki
Advances in Neural Information Processing Systems 35 (NeurIPS '22), pp. 20988–21000, 2022.
Sample complexity of learning heuristic functions for greedy-best-first and A* search
Shinsaku Sakaue and Taihei Oki
Advances in Neural Information Processing Systems 35 (NeurIPS '22), pp. 2889–2901, 2022.
Lazy and fast greedy MAP inference for determinantal point process
Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, and Satoru Iwata
Advances in Neural Information Processing Systems 35 (NeurIPS '22), pp. 2776–2789, 2022.
Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Kazuki Matoya and Taihei Oki
SIAM Journal on Discrete Mathematics, 36(3):2121–2158, 2022.
Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO '21), LNCS 12707, pp. 223–237, 2021.
Computing valuations of the Dieudonné determinants
Journal of Symbolic Computation, 116:284–323, 2023.
Proceedings of the 46th International Symposium on Symbolic and Algebraic Computation (ISSAC ’21), pp. 321–328, 2021.
Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP ’20), LIPIcs 168, pp. 89:1–89:14, 2020. (会議録におけるタイトル: “On solving (non)commutative weighted Edmonds’ problem”)
Dynamic programming approach to the generalized minimum Manhattan network problem
Yuya Masumura, Taihei Oki, and Yutaro Yamaguchi
Algorithmica, 83(12):3681–3714, 2021.
Proceedings of the 6th International Symposium on Combinatorial Optimization (ISCO ’20), LNCS 12176, pp. 237–248, 2020.
Improved structural methods for nonlinear differential-algebraic equations via combinatorial relaxation
IMA Journal of Numerical Analysis, 43(1):357–386, 2023.
Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation (ISSAC ’19), pp. 315–322, 2019.
Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata, Taihei Oki, and Mizuyo Takamatsu
Journal of the ACM, 66(5), 2019.
Proceedings of the 8th SIAM Workshop on Combinatorial Scientific Computing (CSC ’18), pp. 45–55, 2018.
A compact representation for minimizers of $k$-submodular functions
Journal of Combinatorial Optimization, 36(3):45–55, 2018.
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO ’16), LNCS 9849, pp. 45–55, 2018.
プレプリント
Steepest Descent Algorithm for M-convex Function Minimization Using Long Step Length
Taihei Oki and Akiyoshi Shioura
Online Inverse Linear Optimization: Improved Regret Bound, Robustness to Suboptimality, and Toward Tight Regret Analysis
Shinsaku Sakaue, Taira Tsuchiya, Han Bao, and Taihei Oki
Towards the Proximity Conjecture on Group-Labeled Matroids
Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, and Yutaro Yamaguchi
Position Fair Mechanisms Allocating Indivisible Goods
Ryoga Mahara, Ryuhei Mizutani, Taihei Oki, and Tomohiko Yokoyama
Algorithmic aspects of semistability of quiver representations
Yuni Iwamasa, Taihei Oki, and Tasuku Soma
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance
Satoru Iwata, Taihei Oki, and Shinsaku Sakaue
Multi-dimensional Graph Fourier Transform
Takashi Kurokawa, Taihei Oki, and Hiromichi Nagao
国際会議発表
- 査読あり
- ポスター発表
Taihei Oki and Shinsaku Sakaue
No-regret M${}^\natural$-concave function maximization: stochastic bandit algorithms and NP-hardness of adversarial full-information setting
The 38th Conference on Neural Information Processing Systems (NeurIPS '24), Vancouver, BC, Canada, Dec. 2024.
- 査読あり
- 口頭発表
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, and Tamás Schwarcz
Problems on Group-labeled Matroid Bases
The 51st International Colloquium on Automata, Languages and Programming (ICALP ’24), Tallinn, Estonia, July 2024.
- 査読あり
- ポスター発表
Taihei Oki and Shinsaku Sakaue
Faster Discrete Convex Function Minimization with Predictions: the M-Convex Case
The 37th Conference on Neural Information Processing Systems (NeurIPS '23), New Orleans, LA, United States, Dec. 2023.
- 査読なし
- 口頭発表
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
SIAM Conference on Optimization (OP '23), Seattle, Washington, United States, June 2023.
- 査読あり
- 口頭発表
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
The 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH '23), Budapest, Hungary, Mar. 2023.
- 査読あり
- 口頭発表
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
The 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '23), Florence, Italy, Jan. 2023.
- 査読あり
- ポスター発表
Shinsaku Sakaue and Taihei Oki
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
The 36th Conference on Neural Information Processing Systems (NeurIPS '22), New Orleans, LA, United States, Nov. 2022.
- 査読あり
- 口頭発表
Computing Valuations of the Dieudonné Determinants
The 46th International Symposium on Symbolic and Algebraic Computation (ISSAC ’21), Saint Petersburg, Russia (Online Conference), July 2021.
- 査読あり
- 口頭発表
On Solving (Non)commutative Weighted Edmonds’ Problem
The 47th International Colloquium on Automata, Languages and Programming (ICALP ’20), Saarbrücken, Germany (Online Conference), July 2020.
- 査読なし
- 口頭発表
Computing the Maximum Degree of Minors in Skew Polynomial Matrices
Buildings, Varieties, and Applications, Leipzig, Germany, Nov. 2019.
- 査読あり
- 口頭発表
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
The 44th International Symposium on Symbolic and Algebraic Computation (ISSAC ’19), Beijing, China, July 2019.
- 査読あり
- 口頭発表
Computing the Maximum Degree of Minors in Polynomial Matrices over Skew Fields
The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ ’19), Tokyo, Japan, May 2019.
- 査読なし
- 口頭発表
Index Reduction for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
NII Shonan Meeting Seminar 125 “Piecewise Smooth System and Optimization with Piecewise Linearization via Algorithmic Differentiation”, Kanagawa, Japan, June 2018.
- 査読あり
- 口頭発表
Satoru Iwata, Taihei Oki, and Mizuyo Takamatsu
Index Reduction for Differential-Algebraic Equations with Mixed Matrices
The 8th SIAM Workshop on Combinatorial Scientific Computing (CSC ’18), Bergen, Norway, June 2018.
- 査読あり
- 口頭発表
A compact representation for minimizers of $k$-submodular functions
The 4th International Symposium on Combinatorial Optimization (ISCO ’16), Vietri sul Mare, Italy, May 2016.
国内学会発表
- 招待講演
- 口頭発表
ウォームスタートの学習による離散最適化手法の高速化
第131回人工知能基本問題研究会 (SIG-FPAI),くまもと県民交流館パレア,熊本,2025 年 1 月.
- 招待講演
- 口頭発表
反応速度論シミュレーションに対する速度定数行列縮約法の数理
第14回計算力学シンポジウム,日本学術会議講堂,東京,2024 年 12 月.
- 査読なし
- 口頭発表
群ラベル付きマトロイドにおける諸問題
離散数学とその応用研究集会 (JCCA ’24),山形大学,山形,2024 年 8 月.
- 査読なし
- ポスター発表
Faster Discrete Convex Function Minimization with Predictions: the M-Convex Case
第26回情報論的学習理論ワークショップ (IBIS ’23),北九州国際会議場,福岡,2023 年 10 月.
- 査読なし
- 口頭発表
- 研究部会連合発表会優秀講演賞
分数線形マトロイドパリティに対する非可換階数を用いた代数的アルゴリズム
日本応用数理学会 第19回研究部会連合発表会,岡山理科大学,岡山,2023 年 3 月.
- 査読なし
- ポスター発表
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
第25回情報論的学習理論ワークショップ (IBIS ’22),つくば国際会議場,茨城,2022 年 11 月.
- 招待講演
- 口頭発表
線形マトロイドと数え上げ
日本オペレーションズ・リサーチ学会研究部会「最適化手法とアルゴリズム」,オンライン開催,2022 年 3 月.
- 査読なし
- 口頭発表
マトロイドの接続2-束多面体上の線形最適化
日本応用数理学会 第18回研究部会連合発表会,九州大学,福岡(オンライン開催),2022 年 3 月.
- 査読なし
- 口頭発表
分割的付値斜体におけるDieudonné行列式の付値計算
日本応用数理学会 2021年度年会,芝浦工業大学,東京(オンライン開催),2021 年 9 月.
- 招待講演
- 口頭発表
混合行列を係数とする微分代数方程式の指数減少法
電子情報通信学会 コンピュテーション研究会 (COMP),大阪大学,大阪,2020 年 10 月.
- 査読なし
- 口頭発表
- LA/EATCS-Japan 学生発表論文賞
パフィアンペアに対する一般化行列木定理
2019年度冬のLAシンポジウム,京都大学,京都,2020 年 2 月.
- 査読なし
- 口頭発表
Computing the Maximum Degree of Minors in Skew Polynomial Matrices
日本数式処理学会 2019年度理論分科会 & システム分科会合同研究会,九州大学,福岡,2019 年 10 月.
- 査読なし
- 口頭発表
Computing the Maximum Degree of Minors in Skew Polynomial Matrices
2019年度夏のLAシンポジウム,ホテル竹島,愛知,2019 年 8 月.
- 査読なし
- 口頭発表
- 優秀発表賞
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
日本オペレーションズ・リサーチ学会研究部会「最適化とその応用」:未来を担う若手研究者の集い2019,筑波大学,茨城,2019 年 6 月.
- 査読なし
- 口頭発表
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
日本応用数理学会 第15回研究部会連合発表会,筑波大学,茨城,2019 年 3 月.
- 査読なし
- 口頭発表
混合行列を係数とする微分代数方程式の指数減少法
日本応用数理学会 2017年度年会,武蔵野大学,東京,2017 年 9 月.
- 査読なし
- 口頭発表
- 最優秀発表賞
混合行列を係数とする微分代数方程式の指数減少法
日本オペレーションズ・リサーチ学会研究部会「最適化の基盤とフロンティア」―未来を担う若手研究者の集い2017―,筑波大学,茨城,2017 年 5 月.
- 査読なし
- 口頭発表
- 最優秀発表賞
$k$-劣モジュラ関数の最小値集合の表現とアルゴリズム
日本オペレーションズ・リサーチ学会研究部会「最適化の基盤とフロンティア」―未来を担う若手研究者の集い2016―,筑波大学,茨城,2016 年 5 月.
- 査読なし
- 口頭発表
$k$-劣モジュラ関数の最小値集合の表現とアルゴリズム
日本オペレーションズ・リサーチ学会 2016年春季研究発表会,慶應義塾大学,神奈川,2016 年 3 月.