Demo Data from EDBT 2026 / reviewers in the wild / expert
Patrick Tardivel
dblp:254/3575
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1
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.
| Theoretical computer science
1 paper |
Mathematical optimization · 60% Algorithms and data structures · 40% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
clustering |
0.6 | 1 | 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022 |
Algorithms and data structures › clustering
convex clustering |
0.6 | 1 | 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022 |
Mathematical optimization › regularization
regularized estimation |
0.6 | 1 | 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022 |
Mathematical optimization › regularization › structured sparsity
SLOPE |
0.6 | 1 | 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022 |
Mathematical optimization › statistical estimation › high-dimensional estimation
sparse estimation |
0.6 | 1 | 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized Estimation · J. Mach. Learn. Res. 2022 |
Bioinformatics and computational biology
metabolomics |
0.4 | 1 | 2019 | ASICS: an R package for a whole analysis workflow of 1D 1H NMR spectra · Bioinform. 2019 |
Bioinformatics and computational biology › structural biology
NMR spectroscopy |
0.4 | 1 | 2019 | ASICS: an R package for a whole analysis workflow of 1D 1H NMR spectra · Bioinform. 2019 |
Bioinformatics and computational biology › biostatistics
statistical methods for omics data |
0.1 | 1 | 2019 | ASICS: an R package for a whole analysis workflow of 1D 1H NMR spectra · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
polytope · 0.6geometric characterization · 0.6dual norm unit ball · 0.6statistical analysis · 0.4spectral preprocessing · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | The Solution Path of SLOPEabstractThe SLOPE estimator has the particularity of having null components (sparsity) and components that are equal in absolute value (clustering). The number of clusters depends on the regularization parameter of the estimator. This parameter can be chosen as a trade-off between interpretability (with a small number of clusters) and accuracy (with a small mean squared error or a small prediction error). Finding such a compromise requires to compute the solution path, that is the function mapping the regularization parameter to the estimator. We provide in this article an algorithm to compute the solution path of SLOPE and show how it can be used to adjust the regularization parameter. Xavier Dupuis, Patrick Tardivel |
AISTATS | 2 |
| 2022 | The Geometry of Uniqueness, Sparsity and Clustering in Penalized EstimationabstractWe provide a necessary and sufficient condition for the uniqueness of penalized least-squares estimators whose penalty term is given by a norm with a polytope unit ball, covering a wide range of methods including SLOPE, PACS, fused, clustered and classical LASSO as well as the related method of basis pursuit. We consider a strong type of uniqueness that is relevant for statistical problems. The uniqueness condition is geometric and involves how the row span of the design matrix intersects the faces of the dual norm unit ball, which for SLOPE is given by the signed permutahedron. Further considerations based this condition also allow to derive results on sparsity and clustering features. In particular, we define the notion of a SLOPE pattern to describe both sparsity and clustering properties of this method and also provide a geometric characterization of accessible SLOPE patterns. Ulrike Schneider 0001, Patrick Tardivel |
J. Mach. Learn. Res. | 2 |
| 2019 | ASICS: an R package for a whole analysis workflow of 1D 1H NMR spectraabstractMOTIVATION: In metabolomics, the detection of new biomarkers from Nuclear Magnetic Resonance (NMR) spectra is a promising approach. However, this analysis remains difficult due to the lack of a whole workflow that handles spectra pre-processing, automatic identification and quantification of metabolites and statistical analyses, in a reproducible way. RESULTS: We present ASICS, an R package that contains a complete workflow to analyse spectra from NMR experiments. It contains an automatic approach to identify and quantify metabolites in a complex mixture spectrum and uses the results of the quantification in untargeted and targeted statistical analyses. ASICS was shown to improve the precision of quantification in comparison to existing methods on two independent datasets. In addition, ASICS successfully recovered most metabolites that were found important to explain a two level condition describing the samples by a manual and expert analysis based on bucketing. It also found new relevant metabolites involved in metabolic pathways related to risk factors associated with the condition. AVAILABILITY AND IMPLEMENTATION: ASICS is distributed as an R package, available on Bioconductor. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Gaëlle Lefort, Laurence Liaubet, Cécile Canlet, Patrick Tardivel, Marie-Christine Père, Hélène Quesnel, Alain Paris, Nathalie Iannuccelli, Nathalie Vialaneix, Rémi Servien |
Bioinform. | 4 |