Taihei Oki - RankMe

58 papers A* 14A 2B 4C 2Journal 35Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets. CoRR Taihei Oki, Shinsaku Sakaue
2026	A*	`conf`	Position Fair Mechanisms Allocating Indivisible Goods. AAAI Ryoga Mahara, Ryuhei Mizutani, Taihei Oki, Tomohiko Yokoyama
2026	J	`jnl`	Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. SIAM J. Sci. Comput. Satoru Iwata, Taihei Oki, Shinsaku Sakaue
2025	J	`jnl`	Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank. SIAM J. Comput. Taihei Oki, Tasuku Soma
2025	J	`jnl`	Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. Math. Program. Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
2025	A*	`conf`	Algorithmic Aspects of Semistability of Quiver Representations. ICALP Yuni Iwamasa, Taihei Oki, Tasuku Soma
2025	J	`jnl`	Mathematical Framework to Identify Optimal Molecule Based on Virtual Ligand Strategy. J. Chem. Inf. Model. Wataru Matsuoka, Ken Hirose, Ren Yamada, Taihei Oki, Satoru Iwata, Satoshi Maeda
2025	J	`jnl`	Online Inverse Linear Optimization: Improved Regret Bound, Robustness to Suboptimality, and Toward Tight Regret Analysis. CoRR Shinsaku Sakaue, Taira Tsuchiya, Han Bao, Taihei Oki
2025	A*	`conf`	Towards the Proximity Conjecture on Group-Labeled Matroids. ICALP Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, Yutaro Yamaguchi
2024	J	`jnl`	Algorithmic aspects of semistability of quiver representations. CoRR Yuni Iwamasa, Taihei Oki, Tasuku Soma
2024	J	`jnl`	Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method. CoRR Shinichi Hemmi, Satoru Iwata, Taihei Oki
2024	A	`conf`	Fractional Linear Matroid Matching Is in Quasi-NC. ESA Rohit Gurjar, Taihei Oki, Roshan Raj
2024	J	`jnl`	Fractional Linear Matroid Matching is in quasi-NC. CoRR Rohit Gurjar, Taihei Oki, Roshan Raj
2024	J	`jnl`	Fractional Linear Matroid Matching is in quasi-NC. Electron. Colloquium Comput. Complex. Rohit Gurjar, Taihei Oki, Roshan Raj
2024	A*	`conf`	Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming. NeurIPS Shinsaku Sakaue, Taihei Oki
2024	A*	`conf`	No-Regret M NeurIPS Taihei Oki, Shinsaku Sakaue
2024	J	`jnl`	No-Regret M CoRR Taihei Oki, Shinsaku Sakaue
2024	A*	`conf`	Online Structured Prediction with Fenchel-Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss. COLT Shinsaku Sakaue, Han Bao, Taira Tsuchiya, Taihei Oki
2024	J	`jnl`	Online Structured Prediction with Fenchel-Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss. CoRR Shinsaku Sakaue, Han Bao, Taira Tsuchiya, Taihei Oki
2024	J	`jnl`	Position Fair Mechanisms Allocating Indivisible Goods. CoRR Ryoga Mahara, Ryuhei Mizutani, Taihei Oki, Tomohiko Yokoyama
2024	A*	`conf`	Problems on Group-Labeled Matroid Bases. ICALP Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
2024	J	`jnl`	Problems on Group-labeled Matroid Bases. CoRR Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
2024	B	`conf`	Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices. ISSAC Taihei Oki, Yujin Song
2024	J	`jnl`	Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices. CoRR Taihei Oki, Yujin Song
2023	A*	`conf`	Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. SODA Taihei Oki, Tasuku Soma
2023	J	`jnl`	Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma
2023	J	`jnl`	Computing valuations of the Dieudonné determinants. J. Symb. Comput. Taihei Oki
2023	J	`jnl`	Data-Driven Projection for Reducing Dimensionality of Linear Programs: Generalization Bound and Learning Methods. CoRR Shinsaku Sakaue, Taihei Oki
2023	A*	`conf`	Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. NeurIPS Taihei Oki, Shinsaku Sakaue
2023	J	`jnl`	Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. CoRR Taihei Oki, Shinsaku Sakaue
2023	A	`conf`	Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation. AISTATS Shinsaku Sakaue, Taihei Oki
2023	J	`jnl`	Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. CoRR Satoru Iwata, Taihei Oki, Shinsaku Sakaue
2023	A*	`conf`	Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster L-/L ICML Shinsaku Sakaue, Taihei Oki
2023	J	`jnl`	Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster L-/L CoRR Shinsaku Sakaue, Taihei Oki
2022	J	`jnl`	Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. CoRR Taihei Oki, Tasuku Soma
2022	A*	`conf`	Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions. NeurIPS Shinsaku Sakaue, Taihei Oki
2022	J	`jnl`	Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions. CoRR Shinsaku Sakaue, Taihei Oki
2022	J	`jnl`	Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation. CoRR Shinsaku Sakaue, Taihei Oki
2022	A*	`conf`	Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
2022	J	`jnl`	Lazy and Fast Greedy MAP Inference for Determinantal Point Process. CoRR Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
2022	J	`jnl`	Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. SIAM J. Discret. Math. Kazuki Matoya, Taihei Oki
2022	A*	`conf`	Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search. NeurIPS Shinsaku Sakaue, Taihei Oki
2022	J	`jnl`	Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search. CoRR Shinsaku Sakaue, Taihei Oki
2021	B	`conf`	Computing Valuations of the Dieudonné Determinants. ISSAC Taihei Oki
2021	J	`jnl`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Algorithmica Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2021	B	`conf`	Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. IPCO Kazuki Matoya, Taihei Oki
2020	C	`conf`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2020	J	`jnl`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. CoRR Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2020	A*	`conf`	On Solving (Non)commutative Weighted Edmonds' Problem. ICALP Taihei Oki
2019	J	`jnl`	A Generalized Matrix-Tree Theorem for Pfaffian Pairs. CoRR Taihei Oki
2019	J	`jnl`	Computing the Maximum Degree of Minors in Skew Polynomial Matrices. CoRR Taihei Oki
2019	B	`conf`	Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation. ISSAC Taihei Oki
2019	J	`jnl`	Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation. CoRR Taihei Oki
2019	J	`jnl`	Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
2018	J	`jnl`	A compact representation for minimizers of k-submodular functions. J. Comb. Optim. Hiroshi Hirai, Taihei Oki
2018	—	`conf`	Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
2017	J	`jnl`	Multi-dimensional Graph Fourier Transform. CoRR Takashi Kurokawa, Taihei Oki, Hiromichi Nagao
2016	C	`conf`	A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract). ISCO Hiroshi Hirai, Taihei Oki