Tasuku Soma
8 papers · 2014–2025 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
π Conference Polyglot (5) π Academic Marathon (11) π Interdisciplinary Bridge π£ Hot Topic Early Bird π Cross-Pollinator (15)
πΊοΈ
Taxonomy Completionist
(16)
π§
Keyword Pioneer
π§¬
Topic Evolution
π
Trend Setter
Conferences
NIPS (4)
AISTATS (1)
ICLR (1)
ICML (1)
IJCAI (1)
Top co-authors
Keywords
submodular maximization
(3)
matroid constraint
(2)
online optimization
(2)
approximation algorithm
(2)
blackwell approachability
(2)
submodular optimization
(2)
online algorithm
(2)
regret bound
(2)
no-regret algorithm
(1)
sparsity constraint
(1)
bicriteria approximation
(1)
diminishing return property
(1)
diminishing return
(1)
budget allocation
(1)
conditional value at risk
(1)
knapsack constraint
(1)
dictionary selection
(1)
multiplicative weight update
(1)
integer lattice
(1)
k-submodular function
(1)
Papers
Difference-of-submodular Bregman Divergence
ICLR 2025
Online Risk-Averse Submodular Maximization
IJCAI 2021
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds
NIPS 2020
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits
NIPS 2020
No-regret algorithms for online $k$-submodular maximization
AISTATS 2019
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
NIPS 2018
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
NIPS 2015
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
ICML 2014