14 citations · 20 across the 7 of their papers we have counts for
7 papers
When Does Metadata Conditioning (NOT) Work for Language Model Pre-Training? A Study with Context-Free Grammars
Rei Higuchi, Ryotaro Kawata, Naoki Nishikawa +7
The ability to acquire latent semantics is one of the key properties that determines the performance of language models. One convenient approach to invoke this ability is to prepen…
Collision-free Path Planning in the Latent Space through cGANs
Tomoki Ando, Hiroki Mori, Ryota Torishima +4
We show a new method for collision-free path planning by cGANs by mapping its latent space to only the collision-free areas of the robot joint space. Our method simply provides thi…
Learning-based Collision-free Planning on Arbitrary Optimization Criteria in the Latent Space through cGANs
Tomoki Ando, Hiroto Iino, Hiroki Mori +5
We propose a new method for collision-free planning using Conditional Generative Adversarial Networks (cGANs) to transform between the robot's joint space and a latent space that c…
Neural Multi-scale Image Compression
Ken Nakanishi, Shin-ichi Maeda, Takeru Miyato +1
This study presents a new lossy image compression method that utilizes the multi-scale features of natural images. Our model consists of two networks: multi-scale lossy autoencoder…
A Deep-Learning Approach for Operation of an Automated Realtime Flare Forecast
Yuko Hada-Muranushi, Takayuki Muranushi, Ayumi Asai +5
Automated forecasts serve important role in space weather science, by providing statistical insights to flare-trigger mechanisms, and by enabling tailor-made forecasts and high-fre…
LGM: Mining Frequent Subgraphs from Linear Graphs
Yasuo Tabei, Daisuke Okanohara, Shuichi Hirose +1
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Exampl…
Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara, Kunihiko Sadakane
Rank/Select dictionaries are data structures for an ordered set to compute $\rank(x,S)$ (the number of elements in which are no greater than ), a…