Takuya Akiba

According to our database1, Takuya Akiba authored at least 38 papers between 2012 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
MN-Core - A Highly Efficient and Scalable Approach to Deep Learning.
Proceedings of the 2021 Symposium on VLSI Circuits, Kyoto, Japan, June 13-19, 2021, 2021

2020
Online-Codistillation Meets LARS, Going beyond the Limit of Data Parallelism in Deep Learning.
Proceedings of the Fourth IEEE/ACM Workshop on Deep Learning on Supercomputers, 2020

2019
Team PFDet's Methods for Open Images Challenge 2019.
CoRR, 2019

Shakedrop Regularization for Deep Residual Learning.
IEEE Access, 2019

A Graph Theoretic Framework of Recomputation Algorithms for Memory-Efficient Backpropagation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Chainer: A Deep Learning Framework for Accelerating the Research Cycle.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Optuna: A Next-generation Hyperparameter Optimization Framework.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Sampling Techniques for Large-Scale Object Detection From Sparsely Annotated Objects.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
PFDet: 2nd Place Solution to Open Images Challenge 2018 Object Detection Track.
CoRR, 2018

Adversarial Attacks and Defences Competition.
CoRR, 2018

Variance-based Gradient Compression for Efficient Distributed Deep Learning.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
BDD-Constrained A<sup>*</sup> Search: A Fast Method for Solving Constrained Shortest-Path Problems.
IEICE Trans. Inf. Syst., 2017

Extremely Large Minibatch SGD: Training ResNet-50 on ImageNet in 15 Minutes.
CoRR, 2017

ChainerMN: Scalable Distributed Deep Learning Framework.
CoRR, 2017

BDD-Constrained A* Search: A Fast Method for Solving Constrained DAG Shortest-Path Problems.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Random-Radius Ball Method for Estimating Closeness Centrality.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover.
Theor. Comput. Sci., 2016

Dynamic Influence Analysis in Evolving Networks.
Proc. VLDB Endow., 2016

Integer programming approach for directed minimum spanning tree problem on temporal graphs.
Proceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics, 2016

Compact and Scalable Graph Neighborhood Sketching.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

Efficient Algorithms for Spanning Tree Centrality.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Cut Tree Construction from Massive Graphs.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

Hierarchical and Dynamic <i>k</i>-Path Covers.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Fully Dynamic Betweenness Centrality Maintenance on Massive Networks.
Proc. VLDB Endow., 2015

An Exact Algorithm for Diameters of Large Real Directed Graphs.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Computing Personalized PageRank Quickly by Exploiting Graph Structures.
Proc. VLDB Endow., 2014

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling.
Proceedings of the 23rd International World Wide Web Conference, 2014

Pruned labeling algorithms: fast, exact, dynamic, simple and general indexing scheme for shortest-path queries.
Proceedings of the 23rd International World Wide Web Conference, 2014

Network structural analysis via core-tree-decomposition Publication of this article pending inquiry.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Fast exact shortest-path distance queries on large networks by pruned landmark labeling.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Shortest-path queries for complex networks: exploiting low tree-width outside the core.
Proceedings of the 15th International Conference on Extending Database Technology, 2012


  Loading...