Ken-Ichi Kawarabayashi

31 papers · 2013–2026 · 10 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (10) 🏃 Academic Marathon (11) 🐝 Cross-Pollinator (9) 🌈 Renaissance Researcher (7) 🗺️ Taxonomy Completionist (30) 🤝 Dynamic Duo (14) 🔬 Deep Specialist (10) 🏆 Grand Slam 🗃️ Keyword Collector (93) 🔥 Unstoppable (12) 💎 Century Club (30) 🚀 Conference Pioneer ❓ The Questioner (2) ⚡ Prolific Year (5)

Conferences

IJCAI (6) NIPS (6) AAAI (5) ICML (4) ACL (2) AISTATS (2) ICLR (2) IJCNLP (2) AACL (1) EACL (1)

Top co-authors

Naonori Kakimura (14) Takuro Fukunaga (14) Hanna Sumita (13) Daisuke Hatano (13) Shinji Ito (12) Danushka Bollegala (8) Kei Takemura (7) Akihiro Yabe (5) Stefanie Jegelka (4) Takanori Maehara (4)

Keywords

regret bound (9) multi-armed bandit (4) online algorithm (4) online learning (4) approximation algorithm (3) combinatorial optimization (2) sublinear regret (2) budget allocation (2) stochastic optimization (2) contextual bandit (2) submodular maximization (2) representation learning (2) sparse linear regression (2) stochastic process (2) traveling salesman problem (2) bandit feedback (2) locally linear embedding (1) random walk (1) nash equilibrium (1) cross-lingual alignment (1)

Papers

A TSP-Based Algorithm for Multi-League Traveling Tournament AAAI 2026

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem AAAI 2024

A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings IJCNLP 2023

A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings AACL 2023

Bandit Task Assignment with Unknown Processing Time NIPS 2023

Online Task Assignment Problems with Reusable Resources AAAI 2022

RelWalk - A Latent Variable Model Approach to Knowledge Graph Embedding EACL 2021

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

How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks ICLR 2021

What Can Neural Networks Reason About? ICLR 2020

Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020

Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019

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

Are Girls Neko or Shōjo? Cross-Lingual Alignment of Non-Isomorphic Embeddings with Iterative Normalization ACL 2019

Stochastic Submodular Maximization with Performance-Dependent Item Costs AAAI 2019

Causal Bandits with Propagating Inference ICML 2018

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

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

Think Globally, Embed Locally --- Locally Linear Meta-embedding of Words IJCAI 2018

Representation Learning on Graphs with Jumping Knowledge Networks ICML 2018

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

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

Identifying Key Observers to Find Popular Information in Advance IJCAI 2016

Adaptive Budget Allocation for Maximizing Influence of Advertisements IJCAI 2016

Embedding Semantic Relations into Word Representations IJCAI 2015

Unsupervised Cross-Domain Word Representation Learning IJCNLP 2015

Unsupervised Cross-Domain Word Representation Learning ACL 2015

Budget Allocation Problem with Multiple Advertisers: A Game Theoretic View ICML 2015

Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm ICML 2014

Mining for Analogous Tuples from an Entity-Relation Graph IJCAI 2013