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

Philippe Regnault

dblp:169/6976 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-7086-9030ORCID · corroborated

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

Theory of computation · 1Applied, interdisciplinary, general and emerging 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.

Theoretical computer science
1 paper
Information theory · 72% Mathematical optimization · 28%

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

TopicWeightPapersLastEvidence papers
Information theory › hypothesis testing
independence testing
0.312017
Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence · IEEE Trans. Inf. Theory 2017
Information theory › information measures
mutual information
0.312017
Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence · IEEE Trans. Inf. Theory 2017
Mathematical optimization › statistical estimation
semiparametric estimation
0.312017
Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence · IEEE Trans. Inf. Theory 2017
Information theory › information measures
divergence measures
0.112017
Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence · IEEE Trans. Inf. Theory 2017
Information theory › information measures › divergence measures
f-divergence
0.112017
Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence · IEEE Trans. Inf. Theory 2017

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

semiparametric copulas · 0.3dual representation of φ-divergences · 0.3bahadur efficiency · 0.3
YearPublicationVenuePosition
2020 Rényi Divergence rates of Ergodic Markov Chains: existence, explicit expressions and properties
abstract
The Kullback-Leibler divergence rate of two finite or countable ergodic Markov chains is well-known to exist and have an explicit expression as a function of the transition matrices of the chains, allowing access to classical tools for applications, such as minimization under constraints or projections on convex sets. The existence of Rényi divergence rates of ergodic Markov chains has been established in [5], [12]; here we establish explicit expressions for them and prove some properties of the resulting measures of discrepancy between stochastic matrices, opening the way to applications.
Valerie Girardin, Philippe Regnault
ISIT2
2017 Semiparametric Estimation of Mutual Information and Related Criteria: Optimal Test of Independence
abstract
We derive independence tests by means of dependence measures thresholding in a semiparametric context. Precisely, the estimates of φ-mutual informations, associated to φ-divergences between a joint distribution and the product distribution of its marginals, are derived through the dual representation of φ-divergences. The asymptotic properties of the proposed estimates are established, including consistency, asymptotic distributions, and large deviations principle. The obtained tests of independence are compared via their relative asymptotic Bahadur efficiency and numerical simulations. It follows that the proposed semiparametric mutual information test is the optimal one. On the other hand, the proposed approach provides a new method for estimating the mutual information in a semiparametric setting, as well as a model selection procedure in a large class of dependence models, including semiparametric copulas.
Amor Keziou, Philippe Regnault
IEEE Trans. Inf. Theory2