| 2025 | ICLR | Agent Skill Acquisition for Large Language Models via CycleQD. | So Kuroki, Taishi Nakamura, Takuya Akiba, Yujin Tang |
| 2025 | ICLR | Drop-Upcycling: Training Sparse Mixture of Experts with Partial Re-initialization. | Taishi Nakamura, Takuya Akiba, Kazuki Fujii, Yusuke Oda, Rio Yokota, Jun Suzuki |
| 2025 | ICLR | TAID: Temporally Adaptive Interpolated Distillation for Efficient Knowledge Transfer in Language Models. | Makoto Shing, Kou Misaki, Han Bao, Sho Yokoi, Takuya Akiba |
| 2020 | SC | Online-Codistillation Meets LARS, Going beyond the Limit of Data Parallelism in Deep Learning. | Shogo Murai, Hiroaki Mikami, Masanori Koyama, Shuji Suzuki, Takuya Akiba |
| 2019 | CVPR | Sampling Techniques for Large-Scale Object Detection From Sparsely Annotated Objects. | Yusuke Niitani, Takuya Akiba, Tommi Kerola, Toru Ogawa, Shotaro Sano, Shuji Suzuki |
| 2019 | KDD | Optuna: A Next-generation Hyperparameter Optimization Framework. | Takuya Akiba, Shotaro Sano, Toshihiko Yanase, Takeru Ohta, Masanori Koyama |
| 2019 | KDD | Chainer: A Deep Learning Framework for Accelerating the Research Cycle. | Seiya Tokui, Ryosuke Okuta, Takuya Akiba, Yusuke Niitani, Toru Ogawa, Shunta Saito, Shuji Suzuki, Kota Uenishi, Brian Vogel, Hiroyuki Yamazaki Vincent |
| 2018 | ICLR | Variance-based Gradient Compression for Efficient Distributed Deep Learning. | Yusuke Tsuzuku, Hiroto Imachi, Takuya Akiba |
| 2017 | AAAI | Random-Radius Ball Method for Estimating Closeness Centrality. | Wataru Inariba, Takuya Akiba, Yuichi Yoshida |
| 2017 | AAAI | BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems. | Fumito Takeuchi, Masaaki Nishino, Norihito Yasuda, Takuya Akiba, Shin-ichi Minato, Masaaki Nagata |
| 2016 | CIKM | Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. | Takanori Hayashi, Takuya Akiba, Ken-ichi Kawarabayashi |
| 2016 | CIKM | Hierarchical and Dynamic | Takuya Akiba, Yosuke Yano, Naoto Mizuno |
| 2016 | ICDM | Cut Tree Construction from Massive Graphs. | Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano |
| 2016 | ICDM | Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm. | Takuya Akiba, Kenko Nakamura, Taro Takaguchi |
| 2016 | IJCAI | Efficient Algorithms for Spanning Tree Centrality. | Takanori Hayashi, Takuya Akiba, Yuichi Yoshida |
| 2016 | KDD | Compact and Scalable Graph Neighborhood Sketching. | Takuya Akiba, Yosuke Yano |
| 2016 | SIGMOD | Integer programming approach for directed minimum spanning tree problem on temporal graphs. | Takuto Ikuta, Takuya Akiba |
| 2015 | AAAI | Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. | Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida |
| 2015 | ALENEX | Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. | Takuya Akiba, Yoichi Iwata |
| 2014 | AAAI | Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. | Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi |
| 2014 | ALENEX | Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. | Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata |
| 2014 | KDD | Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. | Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi |
| 2014 | WWW | Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries. | Takuya Akiba |
| 2014 | WWW | Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. | Takuya Akiba, Yoichi Iwata, Yuichi Yoshida |
| 2013 | CIKM | Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. | Takuya Akiba, Yoichi Iwata, Yuichi Yoshida |
| 2013 | CIKM | Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. | Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida |
| 2013 | SIGMOD | Fast exact shortest-path distance queries on large networks by pruned landmark labeling. | Takuya Akiba, Yoichi Iwata, Yuichi Yoshida |
| 2012 | EDBT | Shortest-path queries for complex networks: exploiting low tree-width outside the core. | Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi |