default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Garrigos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Fabian Schaipp, Guillaume Garrigos, Umut Simsekli, Robert M. Gower:
SGD with Clipping is Secretly Estimating the Median Gradient. CoRR abs/2402.12828 (2024)- [i5]Massil Hihat, Guillaume Garrigos, Adeline Fermanian, Simon Bussy:
Multivariate Online Linear Regression for Hierarchical Forecasting. CoRR abs/2402.14578 (2024) - 2023
- [j4]Guillaume Garrigos
, Lorenzo Rosasco, Silvia Villa:
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry. Math. Program. 198(1): 937-996 (2023) - [c5]Justin Domke, Robert M. Gower, Guillaume Garrigos:
Provable convergence guarantees for black-box variational inference. NeurIPS 2023 - [c4]Massil Hihat, Stéphane Gaïffas, Guillaume Garrigos, Simon Bussy:
Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization. NeurIPS 2023 - [i4]Justin Domke, Guillaume Garrigos, Robert M. Gower:
Provable convergence guarantees for black-box variational inference. CoRR abs/2306.03638 (2023) - [i3]Massil Hihat, Stéphane Gaïffas, Guillaume Garrigos, Simon Bussy:
Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization. CoRR abs/2307.06048 (2023) - [i2]Guillaume Garrigos, Robert M. Gower, Fabian Schaipp:
Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM. CoRR abs/2307.14528 (2023) - 2022
- [c3]Jiabin Chen, Rui Yuan, Guillaume Garrigos, Robert M. Gower:
SAN: Stochastic Average Newton Algorithm for Minimizing Finite Sums. AISTATS 2022: 279-318 - 2021
- [j3]Luca Calatroni, Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa:
Accelerated Iterative Regularization via Dual Diagonal Descent. SIAM J. Optim. 31(1): 754-784 (2021) - [i1]Jiabin Chen, Rui Yuan, Guillaume Garrigos, Robert M. Gower:
SAN: Stochastic Average Newton Algorithm for Minimizing Finite Sums. CoRR abs/2106.10520 (2021)
2010 – 2019
- 2019
- [c2]Jalal Fadili, Guillaume Garrigos, Jérôme Malick, Gabriel Peyré:
Model Consistency for Learning with Mirror-Stratifiable Regularizers. AISTATS 2019: 1236-1244 - 2018
- [j2]Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa:
Iterative Regularization via Dual Diagonal Descent. J. Math. Imaging Vis. 60(2): 189-215 (2018) - [c1]Guillaume Garrigos, Lorenzo Rosasco, Silvia Villa:
Sparse Multiple Kernel Learning: Support Identification via Mirror Stratifiability. EUSIPCO 2018: 1077-1081 - 2015
- [b1]Guillaume Garrigos:
Descent dynamical systems and algorithms for tame optimization, and multi-objective problems. (Systèmes dynamiques de descente et algorithmes pour l'optimisation modérée, et les problèmes multi-objectif). University of Montpellier, France, 2015 - [j1]Pierre Frankel, Guillaume Garrigos, Juan Peypouquet:
Splitting Methods with Variable Metric for Kurdyka-Łojasiewicz Functions and General Convergence Rates. J. Optim. Theory Appl. 165(3): 874-900 (2015)
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-04-24 23:20 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:
