Hanna Sumita
19 papers · 2017–2024 · 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 ↓+10 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (23) π Academic Marathon Β· Sprint π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(10)
π€
Dynamic Duo
(13)
π§¬
Topic Evolution
π
Keyword Champion
π
Trend Setter
ποΈ
Keyword Collector
(81)
π
Conference Pioneer
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
π
Renaissance Researcher
(5)
Top co-authors
Research topics
Machine Learning
(16)
Mathematics & Optimization
(15)
Optimization
(15)
Optimization & Theory
(13)
Learning Types
(6)
Artificial Intelligence
(2)
Computer Science
(2)
Knowledge & Reasoning
(2)
Core AI
(2)
Core Methods
(2)
Foundations
(2)
Reasoning
(2)
Reinforcement Learning
(1)
Application Areas
(1)
Mathematics
(1)
Keywords
regret bound
(9)
multi-armed bandit
(4)
online algorithm
(4)
online learning
(4)
combinatorial optimization
(3)
fair division
(2)
competitive analysis
(2)
partition matroid constraint
(2)
online optimization
(2)
approximation algorithm
(2)
contextual bandit
(2)
resource allocation
(2)
submodular optimization
(2)
matroid constraint
(2)
bandit feedback
(2)
stochastic process
(2)
polynomial time
(2)
sparse linear regression
(2)
sublinear regret
(2)
algorithm design
(1)
Papers
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
AAAI 2024
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations
AAAI 2024
Bandit Task Assignment with Unknown Processing Time
NeurIPS 2023
Fair Division with Two-Sided Preferences
IJCAI 2023
Random Assignment of Indivisible Goods under Constraints
IJCAI 2023
Online Task Assignment Problems with Reusable Resources
AAAI 2022
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits
AISTATS 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
AAAI 2021
Delay and Cooperation in Nonstochastic Linear Bandits
NeurIPS 2020
On the Max-Min Fair Stochastic Allocation of Indivisible Goods
AAAI 2020
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
NeurIPS 2019
Randomized Strategies for Robust Combinatorial Optimization
AAAI 2019
Causal Bandits with Propagating Inference
ICML 2018
Online Regression with Partial Information: Generalization and Linear Projection
AISTATS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint
NeurIPS 2018
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization
IJCAI 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation
NeurIPS 2017
Online Optimization of Video-Ad Allocation
IJCAI 2017