Taiji Suzuki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hiroshi Abe

> Home > Persons > Taiji Suzuki

Publications

2020
[c44]
- view
  - electronic edition @ openreview.net (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/iclr/SuzukiAN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclr/SuzukiAN20
Taiji Suzuki, Hiroshi Abe, Tomoaki Nishimura:
Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural network. ICLR 2020
[c43]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/ijcai/SuzukiAMHIWHYN20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/SuzukiAMHIWHYN20
Taiji Suzuki, Hiroshi Abe, Tomoya Murata, Shingo Horiuchi, Kotaro Ito, Tokuma Wachi, So Hirai, Masatoshi Yukishima, Tomoaki Nishimura:
Spectral Pruning: Compressing Deep Neural Networks via Spectral Analysis and its Generalization Error. IJCAI 2020: 2839-2846
2018
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1808-08558
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1808-08558
Taiji Suzuki, Hiroshi Abe, Tomoya Murata, Shingo Horiuchi, Kotaro Ito, Tokuma Wachi, So Hirai, Masatoshi Yukishima, Tomoaki Nishimura:
Spectral-Pruning: Compressing deep neural network via spectral analysis. CoRR abs/1808.08558 (2018)

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.