Tasuku Soma
8 papers · 2014–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π£ Hot Topic Early Bird π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Bronze π Conference Polyglot Β· Silver πΊοΈ Taxonomy Completionist (19)
π§¬
Topic Evolution
π
Trend Setter
Top co-authors
Research topics
Keywords
submodular maximization
(3)
blackwell approachability
(2)
submodular optimization
(2)
regret bound
(2)
online algorithm
(2)
online optimization
(2)
approximation algorithm
(2)
matroid constraint
(2)
greedy algorithm
(1)
first-order method
(1)
no-regret algorithm
(1)
sparsity constraint
(1)
bicriteria approximation
(1)
submodular function
(1)
diminishing return property
(1)
diminishing return
(1)
budget allocation
(1)
conditional value at risk
(1)
knapsack constraint
(1)
dictionary selection
(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
NeurIPS 2020
Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits
NeurIPS 2020
No-regret algorithms for online k-submodular maximization
AISTATS 2019
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
NeurIPS 2018
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
NeurIPS 2015
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
ICML 2014