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

M. R. Gupta

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

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

Theory of computation · 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 · 88% Mathematical optimization · 12%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
divergence measures
0.112006
On minimizing distortion and relative entropy · IEEE Trans. Inf. Theory 2006
Information theory
minimum cross-entropy
0.112006
On minimizing distortion and relative entropy · IEEE Trans. Inf. Theory 2006
Mathematical optimization
constrained optimization
0.012006
On minimizing distortion and relative entropy · IEEE Trans. Inf. Theory 2006
Information theory
moment constraints
0.012006
On minimizing distortion and relative entropy · IEEE Trans. Inf. Theory 2006

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

relative entropy minimization · 0.1penalty formulation · 0.1
YearPublicationVenuePosition
2006 On minimizing distortion and relative entropy
abstract
A common approach for estimating a probability mass function w when given a prior q and moment constraints given by Aw/spl les/b is to minimize the relative entropy between w and q subject to the set of linear constraints. In such cases, the solution w is known to have exponential form. We consider the case in which the linear constraints are noisy, uncertain, infeasible, or otherwise "soft." A solution can then be obtained by minimizing both the relative entropy and violation of the constraints Aw/spl les/b. A penalty parameter /spl sigma/ weights the relative importance of these two objectives. We show that this penalty formulation also yields a solution w with exponential form. If the distortion is based on an /spl lscr//sub p/ norm, then the exponential form of w is shown to have exponential decay parameters that are bounded as a function of /spl sigma/. We also state conditions under which the solution w to the penalty formulation will result in zero distortion, so that the moment constraints hold exactly. These properties are useful in choosing penalty parameters, evaluating the impact of chosen penalty parameters, and proving properties about methods that use such penalty formulations.
Michael P. Friedlander, M. R. Gupta
IEEE Trans. Inf. Theory2