Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. - Tasuku Soma; Naonori Kakimura; Kazuhiro Inaba; Ken-ichi Kawarabayashi (ICML, 2014)

Fast Deterministic Algorithms for Matrix Completion Problems. - Tasuku Soma (SIAM J. Discret. Math., 2014)

A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice. - Tasuku Soma; Yuichi Yoshida (NIPS, 2015)

Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice. - Tasuku Soma; Yuichi Yoshida (CoRR, 2015)

Non-convex Compressed Sensing with the Sum-of-Squares Method. - Tasuku Soma; Yuichi Yoshida (SODA, 2016)

Multicasting in Linear Deterministic Relay Network by Matrix Completion. - Tasuku Soma (IEEE Trans. Inf. Theory, 2016)

Non-Monotone DR-Submodular Function Maximization. - Tasuku Soma; Yuichi Yoshida (AAAI, 2017)

Regret Ratio Minimization in Multi-Objective Submodular Function Maximization. - Tasuku Soma; Yuichi Yoshida (AAAI, 2017)

Finding a low-rank basis in a matrix subspace. - Yuji Nakatsukasa; Tasuku Soma; André Uschmajew (Math. Program., 2017)

A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. - Tasuku Soma; Yuichi Yoshida (ICALP, 2018)

Fast greedy algorithms for dictionary selection with generalized sparsity constraints. - Kaito Fujii; Tasuku Soma (NeurIPS, 2018)

Maximally Invariant Data Perturbation as Explanation. - Satoshi Hara 001; Kouichi Ikeno; Tasuku Soma; Takanori Maehara (CoRR, 2018)

No-regret algorithms for online k-submodular maximization. - Tasuku Soma (CoRR, 2018)

Maximizing monotone submodular functions over the integer lattice. - Tasuku Soma; Yuichi Yoshida (Math. Program., 2018)

On Orthogonal Tensors and Best Rank-One Approximation Ratio. - Zhening Li; Yuji Nakatsukasa; Tasuku Soma; André Uschmajew (SIAM J. Matrix Anal. Appl., 2018)

No-regret algorithms for online k-submodular maximization. - Tasuku Soma (AISTATS, 2019)

Spectral Sparsification of Hypergraphs. - Tasuku Soma; Yuichi Yoshida (SODA, 2019)

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. - Nicholas J. A. Harvey; Christopher Liaw; Tasuku Soma (NeurIPS, 2020)

Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits. - Shinji Ito; Shuichi Hirahara; Tasuku Soma; Yuichi Yoshida (NeurIPS, 2020)

Statistical Learning with Conditional Value at Risk. - Tasuku Soma; Yuichi Yoshida (CoRR, 2020)

Information geometry of operator scaling. - Takeru Matsuda; Tasuku Soma (CoRR, 2020)

Polynomial-time algorithms for submodular Laplacian systems. - Kaito Fujii; Tasuku Soma; Yuichi Yoshida (Theor. Comput. Sci., 2021)

Optimal algorithms for group distributionally robust optimization and beyond. - Tasuku Soma; Khashayar Gatmiry; Stefanie Jegelka (CoRR, 2022)

Shrunk subspaces via operator Sinkhorn iteration. - Cole Franks; Tasuku Soma; Michel X. Goemans (SODA, 2023)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. - Taihei Oki; Tasuku Soma (SODA, 2023)

Online risk-averse submodular maximization. - Tasuku Soma; Yuichi Yoshida (Ann. Oper. Res., 2023)

Online Algorithms for Spectral Hypergraph Sparsification. - Tasuku Soma; Kam Chuen Tung; Yuichi Yoshida (IPCO, 2024)

Accelerating operator Sinkhorn iteration with overrelaxation. - Tasuku Soma; André Uschmajew (CoRR, 2024)

Algorithmic Aspects of Semistability of Quiver Representations. - Yuni Iwamasa; Taihei Oki; Tasuku Soma (ICALP, 2025)

Difference-of-submodular Bregman Divergence. - Masanari Kimura; Takahiro Kawashima; Tasuku Soma; Hideitsu Hino (ICLR, 2025)

Algebraic Algorithms for Fractional Linear Matroid Parity via Noncommutative Rank. - Taihei Oki; Tasuku Soma (SIAM J. Comput., 2025)

Cut-Matching Games for Bipartiteness Ratio of Undirected Graphs. - Tasuku Soma; Mingquan Ye; Yuichi Yoshida (CoRR, 2025)

Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. - Hiroshi Hirai 001; Yuni Iwamasa; Taihei Oki; Tasuku Soma (Math. Program., 2025)