User:IssaRice/Logical induction notation: Difference between revisions
No edit summary |
No edit summary |
||
| Line 9: | Line 9: | ||
| Holdings from <math>T</math> against <math>\overline{\mathbb P}</math> (a <math>\mathbb Q</math>-combination)|| <math>T(\overline{\mathbb P})</math> || <math>\mathcal S \cup \{0,1\} \to \mathbb Q</math> || || | | Holdings from <math>T</math> against <math>\overline{\mathbb P}</math> (a <math>\mathbb Q</math>-combination)|| <math>T(\overline{\mathbb P})</math> || <math>\mathcal S \cup \{0,1\} \to \mathbb Q</math> || || | ||
|} | |} | ||
Example of a 5-strategy given on p. 18 of the paper: | |||
:<math>\left[(\neg\neg\phi)^{*5} -\phi^{*5}\right] \cdot (\phi - \phi^{*5}) + \left[\phi^{*5} - (\neg \neg \phi)^{*5}\right] \cdot \left(\neg\neg\phi - (\neg\neg\phi)^{*5}\right)</math> | |||
Since the coefficients are in <math>\mathcal F_5</math>, this is an <math>\mathcal F_5</math>-combination. Let's call this 5-strategy <math>T_5</math>. We can pick out the coefficient for the <math>\phi</math> term like <math>T_5[\phi] = (\neg\neg\phi)^{*5} -\phi^{*5}</math>. But since each coefficient is a feature (which is a function), we can also apply each coefficient to some valuation sequence <math>\overline{\mathbb V}</math>, like this: | |||
:<math>T_5(\overline{\mathbb V}) = \left[(\neg\neg\phi)^{*5}(\overline{\mathbb V}) -\phi^{*5}(\overline{\mathbb V})\right] \cdot (\phi - \phi^{*5}(\overline{\mathbb V})) + \left[\phi^{*5}(\overline{\mathbb V}) - (\neg \neg \phi)^{*5}(\overline{\mathbb V})\right] \cdot \left(\neg\neg\phi - (\neg\neg\phi)^{*5}(\overline{\mathbb V})\right)</math> | |||
Now each coefficient is a real number, so <math>T_5(\overline{\mathbb V})</math> is an <math>\mathbb R</math>-combination. | |||
==External links== | ==External links== | ||
Revision as of 02:32, 3 August 2018
This is in user space because it's not really about machine learning.
| Term | Notation | Type | Definition | Notes |
|---|---|---|---|---|
| -combination | Function application of an -combination uses square brackets instead of parentheses. Why? As far as I can tell, this is because each coefficient is in so is itself a function. This means we have two senses of "application": we can pick out the specific coefficient we want (square brackets), or we can apply each coefficient to return something (parentheses). | |||
| Holdings from against (a -combination) |
Example of a 5-strategy given on p. 18 of the paper:
Since the coefficients are in , this is an -combination. Let's call this 5-strategy . We can pick out the coefficient for the term like . But since each coefficient is a feature (which is a function), we can also apply each coefficient to some valuation sequence , like this:
Now each coefficient is a real number, so is an -combination.