Does Maximizing Likelihood Over Truncated Support Increase Probability?

  • Context: Graduate 
  • Thread starter Thread starter kullbach_liebler
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the implications of maximizing likelihood over truncated support in probability density functions (pdf) defined by a parameter vector ##\mathbf{v}_0##. It establishes that if the cardinality of the intersection of sets ##\mathcal{B}## and ##\mathcal{A}## exceeds that of the complement, then the maximum likelihood estimate will surpass the likelihood evaluated at ##\mathbf{v}_0##. The participants also explore how to enhance the presentation of the proposition and inquire about the conditions under which the statement holds true.

PREREQUISITES
  • Understanding of probability density functions (pdf) and parameter estimation
  • Familiarity with the concepts of finite support and truncated distributions
  • Knowledge of mathematical notation and summation in statistics
  • Basic principles of likelihood maximization in statistical inference
NEXT STEPS
  • Research "Likelihood Maximization in Statistical Models" for deeper insights
  • Study "Truncated Distributions and Their Applications" to understand practical implications
  • Explore "Parameter Estimation Techniques in Statistics" for various methodologies
  • Investigate "Presentation Techniques for Statistical Propositions" to improve clarity
USEFUL FOR

Statisticians, data scientists, and researchers involved in statistical modeling and parameter estimation, particularly those focused on likelihood methods and truncated distributions.

kullbach_liebler
Messages
1
Reaction score
0
Suppose ##\mathbf{X}## is a random variable with a finite support ##\Omega## and with some pdf ##f(\cdot; \mathbf{v}_0)## where ##\mathbf{v}_0## is the parameter vector. Define, ##\mathcal{A}:= \{\mathbf{x}:S(\mathbf{x}) \geq \gamma\} \subset \Omega## and ##\tilde{\mathbf{x}}:=S(\tilde{\mathbf{x}}) = \gamma##, ##\mathcal{B}:=\{\mathbf{x} \geq \tilde{\mathbf{x}}\}## where ##S:\mathbf{x} \mapsto \mathbb{R}^n##. Moreover, suppose that,

$$\#(\mathcal{B} \cap \mathcal{A}) > \#(\neg \mathcal{B} \cap \mathcal{A})$$
and
$$!\exists \mathbf{x}^*>\tilde{\mathbf{x}}:=\arg \max_{\mathbf{x}}S(\mathbf{x}).$$

Then, it implies that,

\begin{align}
\max_{\mathbf{v}}\sum_{\mathbf{x} :S(\mathbf{x}) \geq \gamma} f(\mathbf{x};\mathbf{v}) > \sum_{\mathbf{x} :S(\mathbf{x}) \geq \gamma} f(\mathbf{x};\mathbf{v}_0)
\end{align}

My questions:

1) Is the statement true?;
2) How could I improve the presentation of this proposition?;
3) What are the mildest possible conditions under which (1) will hold?
 
Last edited:
Physics news on Phys.org
kullbach_liebler said:
2) How could I improve the presentation of this proposition?;
I don't know what a statistical journal would want, but for the purpose of getting an answer on an internet forum, you could give a more verbal statement of the proposition before presenting it using only notation.

\begin{align}
\max_{\mathbf{v}}\sum_{\mathbf{x} :S(\mathbf{x}) \geq \gamma} f(\mathbf{x};\mathbf{v}) > \sum_{\mathbf{x} :S(\mathbf{x}) \geq \gamma} f(\mathbf{x};\mathbf{v}_0)
\end{align}

This appears to say the maximum value of a function ( which is a summation rather than an integration) when taken over a set is greater than the value of that function evaluated at the particular element ##v_o## in that set. Is that the general idea?
 
kullbach_liebler said:
1) Is the statement true?
Let ## \mathbf{v_max} ## be a value of ## \mathbf{v} ## which maximizes the sum. What happens when ## \mathbf{v_0} = \mathbf{v_max} ##?
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 16 ·
Replies
16
Views
7K
  • · Replies 28 ·
Replies
28
Views
7K
Replies
1
Views
4K
  • · Replies 39 ·
2
Replies
39
Views
13K
Replies
1
Views
2K