default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaihei Oki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Shinsaku Sakaue, Han Bao, Taira Tsuchiya, Taihei Oki:
Online Structured Prediction with Fenchel-Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss. COLT 2024: 4458-4486- [c17]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching Is in Quasi-NC. ESA 2024: 63:1-63:14 - [c16]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-Labeled Matroid Bases. ICALP 2024: 86:1-86:20 - [c15]Taihei Oki
, Yujin Song:
Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices. ISSAC 2024: 143-152 - [i24]Shinsaku Sakaue, Han Bao, Taira Tsuchiya, Taihei Oki:
Online Structured Prediction with Fenchel-Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss. CoRR abs/2402.08180 (2024) - [i23]Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz:
Problems on Group-labeled Matroid Bases. CoRR abs/2402.16259 (2024) - [i22]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching is in quasi-NC. CoRR abs/2402.18276 (2024) - [i21]Taihei Oki, Yujin Song:
Structural Preprocessing Method for Nonlinear Differential-Algebraic Equations Using Linear Symbolic Matrices. CoRR abs/2403.10260 (2024) - [i20]Taihei Oki, Shinsaku Sakaue:
No-Regret M♮-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting. CoRR abs/2405.12439 (2024) - [i19]Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algorithmic aspects of semistability of quiver representations. CoRR abs/2407.06493 (2024) - [i18]Ryoga Mahara, Ryuhei Mizutani, Taihei Oki, Tomohiko Yokoyama:
Position Fair Mechanisms Allocating Indivisible Goods. CoRR abs/2409.06423 (2024) - [i17]Shinichi Hemmi, Satoru Iwata, Taihei Oki:
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method. CoRR abs/2409.13128 (2024) - [i16]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching is in quasi-NC. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j5]Taihei Oki:
Computing valuations of the Dieudonné determinants. J. Symb. Comput. 116: 284-323 (2023) - [c14]Shinsaku Sakaue, Taihei Oki:
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation. AISTATS 2023: 1-10 - [c13]Shinsaku Sakaue, Taihei Oki:
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster L-/L♮-Convex Function Minimization. ICML 2023: 29760-29776 - [c12]Taihei Oki, Shinsaku Sakaue:
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. NeurIPS 2023 - [c11]Taihei Oki, Tasuku Soma:
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. SODA 2023: 4188-4204 - [i15]Shinsaku Sakaue, Taihei Oki:
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster L-/L♮-Convex Function Minimization. CoRR abs/2302.00928 (2023) - [i14]Taihei Oki, Shinsaku Sakaue:
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case. CoRR abs/2306.05865 (2023) - [i13]Shinsaku Sakaue, Taihei Oki:
Data-Driven Projection for Reducing Dimensionality of Linear Programs: Generalization Bound and Learning Methods. CoRR abs/2309.00203 (2023) - [i12]Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR abs/2310.15502 (2023) - [i11]Satoru Iwata, Taihei Oki, Shinsaku Sakaue:
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. CoRR abs/2312.05470 (2023) - 2022
- [j4]Kazuki Matoya, Taihei Oki:
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. SIAM J. Discret. Math. 36(3): 2121-2158 (2022) - [c10]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS 2022 - [c9]Shinsaku Sakaue, Taihei Oki:
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search. NeurIPS 2022 - [c8]Shinsaku Sakaue, Taihei Oki:
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions. NeurIPS 2022 - [i10]Shinsaku Sakaue, Taihei Oki:
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions. CoRR abs/2205.09961 (2022) - [i9]Shinsaku Sakaue, Taihei Oki:
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search. CoRR abs/2205.09963 (2022) - [i8]Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata:
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. CoRR abs/2206.05947 (2022) - [i7]Taihei Oki, Tasuku Soma:
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. CoRR abs/2207.07946 (2022) - [i6]Shinsaku Sakaue, Taihei Oki:
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation. CoRR abs/2209.08281 (2022) - 2021
- [j3]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Algorithmica 83(12): 3681-3714 (2021) - [c7]Kazuki Matoya, Taihei Oki:
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems. IPCO 2021: 223-237 - [c6]Taihei Oki:
Computing Valuations of the Dieudonné Determinants. ISSAC 2021: 321-328 - 2020
- [c5]Taihei Oki:
On Solving (Non)commutative Weighted Edmonds' Problem. ICALP 2020: 89:1-89:14 - [c4]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO 2020: 237-248 - [i5]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. CoRR abs/2004.11166 (2020)
2010 – 2019
- 2019
- [j2]Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM 66(5): 35:1-35:34 (2019) - [c3]Taihei Oki:
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation. ISSAC 2019: 315-322 - [i4]Taihei Oki:
Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation. CoRR abs/1907.04511 (2019) - [i3]Taihei Oki:
Computing the Maximum Degree of Minors in Skew Polynomial Matrices. CoRR abs/1907.04512 (2019) - [i2]Taihei Oki:
A Generalized Matrix-Tree Theorem for Pfaffian Pairs. CoRR abs/1912.00620 (2019) - 2018
- [j1]Hiroshi Hirai, Taihei Oki:
A compact representation for minimizers of k-submodular functions. J. Comb. Optim. 36(3): 709-741 (2018) - [c2]Satoru Iwata, Taihei Oki, Mizuyo Takamatsu:
Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC 2018: 45-55 - 2017
- [i1]Takashi Kurokawa, Taihei Oki, Hiromichi Nagao:
Multi-dimensional Graph Fourier Transform. CoRR abs/1712.07811 (2017) - 2016
- [c1]Hiroshi Hirai, Taihei Oki:
A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract). ISCO 2016: 381-392
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
