Tasuku Soma

Orcid: 0000-0001-9519-2487

Affiliations:
  • University of Tokyo, Japan


According to our database1, Tasuku Soma authored at least 27 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices.
CoRR, 2023

Online Algorithms for Spectral Hypergraph Sparsification.
CoRR, 2023

Online risk-averse submodular maximization.
Ann. Oper. Res., 2023

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Shrunk subspaces via operator Sinkhorn iteration.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Optimal algorithms for group distributionally robust optimization and beyond.
CoRR, 2022

2021
Polynomial-time algorithms for submodular Laplacian systems.
Theor. Comput. Sci., 2021

2020
Information geometry of operator scaling.
CoRR, 2020

Statistical Learning with Conditional Value at Risk.
CoRR, 2020

Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Spectral Sparsification of Hypergraphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

No-regret algorithms for online $k$-submodular maximization.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
On Orthogonal Tensors and Best Rank-One Approximation Ratio.
SIAM J. Matrix Anal. Appl., 2018

Maximizing monotone submodular functions over the integer lattice.
Math. Program., 2018

Maximally Invariant Data Perturbation as Explanation.
CoRR, 2018

Fast greedy algorithms for dictionary selection with generalized sparsity constraints.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Finding a low-rank basis in a matrix subspace.
Math. Program., 2017

Regret Ratio Minimization in Multi-Objective Submodular Function Maximization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Non-Monotone DR-Submodular Function Maximization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Multicasting in Linear Deterministic Relay Network by Matrix Completion.
IEEE Trans. Inf. Theory, 2016

Non-convex Compressed Sensing with the Sum-of-Squares Method.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Maximizing Submodular Functions with the Diminishing Return Property over the Integer Lattice.
CoRR, 2015

A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

2014
Fast Deterministic Algorithms for Matrix Completion Problems.
SIAM J. Discret. Math., 2014

Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm.
Proceedings of the 31th International Conference on Machine Learning, 2014


  Loading...