Daisuke Hatano
15 papers · 2013–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 ↓+5 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Silver πΊοΈ Taxonomy Completionist (17) π Conference Polyglot Β· Silver π£ Hot Topic Early Bird π Academic Marathon Β· Half
π€
Dynamic Duo
(13)
π
Conference Pioneer
π₯
Unstoppable Β· Bronze
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(58)
Top co-authors
Research topics
Keywords
regret bound
(9)
online algorithm
(4)
multi-armed bandit
(4)
online learning
(4)
bandit feedback
(2)
sparse linear regression
(2)
stochastic process
(2)
sublinear regret
(2)
contextual bandit
(2)
online optimization
(1)
oracle complexity
(1)
sequential decision making
(1)
causal inference
(1)
characteristic function
(1)
cardinality constraint
(1)
feature selection
(1)
upper confidence bound
(1)
resource allocation
(1)
online linear optimization
(1)
task assignment
(1)
Papers
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
AAAI 2024
Bandit Task Assignment with Unknown Processing Time
NeurIPS 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
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
NeurIPS 2019
Causal Bandits with Propagating Inference
ICML 2018
Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games
IJCAI 2018
Online Regression with Partial Information: Generalization and Linear Projection
AISTATS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint
NeurIPS 2018
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation
NeurIPS 2017
Adaptive Budget Allocation for Maximizing Influence of Advertisements
IJCAI 2016
DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP
IJCAI 2013