Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Mélisande Albert

dblp:188/9116 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0003-0857-9427ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous 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.

Artificial intelligence
1 paper
Learning theory · 80% Probabilistic and Bayesian machine learning · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › experimental design
adaptive testing
0.712023
MMD Aggregated Two-Sample Test · J. Mach. Learn. Res. 2023
Machine learning › Learning theory › hypothesis testing › two-sample testing
kernel two-sample test
0.712023
MMD Aggregated Two-Sample Test · J. Mach. Learn. Res. 2023
Machine learning › Learning theory
minimax optimality
0.712023
MMD Aggregated Two-Sample Test · J. Mach. Learn. Res. 2023
Machine learning › Learning theory › hypothesis testing
nonparametric hypothesis testing
0.712023
MMD Aggregated Two-Sample Test · J. Mach. Learn. Res. 2023
Machine learning › Learning theory › hypothesis testing
two-sample testing
0.712023
MMD Aggregated Two-Sample Test · J. Mach. Learn. Res. 2023

Methods — techniques the papers use, named apart from their topics

wild bootstrap · 0.7permutation test · 0.7maximum mean discrepancy · 0.7
YearPublicationVenuePosition
2023 MMD Aggregated Two-Sample Test
abstract
We propose two novel nonparametric two-sample kernel tests based on the Maximum Mean Discrepancy (MMD). First, for a fixed kernel, we construct an MMD test using either permutations or a wild bootstrap, two popular numerical procedures to determine the test threshold. We prove that this test controls the probability of type I error non-asymptotically. Hence, it can be used reliably even in settings with small sample sizes as it remains well-calibrated, which differs from previous MMD tests which only guarantee correct test level asymptotically. When the difference in densities lies in a Sobolev ball, we prove minimax optimality of our MMD test with a specific kernel depending on the smoothness parameter of the Sobolev ball. In practice, this parameter is unknown and, hence, the optimal MMD test with this particular kernel cannot be used. To overcome this issue, we construct an aggregated test, called MMDAgg, which is adaptive to the smoothness parameter. The test power is maximised over the collection of kernels used, without requiring held-out data for kernel selection (which results in a loss of test power), or arbitrary kernel choices such as the median heuristic. We prove that MMDAgg still controls the level non-asymptotically, and achieves the minimax rate over Sobolev balls, up to an iterated logarithmic term. Our guarantees are not restricted to a specific type of kernel, but hold for any product of one-dimensional translation invariant characteristic kernels. We provide a user-friendly parameter-free implementation of MMDAgg using an adaptive collection of bandwidths. We demonstrate that MMDAgg significantly outperforms alternative state-of-the-art MMD-based two-sample tests on synthetic data satisfying the Sobolev smoothness assumption, and that, on real-world image data, MMDAgg closely matches the power of tests leveraging the use of models such as neural networks.
Antonin Schrab, Ilmun Kim, Mélisande Albert, Béatrice Laurent, Benjamin Guedj, Arthur Gretton
J. Mach. Learn. Res.3
2020 Physiological Synchrony Revealed by Delayed Coincidence Count: Application to a Cooperative Complex Environment
abstract
Synchrony at the physiological level is an objective measure that can be used to investigate cooperation between human agents. This physiological synchrony has been experimentally observed in different dyadic contexts through measures of the autonomous system such as cardiac measures. Various metrics are used to characterize synchrony between participants such as crosscorrelation, weighted coherence, or cross recurrence quantification analysis and with a wide variety of paradigms. We propose the delayed coincidence count as a new method for assessing cardiac synchrony. Delayed coincidence count has already been used to characterize synchrony in firing neurons populations. While being straightforward and computationally light, this method has already been formally proven to be statistically robust. A complex dynamic microworld is designed with two difficulty levels and two cooperation conditions. A total of 40 participants, i.e., 20 teams, voluntarily has conducted the experiment. The delayed coincidence count method (with a coincidence threshold δ of 20 ms) reveals a significant synchrony (p <; .01) during the cooperative and high difficulty condition only, while the other methods did not. The results are interpreted in terms of interaction intensity in accordance with recent literature.
Kevin J. Verdiere, Mélisande Albert, Frédéric Dehais, Raphaëlle N. Roy
IEEE Trans. Hum. Mach. Syst.2
2016 Surrogate Data Methods Based on a Shuffling of the Trials for Synchrony Detection: The Centering Issue
abstract
We investigate several distribution-free dependence detection procedures, all based on a shuffling of the trials, from a statistical point of view. The mathematical justification of such procedures lies in the bootstrap principle and its approximation properties. In particular, we show that such a shuffling has mainly to be done on centered quantities-that is, quantities with zero mean under independence-to construct correct p-values, meaning that the corresponding tests control their false positive (FP) rate. Thanks to this study, we introduce a method, named permutation UE, which consists of a multiple testing procedure based on permutation of experimental trials and delayed coincidence count. Each involved single test of this procedure achieves the prescribed level, so that the corresponding multiple testing procedure controls the false discovery rate (FDR), and this with as few assumptions as possible on the underneath distribution, except independence and identical distribution across trials. The mathematical meaning of this assumption is discussed, and it is in particular argued that it does not mean what is commonly referred in neuroscience to as cross-trials stationarity. Some simulations show, moreover, that permutation UE outperforms the trial-shuffling of Pipa and Grün ( 2003 ) and the MTGAUE method of Tuleau-Malot et al. ( 2014 ) in terms of single levels and FDR, for a comparable amount of false negatives. Application to real data is also provided.
Mélisande Albert, Yann Bouret, Magalie Fromont, Patricia Reynaud-Bouret
Neural Comput.1