Sébastien Gerchinovitz
12 papers · 2011–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🏃 Academic Marathon (14) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (6) 🐝 Cross-Pollinator (8)
🐝
Cross-Pollinator
(8)
🗺️
Taxonomy Completionist
(21)
🏆
Keyword Champion
(3)
📈
Trend Setter
💎
Century Club
(12)
🚀
Conference Pioneer
🗃️
Keyword Collector
(54)
Conferences
NIPS (4)
COLT (3)
JMLR (2)
AISTATS (1)
ALT (1)
ICML (1)
Top co-authors
Keywords
regret bound
(5)
online linear regression
(3)
stochastic optimization
(2)
online learning
(2)
exponential weighting
(2)
sample complexity
(2)
individual sequence
(2)
function approximation
(1)
matrix factorization
(1)
learning theory
(1)
nonparametric regression
(1)
gradient descent
(1)
sequential learning
(1)
fat-shattering dimension
(1)
multi-armed bandit
(1)
loss landscape
(1)
square loss
(1)
minimax regret
(1)
matrix rank
(1)
partial feedback
(1)
Papers
Efficient Robust Conformal Prediction via Lipschitz-Bounded Networks
ICML 2025
The Loss Landscape of Deep Linear Neural Networks: a Second-order Analysis
JMLR 2024
A general approximation lower bound in $L^p$ norm, with applications to feed-forward neural networks
NIPS 2022
The Sample Complexity of Level Set Approximation
AISTATS 2021
Numerical influence of ReLU’(0) on backpropagation
NIPS 2021
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates
NIPS 2021
Uniform regret bounds over $\mathbb{R}^d$ for the sequential linear regression problem with the square loss
ALT 2019
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning
COLT 2017
Refined Lower Bounds for Adversarial Bandits
NIPS 2016
A Chaining Algorithm for Online Nonparametric Regression
COLT 2015
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression
JMLR 2013
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression
COLT 2011