default search action
Nathanaël Perraudin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Andreas Bergmeister, Karolis Martinkus, Nathanaël Perraudin, Roger Wattenhofer:
Efficient and Scalable Graph Generation through Iterative Local Expansion. ICLR 2024 - [i34]Nathanaël Perraudin, Adrien Teutrie, Cécile Hébert, Guillaume Obozinski:
Efficient algorithms for regularized Poisson Non-negative Matrix Factorization. CoRR abs/2404.16505 (2024) - 2023
- [i33]Stefania Russo, Nathanaël Perraudin, Steven Stalder, Fernando Pérez-Cruz, João Paulo Leitão, Guillaume Obozinski, Jan Dirk Wegner:
An evaluation of deep learning models for predicting water depth evolution in urban floods. CoRR abs/2302.10062 (2023) - [i32]Andreas Bergmeister, Karolis Martinkus, Nathanaël Perraudin, Roger Wattenhofer:
Efficient and Scalable Graph Generation through Iterative Local Expansion. CoRR abs/2312.11529 (2023) - 2022
- [c12]Karolis Martinkus, Andreas Loukas, Nathanaël Perraudin, Roger Wattenhofer:
SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators. ICML 2022: 15159-15179 - [c11]Steven Stalder, Nathanaël Perraudin, Radhakrishna Achanta, Fernando Pérez-Cruz, Michele Volpi:
What You See is What You Classify: Black Box Attributions. NeurIPS 2022 - [i31]Karolis Martinkus, Andreas Loukas, Nathanaël Perraudin, Roger Wattenhofer:
SPECTRE : Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators. CoRR abs/2204.01613 (2022) - [i30]Steven Stalder, Nathanaël Perraudin, Radhakrishna Achanta, Fernando Pérez-Cruz, Michele Volpi:
What You See is What You Classify: Black Box Attributions. CoRR abs/2205.11266 (2022) - [i29]Kilian Konstantin Haefeli, Karolis Martinkus, Nathanaël Perraudin, Roger Wattenhofer:
Diffusion Models for Graphs Benefit From Discrete State Spaces. CoRR abs/2210.01549 (2022) - 2021
- [j12]Nathanaël Perraudin, Sandro Marcon, Aurélien Lucchi, Tomasz Kacprzak:
Emulation of Cosmological Mass Maps with Conditional Generative Adversarial Networks. Frontiers Artif. Intell. 4: 673062 (2021) - [j11]Andrés Marafioti, Piotr Majdak, Nicki Holighaus, Nathanaël Perraudin:
GACELA: A Generative Adversarial Context Encoder for Long Audio Inpainting of Music. IEEE J. Sel. Top. Signal Process. 15(1): 120-131 (2021) - [c10]Karolis Martinkus, Aurélien Lucchi, Nathanaël Perraudin:
Scalable Graph Networks for Particle Simulations. AAAI 2021: 8912-8920 - [i28]Romana Rust, Achilleas Xydis, Kurt Heutschi, Nathanaël Perraudin, Gonzalo Casas, Chaoyu Du, Jürgen Strauss, Kurt Eggenschwiler, Fernando Pérez-Cruz, Fabio Gramazio, Matthias Kohler:
A data acquisition setup for data driven acoustic design. CoRR abs/2109.12014 (2021) - 2020
- [c9]Michaël Defferrard, Martino Milani, Frédérick Gusset, Nathanaël Perraudin:
DeepSphere: a graph-based spherical CNN. ICLR 2020 - [i27]Nathanaël Perraudin, Sandro Marcon, Aurélien Lucchi, Tomasz Kacprzak:
Emulation of cosmological mass maps with conditional generative adversarial networks. CoRR abs/2004.08139 (2020) - [i26]Andrés Marafioti, Piotr Majdak, Nicki Holighaus, Nathanaël Perraudin:
GACELA - A generative adversarial context encoder for long audio inpainting. CoRR abs/2005.05032 (2020) - [i25]Karolis Martinkus, Aurélien Lucchi, Nathanaël Perraudin:
Scalable Graph Networks for Particle Simulations. CoRR abs/2010.06948 (2020) - [i24]Michaël Defferrard, Martino Milani, Frédérick Gusset, Nathanaël Perraudin:
DeepSphere: a graph-based spherical CNN. CoRR abs/2012.15000 (2020)
2010 – 2019
- 2019
- [j10]Nathanaël Perraudin, Michaël Defferrard, Tomasz Kacprzak, Raphaël Sgier:
DeepSphere: Efficient spherical convolutional neural network with HEALPix sampling for cosmological applications. Astron. Comput. 27: 130-146 (2019) - [j9]Andreas Loukas, Nathanaël Perraudin:
Stationary time-vertex signal processing. EURASIP J. Adv. Signal Process. 2019: 36 (2019) - [j8]Andrés Marafioti, Nathanaël Perraudin, Nicki Holighaus, Piotr Majdak:
A Context Encoder For Audio Inpainting. IEEE ACM Trans. Audio Speech Lang. Process. 27(12): 2362-2372 (2019) - [j7]Elvin Isufi, Andreas Loukas, Nathanaël Perraudin, Geert Leus:
Forecasting Time Series With VARMA Recursions on Graphs. IEEE Trans. Signal Process. 67(18): 4870-4885 (2019) - [c8]Vassilis Kalofolias, Nathanaël Perraudin:
Large Scale Graph Learning From Smooth Signals. ICLR (Poster) 2019 - [c7]Andrés Marafioti, Nathanaël Perraudin, Nicki Holighaus, Piotr Majdak:
Adversarial Generation of Time-Frequency Features with application in audio synthesis. ICML 2019: 4352-4362 - [c6]Paulina Grnarova, Kfir Y. Levy, Aurélien Lucchi, Nathanaël Perraudin, Ian Goodfellow, Thomas Hofmann, Andreas Krause:
A Domain Agnostic Measure for Monitoring and Evaluating GANs. NeurIPS 2019: 12069-12079 - [i23]Andrés Marafioti, Nicki Holighaus, Nathanaël Perraudin, Piotr Majdak:
Adversarial Generation of Time-Frequency Features with application in audio synthesis. CoRR abs/1902.04072 (2019) - [i22]Michaël Defferrard, Nathanaël Perraudin, Tomasz Kacprzak, Raphaël Sgier:
DeepSphere: towards an equivariant graph-based spherical CNN. CoRR abs/1904.05146 (2019) - [i21]Younjoo Seo, Andreas Loukas, Nathanaël Perraudin:
Discriminative structural graph classification. CoRR abs/1905.13422 (2019) - [i20]Nathanaël Perraudin, Ankit Srivastava, Aurélien Lucchi, Tomasz Kacprzak, Thomas Hofmann, Alexandre Réfrégier:
Cosmological N-body simulations: a challenge for scalable generative models. CoRR abs/1908.05519 (2019) - 2018
- [j6]Nathanaël Perraudin, Nicki Holighaus, Peter L. Søndergaard, Péter Balázs:
Designing Gabor windows using convex optimization. Appl. Math. Comput. 330: 266-287 (2018) - [j5]Nathanaël Perraudin, Nicki Holighaus, Piotr Majdak, Péter Balázs:
Inpainting of Long Audio Segments With Similarity Graphs. IEEE ACM Trans. Audio Speech Lang. Process. 26(6): 1079-1090 (2018) - [j4]Francesco Grassi, Andreas Loukas, Nathanaël Perraudin, Benjamin Ricaud:
A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs. IEEE Trans. Signal Process. 66(3): 817-829 (2018) - [i19]Joachim Muth, Stefan Uhlich, Nathanaël Perraudin, Thomas Kemp, Fabien Cardinaux, Yuki Mitsufuji:
Improving DNN-based Music Source Separation using Phase Features. CoRR abs/1807.02710 (2018) - [i18]Elvin Isufi, Andreas Loukas, Nathanaël Perraudin, Geert Leus:
Forecasting Time Series with VARMA Recursions on Graphs. CoRR abs/1810.08581 (2018) - [i17]Andrés Marafioti, Nathanaël Perraudin, Nicki Holighaus, Piotr Majdak:
A context encoder for audio inpainting. CoRR abs/1810.12138 (2018) - [i16]Nathanaël Perraudin, Michaël Defferrard, Tomasz Kacprzak, Raphaël Sgier:
DeepSphere: Efficient spherical Convolutional Neural Network with HEALPix sampling for cosmological applications. CoRR abs/1810.12186 (2018) - [i15]Paulina Grnarova, Kfir Y. Levy, Aurélien Lucchi, Nathanaël Perraudin, Thomas Hofmann, Andreas Krause:
Evaluating GANs via Duality. CoRR abs/1811.05512 (2018) - 2017
- [j3]Nauman Shahid, Nathanaël Perraudin, Gilles Puy, Pierre Vandergheynst:
Compressive PCA for Low-Rank Matrices on Graphs. IEEE Trans. Signal Inf. Process. over Networks 3(4): 695-710 (2017) - [j2]Nathanaël Perraudin, Pierre Vandergheynst:
Stationary Signal Processing on Graphs. IEEE Trans. Signal Process. 65(13): 3462-3477 (2017) - [c5]Andreas Loukas, Elvin Isufi, Nathanaël Perraudin:
Predicting the evolution of stationary graph signals. ACSSC 2017: 60-64 - [c4]Nathanaël Perraudin, Andreas Loukas, Francesco Grassi, Pierre Vandergheynst:
Towards stationary time-vertex signal processing. ICASSP 2017: 3914-3918 - [i14]Johan Paratte, Nathanaël Perraudin, Pierre Vandergheynst:
Compressive Embedding and Visualization using Graphs. CoRR abs/1702.05815 (2017) - [i13]Francesco Grassi, Andreas Loukas, Nathanaël Perraudin, Benjamin Ricaud:
A Time-Vertex Signal Processing Framework. CoRR abs/1705.02307 (2017) - [i12]Vassilis Kalofolias, Nathanaël Perraudin:
Large Scale Graph Learning from Smooth Signals. CoRR abs/1710.05654 (2017) - 2016
- [j1]Nauman Shahid, Nathanaël Perraudin, Vassilis Kalofolias, Gilles Puy, Pierre Vandergheynst:
Fast Robust PCA on Graphs. IEEE J. Sel. Top. Signal Process. 10(4): 740-756 (2016) - [c3]Francesco Grassi, Nathanaël Perraudin, Benjamin Ricaud:
Tracking time-vertex propagation using dynamic graph wavelets. GlobalSIP 2016: 351-355 - [c2]Nauman Shahid, Nathanaël Perraudin, Vassilis Kalofolias, Benjamin Ricaud, Pierre Vandergheynst:
PCA using graph total variation. ICASSP 2016: 4668-4672 - [i11]Nathanaël Perraudin, Pierre Vandergheynst:
Stationary signal processing on graphs. CoRR abs/1601.02522 (2016) - [i10]Nauman Shahid, Nathanaël Perraudin, Gilles Puy, Pierre Vandergheynst:
Compressive PCA on Graphs. CoRR abs/1602.02070 (2016) - [i9]Nauman Shahid, Nathanaël Perraudin, Pierre Vandergheynst:
Low-Rank Matrices on Graphs: Generalized Recovery & Applications. CoRR abs/1605.05579 (2016) - [i8]Francesco Grassi, Nathanaël Perraudin, Benjamin Ricaud:
Tracking Time-Vertex Propagation using Dynamic Graph Wavelets. CoRR abs/1606.06653 (2016) - [i7]Nathanaël Perraudin, Andreas Loukas, Francesco Grassi, Pierre Vandergheynst:
Towards stationary time-vertex signal processing. CoRR abs/1606.06962 (2016) - [i6]Andreas Loukas, Nathanaël Perraudin:
Predicting the evolution of stationary graph signals. CoRR abs/1607.03313 (2016) - [i5]Nathanaël Perraudin, Nicki Holighaus, Piotr Majdak, Péter Balázs:
Audio inpainting with similarity graphs. CoRR abs/1607.06667 (2016) - [i4]Andreas Loukas, Nathanaël Perraudin:
Stationary time-vertex signal processing. CoRR abs/1611.00255 (2016) - 2015
- [i3]Nauman Shahid, Nathanaël Perraudin, Vassilis Kalofolias, Pierre Vandergheynst:
Fast Robust PCA on Graphs. CoRR abs/1507.08173 (2015) - 2014
- [i2]Nathanaël Perraudin, David I. Shuman, Gilles Puy, Pierre Vandergheynst:
UNLocBoX A matlab convex optimization toolbox using proximal splitting methods. CoRR abs/1402.0779 (2014) - [i1]Nathanaël Perraudin, Johan Paratte, David I. Shuman, Vassilis Kalofolias, Pierre Vandergheynst, David K. Hammond:
GSPBOX: A toolbox for signal processing on graphs. CoRR abs/1408.5781 (2014) - 2013
- [c1]Nathanaël Perraudin, Péter Balázs, Peter L. Søndergaard:
A fast Griffin-Lim algorithm. WASPAA 2013: 1-4
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-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint