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

Michel Broniatowski

dblp:44/3310 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0001-6301-5531ORCID · corroborated

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

Theory of computation · 2 · 2 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
2 papers
Information theory · 77% Mathematical optimization · 23%
Artificial intelligence
1 paper
Learning theory · 50% Probabilistic and Bayesian machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
entropy and divergence measures
0.922023
A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations · IEEE Trans. Inf. Theory 2023
Estimation for Models Defined by Conditions on Their L-Moments · IEEE Trans. Inf. Theory 2016
Mathematical optimization
constrained optimization
0.712023
A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations · IEEE Trans. Inf. Theory 2023
Information theory › information measures › divergence measures
kullback-leibler divergence
0.712023
A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations · IEEE Trans. Inf. Theory 2023
Information theory › information measures › entropy
shannon entropy
0.712023
A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations · IEEE Trans. Inf. Theory 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
maximum likelihood estimation
0.112016
Estimation for Models Defined by Conditions on Their L-Moments · IEEE Trans. Inf. Theory 2016
Machine learning › Learning theory
statistical estimation
0.112016
Estimation for Models Defined by Conditions on Their L-Moments · IEEE Trans. Inf. Theory 2016

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

monte carlo simulation · 0.7bare simulation · 0.7empirical minimum divergence · 0.5chi-square divergence · 0.5
YearPublicationVenuePosition
2023 A Precise Bare Simulation Approach to the Minimization of Some Distances. I. Foundations
abstract
In information theory — as well as in the adjacent fields of statistics, machine learning, artificial intelligence, signal processing and pattern recognition — many flexibilizations of the omnipresent Kullback-Leibler information distance (relative entropy) and of the closely related Shannon entropy have become frequently used tools. To tackle corresponding constrained minimization (respectively maximization) problems by a newly developed dimension-free bare (pure) simulation method, is the main goal of this paper. Almost no assumptions (like convexity) on the set of constraints are needed, within our discrete setup of arbitrary dimension, and our method is precise (i.e., converges in the limit). As a side effect, we also derive an innovative way of constructing new useful distances/divergences. To illustrate the core of our approach, we present numerous solved cases. The potential for wide-spread applicability is indicated, too; in particular, we deliver many recent references for uses of the involved distances/divergences and entropies in various different research fields (which may also serve as an interdisciplinary interface).
Michel Broniatowski, Wolfgang Stummer
IEEE Trans. Inf. Theory1
2016 Estimation for Models Defined by Conditions on Their L-Moments
abstract
This paper extends the empirical minimum divergence approach for models, which satisfy linear constraints with respect to the probability measure of the underlying variable (moment constraints) to the case where such constraints pertain to its quantile measure (called here semiparametric quantile models). The case when these constraints describe shape conditions as handled by the L-moments is considered, and both the description of these models as well as the resulting nonclassical minimum divergence procedures are presented. These models describe neighbourhoods of classical models used mainly for their tail behavior, for example, neighborhoods of Pareto or Weibull distributions, with which they may share the same first L-moments. The properties of the resulting estimators are illustrated by simulated examples comparing maximum likelihood estimators on Pareto and Weibull models to the minimum chi-square empirical divergence approach on semiparametric quantile models, and others.
Michel Broniatowski, Alexis Decurninge
IEEE Trans. Inf. Theory1