default search action
Victor Quétu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j2]Giommaria Pilo
, Nour Hezbri, André Pereira e Ferreira, Victor Quétu, Enzo Tartaglione:
LayerFold: A Python library to reduce the depth of neural networks. SoftwareX 29: 102030 (2025) - [c7]Zhu Liao, Nour Hezbri, Victor Quétu, Van-Tam Nguyen, Enzo Tartaglione:
Till the Layers Collapse: Compressing a Deep Neural Network Through the Lenses of Batch Normalization Layers. AAAI 2025: 18702-18710 - [i11]Haicheng Wang, Zhemeng Yu, Gabriele Spadaro, Chen Ju, Victor Quétu, Enzo Tartaglione:
FOLDER: Accelerating Multi-modal Large Language Models with Enhanced Performance. CoRR abs/2501.02430 (2025) - 2024
- [c6]Victor Quétu, Enzo Tartaglione:
DSD²: Can We Dodge Sparse Double Descent and Compress the Neural Network Worry-Free? AAAI 2024: 14749-14757 - [c5]Victor Quétu
The Simpler The Better: An Entropy-Based Importance Metric to Reduce Neural Networks' Depth. ECML/PKDD (6) 2024: 92-108 - [i10]Zhu Liao, Victor Quétu, Van-Tam Nguyen, Enzo Tartaglione:
NEPENTHE: Entropy-Based Pruning as a Neural Network Depth's Reducer. CoRR abs/2404.16890 (2024) - [i9]Victor Quétu, Zhu Liao, Enzo Tartaglione:
The Simpler The Better: An Entropy-Based Importance Metric To Reduce Neural Networks' Depth. CoRR abs/2404.18949 (2024) - [i8]Victor Quétu, Nour Hezbri, Enzo Tartaglione:
LaCoOT: Layer Collapse through Optimal Transport. CoRR abs/2406.08933 (2024) - [i7]Maxime Girard, Victor Quétu, Samuel Tardieu, Van-Tam Nguyen, Enzo Tartaglione:
Memory-Optimized Once-For-All Network. CoRR abs/2409.05900 (2024) - [i6]Zhu Liao, Nour Hezbri, Victor Quétu, Van-Tam Nguyen, Enzo Tartaglione:
Till the Layers Collapse: Compressing a Deep Neural Network through the Lenses of Batch Normalization Layers. CoRR abs/2412.15077 (2024) - 2023
- [j1]Enzo Tartaglione
Disentangling private classes through regularization. Neurocomputing 554: 126612 (2023) - [c4]Zhu Liao, Victor Quétu, Van-Tam Nguyen, Enzo Tartaglione:
Can Unstructured Pruning Reduce the Depth in Deep Neural Networks? ICCV (Workshops) 2023: 1394-1398 - [c3]Victor Quétu
Sparse Double Descent in Vision Transformers: Real or Phantom Threat? ICIAP (2) 2023: 490-502 - [c2]Victor Quétu, Enzo Tartaglione:
Dodging the Double Descent in Deep Neural Networks. ICIP 2023: 1625-1629 - [c1]Victor Quétu, Marta Milovanovic
The Quest of Finding the Antidote to Sparse Double Descent. PKDD/ECML Workshops (4) 2023: 153-167 - [i5]Victor Quétu, Enzo Tartaglione:
Dodging the Double Descent in Deep Neural Networks. CoRR abs/2302.13259 (2023) - [i4]Victor Quétu, Enzo Tartaglione:
Dodging the Sparse Double Descent. CoRR abs/2303.01213 (2023) - [i3]Victor Quétu, Marta Milovanovic, Enzo Tartaglione:
Sparse Double Descent in Vision Transformers: real or phantom threat? CoRR abs/2307.14253 (2023) - [i2]Zhu Liao, Victor Quétu, Van-Tam Nguyen, Enzo Tartaglione:
Can Unstructured Pruning Reduce the Depth in Deep Neural Networks? CoRR abs/2308.06619 (2023) - [i1]Victor Quétu, Marta Milovanovic:
The Quest of Finding the Antidote to Sparse Double Descent. CoRR abs/2308.16596 (2023)
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 2025-04-20 23:52 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: