Taihei Oki
10 papers · 2022–2026 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Silver
🌉
Interdisciplinary Bridge · Silver
🗺️
Taxonomy Completionist
(19)
💎
Century Club · Bronze
🗃️
Keyword Collector
(56)
Top co-authors
Research topics
Keywords
combinatorial optimization
(4)
convex optimization
(4)
online learning
(2)
bipartite matching
(2)
generalization bound
(2)
greedy algorithm
(2)
matroid intersection
(2)
structured prediction
(1)
low-rank approximation
(1)
dimensionality reduction
(1)
mechanism design
(1)
map inference
(1)
discrete optimization
(1)
multi-class classification
(1)
determinantal point process
(1)
energy minimization
(1)
logistic loss
(1)
heuristic function
(1)
matrix approximation
(1)
linear programming
(1)
Papers
Position Fair Mechanisms Allocating Indivisible Goods
AAAI 2026
Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming
NeurIPS 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
NeurIPS 2024
Online Structured Prediction with Fenchel–Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
COLT 2024
Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case
NeurIPS 2023
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation
AISTATS 2023
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization
ICML 2023
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
NeurIPS 2022
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
NeurIPS 2022
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search
NeurIPS 2022