4 citations · 5 across the 5 of their papers we have counts for
5 papers
Hybrid Random Concentrated Optimization Without Convexity Assumption
Pierre Bertrand, Michel Broniatowski, Wolfgang Stummer
We propose a new random method to minimize deterministic continuous functions over subsets of high-dimensional space without assuming convexity. Our pr…
Continuous indetermination and average likelihood minimization
Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino
The authors transpose a discrete notion of indetermination coupling in the case of continuous probabilities. They show that this coupling, expressed on densities, cannot be capture…
A constructive method to minimize couple matchings
Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino
This paper provides constructive procedures for the indeterminacy coupling between two marginal distributions, an alternative to independence coupling. It also introduces a drawing…
Independence versus Indetermination: basis of two canonical clustering criteria
Pierre Bertrand, Michel Broniatowski, Jean-François Marcotorchino
This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "o…
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm
Pierre Bertrand, Christoph Lenzen
In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provid…