Optimal budget allocation: Theoretical guarantee and efficient algorithm T Soma, N Kakimura, K Inaba, K Kawarabayashi
International Conference on Machine Learning, 351-359, 2014
135 2014 Maximizing monotone submodular functions over the integer lattice T Soma, Y Yoshida
Mathematical Programming 172, 539-563, 2018
108 2018 A generalization of submodular cover via the diminishing return property on the integer lattice T Soma, Y Yoshida
Advances in neural information processing systems 28, 2015
106 2015 Non-Monotone DR-Submodular Function Maximization YY Tasuku Soma
The 31st AAAI Conference on Artificial Inteligence, 2017
63 * 2017 Spectral sparsification of hypergraphs T Soma, Y Yoshida
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
57 2019 Statistical learning with conditional value at risk T Soma, Y Yoshida
arXiv preprint arXiv:2002.05826, 2020
48 2020 On orthogonal tensors and best rank-one approximation ratio Z Li, Y Nakatsukasa, T Soma, A Uschmajew
SIAM Journal on Matrix Analysis and Applications 39 (1), 400-425, 2018
35 2018 No-regret algorithms for online -submodular maximization T Soma
Proceedings of the 22nd International Conference on Artificial Intelligence …, 2018
29 2018 Finding a low-rank basis in a matrix subspace Y Nakatsukasa, T Soma, A Uschmajew
Mathematical Programming 162, 325-361, 2017
29 2017 Regret Ratio Minimization in Multi-Objective Submodular Function Maximization YY Tasuku Soma
The 31st AAAI Conference on Artificial Inteligence, 2017
18 * 2017 Tight first-and second-order regret bounds for adversarial linear bandits S Ito, S Hirahara, T Soma, Y Yoshida
Advances in Neural Information Processing Systems 33, 2028-2038, 2020
17 2020 Polynomial-time algorithms for submodular Laplacian systems K Fujii, T Soma, Y Yoshida
Theoretical Computer Science 892, 170-186, 2021
16 2021 Improved algorithms for online submodular maximization via first-order regret bounds N Harvey, C Liaw, T Soma
Advances in Neural Information Processing Systems 33, 123-133, 2020
14 2020 A new approximation guarantee for monotone submodular function maximization via discrete convexity T Soma, Y Yoshida
45th International Colloquium on Automata, Languages, and Programming …, 2017
14 2017 Optimal algorithms for group distributionally robust optimization and beyond T Soma, K Gatmiry, S Jegelka
arXiv preprint arXiv:2212.13669, 2022
12 2022 Maximally invariant data perturbation as explanation S Hara, K Ikeno, T Soma, T Maehara
arXiv preprint arXiv:1806.07004, 2018
9 2018 Information geometry of operator scaling T Matsuda, T Soma
Linear Algebra and its Applications 649, 240-267, 2022
6 2022 Shrunk subspaces via operator Sinkhorn iteration C Franks, T Soma, MX Goemans
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
5 2023 Fast greedy algorithms for dictionary selection with generalized sparsity constraints K Fujii, T Soma
Advances in Neural Information Processing Systems 31, 2018
5 2018 Fast deterministic algorithms for matrix completion problems T Soma
SIAM Journal on Discrete Mathematics 28 (1), 490-502, 2014
5 2014