| On maximizing a monotone k-submodular function subject to a matroid constraint S Sakaue Discrete Optimization 23, 105-113, 2017 | 43 | 2017 |
| Solving generalized CDT problems via two-parameter eigenvalues S Sakaue, Y Nakatsukasa, A Takeda, S Iwata SIAM Journal on Optimization 26 (3), 1669-1694, 2016 | 43* | 2016 |
| Beyond adaptive submodularity: Approximation guarantees of greedy policy with adaptive submodularity ratio K Fujii, S Sakaue International Conference on Machine Learning, 2042-2051, 2019 | 26 | 2019 |
| Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams S Sakaue, M Ishihata, S Minato International Conference on Artificial Intelligence and Statistics, 585-594, 2018 | 21 | 2018 |
| Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems S Sakaue, A Takeda, S Kim, N Ito SIAM Journal on Optimization 27 (1), 565-582, 2017 | 20* | 2017 |
| Discrete-convex-analysis-based framework for warm-starting algorithms with predictions S Sakaue, T Oki Advances in Neural Information Processing Systems 35, 20988-21000, 2022 | 18 | 2022 |
| Learning Individually Fair Classifier with Path-Specific Causal-Effect Constraint Y Chikahara, S Sakaue, A Fujino, H Kashima International Conference on Artificial Intelligence and Statistics, 145-153, 2021 | 16 | 2021 |
| Accelerated best-first search with upper-bound computation for submodular function maximization S Sakaue, M Ishihata Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 16 | 2018 |
| Selecting molecules with diverse structures and properties by maximizing submodular functions of descriptors learned with graph neural networks T Nakamura, S Sakaue, K Fujii, Y Harabuchi, S Maeda, S Iwata Scientific reports 12 (1), 1124, 2022 | 15 | 2022 |
| Differentiable greedy algorithm for monotone submodular maximization: Guarantees, gradient estimators, and applications S Sakaue International Conference on Artificial Intelligence and Statistics, 28-36, 2021 | 9 | 2021 |
| Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint S Sakaue International Conference on Artificial Intelligence and Statistics, 11-21, 2020 | 8* | 2020 |
| Provable fast greedy compressive summarization with any monotone submodular function S Sakaue, T Hirao, M Nishino, M Nagata Proceedings of the 2018 Conference of the North American Chapter of the …, 2018 | 7 | 2018 |
| Sparse Regularized Optimal Transport with Deformed q-Entropy H Bao, S Sakaue Entropy 24 (11), 1634, 2022 | 6 | 2022 |
| Greedy and IHT algorithms for non-convex optimization with monotone costs of non-zeros S Sakaue International Conference on Artificial Intelligence and Statistics, 206-215, 2019 | 6 | 2019 |
| Submodular function maximization over graphs via zero-suppressed binary decision diagrams S Sakaue, M Nishino, N Yasuda Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 6 | 2018 |
| Nearly tight spectral sparsification of directed hypergraphs K Oko, S Sakaue, S Tanigawa 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 5* | 2023 |
| Practical Frank–Wolfe method with decision diagrams for computing Wardrop equilibrium of combinatorial congestion games K Nakamura, S Sakaue, N Yasuda Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2200-2209, 2020 | 5 | 2020 |
| Sample complexity of learning heuristic functions for greedy-best-first and A* search S Sakaue, T Oki Advances in Neural Information Processing Systems 35, 2889-2901, 2022 | 3 | 2022 |
| Differentiable equilibrium computation with decision diagrams for Stackelberg models of combinatorial congestion games S Sakaue, K Nakamura Advances in Neural Information Processing Systems 34, 9416-9428, 2021 | 3 | 2021 |
| Faster discrete convex function minimization with predictions: the M-convex case T Oki, S Sakaue Advances in Neural Information Processing Systems 36, 68576-68588, 2023 | 2 | 2023 |
Taihei OkiThe University of Tokyo在 mist.i.u-tokyo.ac.jp 的电子邮件经过验证
