default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTasuku Soma
Person information
- affiliation: University of Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Tasuku Soma
, Kam Chuen Tung, Yuichi Yoshida:
Online Algorithms for Spectral Hypergraph Sparsification. IPCO 2024: 405-417- [i19]Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algorithmic aspects of semistability of quiver representations. CoRR abs/2407.06493 (2024) - 2023
- [j7]Tasuku Soma, Yuichi Yoshida:
Online risk-averse submodular maximization. Ann. Oper. Res. 320(1): 393-414 (2023) - [c17]Cole Franks, Tasuku Soma, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. SODA 2023: 1655-1668 - [c16]Taihei Oki, Tasuku Soma:
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. SODA 2023: 4188-4204 - [i18]Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida:
Online Algorithms for Spectral Hypergraph Sparsification. CoRR abs/2310.02643 (2023) - [i17]Hiroshi Hirai, Yuni Iwamasa, Taihei Oki, Tasuku Soma:
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices. CoRR abs/2310.15502 (2023) - 2022
- [i16]Taihei Oki, Tasuku Soma:
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank. CoRR abs/2207.07946 (2022) - [i15]Cole Franks, Tasuku Soma, Michel X. Goemans:
Shrunk subspaces via operator Sinkhorn iteration. CoRR abs/2207.08311 (2022) - [i14]Tasuku Soma, Khashayar Gatmiry, Stefanie Jegelka:
Optimal algorithms for group distributionally robust optimization and beyond. CoRR abs/2212.13669 (2022) - 2021
- [j6]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-time algorithms for submodular Laplacian systems. Theor. Comput. Sci. 892: 170-186 (2021) - [c15]Tasuku Soma, Yuichi Yoshida:
Online Risk-Averse Submodular Maximization. IJCAI 2021: 2988-2994 - [i13]Tasuku Soma, Yuichi Yoshida:
Online Risk-Averse Submodular Maximization. CoRR abs/2105.09838 (2021) - 2020
- [c14]Nicholas J. A. Harvey, Christopher Liaw, Tasuku Soma:
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds. NeurIPS 2020 - [c13]Shinji Ito, Shuichi Hirahara, Tasuku Soma, Yuichi Yoshida:
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits. NeurIPS 2020 - [i12]Tasuku Soma, Yuichi Yoshida:
Statistical Learning with Conditional Value at Risk. CoRR abs/2002.05826 (2020) - [i11]Takeru Matsuda, Tasuku Soma:
Information geometry of operator scaling. CoRR abs/2005.01453 (2020)
2010 – 2019
- 2019
- [c12]Tasuku Soma:
No-regret algorithms for online k-submodular maximization. AISTATS 2019: 1205-1214 - [c11]Tasuku Soma, Yuichi Yoshida:
Spectral Sparsification of Hypergraphs. SODA 2019: 2570-2581 - 2018
- [j5]Tasuku Soma, Yuichi Yoshida:
Maximizing monotone submodular functions over the integer lattice. Math. Program. 172(1-2): 539-563 (2018) - [j4]Zhening Li, Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
On Orthogonal Tensors and Best Rank-One Approximation Ratio. SIAM J. Matrix Anal. Appl. 39(1): 400-425 (2018) - [c10]Tasuku Soma, Yuichi Yoshida:
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. ICALP 2018: 99:1-99:14 - [c9]Kaito Fujii, Tasuku Soma:
Fast greedy algorithms for dictionary selection with generalized sparsity constraints. NeurIPS 2018: 4749-4758 - [i10]Kaito Fujii, Tasuku Soma, Yuichi Yoshida:
Polynomial-Time Algorithms for Submodular Laplacian Systems. CoRR abs/1803.10923 (2018) - [i9]Satoshi Hara, Kouichi Ikeno, Tasuku Soma, Takanori Maehara:
Maximally Invariant Data Perturbation as Explanation. CoRR abs/1806.07004 (2018) - [i8]Tasuku Soma:
No-regret algorithms for online k-submodular maximization. CoRR abs/1807.04965 (2018) - [i7]Tasuku Soma, Yuichi Yoshida:
Spectral Sparsification of Hypergraphs. CoRR abs/1807.04974 (2018) - [i6]Kaito Fujii, Tasuku Soma:
Fast greedy algorithms for dictionary selection with generalized sparsity constraints. CoRR abs/1809.02314 (2018) - 2017
- [j3]Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
Finding a low-rank basis in a matrix subspace. Math. Program. 162(1-2): 325-361 (2017) - [c8]Tasuku Soma, Yuichi Yoshida:
Non-Monotone DR-Submodular Function Maximization. AAAI 2017: 898-904 - [c7]Tasuku Soma, Yuichi Yoshida:
Regret Ratio Minimization in Multi-Objective Submodular Function Maximization. AAAI 2017: 905-911 - [i5]Zhening Li, Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
On orthogonal tensors and best rank-one approximation ratio. CoRR abs/1707.02569 (2017) - [i4]Tasuku Soma, Yuichi Yoshida:
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity. CoRR abs/1709.02910 (2017) - 2016
- [j2]Tasuku Soma:
Multicasting in Linear Deterministic Relay Network by Matrix Completion. IEEE Trans. Inf. Theory 62(2): 870-875 (2016) - [c6]Tasuku Soma, Yuichi Yoshida:
Maximizing Monotone Submodular Functions over the Integer Lattice. IPCO 2016: 325-336 - [c5]Tasuku Soma, Yuichi Yoshida:
Non-convex Compressed Sensing with the Sum-of-Squares Method. SODA 2016: 570-579 - [i3]Tasuku Soma, Yuichi Yoshida:
Non-monotone DR-Submodular Function Maximization. CoRR abs/1612.00960 (2016) - 2015
- [c4]Tasuku Soma, Yuichi Yoshida:
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice. NIPS 2015: 847-855 - [i2]Tasuku Soma, Yuichi Yoshida:
Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice. CoRR abs/1503.01218 (2015) - [i1]Yuji Nakatsukasa, Tasuku Soma, André Uschmajew:
Finding a low-rank basis in a matrix subspace. CoRR abs/1503.08601 (2015) - 2014
- [j1]Tasuku Soma:
Fast Deterministic Algorithms for Matrix Completion Problems. SIAM J. Discret. Math. 28(1): 490-502 (2014) - [c3]Tasuku Soma, Naonori Kakimura, Kazuhiro Inaba, Ken-ichi Kawarabayashi:
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm. ICML 2014: 351-359 - [c2]Tasuku Soma:
Multicasting in linear deterministic relay network by matrix completion. ISIT 2014: 1191-1195 - 2013
- [c1]Tasuku Soma:
Fast Deterministic Algorithms for Matrix Completion Problems. IPCO 2013: 375-386
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
