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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aurélien Guetsop Nangue

dblp:209/6639 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Artificial intelligence and machine learning · 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
Kernel, tree and ensemble methods · 50% Learning theory · 25% Representation and self-supervised learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
distance covariance
0.312017
Tests of Mutual or Serial Independence of Random Vectors with Applications · J. Mach. Learn. Res. 2017
Machine learning › Kernel, tree and ensemble methods › kernel methods
hilbert-schmidt independence criterion
0.312017
Tests of Mutual or Serial Independence of Random Vectors with Applications · J. Mach. Learn. Res. 2017
Machine learning › Learning theory › hypothesis testing
independence testing
0.312017
Tests of Mutual or Serial Independence of Random Vectors with Applications · J. Mach. Learn. Res. 2017
Machine learning › Kernel, tree and ensemble methods
kernel methods
0.312017
Tests of Mutual or Serial Independence of Random Vectors with Applications · J. Mach. Learn. Res. 2017

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

randomization test · 0.3möbius transformation · 0.3characteristic function · 0.3
YearPublicationVenuePosition
2017 Tests of Mutual or Serial Independence of Random Vectors with Applications
abstract
The problem of testing mutual independence between many random vectors is addressed. The closely related problem of testing serial independence of a multivariate stationary sequence is also considered. The Möbius transformation of characteristic functions is used to characterize independence. A generalization to $p$ vectors of distance covariance and Hilbert-Schmidt independence criterion ($HSIC$) tests with the translation invariant kernel of a stable probability distribution is proposed. Both test statistics can be expressed in a simple form as a sum over all elements of a componentwise product of $p$ doubly-centered matrices. It is shown that an $HSIC$ statistic with sufficiently small scale parameters is equivalent to a distance covariance statistic. Consistency and weak convergence of both types of statistics are established. Approximation of $p$-values is made by randomization tests without recomputing interpoint distances for each randomized sample. The dependogram is adapted to the proposed tests for the graphical identification of sources of dependencies. Empirical rejection rates obtained through extensive simulations confirm both the applicability of the testing procedures in small samples and the high level of competitiveness in terms of power. Applications to meteorological and financial data provide some interesting interpretations of dependencies revealed by dependograms.
Martin Bilodeau, Aurélien Guetsop Nangue
J. Mach. Learn. Res.2