default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakuya Akiba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Takuya Akiba, Makoto Shing, Yujin Tang, Qi Sun, David Ha:
Evolutionary Optimization of Model Merging Recipes. CoRR abs/2403.13187 (2024)- 2021
- [c28]Ken Namura, Johannes Maximilian Kühn, Tohru Adachi, H. Imachi, H. Kaneko, T. Kato, Go Watanabe, Naoto Tanaka, S. Kashihara, Hiroshi Miyashita, Y. Tomonaga, Ryosuke Okuta, Takuya Akiba, Brian Vogel, S. Kitajo, F. Osawa, K. Takahashi, Y. Takatsukasa, K. Mizumaru, T. Yamauchi, J. Ono, A. Takahashi, Tanvir Ahmed, Y. Doi, K. Hiraki, J. Makino:
MN-Core - A Highly Efficient and Scalable Approach to Deep Learning. VLSI Circuits 2021: 1-2 - 2020
- [c27]Shogo Murai, Hiroaki Mikami, Masanori Koyama, Shuji Suzuki, Takuya Akiba:
Online-Codistillation Meets LARS, Going beyond the Limit of Data Parallelism in Deep Learning. DLS@SC 2020: 1-9
2010 – 2019
- 2019
- [j6]Yoshihiro Yamada
, Masakazu Iwamura, Takuya Akiba, Koichi Kise:
Shakedrop Regularization for Deep Residual Learning. IEEE Access 7: 186126-186136 (2019) - [c26]Yusuke Niitani, Takuya Akiba, Tommi Kerola, Toru Ogawa, Shotaro Sano, Shuji Suzuki:
Sampling Techniques for Large-Scale Object Detection From Sparsely Annotated Objects. CVPR 2019: 6510-6518 - [c25]Seiya Tokui, Ryosuke Okuta, Takuya Akiba, Yusuke Niitani, Toru Ogawa, Shunta Saito, Shuji Suzuki, Kota Uenishi, Brian Vogel, Hiroyuki Yamazaki Vincent:
Chainer: A Deep Learning Framework for Accelerating the Research Cycle. KDD 2019: 2002-2011 - [c24]Takuya Akiba, Shotaro Sano, Toshihiko Yanase, Takeru Ohta, Masanori Koyama:
Optuna: A Next-generation Hyperparameter Optimization Framework. KDD 2019: 2623-2631 - [c23]Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama:
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. NeurIPS 2019: 1161-1170 - [i14]Mitsuru Kusumoto, Takuya Inoue, Gentaro Watanabe, Takuya Akiba, Masanori Koyama:
A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation. CoRR abs/1905.11722 (2019) - [i13]Takuya Akiba, Shotaro Sano, Toshihiko Yanase, Takeru Ohta, Masanori Koyama:
Optuna: A Next-generation Hyperparameter Optimization Framework. CoRR abs/1907.10902 (2019) - [i12]Seiya Tokui, Ryosuke Okuta, Takuya Akiba, Yusuke Niitani, Toru Ogawa, Shunta Saito, Shuji Suzuki, Kota Uenishi, Brian Vogel, Hiroyuki Yamazaki Vincent:
Chainer: A Deep Learning Framework for Accelerating the Research Cycle. CoRR abs/1908.00213 (2019) - [i11]Yusuke Niitani, Toru Ogawa, Shuji Suzuki, Takuya Akiba, Tommi Kerola, Kohei Ozaki, Shotaro Sano:
Team PFDet's Methods for Open Images Challenge 2019. CoRR abs/1910.11534 (2019) - 2018
- [c22]Yusuke Tsuzuku, Hiroto Imachi, Takuya Akiba:
Variance-based Gradient Compression for Efficient Distributed Deep Learning. ICLR (Workshop) 2018 - [i10]Yusuke Tsuzuku, Hiroto Imachi, Takuya Akiba:
Variance-based Gradient Compression for Efficient Distributed Deep Learning. CoRR abs/1802.06058 (2018) - [i9]Alexey Kurakin, Ian J. Goodfellow, Samy Bengio, Yinpeng Dong, Fangzhou Liao, Ming Liang, Tianyu Pang, Jun Zhu, Xiaolin Hu, Cihang Xie, Jianyu Wang, Zhishuai Zhang, Zhou Ren, Alan L. Yuille, Sangxia Huang, Yao Zhao, Yuzhe Zhao, Zhonglin Han, Junjiajia Long, Yerkebulan Berdibekov, Takuya Akiba, Seiya Tokui, Motoki Abe:
Adversarial Attacks and Defences Competition. CoRR abs/1804.00097 (2018) - [i8]Takuya Akiba, Tommi Kerola, Yusuke Niitani, Toru Ogawa, Shotaro Sano, Shuji Suzuki:
PFDet: 2nd Place Solution to Open Images Challenge 2018 Object Detection Track. CoRR abs/1809.00778 (2018) - [i7]Yusuke Niitani, Takuya Akiba, Tommi Kerola, Toru Ogawa, Shotaro Sano, Shuji Suzuki:
Sampling Techniques for Large-Scale Object Detection from Sparsely Annotated Objects. CoRR abs/1811.10862 (2018) - 2017
- [j5]Fumito Takeuchi, Masaaki Nishino, Norihito Yasuda, Takuya Akiba, Shin-ichi Minato, Masaaki Nagata:
BDD-Constrained A* Search: A Fast Method for Solving Constrained Shortest-Path Problems. IEICE Trans. Inf. Syst. 100-D(12): 2945-2952 (2017) - [c21]Wataru Inariba, Takuya Akiba, Yuichi Yoshida:
Random-Radius Ball Method for Estimating Closeness Centrality. AAAI 2017: 125-131 - [c20]Fumito Takeuchi, Masaaki Nishino, Norihito Yasuda, Takuya Akiba, Shin-ichi Minato, Masaaki Nagata:
BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems. AAAI Workshops 2017 - [i6]Takuya Akiba, Keisuke Fukuda, Shuji Suzuki:
ChainerMN: Scalable Distributed Deep Learning Framework. CoRR abs/1710.11351 (2017) - [i5]Takuya Akiba, Shuji Suzuki, Keisuke Fukuda:
Extremely Large Minibatch SGD: Training ResNet-50 on ImageNet in 15 Minutes. CoRR abs/1711.04325 (2017) - 2016
- [j4]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Dynamic Influence Analysis in Evolving Networks. Proc. VLDB Endow. 9(12): 1077-1088 (2016) - [j3]Takuya Akiba, Yoichi Iwata:
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. Theor. Comput. Sci. 609: 211-225 (2016) - [c19]Takanori Hayashi, Takuya Akiba, Ken-ichi Kawarabayashi:
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. CIKM 2016: 1533-1542 - [c18]Takuya Akiba, Yosuke Yano, Naoto Mizuno:
Hierarchical and Dynamic k-Path Covers. CIKM 2016: 1543-1552 - [c17]Takuya Akiba, Kenko Nakamura, Taro Takaguchi:
Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm. ICDM 2016: 769-774 - [c16]Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano:
Cut Tree Construction from Massive Graphs. ICDM 2016: 775-780 - [c15]Takanori Hayashi, Takuya Akiba, Yuichi Yoshida:
Efficient Algorithms for Spanning Tree Centrality. IJCAI 2016: 3733-3739 - [c14]Takuya Akiba, Yosuke Yano:
Compact and Scalable Graph Neighborhood Sketching. KDD 2016: 685-694 - [c13]Takuto Ikuta, Takuya Akiba:
Integer programming approach for directed minimum spanning tree problem on temporal graphs. NDA@SIGMOD 2016: 4:1-4:8 - [i4]Takuya Akiba, Kenko Nakamura, Taro Takaguchi:
Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm. CoRR abs/1609.07994 (2016) - [i3]Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano:
Cut Tree Construction from Massive Graphs. CoRR abs/1609.08723 (2016) - 2015
- [j2]Takanori Hayashi, Takuya Akiba, Yuichi Yoshida:
Fully Dynamic Betweenness Centrality Maintenance on Massive Networks. Proc. VLDB Endow. 9(2): 48-59 (2015) - [c12]Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida:
Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. AAAI 2015: 2-8 - [c11]Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. ALENEX 2015: 70-81 - [c10]Takuya Akiba, Yoichi Iwata, Yuki Kawata:
An Exact Algorithm for Diameters of Large Real Directed Graphs. SEA 2015: 56-67 - 2014
- [j1]Takanori Maehara, Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi:
Computing Personalized PageRank Quickly by Exploiting Graph Structures. Proc. VLDB Endow. 7(12): 1023-1034 (2014) - [c9]Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, Ken-ichi Kawarabayashi:
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. AAAI 2014: 138-144 - [c8]Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, Yuki Kawata:
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. ALENEX 2014: 147-154 - [c7]Takuya Akiba, Takanori Maehara, Ken-ichi Kawarabayashi:
Network structural analysis via core-tree-decomposition Publication of this article pending inquiry. KDD 2014: 1476-1485 - [c6]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. WWW 2014: 237-248 - [c5]Takuya Akiba:
Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries. WWW (Companion Volume) 2014: 1339-1340 - [i2]Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. CoRR abs/1411.2680 (2014) - 2013
- [c4]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. CIKM 2013: 909-918 - [c3]Yosuke Yano, Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. CIKM 2013: 1601-1606 - [c2]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast exact shortest-path distance queries on large networks by pruned landmark labeling. SIGMOD Conference 2013: 349-360 - [i1]Takuya Akiba, Yoichi Iwata, Yuichi Yoshida:
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. CoRR abs/1304.4661 (2013) - 2012
- [c1]Takuya Akiba, Christian Sommer, Ken-ichi Kawarabayashi:
Shortest-path queries for complex networks: exploiting low tree-width outside the core. EDBT 2012: 144-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-26 17:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
