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

Adrien Saumard

dblp:217/3701 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-3260-1471ORCID · reported

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

Theory of computation · 1 · 1 first-author · 1 since 2021

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 · 70% Coding theory · 30%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › cyclic codes
affine-invariant codes
0.512021
Finite Sample Improvement of Akaike's Information Criterion · IEEE Trans. Inf. Theory 2021
Information theory › statistical inference
model selection
0.512021
Finite Sample Improvement of Akaike's Information Criterion · IEEE Trans. Inf. Theory 2021
Information theory › statistical inference
oracle inequalities
0.512021
Finite Sample Improvement of Akaike's Information Criterion · IEEE Trans. Inf. Theory 2021

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

kullback-leibler divergence · 0.5concentration inequalities · 0.5
YearPublicationVenuePosition
2021 Finite Sample Improvement of Akaike's Information Criterion
abstract
Considering the selection of frequency histograms, we propose a modification of Akaike's Information Criterion that avoids overfitting, even when the sample size is small. We call this correction an over-penalization procedure. We emphasize that the principle of unbiased risk estimation for model selection can indeed be improved by addressing excess risk deviations in the design of the penalization procedure. On the theoretical side, we prove sharp oracle inequalities for the Kullback-Leibler divergence. These inequalities are valid with positive probability for any sample size and include the estimation of unbounded log-densities. Along the proofs, we derive several analytical lemmas related to the Kullback-Leibler divergence, as well as concentration inequalities, that are of independent interest. In a simulation study, we also demonstrate state-of-the-art performance of our over-penalization criterion for bin size selection, in particular outperforming AICc procedure.
Adrien Saumard, Fabien Navarro
IEEE Trans. Inf. Theory1