Taihei Oki

According to our database, Taihei Oki authored at least 32 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Online Inverse Linear Optimization: Improved Regret Bound, Robustness to Suboptimality, and Toward Tight Regret Analysis.

Shinsaku Sakaue, Taira Tsuchiya, Han Bao, Taihei Oki

CoRR, January, 2025

Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank.

Taihei Oki, Tasuku Soma

SIAM J. Comput., 2025

2024

Fractional Linear Matroid Matching is in quasi-NC.

Rohit Gurjar, Taihei Oki, Roshan Raj

Electron. Colloquium Comput. Complex., 2024

Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method.

Shinichi Hemmi, Satoru Iwata, Taihei Oki

CoRR, 2024

Position Fair Mechanisms Allocating Indivisible Goods.

Ryoga Mahara, Ryuhei Mizutani, Taihei Oki, Tomohiko Yokoyama

CoRR, 2024

Algorithmic aspects of semistability of quiver representations.

Yuni Iwamasa, Taihei Oki, Tasuku Soma

CoRR, 2024

Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming.

Shinsaku Sakaue, Taihei Oki

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

No-Regret M^♮-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting.

Taihei Oki, Shinsaku Sakaue

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices.

Taihei Oki, Yujin Song

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

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, 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, Taihei Oki

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Computing valuations of the Dieudonné determinants.

Taihei Oki

J. Symb. Comput., 2023

Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance.

Satoru Iwata, Taihei Oki, Shinsaku Sakaue

CoRR, 2023

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.

Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma

CoRR, 2023

Data-Driven Projection for Reducing Dimensionality of Linear Programs: Generalization Bound and Learning Methods.

Shinsaku Sakaue, Taihei Oki

CoRR, 2023

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank.

Taihei Oki, Tasuku Soma

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case.

Taihei Oki, Shinsaku Sakaue

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

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 International Conference on Machine Learning, 2023

Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation.

Shinsaku Sakaue, Taihei Oki

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems.

Kazuki Matoya, Taihei Oki

SIAM J. Discret. Math., September, 2022

Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions.

Shinsaku Sakaue, Taihei Oki

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search.

Shinsaku Sakaue, Taihei Oki

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Lazy and Fast Greedy MAP Inference for Determinantal Point Process.

Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.

Yuya Masumura, Taihei Oki, Yutaro Yamaguchi

Algorithmica, 2021

2020

On Solving (Non)commutative Weighted Edmonds' Problem.

Taihei Oki

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Index Reduction for Differential-algebraic Equations with Mixed Matrices.

Satoru Iwata, Taihei Oki, Mizuyo Takamatsu

J. ACM, 2019

A Generalized Matrix-Tree Theorem for Pfaffian Pairs.

Taihei Oki

CoRR, 2019

Computing the Maximum Degree of Minors in Skew Polynomial Matrices.

Taihei Oki

CoRR, 2019

Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation.

Taihei Oki

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018

A compact representation for minimizers of k-submodular functions.

Hiroshi Hirai, Taihei Oki

J. Comb. Optim., 2018

2017

Multi-dimensional Graph Fourier Transform.

Takashi Kurokawa, Taihei Oki, Hiromichi Nagao

CoRR, 2017

2016

A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract).

Hiroshi Hirai, Taihei Oki

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016