SEARCH
Search DetailsOki Taihei
| Institute for Integrated Innovations Institute for Chemical Reaction Design and Discovery | Specially Appointed Associate Professor |
Researcher basic information
■ Degree■ URL
researchmap URLホームページURL■ Various IDs
ORCID IDJ-Global ID■ Research Keywords and Fields
Research KeywordResearch Field
Career
■ CareerCareer
- Apr. 2026 - Present
The University of Osaka, D3 Center, Specially Appointed Associate Professor (Full Time), Japan - Apr. 2025 - Present
RIKEN, Center for Advanced Intelligence Project, Visiting Researcher, Japan - Aug. 2024 - Present
Hokkaido University, Institution for Chemical Reaction Design and Discovery, Specially Appointed Associate Professor, Japan - Apr. 2021 - Jul. 2024
The University of Tokyo, The Graduate School of Information Science and Technology, Project Research Associate, Japan - Apr. 2020 - Mar. 2021
JST ERATO Maeda Artificial Intelligence in Chemical Reaction Design and Discovery Project, Optimization Group, Assistant Technical Staff, Japan - Apr. 2018 - Mar. 2021
JSPS, Research Fellowship for Young Scientists (DC1) - May 2018 - Mar. 2020
JST CREST “Modeling Methods allied with Modern Mathematics” Area, “Developing Optimal Modeling Methods for Large-Scale Complex Systems” Team, Assistant Technical Staff, Japan - Jun. 2016 - Feb. 2018
JST ERATO Kawarabayashi Large Graph Project, “The Network Graph Theories and Optimization” Group, RA, Japan
- Apr. 2018 - Mar. 2021, The University of Tokyo, The Graduate School of Information Science and Technology, Department of Mathematical Informatics, Ph.D. Course, Japan
- Apr. 2016 - Mar. 2018, University of Tokyo, Graduate School of Information Science and Technology, Department of Mathematical Informatics, Master's Course, Japan
- Apr. 2013 - Mar. 2016, University of Tokyo, Faculty of Engineering, Department of Mathematical Engineering and Information Physics, Japan
- Apr. 2008 - Mar. 2013, Kurume National Institute of Technology, Department of Control and Information Systems Engineering, Japan
Research activity information
■ Awards- Feb. 2026, Funai Foundation for Informationn Thechnology, Funai Information Technology Award for Young Researchers
Taihei Oki, 49924802;45313775;13064513;13064514;49925508 - Mar. 2023, The Japan Society for Industrial and Applied Mathematics, Best presentation award at the 2023 Joint Meeting of JSIAM Activity Groups
Taihei Oki, 45313775;13064513 - Feb. 2020, LA Symposium & European Association of Theoretical Computer Science, LA/EATCS-Japan Student Presentation Award
Taihei Oki, 13064513 - Jun. 2019, Workshop on Optimization and its Applications, the Operations Research Society of Japan, Presentation Award
Taihei Oki, 13064514 - Sep. 2018, The Operations Research Society of Japan, Student Thesis Award
Taihei Oki - May 2017, Workshop on Optimization: Foundations and Frontiers, the Operations Research Society of Japan, Best Presentation Award
Taihei Oki - May 2016, Workshop on Optimization: Foundations and Frontiers, the Operations Research Society of Japan, Best Presentation Award
Taihei Oki - Mar. 2013, Kyushu Section, the Institute of Electronics, Information and Communication Engineers, Award for Excellent Academic Results
Taihei Oki - Dec. 2011, Commendation by the Minister of Education, Culture, Sports, Science and Technology
Taihei Oki - Dec. 2011, Information Processing Society of Japan, IPSJ Excellent Student Award
Taihei Oki
- Position fair mechanisms allocating indivisible goods
Ryoga Mahara; Ryuhei Mizutani; Taihei Oki; Tomohiko Yokoyama
Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI '26), 40, 20, 17137, 17144, Association for the Advancement of Artificial Intelligence (AAAI), 14 Mar. 2026, [Peer-reviewed]
English, International conference proceedings, Fair division mechanisms for indivisible goods require agent orderings to deterministically select one allocation when running the algorithm in practice. We introduce position envy-freeness up to one good (PEF1) as a fairness criterion for mechanisms: a mechanism is said to satisfy PEF1 if for any pair of agent orderings, no agent prefers their bundle determined under one ordering to that under another ordering by more than the utility of a single good. First, we propose a scale-invariant, polynomial-time mechanism that satisfies PEF1 and yields an envy-freeness up to one good (EF1) allocation. For the case of two agents, we establish that any mechanism producing a maximum Nash welfare allocation eliminates envy based on positions by removing one good, provided that utilities are positive. Additionally, we present a polynomial-time mechanism based on the adjusted winner procedure, which satisfies PEF1 and produces an EF1 and Pareto optimal allocation for two agents. In contrast, we demonstrate that well-known mechanisms such as round-robin and envy-cycle elimination do not generally satisfy PEF1., 49924802 - Rate constant matrix contraction method for stiff master equations with detailed balance
Satoru Iwata; Taihei Oki; Shinsaku Sakaue
SIAM Journal on Scientific Computing, 48, 1, A261, A285, 28 Feb. 2026, [Peer-reviewed], [Lead author, Corresponding author]
English, Scientific journal, 49924908 - Fast and numerically stable implementation of rate constant matrix contraction method
Shinichi Hemmi; Satoru Iwata; Taihei Oki
ICIAM2023 Springer Series, 1, 9, 39, Springer Nature Singapore, 12 Jan. 2026, [Peer-reviewed], [Invited], [Corresponding author]
English, International conference proceedings, Abstract
The rate constant matrix contraction (RCMC) method, proposed by Sumiya et al. (2015, 2017), enables efficient and stable simulations of chemical kinetics in large-scale reaction networks. Iwata et al. (2023) reformulated the RCMC method as an algorithm for solving master equations with rate constant matrices satisfying detailed balance. This study focuses on accelerating RCMC by addressing its bottleneck: the greedy selection of steady states, which is equivalent to MAP inference in determinantal point processes (DPPs) under cardinality constraints. LazyFastGreedy, introduced by Hemmi et al. (2022), combines the practically efficient lazy greedy method with the DPP MAP inference but suffers from numerical instability due to wide-ranging reaction time scales in chemical kinetics. We propose modified LazyFastGreedy that mitigates numerical instability by avoiding subtraction of like-sign numbers, leveraging properties of rate constant matrices and connections to Cholesky decomposition. Numerical experiments on real chemical reaction instances demonstrate that the proposed method achieves significant speed improvements while maintaining numerical stability., 49924908;49924802;45313775 - Reaction yield oscillates over reaction time in first-order chemical reactions
Yu Harabuchi; Tomohiko Yokoyama; Keisuke Katayama; Satoshi Maeda; Taihei Oki; Satoru Iwata
RSC Advances, 16, 9, 7681, 7686, Royal Society of Chemistry (RSC), Nov. 2025, [Peer-reviewed]
English, Scientific journal, The reaction yield can oscillate multiple times over the reaction time in a first-order reaction. There is a maximum number of oscillations, and the upper bound is tight. This study provides theoretical insight into reaction optimization strategies., 49924908 - Algorithmic aspects of semistability of quiver representations
Yuni Iwamasa; Taihei Oki; Tasuku Soma
Proceedings of the 52nd International Colloquium on Automata, Languages and Programming (ICALP ’25), 334, 99:1, 99:18, Jul. 2025, [Peer-reviewed]
English, International conference proceedings, 47732664;49924802;45313775 - Towards the proximity conjecture on group-labeled matroids
Dániel Garamvölgyi; Ryuhei Mizutani; Taihei Oki; Tamás Schwarcz; Yutaro Yamaguchi
Proceedings of the 52nd International Colloquium on Automata, Languages and Programming (ICALP ’25), 334, 85:1, 85:17, Jul. 2025, [Peer-reviewed], [Lead author, Corresponding author]
English, International conference proceedings, 49924802 - Mathematical framework to identify optimal molecule based on virtual ligand strategy
Wataru Matsuoka; Ken Hirose; Ren Yamada; Taihei Oki; Satoru Iwata; Satoshi Maeda
Journal of Chemical Information and Modeling, 65, 13, 6913, 6926, American Chemical Society (ACS), 13 Jun. 2025, [Peer-reviewed]
English, Scientific journal, 49924908 - Algebraic algorithms for fractional linear matroid parity via noncommutative rank
Taihei Oki; Tasuku Soma
SIAM Journal on Computing, 54, 1, 134, 162, Society for Industrial & Applied Mathematics (SIAM), Jan. 2025, [Peer-reviewed], [Lead author, Corresponding author]
English, Scientific journal, 49924802;13064513 - No-regret M♮-concave function maximization: stochastic bandit algorithms and NP-hardness of adversarial full-information setting
Taihei Oki; Shinsaku Sakaue
Advances in Neural Information Processing Systems, 37, 57418, 57438, Dec. 2024, [Peer-reviewed], [Lead author]
English, International conference proceedings, 49924802 - Data-driven projection for reducing dimensionality of linear programs: generalization bound and learning methods
Shinsaku Sakaue; Taihei Oki
Advances in Neural Information Processing Systems, 37, 12825, 12846, Dec. 2024, [Peer-reviewed]
English, International conference proceedings, 49924802 - Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
Hiroshi Hirai; Yuni Iwamasa; Taihei Oki; Tasuku Soma
Mathematical Programming, 213, 1, 941, 984, Springer Science and Business Media LLC, 02 Nov. 2024, [Peer-reviewed]
English, Scientific journal, Abstract
We address the computation of the degrees of minors of a noncommutative symbolic matrix of form $$ A[c] :=\sum _{k=1}^m A_k t^{c_k} x_k, $$ where $$A_k$$ are matrices over a field $$\mathbb {K}$$ , $$x_k$$ are noncommutative variables, $$c_k$$ are integer weights, and t is a commuting variable specifying the degree. This problem extends noncommutative Edmonds’ problem (Ivanyos et al. in Comput Complex 26:717–763, 2017), and can formulate various combinatorial optimization problems. Extending the study by Hirai 2018, and Hirai, Ikeda 2022, we provide novel duality theorems and polyhedral characterization for the maximum degrees of minors of A[c] of all sizes, and develop a strongly polynomial-time algorithm for computing them. This algorithm is viewed as a unified algebraization of the classical Hungarian method for bipartite matching and the weight-splitting algorithm for linear matroid intersection. As applications, we provide polynomial-time algorithms for weighted fractional linear matroid matching and for membership of rank-2 Brascamp–Lieb polytopes., 47732664 - Virtual ligand-assisted optimization: a rational strategy for ligand engineering
Wataru Matsuoka; Taihei Oki; Ren Yamada; Tomohiko Yokoyama; Shinichi Suda; Carla M. Saunders; Bastian Bjerkem Skjelstad; Yu Harabuchi; Natalie Fey; Satoru Iwata; Satoshi Maeda
ACS Catalysis, 14, 21, 16297, 16312, American Chemical Society (ACS), 21 Oct. 2024, [Peer-reviewed]
English, Scientific journal, 49924908 - Fractional linear matroid matching is in quasi-NC
Rohit Gurjar; Taihei Oki; Roshan Raj
Proceedings of the 32nd Annual European Symposium on Algorithms (ESA ’24), LIPIcs 308, 63:1, 63:14, Sep. 2024, [Peer-reviewed]
English, International conference proceedings, 45313775 - Structural preprocessing method for nonlinear differential-algebraic equations using linear symbolic matrices
Taihei Oki; Yujin Song
Proceedings of the 49th International Symposium on Symbolic and Algebraic Computation (ISSAC ’24), 143, 152, ACM, 16 Jul. 2024, [Peer-reviewed], [Last author]
English, International conference proceedings, 45313775 - Problems on group-labeled matroid bases
Florian Hörsch; András Imolay; Ryuhei Mizutani; Taihei Oki; Tamás Schwarcz
Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP ’24), LIPIcs 297, 86:1, 86:20, Jul. 2024, [Peer-reviewed], [Lead author, Corresponding author]
English, International conference proceedings, 45313775 - Online structured prediction with Fenchel–Young losses and improved surrogate regret for online multiclass classification with logistic loss
Shinsaku Sakaue; Han Bao; Taira Tsuchiya; Taihei Oki
Proceedings of the 37th Conference on Learning Theory (COLT ’24), PMLR 247, 4458, 4486, PMLR, Jun. 2024, [Peer-reviewed]
English, International conference proceedings - 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; Satoshi Maeda
The Journal of Physical Chemistry, 128, 14, 2883, 2890, 11 Apr. 2024, [Peer-reviewed], [International Magazine]
English, Scientific journal, The yield of a chemical reaction is obtained by solving its rate equation. This study introduces an approach for differentiating yields by utilizing the parameters of the rate equation, which is expressed as a first-order linear differential equation. The yield derivative for a specific pair of reactants and products is derived by mathematically expressing the rate constant matrix contraction method, which is a simple kinetic analysis method. The parameters of the rate equation are the Gibbs energies of the intermediates and transition states in the reaction path network used to formulate the rate equation. Thus, our approach for differentiating the yield allows a numerical evaluation of the contribution of energy variation to the yield for each intermediate and transition state in the reaction path network. In other words, a comparison of these values automatically extracts the factors affecting the yield from a complicated reaction path network consisting of numerous reaction paths and intermediates. This study verifies the behavior of the proposed approach through numerical experiments on the reaction path networks of a model system and the Rh-catalyzed hydroformylation reaction. Moreover, the possibility of using this approach for designing ligands in organometallic catalysts is discussed. - Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming.
Shinsaku Sakaue; Taihei Oki
Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024(NeurIPS), 2024
International conference proceedings - Faster discrete convex function minimization with predictions: the M-Convex case
Taihei Oki; Shinsaku Sakaue
Advances in Neural Information Processing Systems, 36, 68576, 68588, Dec. 2023, [Peer-reviewed], [Lead author]
English, International conference proceedings, 45313775 - Rethinking warm-starts with predictions: learning predictions close to sets of optimal solutions for faster L-/L♮-convex function minimization
Shinsaku Sakaue; Taihei Oki
Proceedings of the 40th International Conference on Machine Learning (ICML '23), PMLR 202, 29760, 29776, Jul. 2023, [Peer-reviewed]
English, International conference proceedings - Computing valuations of the Dieudonné determinants
Taihei Oki
Journal of Symbolic Computation, 116, 284, 323, May 2023, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, Scientific journal, 13064513;45313775 - Improved generalization bound and learning of sparsity patterns for data-driven low-rank approximation
Shinsaku Sakaue; Taihei Oki
Proceedings of the 26th International Conference on Artificial Intelligence and Statistics (AISTATS '23), PMLR 206, 1, 10, PMLR, Apr. 2023, [Peer-reviewed]
English, International conference proceedings - Algebraic algorithms for fractional linear matroid parity via non-commutative rank
Taihei Oki; Tasuku Soma
Proceedings of the 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '23), 4188, 4204, SIAM, Jan. 2023, [Peer-reviewed], [Lead author, Corresponding author]
English, International conference proceedings, 45313775;13064513 - Discrete-convex-analysis-based framework for warm-starting algorithms with predictions
Shinsaku Sakaue; Taihei Oki
Advances in Neural Information Processing Systems, 35, 20988, 21000, Dec. 2022, [Peer-reviewed], [Lead author]
English, International conference proceedings, 45313775 - Sample complexity of learning heuristic functions for greedy-best-first and A* search
Shinsaku Sakaue; Taihei Oki
Advances in Neural Information Processing Systems, 35, 2889, 2901, Dec. 2022, [Peer-reviewed]
English, International conference proceedings, 45313775 - Lazy and fast greedy MAP inference for determinantal point process
Shinichi Hemmi; Taihei Oki; Shinsaku Sakaue; Kaito Fujii; Satoru Iwata
Advances in Neural Information Processing Systems, 35, 2776, 2789, Dec. 2022, [Peer-reviewed]
English, International conference proceedings, 45313775 - Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Kazuki Matoya; Taihei Oki
SIAM Journal on Discrete Mathematics, 36, 3, 2121, 2158, Sep. 2022, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, Scientific journal, 13064513;45313775 - Improved structural methods for nonlinear differential-algebraic equations via combinatorial relaxation
Taihei Oki
IMA Journal of Numerical Analysis, 43, 1, 357, 386, Oxford University Press (OUP), Dec. 2021, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, Scientific journal, Abstract
Differential-algebraic equations (DAEs) are widely used for modelling dynamical systems. In the numerical analysis of DAEs, consistent initialization and index reduction are important preprocessing steps prior to numerical integration. Existing DAE solvers commonly adopt structural preprocessing methods based on combinatorial optimization. Unfortunately, structural methods fail if the DAE has a singular system Jacobian matrix. For such DAEs, methods have been proposed to modify them to other DAEs to which structural methods are applicable, based on the combinatorial relaxation technique. Existing modification methods, however, work only for DAEs that are linear or close to linear. This paper presents two new modification methods for nonlinear DAEs: the substitution method and the augmentation method. Both methods are based on the combinatorial relaxation approach and are applicable to a large class of nonlinear DAEs. The substitution method symbolically solves equations for some derivatives based on the implicit function theorem and substitutes the solution back into the system. Instead of solving equations, the augmentation method modifies DAEs by appending new variables and equations. Our methods are implemented as a MATLAB library using MuPAD, and through its application to practical DAEs, we show that our methods can be used as a promising preprocessing of DAEs that the index reduction procedure in MATLAB cannot handle., 13064514;13064513 - Dynamic programming approach to the generalized minimum Manhattan network problem
Yuya Masumura; Taihei Oki; Yutaro Yamaguchi
Algorithmica, 83, 12, 3681, 3714, Springer Science and Business Media LLC, Sep. 2021, [Peer-reviewed]
English, Scientific journal - Computing valuations of the Dieudonné determinants
Taihei Oki
Proceedings of the 46th International Symposium on Symbolic and Algebraic Computation (ISSAC ’21), 321, 328, ACM, Jul. 2021, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, International conference proceedings, 13064514;13064513 - Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Kazuki Matoya; Taihei Oki
Proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization (IPCO '21), LNCS 12707, 223, 237, Springer, Jun. 2021, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, International conference proceedings, 49925508;13064513;13064514 - On solving (non)commutative weighted Edmonds’ problem
Taihei Oki
Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP ’20), LIPIcs 168, 89:1, 89:14, Jul. 2020, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, International conference proceedings, 13064514;49925508 - Dynamic programming approach to the generalized minimum Manhattan network problem
Yuya Masumura; Taihei Oki; Yutaro Yamaguchi
Proceedings of the 6th International Symposium on Combinatorial Optimization (ISCO ’20), LNCS 12176, 237, 248, May 2020, [Peer-reviewed]
English, International conference proceedings - Improved structural methods for nonlinear differential-algebraic equations via combinatorial relaxation
Taihei Oki
Proceedings of the 44th International Symposium on Symbolic and Algebraic Computation (ISSAC ’19), 315, 322, Aug. 2019, [Peer-reviewed], [Lead author, Last author, Corresponding author]
English, International conference proceedings, 13064514 - Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata; Taihei Oki; Mizuyo Takamatsu
Journal of the ACM, 66, 5, 35, 34, Jul. 2019, [Peer-reviewed], [Lead author, Corresponding author]
English, Scientific journal, 13064514 - A compact representation for minimizers of k-submodular functions
Hiroshi Hirai; Taihei Oki
Journal of Combinatorial Optimization, 36, 3, 709, 741, Oct. 2018, [Peer-reviewed], [Lead author, Corresponding author]
English, Scientific journal - Index reduction for differential-algebraic equations with mixed matrices
Satoru Iwata; Taihei Oki; Mizuyo Takamatsu
Proceedings of the 8th SIAM Workshop on Combinatorial Scientific Computing (CSC ’18), 45, 55, SIAM, Jun. 2018, [Peer-reviewed], [Lead author, Corresponding author]
English, International conference proceedings, 13064514 - A compact representation for minimizers of k-submodular functions
Hiroshi Hirai; Taihei Oki
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO ’16), LNCS 9849, 381, 392, Springer Verlag, May 2016, [Peer-reviewed], [Lead author, Corresponding author]
English, International conference proceedings
- 〔主要な業績〕離散凸解析に基づく予測付き離散最適化手法
大城泰平
第28回情報論的学習理論ワークショップ (IBIS ’25), 14 Nov. 2025, Japanese, Invited oral presentation
49924802, [Invited] - 〔主要な業績〕マトロイドにおける群ラベル制約
大城泰平
第37回RAMP数理最適化シンポジウム, 17 Oct. 2025, Japanese, Invited oral presentation
49924802, [Invited] - Group-label Constraints for Matroid Problems
大城泰平
電子情報通信学会 コンピュテーション研究会(COMP), 04 Sep. 2025, Japanese, Invited oral presentation
49924802;45313775, [Invited] - Online M♮-concave function maximization under component sum constraints
Taihei Oki; Shinsaku Sakaue
The 13th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ '25), 29 May 2025, English, Oral presentation
49924802;45313775 - ウォームスタートの学習による離散最適化手法の高速化
大城泰平
第131回人工知能基本問題研究会 (SIG-FPAI), 15 Jan. 2025, Japanese, Invited oral presentation
14 Jan. 2025 - 15 Jan. 2025, 49924802, [Invited] - 〔Major achievements〕No-regret M♮-concave function maximization: stochastic bandit algorithms and NP-hardness of adversarial full-information setting
Taihei Oki; Shinsaku Sakaue
The 38th Conference on Neural Information Processing Systems (NeurIPS '24), 11 Dec. 2024, English, Poster presentation
10 Dec. 2024 - 15 Dec. 2024, 49924802 - 〔主要な業績〕反応速度論シミュレーションに対する速度定数行列縮約法の数理
大城泰平
第14回計算力学シンポジウム, 10 Dec. 2024, Japanese, Invited oral presentation
10 Dec. 2024 - 10 Dec. 2024, 49924908, [Invited] - 群ラベル付きマトロイドにおける諸問題
大城泰平
離散数学とその応用研究集会 (JCCA ’24), 19 Aug. 2024, Japanese, Nominated symposium
19 Aug. 2024 - 21 Aug. 2024, 45313775 - Problems on Group-labeled Matroid Bases
Florian Hörsch; András Imolay; Ryuhei Mizutani; Taihei Oki; Tamás Schwarcz
The 51st International Colloquium on Automata, Languages and Programming (ICALP ’24), 09 Jul. 2024, English, Oral presentation
08 Jul. 2024 - 12 Jul. 2024, 45313775 - Faster Discrete Convex Function Minimization with Predictions: the M-Convex Case
大城泰平; 坂上晋作
第26回情報論的学習理論ワークショップ (IBIS ’23), Dec. 2023, Japanese, Poster presentation - Faster Discrete Convex Function Minimization with Predictions: the M-Convex Case
Taihei Oki; Shinsaku Sakaue
The 37th Conference on Neural Information Processing Systems (NeurIPS '23), Dec. 2023, English, Poster presentation - Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
Taihei Oki; Tasuku Soma
SIAM Conference on Optimization (OP '23), Jun. 2023, English, Oral presentation - 分数線形マトロイドパリティに対する非可換階数を用いた代数的アルゴリズム
大城泰平; 相馬輔
日本応用数理学会第19回研究部会連合発表会, Mar. 2023, Japanese, Oral presentation - Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
Taihei Oki; Tasuku Soma
The 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH '23), Mar. 2023, English, Oral presentation - 〔Major achievements〕Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
Taihei Oki; Tasuku Soma
The 34th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '23), Jan. 2023, English, Oral presentation - Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
Shinsaku Sakaue; Taihei Oki
The 36th Conference on Neural Information Processing Systems (NeurIPS '22), Dec. 2022, English, Poster presentation - Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
大城泰平; 坂上晋作
第25回情報論的学習理論ワークショップ (IBIS ’22), Nov. 2022, Japanese, Poster presentation - 線形マトロイドと数え上げ
大城泰平
日本オペレーションズ・リサーチ学会研究部会「最適化手法とアルゴリズム」, Mar. 2022, Japanese, Public discourse
[Invited] - マトロイドの接続2-束多面体上の線形最適化
大城泰平
日本応用数理学会第18回研究部会連合発表会, Mar. 2022, Japanese, Oral presentation - 分割的付値斜体におけるDieudonné行列式の付値計算
大城泰平
日本応用数理学会2021年度年会, Sep. 2021, Japanese, Oral presentation - Computing Valuations of the Dieudonné Determinants
Taihei Oki
The 46th International Symposium on Symbolic and Algebraic Computation (ISSAC ’21), Jul. 2021, English, Oral presentation - 混合行列を係数とする微分代数方程式の指数減少法
岩田覚; 大城泰平; 高松瑞代
電子情報通信学会 コンピュテーション研究会 (COMP), Oct. 2020, Japanese, Invited oral presentation
[Invited] - On Solving (Non)commutative Weighted Edmonds’ Problem
Taihei Oki
The 47th International Colloquium on Automata, Languages and Programming (ICALP ’20), Jul. 2020, English, Oral presentation
13064514;13064513;13064513 - Computing the Maximum Degree of Minors in Skew Polynomial Matrices
Taihei Oki
Buildings, Varieties, and Applications, Nov. 2019, English, Oral presentation
13064514;13064513 - Computing the Maximum Degree of Minors in Skew Polynomial Matrices
大城泰平
日本数式処理学会2019年度理論分科会&システム分科会合同研究会, Oct. 2019, Japanese, Oral presentation
13064514;13064513 - Computing the Maximum Degree of Minors in Skew Polynomial Matrices
大城泰平
2019年度夏のLAシンポジウム, Aug. 2019, Japanese, Oral presentation
13064514;13064513, [Domestic Conference] - Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
Taihei Oki
The 44th International Symposium on Symbolic and Algebraic Computation (ISSAC '19), Jul. 2019, English, Oral presentation
13064514, [International presentation] - Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
大城泰平
日本オペレーションズ・リサーチ学会研究部会「最適化とその応用」:未来を担う若手研究者の集い 2019, Jun. 2019, Japanese, Oral presentation
13064514, [Domestic Conference] - Computing the Maximum Degree of Minors in Polynomial Matrices over Skew Fields
Taihei Oki
The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ '19), May 2019, English, Oral presentation
13064514;13064513, [International presentation] - Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
大城泰平
日本応用数理学会 第 15 回研究部会連合発表会, Mar. 2019, Japanese, Oral presentation
13064514, [Domestic Conference] - Index Reduction for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
Taihei Oki
NII Shonan Meeting Seminar 125 “Piecewise Smooth System and Optimization with Piecewise Linearlization via Algorithmic Differentiation”, Jun. 2018, English, Oral presentation
13064514, [International presentation] - Index Reduction for Differential-Algebraic Equations with Mixed Matrices
Satoru Iwata; Taihei Oki; Mizuyo Takamatsu
The 8th SIAM Workshop on Combinatorial Scientific Computing (CSC '18), Jun. 2018, English, Oral presentation
13064514, [International presentation] - 混合行列を係数とする微分代数方程式の指数減少法
岩田覚; 大城泰平; 高松瑞代
日本応用数理学会 2017年度年会, Sep. 2017, Japanese, Oral presentation
[Domestic Conference] - 混合行列を係数とする微分代数方程式の指数減少法
岩田覚; 大城泰平; 高松瑞代
日本オペレーションズ・リサーチ学会研究部会「最適化の基盤とフロンティア」―未来を担う若手研究者の集い2017―,筑波大学, May 2017, Japanese, Oral presentation
[Domestic Conference] - k-劣モジュラ関数の最小値集合の表現とアルゴリズム
平井広志; 大城泰平
日本オペレーションズ・リサーチ学会研究部会「最適化の基盤とフロンティア」―未来を担う若手研究者の集い2016―, May 2016, Japanese, Oral presentation
[Domestic Conference] - A compact representation for minimizers of k-submodular functions
Hiroshi Hirai; Taihei Oki
The 4th International Symposium on Combinatorial Optimization (ISCO 2016), May 2016, English, Oral presentation
[International presentation] - k-劣モジュラ関数の最小値集合の表現とアルゴリズム
平井広志; 大城泰平
日本オペレーションズ・リサーチ学会 2016年春季研究発表会, Mar. 2016, Japanese, Oral presentation
[Domestic Conference]
- Jul. 2021 - Present
The Japan Society for Industrial and Applied Mathematics - Mar. 2016 - Present
THE OPERATIONS RESEARCH SOCIETY OF JAPAN - Sep. 2019 - Mar. 2025
Japan Society for Symbolic and Algebraic Computation
- Deepening Numerical Methods for Reaction Kinetics by Combinatorial Scientific Computing
BOOST (Support for Young Researchers)
Apr. 2026 - Mar. 2031
Japan Science and Technology Agency, Principal investigator, JPMJBY25A6 - 多様な組合せ最適化手法を統一的に捉える離散凸性の探求と応用
2024 - 2031
大城 泰平
現代情報社会の基盤を支える技術の一つである最適化理論は、解が連続値をとりうる連続最適化と離散値しか取り得ない組合せ最適化に大別されます。離散凸解析は、マトロイドや劣モジュラ関数における最適化理論の一般化であり、効率的に解くことができる組合せ最適化問題を統一的に理解するための枠組みを提供します。本研究は、離散凸解析の理論と応用両面における研究を通し、国産技術・離散凸解析の発展に貢献することを目的とします。
科学技術振興機構, 戦略的な研究開発の推進/創発的研究支援事業, 24013523 - Developing Optimization Methods for Chemical Reaction Prediction, Design and Control
Strategic Basic Research Programs
Oct. 2024 - Mar. 2030
Satoru Iwata; Wataru Matsuoka; Taihei Oki
本研究課題は、量子化学計算と数理最適化を融合して、触媒や反応条件の最適設計を行う方法論の構築を目的としています。そのために、分子の電子効果・立体効果を近似するバーチャル分子モデルを導入します。さらに、触媒や反応条件の各パラメータ値が収率や選択性に及ぼす影響の偏導関数値を用いて最適パラメータ値を算出し、これを近似的に実現する分子や条件を選択することにより化学反応を最適化する方法論を確立します。
Japan Science and Technology Agency, CREST, The University of Tokyo, Coinvestigator, JPMJCR24Q2 - Next-generation convex optimization on non-positive curvature spaces
Grant-in-Aid for Scientific Research
Jun. 2024 - Mar. 2030
平井 広志; 相馬 輔; 岩政 勇仁; 大城 泰平; 谷川 眞一; 早水 桃子
Japan Society for the Promotion of Science (JSPS), Grant-in-Aid for Challenging Research (Pioneering), 名古屋大学, 24K21315 - Exploring Discrete Convexity for Unified Combinatorial Optimization Methods
Fusion Oriented Research for disruptive Science and Technology (FOREST)
Oct. 2024 - Mar. 2028
Taihei Oki
現代情報社会の基盤を支える技術の一つである最適化理論は、解が連続値をとりうる連続最適化と離散値しか取り得ない組合せ最適化に大別されます。離散凸解析は、マトロイドや劣モジュラ関数における最適化理論の一般化であり、効率的に解くことができる組合せ最適化問題を統一的に理解するための枠組みを提供します。本研究は、離散凸解析の理論と応用両面における研究を通し、国産技術・離散凸解析の発展に貢献することを目的とします。
Japan Science and Technology Agency, Hokkaido University, Principal investigator, JPMJFR232L - Developing Theory of Combinatorial Optimization Based on Matrix Representations
Grants-in-Aid for Scientific Research
Apr. 2022 - Mar. 2027
大城 泰平
Japan Society for the Promotion of Science, Grant-in-Aid for Early-Career Scientists, Hokkaido University, 22K17853 - An Interaction of Weighted Combinatorial Optimization and Polynomial Matrix Theory
Strategic Basic Research Programs
Apr. 2020 - Mar. 2022
Taihei Oki
組合せ最適化と線形代数は相互に深く関わりあっており、一方の分野で現れる問題の解決法として他方の分野の道具がしばしば用いられます。本研究では、この両分野の交点である「代数的組合せ最適化」のさらなる深化を目指します。特に、多項式行列と組合せ最適化問題の対応の非線形拡張、およびシステム解析手法への組合せ最適化理論の応用に取り組み、理論と応用の両面からの発展を探求します。
Japan Science and Technology Agency, ACT-I (Acceleration Phase), The University of Tokyo, Principal investigator - Development of Index Reduction Methods for Differential-Algebraic Equations by Combinatorial Methods
Grant-in-Aid for Scientific Research
Apr. 2018 - Mar. 2021
Taihei Oki
Japan Society for the Promotion of Science, Grant-in-Aid for JSPS Research Fellow, University of Tokyo, Principal investigator, Competitive research funding - An Interaction of Weighted Combinatorial Optimization and Polynomial Matrix Theory
Strategic Basic Research Programs
Oct. 2018 - Mar. 2020
大城 泰平
組合せ最適化と線形代数は相互に深く関わりあっており、一方の分野で現れる問題の解決法として他方の分野の道具がしばしば用いられます。本研究では、この両分野の交点である「代数的組合せ最適化」のさらなる深化を目指します。特に、多項式行列と組合せ最適化問題の対応の非線形拡張、およびシステム解析手法への組合せ最適化理論の応用に取り組み、理論と応用の両面からの発展を探求します。
Japan Science and Technology Agency, The University of Tokyo, Principal investigator, JPMJPR18U9 - 重みつき組合せ最適化と多項式行列理論のインタラクション
2018 - 2019
大城 泰平
一部の組合せ最適化問題は行列理論を経由して効率的に解くことができ、また逆にある種の行列の問題は、組合せ最適化の道具を用いて解けることが知られています。本研究では、この相互に確立された活用手法を拡張し、「重みつき組合せ最適化問題」と「多項式行列の問題」の対応に迫ります。特に、組合せ的問題において多項式行列が果たす役割の解明、および多項式行列理論における組合せ最適化手法の活用法の創出を目指します。
科学技術振興機構, 戦略的な研究開発の推進/戦略的創造研究推進事業/ACT-I, 18070185
