Naonori Kakimura
16 papers · 2014–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 ↓+6 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (17) π Academic Marathon Β· Half π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(10)
π€
Dynamic Duo
(14)
π§¬
Topic Evolution
π
Century Club Β· Bronze
ποΈ
Keyword Collector
(64)
π₯
Unstoppable Β· Bronze
Top co-authors
Research topics
Keywords
regret bound
(9)
multi-armed bandit
(4)
online learning
(4)
online algorithm
(4)
budget allocation
(2)
sparse linear regression
(2)
bandit feedback
(2)
influence maximization
(2)
contextual bandit
(2)
approximation algorithm
(2)
polynomial time
(2)
greedy algorithm
(2)
stochastic process
(2)
sublinear regret
(2)
oracle complexity
(1)
graph matching
(1)
cardinality constraint
(1)
resource allocation
(1)
feature selection
(1)
stochastic optimization
(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
Reforming an Envy-Free Matching
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
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
Threshold Influence Model for Allocating Advertising Budgets
ICML 2015
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
ICML 2014