Hanna Sumita

19 papers · 2017–2024 · 5 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (5) 🏃 Academic Marathon (7) 🐝 Cross-Pollinator (9) 🌈 Renaissance Researcher (6) 🗺️ Taxonomy Completionist (23) 🔬 Deep Specialist (10) 🧬 Topic Evolution 🤝 Dynamic Duo (13) 🏆 Keyword Champion 💎 Century Club (19) 🔥 Unstoppable (8) 🗃️ Keyword Collector (81) 🚀 Conference Pioneer 📈 Trend Setter

Conferences

AAAI (6) NIPS (6) IJCAI (4) AISTATS (2) ICML (1)

Top co-authors

Ken-Ichi Kawarabayashi (13) Takuro Fukunaga (13) Naonori Kakimura (13) Shinji Ito (12) Daisuke Hatano (12) Kei Takemura (7) Yasushi Kawase (6) Akihiro Yabe (4) Akihisa Tamura (1) Kazuhisa Makino (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 NIPS 2023

Random Assignment of Indivisible Goods under Constraints IJCAI 2023

Fair Division with Two-Sided Preferences IJCAI 2023

Online Task Assignment Problems with Reusable Resources AAAI 2022

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions AAAI 2021

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits AISTATS 2021

Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020

On the Max-Min Fair Stochastic Allocation of Indivisible Goods AAAI 2020

Randomized Strategies for Robust Combinatorial Optimization AAAI 2019

Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NIPS 2019

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NIPS 2018

Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018

Causal Bandits with Propagating Inference ICML 2018

An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization IJCAI 2017

Online Optimization of Video-Ad Allocation IJCAI 2017

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NIPS 2017