Find a function from a Recursive Formula

In summary, the conversation is discussing the solving of a function W_{t}^{x} from a recursive formula, where the expectation is with respect to \theta over the range (-\infty,\infty). The initial value for W^{0}_{0} or W^{x}_{t} is being determined for a one-armed bandit problem with Bernoulli probability \theta, which is a random variable being figured out through realization.
  • #1
loveinla
11
0
Hi,

I'd like to solve a function [tex]W_{t}^{x}[/tex] from a recursive formula below.

[tex]W_{t}^{x}=P_{t}^{x}*W_{t+1}^{x+1}+(1 - P_{t}^{x})*W_{t+1}^{x}[/tex],

where [tex]P_{t}^{x} = \frac{E[\theta^{x+1}*(1 - \theta)^{t-x}]}{E[\theta^{x}*(1-\theta)^{t-x}]}[/tex], [tex]{\underset{t\to\infty, x\to 0}{lim}}W_{t}^{x} =0[/tex]. Here [tex]E[/tex] stands for expectation.

Any suggestions? Thanks.
 
Mathematics news on Phys.org
  • #2
loveinla said:
[tex]E[/tex] stands for expectation.

Expectation with respect to which variable? Over what range of integration?
 
  • #3
Stephen Tashi said:
Expectation with respect to which variable? Over what range of integration?
I'd imagine on the only free variable in the expression for P, namely [itex]\theta[/itex], and over [itex](-\infty,\infty)[/itex]. But you do well in asking instead of guessing like yours truly. :)

What worries me most is that, in the recurrence rule for W, the "x" does not get any smaller. So what are supposed to be the initial values?
 
  • #4
dodo said:
I'd imagine on the only free variable in the expression for P, namely [itex]\theta[/itex], and over [itex](-\infty,\infty)[/itex]. But you do well in asking instead of guessing like yours truly. :)

What worries me most is that, in the recurrence rule for W, the "x" does not get any smaller. So what are supposed to be the initial values?

Thanks, you are right, the expectation is with respect to [itex]\theta[/itex], which is on [0,1].

The initial value is indeed what I am trying to find.

In fact, it is a one-armed bandit problem with Bernoulli probability [itex]\theta[/itex], but [itex]\theta[/itex] is a random variable we are trying to figure out through the realization.

Any idea on how to determine the initial value [itex]W^{0}_{0}[/itex] or [itex]W^{x}_{t}[/itex]?
 
  • #5


I would first suggest checking the validity of the recursive formula by plugging in different values for t and x and seeing if the formula holds true. If it does, then we can proceed with finding a function for W_{t}^{x}.

One possible approach could be to use the method of generating functions, where we define a generating function G(z) = \sum_{t=0}^{\infty}\sum_{x=0}^{\infty}W_{t}^{x}z^{t}y^{x} and try to find a closed form expression for it. This would involve manipulating the recursive formula and using techniques such as partial fraction decomposition and binomial expansion.

Another approach could be to use the concept of Markov chains, where we can view W_{t}^{x} as the probability of being in state (t,x) and use the transition probabilities given by P_{t}^{x} to construct a transition matrix. From there, we can find the stationary distribution of the Markov chain, which would give us a function for W_{t}^{x}.

Both of these approaches may require some mathematical background and may not necessarily yield a simple and straightforward solution. Another option could be to use numerical methods and solve for W_{t}^{x} for specific values of t and x. This could provide a more practical solution for real-world applications.

In any case, it would be important to thoroughly understand the assumptions and limitations of the recursive formula and the resulting function, and to validate the results through further analysis or experimentation.
 

1. What is a recursive formula?

A recursive formula is a mathematical equation that defines a sequence of terms based on the previous terms in the sequence. It is a way of expressing a pattern or relationship between terms in a sequence.

2. How do you find a function from a recursive formula?

To find a function from a recursive formula, you need to analyze the pattern in the sequence and determine the mathematical operations that are being used to generate the terms. Then, you can write a general function that represents this pattern and can be used to calculate any term in the sequence.

3. Can a recursive formula have multiple solutions?

Yes, a recursive formula can have multiple solutions. This can happen when there are different patterns or relationships that can generate the same sequence of terms. In this case, it is important to clearly define the conditions or restrictions for the formula to ensure that the correct solution is used.

4. Are there any limitations to using a recursive formula to find a function?

Yes, there are some limitations to using a recursive formula to find a function. Recursive formulas can only be used to represent linear relationships, meaning that the terms in the sequence must be related by a constant ratio or difference. They also cannot be used to represent non-numerical sequences.

5. Can a recursive formula be used to generate an infinite sequence?

Yes, a recursive formula can be used to generate an infinite sequence. As long as the pattern or relationship between terms is consistent and well-defined, the formula can continue to generate new terms without limit. This is often seen in mathematical sequences and series.

Similar threads

Replies
2
Views
1K
  • General Math
Replies
1
Views
893
  • General Math
Replies
3
Views
949
Replies
3
Views
1K
Replies
12
Views
1K
  • General Math
Replies
2
Views
723
  • General Math
Replies
5
Views
950
Replies
4
Views
411
Replies
2
Views
1K
Replies
18
Views
2K
Back
Top