en>Spectral sequence: /* Examples */ complex representation ring of a finite abelian group

2013-05-18T19:09:36Z

Examples: complex representation ring of a finite abelian group

New page

'''Regret''' (also called '''opportunity loss''') is defined as the difference between the actual payoff and the payoff that would have been obtained if a different course of action had been chosen. This is also called '''difference regret'''. Furthermore, the '''ratio regret''' is the ratio between the actual payoff and the best one.

==Minimax regret==
The [[minimax]] regret approach is to minimize the worst-case regret.<ref name="savage51">Savage, L.J. (I95I). The theory of statistical decision. ''Journal of the American Statistical Association,'' vol. 46, pp. 55-67.</ref> The aim of this is to perform as closely as possible to the optimal course. Since the minimax criterion applied here is to the regret (difference or ratio of the payoffs) rather than to the payoff itself, it is not as pessimistic as the ordinary minimax approach. Similar approaches have been used in a variety of areas such as:
* [[Hypothesis testing]]
* [[Prediction]]
* [[Economics]]

One benefit of minimax (as opposed to expected regret) is that it is independent of the probabilities of the various outcomes: thus if regret can be accurately computed, one can reliably use minimax regret. However, probabilities of outcomes are hard to estimate.

This differs from the standard minimax approach in that it uses ''differences'' or ''ratios'' between outcomes, and thus requires interval or ratio measurements, as well as [[ordinal measurement]]s (ranking), as in standard minimax.

===Maximin example===

Suppose an investor has to choose between investing in stocks, bonds or the money market, and the total return depends on what happens to interest rates. The following table shows some possible returns:

{| class="wikitable"
! Return !! Interest rates rise !! Static rates !! Interest rates fall || ''Worst return''
|-
! Stocks
| −4 || 4 || 12 || ''−4''
|-
! Bonds
| −2 || 3 || 8 || ''−2''
|-
! Money market
| 3 || 2 || 1 || ''1''
|-
| ''Best return''
| ''3'' || ''4'' || ''12''
|}

The crude maximin choice based on returns would be to invest in the money market, ensuring a return of at least 1. However, if interest rates fell then the regret associated with this choice would be large. This would be −11, which is the difference between the 1 received and the 12 which could have been received if the outturn had been known in advance. A mixed portfolio of about 11.1% in stocks and 88.9% in the money market would have ensured a return of at least 2.22; but, if interest rates fell, there would be a regret of about −9.78.

The regret table for this example, constructed by subtracting best returns from actual returns, is as follows:

{| class="wikitable"
! Regret !! Interest rates rise !! Static rates !! Interest rates fall || ''Worst regret''
|-
! Stocks
| −7 || 0 || 0 || ''−7''
|-
! Bonds
| −5 || −1 || −4 || ''−5''
|-
! Money market
| 0 || −2 || −11 || ''−11''
|}

Therefore, using a minimax choice based on regret, the best course would be to invest in bonds, ensuring a regret of no worse than −5. A mixed investment portfolio would do even better: 61.1% invested in stocks, and 38.9% in the money market would produce a regret no worse than about −4.28.

==Regret theory==

Regret theory is a model of choice under uncertainty. Developed by [[Graham Loomes]] and [[Robert Sugden (economist)|Robert Sugden]], it generalizes the minimax regret approach.<ref>Loomes, G. and Sugden, R. (1982), ‘Regret theory: An alternative theory of rational choice under uncertainty’, Economic Journal, 92(4), 805–24.</ref> Choice is modelled as the minimizing of a function of the regret vector, defined as the difference between the outcome yielded by a given choice and the best outcome that could have been achieved in that state of nature.

==Example: Linear estimation setting==
What follows is an illustration of how the concept of regret can be used to design a linear [[estimator]]. The regret is the difference between the [[mean-squared error]] (MSE) of the linear estimator that doesn't know the parameter <math>x</math>, and the mean-squared error (MSE) of the linear estimator that knows <math>x</math>. Also, since the estimator is restricted to be linear, the zero MSE cannot be achieved in the latter case.

Consider the problem of estimating the unknown deterministic parameter vector <math>x</math> from the noisy measurements in the linear model
:<math>y=Hx+w</math>
where <math>H</math> is a known <math>n \times m</math> matrix with full column rank <math>m</math>, and <math>w</math> is a zero mean random vector with covariance matrix <math>C_w</math>, which models the noise.

Let
:<math>\hat{x}=Gy</math>
be a linear estimate of <math>x</math> from <math>y</math>, where <math>G</math> is some <math>m \times n</math> matrix. The MSE of this estimator is given by
:<math>MSE = E\left(||\hat{x}-x||^2\right) = Tr(GC_wG^*) + x^*(I-GH)^*(I-GH)x.</math>

Since the MSE depends explicitly on <math>x</math> it cannot be minimized directly. Instead, the concept of regret can be used in order to define a linear estimator with good MSE performance. To define the regret here, consider a linear estimator that knows the value of the parameter <math>x</math>, i.e. the matrix <math>G</math> can explicitly depend on <math>x</math>:
:<math>\hat{x}^o=G(x)y.</math>
The MSE of <math>\hat{x}^o</math> is
:<math>MSE^o=E\left(||\hat{x}^o-x||^2\right) = Tr(G(x)C_wG(x)^*) + x^*(I-G(x)H)^*(I-G(x)H)x.</math>
To find the optimal <math>G(x)</math>, it is differentated with respect to <math>G</math> and equated to 0 getting
:<math>G(x)=xx^*H^*(C_w+Hxx^*H^*)^{-1}</math>
and using the Matrix Inversion Lemma
:<math>G(x)=\frac{1}{1+x^*H^*C_w^{-1}Hx}xx^*H^*C_w^{-1}.</math>
Substituting this <math>G(x)</math> back into <math>MSE^o</math>
:<math>MSE^o=\frac{x^*x}{1+x^*H^*C_w^{-1}Hx}.</math>
This is the smallest MSE achievable with a linear estimate that knows <math>x</math>. In practice this MSE cannot be achieved, but it serves as a bound on the optimal MSE. The regret is defined by
:<math>R(x,G)=MSE-MSE^o=Tr(GC_wG^*) + x^*(I-GH)^*(I-GH)x-\frac{x^*x}{1+x^*H^*C_w^{-1}Hx}.</math>
The minimax regret approach here is to minimize the worst-case regret as defined above. This will allow a performance as close as possible to the best achievable performance in the worst case of the parameter <math>x</math>. Although this problem appears difficult, it can be formulated as a [[convex optimization]] problem and solved definitely. For details of this see Eldar, Tal and Nemirovski (2004).<ref>Y. C. Eldar, A. Ben-Tal, and A. Nemirovski, "Linear Minimax regret estimation of deterministic parameters with bounded data uncertainties," IEEE Trans. Signal Process., vol. 52, no. 8, pp. 2177–2188, Aug. 2004.</ref> Similar ideas can be used when <math>x</math> is random with uncertainty in the [[covariance matrix]]. For this see Eldar and Merhav (2004), and Eldar and Merhav (2005).<ref>Y. C. Eldar and Neri Merhav, "A Competitive Minimax Approach to Robust Estimation of Random Parameters," IEEE Trans. Signal Processing, vol. 52, pp. 1931-1946, July 2004.</ref><ref>Y. C. Eldar and Neri Merhav, "Minimax MSE-Ratio Estimation with Signal Covariance Uncertainties," IEEE Trans. Signal Processing, vol. 53, no. 4, pp. 1335-1347, Apr. 2005.</ref>

==See also==
* [[Decision theory]]
* [[Info-gap decision theory]]
* [[Loss function]]
* [[Minimax]]
* [[Wald's maximin model]]
* [[Regret (emotion)]]

==References==

<references />

==External links==
* [http://philosophy.hku.hk/think/strategy/decision.php TUTORIAL G05: Decision theory]

[[Category:Decision theory]]
[[Category:Optimal decisions]]

Representation ring - Revision history

en>Spectral sequence: /* Examples */ complex representation ring of a finite abelian group