Daisuke Hatano

According to our database1, Daisuke Hatano authored at least 21 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Bandit Task Assignment with Unknown Processing Time.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Online Task Assignment Problems with Reusable Resources.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Delay and Cooperation in Nonstochastic Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising.
Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019

Improved Regret Bounds for Bandit Combinatorial Optimization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Computational Aspects of the Preference Cores of Supermodular Two-Scenario Cooperative Games.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Causal Bandits with Propagating Inference.
Proceedings of the 35th International Conference on Machine Learning, 2018

Online Regression with Partial Information: Generalization and Linear Projection.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Computing Least Cores of Supermodular Cooperative Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Scalable Algorithm for Higher-Order Co-Clustering via Random Sampling.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Adaptive Budget Allocation for Maximizing Influence of Advertisements.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Distributed Multiplicative Weights Methods for DCOP.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Lagrangian Decomposition Algorithm for Allocating Marketing Channels.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2013
DeQED: An Efficient Divide-and-Coordinate Algorithm for DCOP.
Proceedings of the IJCAI 2013, 2013

2011
Dynamic SAT with Decision Change Costs: Formalization and Solutions.
Proceedings of the IJCAI 2011, 2011


  Loading...