activity
20152026
most citedStatistical Learning with Conditional Value at Risk

22 citations · 63 across the 20 of their papers we have counts for

collaborators
Showing cs.DSShow all

10 papers · 1 filter

cs.DS2025

-Approximation Algorithms for Bipartiteness Ratio

Tasuku Soma, Mingquan Ye, Yuichi Yoshida

We propose an -approximation algorithm for the bipartiteness ratio of undirected graphs introduced by Trevisan (SIAM Journal on Computing, vol. 41, no. 6, 2012), where $…

cs.DS2023

Online Algorithms for Spectral Hypergraph Sparsification

Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida

We provide the first online algorithm for spectral hypergraph sparsification. In the online setting, hyperedges with positive weights are arriving in a stream, and upon the arrival…

cs.DS2022

Shrunk subspaces via operator Sinkhorn iteration

Cole Franks, Tasuku Soma, Michel X. Goemans

A recent breakthrough in Edmonds' problem showed that the noncommutative rank can be computed in deterministic polynomial time, and various algorithms for it were devised. However,…

cs.DS2021

Online Risk-Averse Submodular Maximization

Tasuku Soma, Yuichi Yoshida

We present a polynomial-time online algorithm for maximizing the conditional value at risk (CVaR) of a monotone stochastic submodular function. Given i.i.d. samples from an und…

cs.DS2018

Spectral Sparsification of Hypergraphs

Tasuku Soma, Yuichi Yoshida

For an undirected/directed hypergraph , its Laplacian is defined such that its ``quadratic form'' $\boldsymbol{x}^\top L_G(\boldsym…

cs.DS2018★ 13 cited

No-regret algorithms for online -submodular maximization

Tasuku Soma

We present a polynomial time algorithm for online maximization of -submodular maximization. For online (nonmonotone) -submodular maximization, our algorithm achieves a tight…

cs.DS2018★ 8 cited

Polynomial-Time Algorithms for Submodular Laplacian Systems

Kaito Fujii, Tasuku Soma, Yuichi Yoshida

Let be an undirected graph, be the associated Laplacian matrix, and be a vector. Solving the Laplacian system $L_G x…

cs.DS2017

A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity

Tasuku Soma, Yuichi Yoshida

In monotone submodular function maximization, approximation guarantees based on the curvature of the objective function have been extensively studied in the literature. However, th…

cs.DS2016★ 7 cited

Non-monotone DR-Submodular Function Maximization

Tasuku Soma, Yuichi Yoshida

We consider non-monotone DR-submodular function maximization, where DR-submodularity (diminishing return submodularity) is an extension of submodularity for functions over the inte…

cs.DS2015★ 1 cited

Maximizing Monotone Submodular Functions over the Integer Lattice

Tasuku Soma, Yuichi Yoshida

The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the probl…