SearcharxivSearch

arXiv subjects

Léo Planche

Publications and source records attributed to Léo Planche.

3 recordsLinked to original sources

PRIVET: PRoximIty leakage detection Via Extreme value Theory

Deep generative models are often trained on sensitive data, such as genetic sequences, health data, or more broadly, any copyrighted, licensed or protected content. This raises critical concerns around privacy-preserving synthetic data, and more specifically around privacy leakage, an issue closely tied to overfitting. Existing proximity-based methods mostly assess privacy risk through global criteria, which quantify a model's overall behaviour but cannot attribute risk to an individual record. Sample-level outputs do exist but they are either uncalibrated, discontinuous, or blind to leakage occurring while the model is globally underfit, which limits their practical use. Using extreme value statistics on nearest-neighbor distances, we propose PRIVET, a generic sample-based, modality-agnostic algorithm that assigns an individual proximity leak score to each synthetic sample. These are evaluated under a chosen representation and distance, each synthetic sample being assigned a continuous score measuring how improbable its proximity to the training set is under a no-leakage model. We empirically demonstrate that PRIVET detects memorization and more subtle forms of proximity-based data leakage across diverse data modalities, including settings with very high dimensionality and limited sample sizes such as genetic data, and in underfitting regimes that overfitting-based diagnostics cannot reach by construction. Our analysis further shows that the representation bounds what any distance-based evaluation can detect, existing computer vision embeddings failing to yield perceptually meaningful distances for near-duplicate samples. Accordingly, a low score is evidence of leakage in the chosen metric, while its absence is not a certificate of privacy.

cs.LG

The Effect of Graph Connecitivity on Metastability on a Stochastic System of Spiking Neurons

We consider a continuous-time stochastic model of spiking neurons. In this model, we have a finite or countable number of neurons which are vertices in some graph $G$ where the edges indicate the synaptic connection between them. We focus on metastability, understood as the property for the time of extinction of the network to be asymptotically memory-less, and we prove that this model exhibits two different behaviors depending on the nature of the specific underlying graph of interaction $G$ that is chosen. This model depends on a leakage parameter $γ$, and it was previously proven that when the graph $G$ is the infinite one-dimensional lattice, this model presents a phase transition with respect to $γ$. It was also proven that, when $γ$ is small enough, the renormalized time of extinction (the first time at which all neurons have a null membrane potential) of a finite version of the system converges in law toward an exponential random variable when the number of neurons goes to infinity. The present article is divided into two parts. First we prove that, in the finite one-dimensional lattice, this last result doesn't hold if $γ$ is not small anymore, in fact we prove that for $γ> 1$ the renormalized time of extinction is asymptotically deterministic. Then we prove that conversely, if $G$ is the complete graph, the result of metastability holds for any positive $γ$.

math.PR

Minimum Eccentricity Shortest Path Problem: an Approximation Algorithm and Relation with the k-Laminarity Problem

The Minimum Eccentricity Shortest Path (MESP) Problem consists in determining a shortest path (a path whose length is the distance between its extremities) of minimum eccentricity in a graph. It was introduced by Dragan and Leitert [9] who described a linear-time algorithm which is an 8-approximation of the problem. In this paper, we study deeper the double-BFS procedure used in that algorithm and extend it to obtain a linear-time 3-approximation algorithm. We moreover study the link between the MESP problem and the notion of laminarity, introduced by V{ö}lkel et al [12], corresponding to its restriction to a diameter (i.e. a shortest path of maximum length), and show tight bounds between MESP and laminarity parameters.

cs.CC