Follow
Tasuku Soma
Title
Cited by
Cited by
Year
Optimal budget allocation: Theoretical guarantee and efficient algorithm
T Soma, N Kakimura, K Inaba, K Kawarabayashi
International Conference on Machine Learning, 351-359, 2014
1072014
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
742015
Maximizing monotone submodular functions over the integer lattice
T Soma, Y Yoshida
Mathematical Programming 172 (1), 539-563, 2018
682018
Non-Monotone DR-Submodular Function Maximization
YY Tasuku Soma
The 31st AAAI Conference on Artificial Inteligence, 2017
42*2017
Spectral sparsification of hypergraphs
T Soma, Y Yoshida
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
312019
Statistical learning with conditional value at risk
T Soma, Y Yoshida
arXiv preprint arXiv:2002.05826, 2020
282020
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
272018
Finding a low-rank basis in a matrix subspace
Y Nakatsukasa, T Soma, A Uschmajew
Mathematical Programming 162 (1), 325-361, 2017
252017
No-regret algorithms for online -submodular maximization
T Soma
Proceedings of the 22nd International Conference on Artificial Intelligence …, 2018
152018
Regret Ratio Minimization in Multi-Objective Submodular Function Maximization
YY Tasuku Soma
The 31st AAAI Conference on Artificial Inteligence, 2017
15*2017
Polynomial-time algorithms for submodular Laplacian systems
K Fujii, T Soma, Y Yoshida
Theoretical Computer Science 892, 170-186, 2021
102021
Maximally invariant data perturbation as explanation
S Hara, K Ikeno, T Soma, T Maehara
arXiv preprint arXiv:1806.07004, 2018
82018
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
82017
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
72020
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
62020
Maximizing submodular functions with the diminishing return property over the integer lattice
T Soma, Y Yoshida
arXiv preprint arXiv:1503.01218, 20, 2015
42015
Fast deterministic algorithms for matrix completion problems
T Soma
SIAM Journal on Discrete Mathematics 28 (1), 490-502, 2014
42014
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
K Fujii, T Soma
Advances in Neural Information Processing Systems 31, 2018
32018
Non-convex compressed sensing with the sum-of-squares method
T Soma, Y Yoshida
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
32016
Information geometry of operator scaling
T Matsuda, T Soma
Linear Algebra and its Applications, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20