Demo Data from SIGIR 2026 / reviewers in the wild / expert
Stéphane Ivanoff
dblp:203/7341
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression › generalized linear model
poisson regression |
0.2 | 1 | 2016 | Adaptive Lasso and group-Lasso for functional Poisson regression · J. Mach. Learn. Res. 2016 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression |
0.2 | 1 | 2016 | Adaptive Lasso and group-Lasso for functional Poisson regression · J. Mach. Learn. Res. 2016 |
Methods — techniques the papers use, named apart from their topics
lasso · 0.2group lasso · 0.2concentration inequalities · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Adaptive Lasso and group-Lasso for functional Poisson regressionabstractHigh dimensional Poisson regression has become a standard framework for the analysis of massive counts datasets. In this work we estimate the intensity function of the Poisson regression model by using a dictionary approach, which generalizes the classical basis approach, combined with a Lasso or a group-Lasso procedure. Selection depends on penalty weights that need to be calibrated. Standard methodologies developed in the Gaussian framework can not be directly applied to Poisson models due to heteroscedasticity. Here we provide data-driven weights for the Lasso and the group-Lasso derived from concentration inequalities adapted to the Poisson case. We show that the associated Lasso and group-Lasso procedures satisfy fast and slow oracle inequalities. Simulations are used to assess the empirical performance of our procedure, and an original application to the analysis of Next Generation Sequencing data is provided. Stéphane Ivanoff, Franck Picard, Vincent Rivoirard |
J. Mach. Learn. Res. | 1 |