1.1k citations
- École PolytechniqueFR461 papers
- Centre National de la Recherche ScientifiqueFR295 papers
- Institut national de recherche en sciences et technologies du numériqueFR118 papers
- Centre Inria de SaclayFR62 papers
- Institut Polytechnique de ParisFR60 papers
- CRANFR28 papers
- Université Paris CitéFR28 papers
- Université Paris-SaclayFR26 papers
- Sorbonne UniversitéFR25 papers
- Université de LorraineFR18 papers
- Université Paris-SudFR17 papers
- École Normale Supérieure de LyonFR14 papers
710 papers
Propagation of~Interval Belief Structures and~Imprecise Copulas for~Neural Network Verification
Francesc Pifarre-Esquerda, Eric Goubault, Sylvie Putot
Quantitative verification of neural networks requires reasoning about probabilities under substantial uncertainty in both input distributions and their dependence structure. In rea…
Minimal Effort to Consensus (MEC) polarization measure
Jesús Aranda, Juan Francisco Díaz, Juan Camilo Narváez +4
We introduce the Minimum Effort to Consensus (MEC), a measure that quantifies polarization as resistance to consensus: a population is highly polarized when much effort is needed t…
Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems
Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker
The Random Gradient hyper-heuristic was recently shown to be able to learn the optimal neighbourhood size when optimizing the LeadingOnes benchmark via the Randomised Local Search…
A Fresh Look at Lamarckian Evolution and the Baldwin Effect
Inès Benito, Johannes F. Lutzeyer, Benjamin Doerr
Baldwinian and Lamarckian evolution have existed for a long time in evolutionary algorithms (EAs) without ever dominating the academic literature or practical applications. In this…
On Saxe's theorems about the complexity of the Distance Geometry Problem
Maël Kupperschmitt, Leo Liberti
In 1979, James B.~Saxe published an extended summary on the complexity of the Distance Geometry Problem in the proceedings of the 17th Allerton Conference. Many of the proofs in hi…
Rigorous numerical computation of the Stokes multipliers for linear differential equations with single level one
Michèle Loday-Richaud, Marc Mezzarobba, Pascal Remy
We describe a practical algorithm for computing the Stokes multipliers of a linear differential equation with polynomial coefficients at an irregular singular point of single level…