Folgen
Shinsaku Sakaue
Shinsaku Sakaue
Bestätigte E-Mail-Adresse bei mist.i.u-tokyo.ac.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
33*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
222019
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
17*2018
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
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
14*2017
On maximizing a monotone k-submodular function subject to a matroid constraint
S Sakaue
Discrete Optimization 23, 105-113, 2017
132017
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
92021
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
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), 1-18, 2022
52022
Provable fast greedy compressive summarization with any monotone submodular function
SSTHM Nishino, M Nagata
Proceedings of NAACL-HLT, 1737-1746, 2018
52018
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
4*2020
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
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
42018
Differentiable greedy algorithm for monotone submodular maximization: Guarantees, gradient estimators, and applications
S Sakaue
International Conference on Artificial Intelligence and Statistics, 28-36, 2021
32021
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions
S Sakaue, T Oki
arXiv preprint arXiv:2205.09961, 2022
22022
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search
S Sakaue, T Oki
arXiv preprint arXiv:2205.09963, 2022
12022
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
12021
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
S Sakaue
International Conference on Artificial Intelligence and Statistics, 22-33, 2020
1*2020
Best-first Search Algorithm for Non-convex Sparse Minimization
S Sakaue, N Marumo
arXiv preprint arXiv:1910.01296, 2019
12019
Using Multiparameter Eigenvalues for Solving Quadratic Programming with Quadratic Equality Constraints
S Sakaue
12016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20