Stéphane Gaïffas

According to our database1, Stéphane Gaïffas authored at least 32 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
WildWood: A New Random Forest Algorithm.
IEEE Trans. Inf. Theory, October, 2023

Robust supervised learning with coordinate gradient descent.
Stat. Comput., October, 2023

Robust Methods for High-Dimensional Linear Learning.
J. Mach. Learn. Res., 2023

Robust Stochastic Optimization via Gradient Quantile Clipping.
CoRR, 2023

Convergence and concentration properties of constant step-size SGD through Markov chains.
CoRR, 2023

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
An improper estimator with optimal excess risk in misspecified density estimation and logistic regression.
J. Mach. Learn. Res., 2022

2021
Predicting the Solar Potential of Rooftops using Image Segmentation and Structured Data.
CoRR, 2021

A Review on Contrastive Learning Methods and Applications to Roof-Type Classification on Aerial Images.
Proceedings of the IEEE International Geoscience and Remote Sensing Symposium, 2021

2020
Sparse and low-rank multivariate Hawkes processes.
J. Mach. Learn. Res., 2020

ZiMM: A deep learning model for long term and blurry relapses with non-clinical claims data.
J. Biomed. Informatics, 2020

SCALPEL3: A scalable open-source library for healthcare claims databases.
Int. J. Medical Informatics, 2020

About contrastive unsupervised representation learning for classification and its convergence.
CoRR, 2020

2019
Sparse inference of the drift of a high-dimensional Ornstein-Uhlenbeck process.
J. Multivar. Anal., 2019

On the optimality of the Hedge algorithm in the stochastic regime.
J. Mach. Learn. Res., 2019

Binarsity: a penalization for one-hot encoded features in linear supervised learning.
J. Mach. Learn. Res., 2019

ZiMM: a deep learning model for long term adverse events with non-clinical claims data.
CoRR, 2019

AMF: Aggregated Mondrian Forests for Online Learning.
CoRR, 2019

2018
Anytime Hedge achieves optimal regret in the stochastic regime.
CoRR, 2018

Comparison of methods for early-readmission prediction in a high-dimensional heterogeneous covariates and time-to-event outcome framework.
CoRR, 2018

Dual optimization for convex constrained objectives without the gradient-Lipschitz assumption.
CoRR, 2018

2017
tick: a Python Library for Statistical Learning, with an emphasis on Hawkes Processes and Time-Dependent Models.
J. Mach. Learn. Res., 2017

Uncovering Causality from Multivariate Hawkes Integrated Cumulants.
J. Mach. Learn. Res., 2017

Universal consistency and minimax rates for online Mondrian Forests.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2015
Learning the Intensity of Time Events With Change-Points.
IEEE Trans. Inf. Theory, 2015

Mean-field inference of Hawkes point processes.
CoRR, 2015

SGD with Variance Reduction beyond Empirical Risk Minimization.
CoRR, 2015

2014
Link prediction in graphs with autoregressive features.
J. Mach. Learn. Res., 2014

2013
Learning to Target the Target: Automatic Audience Segmentation.
Proceedings of the Advances in Data Mining, 13th Industrial Conference, 2013

2011
Sharp Oracle Inequalities for High-Dimensional Matrix Prediction.
IEEE Trans. Inf. Theory, 2011

Hyper-Sparse Optimal Aggregation.
J. Mach. Learn. Res., 2011

Weighted algorithms for compressed sensing and matrix completion
CoRR, 2011


  Loading...