Seuraa
Shinsaku Sakaue
Shinsaku Sakaue
The University of Tokyo
Vahvistettu sähköpostiosoite verkkotunnuksessa mist.i.u-tokyo.ac.jp - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
38*2016
On maximizing a monotone k-submodular function subject to a matroid constraint
S Sakaue
Discrete Optimization 23, 105-113, 2017
312017
Beyond adaptive submodularity: Approximation guarantees of greedy policy with adaptive submodularity ratio
K Fujii, S Sakaue
International Conference on Machine Learning, 2042-2051, 2019
252019
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
19*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
15*2017
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
142018
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
132021
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
102022
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
102022
Differentiable greedy algorithm for monotone submodular maximization: Guarantees, gradient estimators, and applications
S Sakaue
International Conference on Artificial Intelligence and Statistics, 28-36, 2021
72021
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
7*2020
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
62019
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
62018
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
52018
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
42020
Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation
S Sakaue, T Oki
International Conference on Artificial Intelligence and Statistics, 1-10, 2023
22023
Nearly Tight Spectral Sparsification of Directed Hypergraphs
K Oko, S Sakaue, S Tanigawa
50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023
2*2023
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
22022
Sparse Regularized Optimal Transport with Deformed q-Entropy
H Bao, S Sakaue
Entropy 24 (11), 1634, 2022
22022
Algorithmic Bayesian persuasion with combinatorial actions
K Fujii, S Sakaue
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5016-5024, 2022
22022
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20