Pierre Vandergheynst

◀ ▶ joint publications with Konstantinos Pitas

> Home > Persons > Pierre Vandergheynst

Publications

2019
[i64]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-08793
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-08793
Konstantinos Pitas, Mike E. Davies, Pierre Vandergheynst:
Revisiting hard thresholding for DNN pruning. CoRR abs/1905.08793 (2019)
[i63]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-09677
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-09677
Konstantinos Pitas, Andreas Loukas, Mike Davies, Pierre Vandergheynst:
Some limitations of norm based generalization bounds in deep neural networks. CoRR abs/1905.09677 (2019)
2018
[i62]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1801-00171
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1801-00171
Konstantinos Pitas, Mike E. Davies, Pierre Vandergheynst:
PAC-Bayesian Margin Bounds for Convolutional Neural Networks - Technical Report. CoRR abs/1801.00171 (2018)
[i59]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1803-04239
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1803-04239
Konstantinos Pitas, Mike E. Davies, Pierre Vandergheynst:
FeTa: A DCA Pruning Algorithm with Generalization Error Guarantees. CoRR abs/1803.04239 (2018)

a service of

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.