282 citations
- The University of OsakaJP23 papers
- The University of TokyoJP23 papers
- Kyoto UniversityJP21 papers
- Tohoku UniversityJP17 papers
- Tokyo Institute of TechnologyJP17 papers
- Hiroshima UniversityJP14 papers
- National Institute of Advanced Industrial Science and TechnologyJP14 papers
- Nagoya UniversityJP12 papers
- Kyushu UniversityJP11 papers
- University of Electro-CommunicationsJP11 papers
- National Astronomical Observatory of JapanJP9 papers
- Centre National de la Recherche ScientifiqueFR8 papers
8 papers · 1 filter
Guaranteed satisficing and finite regret: Analysis of a cognitive satisficing value function
Akihiro Tamatsukuri, Tatsuji Takahashi
As reinforcement learning algorithms are being applied to increasingly complicated and realistic tasks, it is becoming increasingly difficult to solve such problems within a practi…
Geometric polarized log Hodge structures with a base of log rank one
Taro Fujisawa, Chikara Nakayama
We prove that a projective vertical exact log smooth morphism of fs log analytic spaces with a base of log rank one yields polarized log Hodge structures in the canonical way.
Improved approximation algorithms for path vertex covers in regular graphs
An Zhang, Yong Chen, Zhi-Zhong Chen +1
Given a simple graph and a constant integer , the -path vertex cover problem ({\sc PVC}) asks for a minimum subset of vertices such that…
Bayesian Inference of Self-intention Attributed by Observer
Yosuke Fukuchi, Masahiko Osawa, Hiroshi Yamakawa +2
Most of agents that learn policy for tasks with reinforcement learning (RL) lack the ability to communicate with people, which makes human-agent collaboration challenging. We belie…
Full-body High-resolution Anime Generation with Progressive Structure-conditional Generative Adversarial Networks
Koichi Hamada, Kentaro Tachibana, Tianqi Li +2
We propose Progressive Structure-conditional Generative Adversarial Networks (PSGAN), a new framework that can generate full-body and high-resolution character images based on stru…
Fundamental properties of basic slc-trivial fibrations, II
Osamu Fujino, Taro Fujisawa, Haidong Liu
We prove that if the moduli -b-divisor of a basic slc-trivial fibration is b-numerically trivial then it is -b-linearly trivial. As a consequence, we prove th…