EDBT 2026 Demo / reviewers in the wild / expert
Ashok Kumar Moses
dblp:13/11152
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 · 87% Mathematical optimization · 13% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures › entropy
entropy minimization |
0.4 | 2 | 2015 | Minimization Problems Based on Relative α-Entropy II: Reverse Projection · IEEE Trans. Inf. Theory 2015 Minimization Problems Based on Relative α-Entropy I: Forward Projection · IEEE Trans. Inf. Theory 2015 |
Information theory › information measures › divergence measures
kullback-leibler divergence |
0.4 | 2 | 2015 | Minimization Problems Based on Relative α-Entropy II: Reverse Projection · IEEE Trans. Inf. Theory 2015 Minimization Problems Based on Relative α-Entropy I: Forward Projection · IEEE Trans. Inf. Theory 2015 |
Information theory › information measures › divergence measures
rényi divergence |
0.4 | 2 | 2015 | Minimization Problems Based on Relative α-Entropy II: Reverse Projection · IEEE Trans. Inf. Theory 2015 Minimization Problems Based on Relative α-Entropy I: Forward Projection · IEEE Trans. Inf. Theory 2015 |
Mathematical optimization › continuous optimization
convex optimization |
0.1 | 1 | 2015 | Minimization Problems Based on Relative α-Entropy I: Forward Projection · IEEE Trans. Inf. Theory 2015 |
Mathematical optimization › continuous optimization › convex optimization
convex projections |
0.1 | 1 | 2015 | Minimization Problems Based on Relative α-Entropy I: Forward Projection · IEEE Trans. Inf. Theory 2015 |
Mathematical optimization
linear inequalities |
0.1 | 1 | 2015 | Minimization Problems Based on Relative α-Entropy II: Reverse Projection · IEEE Trans. Inf. Theory 2015 |
Methods — techniques the papers use, named apart from their topics
pythagorean property · 0.2power-law family · 0.2power-law distributions · 0.2log-convex family · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Minimization Problems Based on Relative α-Entropy I: Forward ProjectionabstractMinimization problems with respect to a one-parameter family of generalized relative entropies are studied. These relative entropies, which we term relative α-entropies (denoted Iα), arise as redundancies under mismatched compression when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the usual relative entropy (Kullback-Leibler divergence). Just like relative entropy, these relative α-entropies behave like squared Euclidean distance and satisfy the Pythagorean property. Minimizers of these relative α-entropies on closed and convex sets are shown to exist. Such minimizations generalize the maximum Rényi or Tsallis entropy principle. The minimizing probability distribution (termed forward Iα-projection) for a linear family is shown to obey a power-law. Other results in connection with statistical inference, namely subspace transitivity and iterated projections, are also established. In a companion paper, a related minimization problem of interest in robust statistics that leads to a reverse Iα-projection is studied. Ashok Kumar Moses, Rajesh Sundaresan |
IEEE Trans. Inf. Theory | 1 |
| 2015 | Minimization Problems Based on Relative α-Entropy II: Reverse ProjectionabstractIn part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted ℐα) were studied. Such minimizers were called forward ℐα-projections. Here, a complementary class of minimization problems leading to the so-called reverse ℐα-projections are studied. Reverse ℐα-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (α > 1) and in constrained compression settings (αα-projection into a forward ℐα-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints. Ashok Kumar Moses, Rajesh Sundaresan |
IEEE Trans. Inf. Theory | 1 |
| 2011 | Further results on geometric properties of a family of relative entropiesabstractThis paper extends some geometric properties of a one-parameter family of relative entropies. These arise as redundancies when cumulants of compressed lengths are considered instead of expected compressed lengths. These parametric relative entropies are a generalization of the Kullback-Leibler divergence. They satisfy the Pythagorean property and behave like squared distances. This property, which was known for finite alphabet spaces, is now extended for general measure spaces. Existence of projections onto convex and certain closed sets is also established. Our results may have applications in the Rényi entropy maximization rule of statistical physics. Ashok Kumar Moses, Rajesh Sundaresan |
ISIT | 1 |