Ken-ichi Kawarabayashi

research

∙ 09/19/2023

A Neighbourhood-Aware Differential Privacy Mechanism for Static Word Embeddings

We propose a Neighbourhood-Aware Differential Privacy (NADP) mechanism c...

0 Danushka Bollegala, et al. ∙

research

∙ 05/16/2023

Decomposition of (infinite) digraphs along directed 1-separations

We introduce torsoids, a canonical structure in matching covered graphs,...

0 Nathan Bowler, et al. ∙

research

∙ 09/29/2022

Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis

Accurate estimation of Intrinsic Dimensionality (ID) is of crucial impor...

6 Laurent Amsaleg, et al. ∙

research

∙ 03/15/2022

Online Task Assignment Problems with Reusable Resources

We study online task assignment problem with reusable resources, motivat...

0 Hanna Sumita, et al. ∙

research

∙ 11/15/2021

Embeddings of Planar Quasimetrics into Directed ℓ_1and Polylogarithmic Approximation for Directed Sparsest-Cut

The multi-commodity flow-cut gap is a fundamental parameter that affects...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 01/25/2021

RelWalk A Latent Variable Model Approach to Knowledge Graph Embedding

Embedding entities and relations of a knowledge graph in a low-dimension...

13 Danushka Bollegala, et al. ∙

research

∙ 01/20/2021

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

The contextual combinatorial semi-bandit problem with linear payoff func...

4 Kei Takemura, et al. ∙

research

∙ 10/23/2020

Quickly excluding a non-planar graph

A cornerstone theorem in the Graph Minors series of Robertson and Seymou...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 09/28/2020

The canonical directed tree decomposition and its applications to the directed disjoint paths problem

The canonical tree-decomposition theorem, given by Robertson and Seymour...

0 Archontia C. Giannopoulou, et al. ∙

research

∙ 09/24/2020

How Neural Networks Extrapolate: From Feedforward to Graph Neural Networks

We study how neural networks trained by gradient descent extrapolate, i....

68 Keyulu Xu, et al. ∙

research

∙ 08/04/2020

Automorphism groups of maps in linear time

By a map we mean a 2-cell decomposition of a closed compact surface, i.e...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 09/12/2019

Anonymising Queries by Semantic Decomposition

Protecting the privacy of search engine users is an important requiremen...

0 Danushka Bollegala, et al. ∙

research

∙ 06/27/2019

Improved Distributed Approximation to Maximum Independent Set

We present improved results for approximating Maximum Independent Set ()...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 06/14/2019

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising

Computational advertising has been studied to design efficient marketing...

0 Daisuke Hatano, et al. ∙

research

∙ 06/04/2019

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

Cross-lingual word embeddings (CLWE) underlie many multilingual natural ...

0 Mozhi Zhang, et al. ∙

research

∙ 05/30/2019

What Can Neural Networks Reason About?

Neural networks have successfully been applied to solving reasoning task...

0 Keyulu Xu, et al. ∙

research

∙ 02/25/2019

Optimal Distributed Covering Algorithms

We present a time-optimal deterministic distributed algorithm for approx...

0 Ran Ben Basat, et al. ∙

research

∙ 12/18/2018

Model-Checking on Ordered Structures

We study the model-checking problem for first- and monadic second-order ...

0 Kord Eickmeyer, et al. ∙

research

∙ 08/17/2018

Optimal Distributed Weighted Set Cover Approximation

We present a time-optimal deterministic distributed algorithm for approx...

0 Ran Ben Basat, et al. ∙

research

∙ 07/31/2018

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class

The crossing number of a graph is the minimum number of crossings in a d...

0 Vida Dujmovic, et al. ∙

research

∙ 07/13/2018

Parameterized Distributed Algorithms

In this work, we initiate a thorough study of parameterized graph optimi...

0 Ran Ben Basat, et al. ∙

research

∙ 06/09/2018

Representation Learning on Graphs with Jumping Knowledge Networks

Recent deep learning approaches for representation learning on graphs fo...

0 Keyulu Xu, et al. ∙

research

∙ 06/06/2018

Causal Bandits with Propagating Inference

Bandit is a framework for designing sequential experiments. In each expe...

0 Akihiro Yabe, et al. ∙

research

∙ 04/14/2018

ClassiNet -- Predicting Missing Features for Short-Text Classification

The fundamental problem in short-text classification is feature sparsene...

0 Danushka Bollegala, et al. ∙

research

∙ 04/04/2018

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O( n/ ^2) Rounds

We present a deterministic distributed 2-approximation algorithm for the...

0 Ran Ben Basat, et al. ∙

research

∙ 11/28/2017

Adapting Local Sequential Algorithms to the Distributed Setting

It is a well known fact that sequential algorithms which exhibit a stron...

0 Ken-ichi Kawarabayashi, et al. ∙

research

∙ 09/19/2017

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

Distributed word embeddings have shown superior performances in numerous...

0 Danushka Bollegala, et al. ∙

research

∙ 09/05/2017

Using k-way Co-occurrences for Learning Word Embeddings

Co-occurrences between two words provide useful insights into the semant...

0 Danushka Bollegala, et al. ∙

research

∙ 11/19/2015

Joint Word Representation Learning using a Corpus and a Semantic Lexicon

Methods for learning word representations using large text corpora have ...

0 Danushka Bollegala, et al. ∙

research

∙ 05/01/2015

Embedding Semantic Relations into Word Representations

Learning representations for semantic relations is important for various...

0 Danushka Bollegala, et al. ∙

research

∙ 12/07/2014

Learning Word Representations from Relational Graphs

Attributes of words and relations between two words are central to numer...

0 Danushka Bollegala, et al. ∙

research

∙ 01/23/2014

Generating Approximate Solutions to the TTP using a Linear Distance Relaxation

In some domestic professional sports leagues, the home stadiums are loca...

0 Richard Hoshino, et al. ∙

research

∙ 01/16/2014

Scheduling Bipartite Tournaments to Minimize Total Travel Distance

In many professional sports leagues, teams from opposing leagues/confere...

0 Richard Hoshino, et al. ∙

Ken-ichi Kawarabayashi

Featured Co-authors