default search action
Quentin Bertrand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Quentin Klopfenstein
, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon, Samuel Vaiter:
Local linear convergence of proximal coordinate descent algorithm. Optim. Lett. 18(1): 135-154 (2024) - [c9]Quentin Bertrand, Avishek Joey Bose, Alexandre Duplessis, Marco Jiralerspong, Gauthier Gidel:
On the Stability of Iterative Retraining of Generative Models on their own Data. ICLR 2024 - [i14]Damien Ferbach, Quentin Bertrand, Avishek Joey Bose, Gauthier Gidel:
Self-Consuming Generative Models with Curated Data Provably Optimize Human Preferences. CoRR abs/2407.09499 (2024) - 2023
- [c8]Quentin Bertrand, Wojciech Marian Czarnecki, Gauthier Gidel:
On the Limitations of the Elo, Real-World Games are Transitive, not Additive. AISTATS 2023: 2905-2921 - [c7]Sébastien Lachapelle, Tristan Deleu, Divyat Mahajan, Ioannis Mitliagkas, Yoshua Bengio, Simon Lacoste-Julien, Quentin Bertrand:
Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learning. ICML 2023: 18171-18206 - [i13]Juan Ramirez, Rohan Sukumaran, Quentin Bertrand, Gauthier Gidel:
Omega: Optimistic EMA Gradients. CoRR abs/2306.07905 (2023) - [i12]Quentin Bertrand, Avishek Joey Bose, Alexandre Duplessis, Marco Jiralerspong, Gauthier Gidel:
On the Stability of Iterative Retraining of Generative Models on their own Data. CoRR abs/2310.00429 (2023) - [i11]Quentin Bertrand, Juan Duque, Emilio Calvano, Gauthier Gidel:
Q-learners Can Provably Collude in the Iterated Prisoner's Dilemma. CoRR abs/2312.08484 (2023) - 2022
- [j1]Quentin Bertrand, Quentin Klopfenstein, Mathurin Massias, Mathieu Blondel, Samuel Vaiter, Alexandre Gramfort, Joseph Salmon:
Implicit Differentiation for Fast Hyperparameter Selection in Non-Smooth Convex Learning. J. Mach. Learn. Res. 23: 149:1-149:43 (2022) - [c6]Quentin Bertrand, Quentin Klopfenstein, Pierre-Antoine Bannier, Gauthier Gidel, Mathurin Massias:
Beyond L1: Faster and Better Sparse Models with skglm. NeurIPS 2022 - [c5]Damien Scieur, Gauthier Gidel, Quentin Bertrand, Fabian Pedregosa:
The Curse of Unrolling: Rate of Differentiating Through Optimization. NeurIPS 2022 - [i10]Quentin Bertrand, Quentin Klopfenstein, Pierre-Antoine Bannier, Gauthier Gidel, Mathurin Massias:
Beyond L1: Faster and Better Sparse Models with skglm. CoRR abs/2204.07826 (2022) - [i9]Quentin Bertrand, Wojciech Marian Czarnecki, Gauthier Gidel:
On the Limitations of Elo: Real-World Games, are Transitive, not Additive. CoRR abs/2206.12301 (2022) - [i8]Sébastien Lachapelle, Tristan Deleu, Divyat Mahajan, Ioannis Mitliagkas, Yoshua Bengio, Simon Lacoste-Julien, Quentin Bertrand:
Synergies Between Disentanglement and Sparsity: a Multi-Task Learning Perspective. CoRR abs/2211.14666 (2022) - 2021
- [c4]Quentin Bertrand, Mathurin Massias:
Anderson acceleration of coordinate descent. AISTATS 2021: 1288-1296 - [i7]Quentin Bertrand, Quentin Klopfenstein, Mathurin Massias, Mathieu Blondel, Samuel Vaiter, Alexandre Gramfort, Joseph Salmon:
Implicit differentiation for fast hyperparameter selection in non-smooth convex learning. CoRR abs/2105.01637 (2021) - 2020
- [c3]Mathurin Massias, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon:
Support recovery and sup-norm convergence rates for sparse pivotal estimation. AISTATS 2020: 2655-2665 - [c2]Quentin Bertrand, Quentin Klopfenstein, Mathieu Blondel, Samuel Vaiter, Alexandre Gramfort, Joseph Salmon:
Implicit differentiation of Lasso-type models for hyperparameter optimization. ICML 2020: 810-821 - [i6]Mathurin Massias, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon:
Support recovery and sup-norm convergence rates for sparse pivotal estimation. CoRR abs/2001.05401 (2020) - [i5]Quentin Bertrand, Quentin Klopfenstein, Mathieu Blondel, Samuel Vaiter, Alexandre Gramfort, Joseph Salmon:
Implicit differentiation of Lasso-type models for hyperparameter optimization. CoRR abs/2002.08943 (2020) - [i4]Quentin Klopfenstein, Quentin Bertrand, Alexandre Gramfort, Joseph Salmon, Samuel Vaiter:
Model identification and local linear convergence of coordinate descent. CoRR abs/2010.11825 (2020) - [i3]Quentin Bertrand, Mathurin Massias:
Anderson acceleration of coordinate descent. CoRR abs/2011.10065 (2020)
2010 – 2019
- 2019
- [c1]Quentin Bertrand, Mathurin Massias, Alexandre Gramfort, Joseph Salmon:
Handling correlated and repeated measurements with the smoothed multivariate square-root Lasso. NeurIPS 2019: 3961-3972 - [i2]Quentin Bertrand, Mathurin Massias, Alexandre Gramfort, Joseph Salmon:
Concomitant Lasso with Repetitions (CLaR): beyond averaging multiple realizations of heteroscedastic noise. CoRR abs/1902.02509 (2019) - 2017
- [i1]Gabriel Azevedo Ferreira, Quentin Bertrand, Charles Maussion, Rodrigo de Salvo Braz:
Anytime Exact Belief Propagation. CoRR abs/1707.08704 (2017)
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-09-13 01:38 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: