default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuoc-Tung Le
Person information
- affiliation: Toulouse School of Economics, Toulouse, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Yeow Meng Chee, Quoc-Tung Le, Hoang Ta:
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory. ISIT 2024: 1955-1960- [i7]Antoine Gonon, Léon Zheng, Pascal Carrivain, Quoc-Tung Le:
Make Inference Faster: Efficient GPU Memory Management for Butterfly Sparse Matrix Multiplication. CoRR abs/2405.15013 (2024) - [i6]Jérôme Bolte, Quoc-Tung Le, Edouard Pauwels, Samuel Vaiter:
Geometric and computational hardness of bilevel programming. CoRR abs/2407.12372 (2024) - 2023
- [b1]Quoc-Tung Le:
Algorithmic and theoretical aspects of sparse deep neural networks. (Aspects algorithmiques et th 'eoriques des r 'eseaux de neurones profonds parcimonieux). École normale supérieure de Lyon, France, 2023 - [j1]Quoc-Tung Le, Elisa Riccietti
, Rémi Gribonval:
Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support. SIAM J. Matrix Anal. Appl. 44(2): 503-529 (2023) - [c4]Quoc-Tung Le, Rémi Gribonval, Elisa Riccietti:
Does a sparse ReLU network training problem always admit an optimum ? NeurIPS 2023 - [c3]Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu:
Towards Better Bounds for Finding Quasi-Identifiers. PODS 2023: 155-167 - [i5]Antoine Gonon, Léon Zheng, Clément Lalanne, Quoc-Tung Le, Guillaume Lauga, Can Pouliquen:
Sparsity in neural networks can increase their privacy. CoRR abs/2304.07234 (2023) - [i4]Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval:
Does a sparse ReLU network training problem always admit an optimum? CoRR abs/2306.02666 (2023) - [i3]Quoc-Tung Le, Hoang Ta:
Asymptotic nonnegative rank of matrices. CoRR abs/2308.07187 (2023) - 2022
- [c2]Quoc-Tung Le, Léon Zheng, Elisa Riccietti, Rémi Gribonval:
Fast Learning of Fast Transforms, with Guarantees. ICASSP 2022: 3348-3352 - [i2]Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta, Hoa T. Vu:
Towards Better Bounds for Finding Quasi-Identifiers. CoRR abs/2211.13882 (2022) - 2021
- [c1]Quoc-Tung Le, Rémi Gribonval:
Structured Support Exploration for Multilayer Sparse Matrix Factorization. ICASSP 2021: 3245-3249 - [i1]Quoc-Tung Le, Elisa Riccietti, Rémi Gribonval:
Spurious Valleys, Spurious Minima and NP-hardness of Sparse Matrix Factorization With Fixed Support. CoRR abs/2112.00386 (2021)
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-12 22:56 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:
