default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Gerchinovitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]El Mehdi Achour, François Malgouyres, Sébastien Gerchinovitz:
The Loss Landscape of Deep Linear Neural Networks: a Second-order Analysis. J. Mach. Learn. Res. 25: 242:1-242:76 (2024)- [j3]Hédi Hadiji, Sébastien Gerchinovitz, Jean-Michel Loubes, Gilles Stoltz:
Diversity-Preserving K-Armed Bandits, Revisited. Trans. Mach. Learn. Res. 2024 (2024) - 2023
- [i18]Étienne de Montbrun, Sébastien Gerchinovitz:
Certified Multi-Fidelity Zeroth-Order Optimization. CoRR abs/2308.00978 (2023) - [i17]Pierre Gaillard, Sébastien Gerchinovitz, Étienne de Montbrun:
Adaptive approximation of monotone functions. CoRR abs/2309.07530 (2023) - 2022
- [c15]El Mehdi Achour, Armand Foucault, Sébastien Gerchinovitz, François Malgouyres:
A general approximation lower bound in $L^p$ norm, with applications to feed-forward neural networks. NeurIPS 2022 - [c14]Florence de Grancey, Jean-Luc Adam, Lucian Alecu, Sébastien Gerchinovitz, Franck Mamalet, David Vigouroux:
Object Detection with Probabilistic Guarantees: A Conformal Prediction Approach. SAFECOMP Workshops 2022: 316-329 - [i16]El Mehdi Achour, Armand Foucault, Sébastien Gerchinovitz, François Malgouyres:
A general approximation lower bound in Lp norm, with applications to feed-forward neural networks. CoRR abs/2206.04360 (2022) - 2021
- [c13]François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz:
The Sample Complexity of Level Set Approximation. AISTATS 2021: 424-432 - [c12]David Bertoin, Jérôme Bolte, Sébastien Gerchinovitz, Edouard Pauwels:
Numerical influence of ReLU'(0) on backpropagation. NeurIPS 2021: 468-479 - [c11]François Bachoc, Tommaso Cesari, Sébastien Gerchinovitz:
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates. NeurIPS 2021: 24180-24192 - [i15]François Bachoc, Tommaso Renato Cesari, Sébastien Gerchinovitz:
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates. CoRR abs/2102.01977 (2021) - [i14]Oleksandr Zadorozhnyi, Pierre Gaillard, Sébastien Gerchinovitz, Alessandro Rudi:
Online nonparametric regression with Sobolev kernels. CoRR abs/2102.03594 (2021) - [i13]Hervé Delseny, Christophe Gabreau, Adrien Gauffriau, Bernard Beaudouin, Ludovic Ponsolle, Lucian Alecu, Hugues Bonnin, Brice Beltran, Didier Duchel, Jean-Brice Ginestet, Alexandre Hervieu, Ghilaine Martinez, Sylvain Pasquet, Kevin Delmas, Claire Pagetti, Jean-Marc Gabriel, Camille Chapdelaine, Sylvaine Picard, Mathieu Damour, Cyril Cappi, Laurent Gardès, Florence de Grancey, Eric Jenn, Baptiste Lefèvre, Grégory Flandin, Sébastien Gerchinovitz, Franck Mamalet, Alexandre Albore:
White Paper Machine Learning in Certified Systems. CoRR abs/2103.10529 (2021) - [i12]David Bertoin, Jérôme Bolte, Sébastien Gerchinovitz, Edouard Pauwels:
Numerical influence of ReLU'(0) on backpropagation. CoRR abs/2106.12915 (2021) - [i11]El Mehdi Achour, François Malgouyres, Sébastien Gerchinovitz:
The loss landscape of deep linear neural networks: a second-order analysis. CoRR abs/2107.13289 (2021) - 2020
- [c10]Melanie Ducoffe, Sébastien Gerchinovitz, Jayant Sen Gupta:
A High Probability Safety Guarantee for Shifted Neural Network Surrogates. SafeAI@AAAI 2020: 74-82 - [i10]Clément Bouttier, Tommaso Cesari
, Sébastien Gerchinovitz:
Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization. CoRR abs/2002.02390 (2020) - [i9]Hédi Hadiji, Sébastien Gerchinovitz, Jean-Michel Loubes, Gilles Stoltz:
Diversity-Preserving K-Armed Bandits, Revisited. CoRR abs/2010.01874 (2020)
2010 – 2019
- 2019
- [c9]Pierre Gaillard, Sébastien Gerchinovitz, Malo Huard, Gilles Stoltz:
Uniform regret bounds over Rd for the sequential linear regression problem with the square loss. ALT 2019: 404-432 - 2018
- [c8]Grégoire Jauvion, Nicolas Grislain, Pascal Dkengne Sielenou, Aurélien Garivier, Sébastien Gerchinovitz:
Optimization of a SSP's Header Bidding Strategy using Thompson Sampling. KDD 2018: 425-432 - [i8]Pierre Gaillard, Sébastien Gerchinovitz, Malo Huard, Gilles Stoltz:
Uniform regret bounds over Rd for the sequential linear regression problem with the square loss. CoRR abs/1805.11386 (2018) - [i7]Grégoire Jauvion, Nicolas Grislain, Pascal Dkengne Sielenou, Aurélien Garivier, Sébastien Gerchinovitz:
Optimization of a SSP's Header Bidding Strategy using Thompson Sampling. CoRR abs/1807.03299 (2018) - 2017
- [c7]Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, Sébastien Gerchinovitz:
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning. COLT 2017: 465-481 - [i6]Sébastien Gerchinovitz, Pierre Ménard, Gilles Stoltz:
Fano's inequality for random variables. CoRR abs/1702.05985 (2017) - [i5]Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, Sébastien Gerchinovitz:
Online Nonparametric Learning, Chaining, and the Role of Partial Feedback. CoRR abs/1702.08211 (2017) - 2016
- [c6]Sébastien Gerchinovitz, Tor Lattimore:
Refined Lower Bounds for Adversarial Bandits. NIPS 2016: 1190-1198 - [i4]Sébastien Gerchinovitz, Tor Lattimore:
Refined Lower Bounds for Adversarial Bandits. CoRR abs/1605.07416 (2016) - 2015
- [c5]Pierre Gaillard, Sébastien Gerchinovitz:
A Chaining Algorithm for Online Nonparametric Regression. COLT 2015: 764-796 - [c4]Jonathan Louëdec, Max Chevalier, Josiane Mothe, Aurélien Garivier, Sébastien Gerchinovitz:
A Multiple-Play Bandit Algorithm Applied to Recommender Systems. FLAIRS 2015: 67-72 - [c3]Clément Bouttier, Olivier Babando, Sébastien Gadat, Sébastien Gerchinovitz, Serge Laporte, Florence Nicol:
Adaptive Simulated Annealing with Homogenization for Aircraft Trajectory Optimization. OR 2015: 569-574 - [i3]Pierre Gaillard, Sébastien Gerchinovitz:
A Chaining Algorithm for Online Nonparametric Regression. CoRR abs/1502.07697 (2015) - 2014
- [j2]Sébastien Gerchinovitz, Jia Yuan Yu:
Adaptive and optimal online linear regression on l1-balls. Theor. Comput. Sci. 519: 4-28 (2014) - 2013
- [j1]Sébastien Gerchinovitz:
Sparsity regret bounds for individual sequences in online linear regression. J. Mach. Learn. Res. 14(1): 729-769 (2013) - 2011
- [c2]Sébastien Gerchinovitz, Jia Yuan Yu:
Adaptive and Optimal Online Linear Regression on ℓ1-Balls. ALT 2011: 99-113 - [c1]Sébastien Gerchinovitz:
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression. COLT 2011: 377-396 - [i2]Sébastien Gerchinovitz:
Sparsity regret bounds for individual sequences in online linear regression. CoRR abs/1101.1057 (2011) - [i1]Sébastien Gerchinovitz, Jia Yuan Yu:
Adaptive and Optimal Online Linear Regression on L1-balls. CoRR abs/1105.4042 (2011)
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 01:24 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:
