• Nem Talált Eredményt

Principal component and constantly re-balanced portfolio

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Principal component and constantly re-balanced portfolio"

Copied!
65
0
0

Teljes szövegt

(1)

Principal component and constantly re-balanced portfolio

Gy¨orgy Ottucs´ak1 aszl´o Gy¨orfi

1Department of Computer Science and Information Theory Budapest University of Technology and Economics

Budapest, Hungary

September 20, 2007 e-mail: oti@szit.bme.hu

www.szit.bme.hu/˜oti

www.szit.bme.hu/˜oti/portfolio

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(2)

Investment in the stock market: Growth rate

The model:

d assets

Sn(j) price of asset j at the end of trading period (day) n initial price S0(j)= 1,

Sn(j)=enWn(j) ≈enW(j) j = 1, . . . ,d average growth rate

Wn(j)= 1 nlnSn(j) asymptotic average growth rate

W(j)= lim

n→∞

1 nlnSn(j)

(3)

Investment in the stock market: Growth rate

The model:

d assets

Sn(j) price of asset j at the end of trading period (day) n initial price S0(j)= 1,

Sn(j)=enWn(j) ≈enW(j) j = 1, . . . ,d average growth rate

Wn(j)= 1 nlnSn(j) asymptotic average growth rate

W(j)= lim

n→∞

1 nlnSn(j)

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(4)

Investment in the stock market: Growth rate

The model:

d assets

Sn(j) price of asset j at the end of trading period (day) n initial price S0(j)= 1,

Sn(j)=enWn(j)

≈enW(j)

j = 1, . . . ,d average growth rate

Wn(j)= 1 nlnSn(j)

asymptotic average growth rate W(j)= lim

n→∞

1 nlnSn(j)

(5)

Investment in the stock market: Growth rate

The model:

d assets

Sn(j) price of asset j at the end of trading period (day) n initial price S0(j)= 1,

Sn(j)=enWn(j) ≈enW(j) j = 1, . . . ,d average growth rate

Wn(j)= 1 nlnSn(j) asymptotic average growth rate

W(j)= lim

n→∞

1 nlnSn(j)

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(6)

Static portfolio selection: single period investment

The aim is to achieve maxjW(j).

Static portfolio selection:

Fix a portfolio vectorb= (b(1), . . .b(d)).

S0b(j) denotes the proportion of the investor’s capital invested in asset j. Assumptions:

no short-salesb(j) 0 self-financingP

jb(j)= 1

Aftern day

Sn =S0X

j

b(j)Sn(j)

Use the following simple bound S0max

j b(j)Sn(j)≤Sn≤dS0max

j b(j)Sn(j)

(7)

Static portfolio selection: single period investment

The aim is to achieve maxjW(j). Static portfolio selection:

Fix a portfolio vectorb= (b(1), . . .b(d)).

S0b(j) denotes the proportion of the investor’s capital invested in asset j. Assumptions:

no short-salesb(j) 0 self-financingP

jb(j)= 1

Aftern day

Sn =S0X

j

b(j)Sn(j)

Use the following simple bound S0max

j b(j)Sn(j)≤Sn≤dS0max

j b(j)Sn(j)

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(8)

Static portfolio selection: single period investment

The aim is to achieve maxjW(j). Static portfolio selection:

Fix a portfolio vectorb= (b(1), . . .b(d)).

S0b(j) denotes the proportion of the investor’s capital invested in asset j. Assumptions:

no short-salesb(j) 0 self-financingP

jb(j)= 1

Aftern day

Sn =S0X

j

b(j)Sn(j)

Use the following simple bound S0max

j b(j)Sn(j)≤Sn≤dS0max

j b(j)Sn(j)

(9)

Static portfolio selection: single period investment

The aim is to achieve maxjW(j). Static portfolio selection:

Fix a portfolio vectorb= (b(1), . . .b(d)).

S0b(j) denotes the proportion of the investor’s capital invested in asset j. Assumptions:

no short-salesb(j) 0 self-financingP

jb(j)= 1

Aftern day

Sn =S0X

j

b(j)Sn(j)

Use the following simple bound S0max

j b(j)Sn(j)≤Sn≤dS0max

j b(j)Sn(j)

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(10)

assume thatb(j)>0 1

nln max

j

S0b(j)Sn(j)

≤ 1

nlnSn≤ 1 n ln

dS0max

j b(j)Sn(j)

maxj

1

nlnS0b(j)+ 1 nlnSn(j)

≤ 1 n lnSn

≤max

j

1

nln(dS0b(j)) +1 nlnSn(j)

n→∞lim 1

nlnSn= lim

n→∞max

j

1

nlnSn(j)= max

j W(j)

Conclusion: any static portfolio achieves the maximal growth rate maxjW(j). We can do much better!

(11)

assume thatb(j)>0 1

nln max

j

S0b(j)Sn(j)

≤ 1

nlnSn≤ 1 n ln

dS0max

j b(j)Sn(j)

maxj

1

nlnS0b(j)+ 1 nlnSn(j)

≤ 1 n lnSn

≤max

j

1

nln(dS0b(j)) +1 nlnSn(j)

n→∞lim 1

nlnSn= lim

n→∞max

j

1

nlnSn(j)= max

j W(j)

Conclusion: any static portfolio achieves the maximal growth rate maxjW(j). We can do much better!

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(12)

assume thatb(j)>0 1

nln max

j

S0b(j)Sn(j)

≤ 1

nlnSn≤ 1 n ln

dS0max

j b(j)Sn(j)

maxj

1

nlnS0b(j)+ 1 nlnSn(j)

≤ 1 n lnSn

≤max

j

1

nln(dS0b(j)) +1 nlnSn(j)

n→∞lim 1

nlnSn= lim

n→∞max

j

1

nlnSn(j)= max

j W(j)

Conclusion: any static portfolio achieves the maximal growth rate maxjW(j).

We can do much better!

(13)

assume thatb(j)>0 1

nln max

j

S0b(j)Sn(j)

≤ 1

nlnSn≤ 1 n ln

dS0max

j b(j)Sn(j)

maxj

1

nlnS0b(j)+ 1 nlnSn(j)

≤ 1 n lnSn

≤max

j

1

nln(dS0b(j)) +1 nlnSn(j)

n→∞lim 1

nlnSn= lim

n→∞max

j

1

nlnSn(j)= max

j W(j)

Conclusion: any static portfolio achieves the maximal growth rate maxjW(j). We can do much better!

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(14)

Dynamic portfolio selection: multi-period investment

The model:

Let xi = (xi(1), . . .xi(d)) the return vector on trading periodi, where

xi(j)= Si(j) Si−1(j) .

is the price relatives of two consecutive days.

xi(j) is the factor by which capital invested in stock j grows during the market periodi

One of the simplest dynamic portfolio strategy is the Constantly Re-balanced Portfolio (CRP):

Fix a portfolio vectorb= (b(1), . . .b(d)), where b(j) gives the proportion of the investor’s capital invested in stockj. Thisbis the portfolio vector for each trading day.

(15)

Dynamic portfolio selection: multi-period investment

The model:

Let xi = (xi(1), . . .xi(d)) the return vector on trading periodi, where

xi(j)= Si(j) Si−1(j) .

is the price relatives of two consecutive days.

xi(j) is the factor by which capital invested in stock j grows during the market periodi

One of the simplest dynamic portfolio strategy is the Constantly Re-balanced Portfolio (CRP):

Fix a portfolio vectorb= (b(1), . . .b(d)), where b(j) gives the proportion of the investor’s capital invested in stockj. Thisbis the portfolio vector for each trading day.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(16)

Dynamic portfolio selection: multi-period investment

The model:

Let xi = (xi(1), . . .xi(d)) the return vector on trading periodi, where

xi(j)= Si(j) Si−1(j) .

is the price relatives of two consecutive days.

xi(j) is the factor by which capital invested in stock j grows during the market periodi

One of the simplest dynamic portfolio strategy is the Constantly Re-balanced Portfolio (CRP):

Fix a portfolio vectorb= (b(1), . . .b(d)), where b(j) gives the proportion of the investor’s capital invested in stockj.

Thisbis the portfolio vector for each trading day.

(17)

Dynamic portfolio selection: multi-period investment

The model:

Let xi = (xi(1), . . .xi(d)) the return vector on trading periodi, where

xi(j)= Si(j) Si−1(j) .

is the price relatives of two consecutive days.

xi(j) is the factor by which capital invested in stock j grows during the market periodi

One of the simplest dynamic portfolio strategy is the Constantly Re-balanced Portfolio (CRP):

Fix a portfolio vectorb= (b(1), . . .b(d)), where b(j) gives the proportion of the investor’s capital invested in stockj. Thisbis the portfolio vector for each trading day.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(18)

Dynamic portfolio selection: multi-period investment:2

Repeatedly investment:

for the first trading period S0 denotes the initial capital S1=S0

d

X

j=1

b(j)x1(j)=S0hb,x1i

for the second trading period, S1 new initial capital S2 =S1· hb,x2i=S0· hb,x1i · hb,x2i. for the nth trading period:

Sn=Sn−1hb,xni=S0

n

Y

i=1

hb,xii

=S0enWn(b)

with the average growth rate Wn(b) = 1

n

n

X

i=1

lnhb,xii.

(19)

Dynamic portfolio selection: multi-period investment:2

Repeatedly investment:

for the first trading period S0 denotes the initial capital S1=S0

d

X

j=1

b(j)x1(j)=S0hb,x1i for the second trading period, S1 new initial capital

S2 =S1· hb,x2i=S0· hb,x1i · hb,x2i.

for the nth trading period: Sn=Sn−1hb,xni=S0

n

Y

i=1

hb,xii

=S0enWn(b)

with the average growth rate Wn(b) = 1

n

n

X

i=1

lnhb,xii.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(20)

Dynamic portfolio selection: multi-period investment:2

Repeatedly investment:

for the first trading period S0 denotes the initial capital S1=S0

d

X

j=1

b(j)x1(j)=S0hb,x1i for the second trading period, S1 new initial capital

S2 =S1· hb,x2i=S0· hb,x1i · hb,x2i. for the nth trading period:

Sn=Sn−1hb,xni=S0

n

Y

i=1

hb,xii

=S0enWn(b) with the average growth rate

Wn(b) = 1 n

n

X

i=1

lnhb,xii.

(21)

Dynamic portfolio selection: multi-period investment:2

Repeatedly investment:

for the first trading period S0 denotes the initial capital S1=S0

d

X

j=1

b(j)x1(j)=S0hb,x1i for the second trading period, S1 new initial capital

S2 =S1· hb,x2i=S0· hb,x1i · hb,x2i. for the nth trading period:

Sn=Sn−1hb,xni=S0

n

Y

i=1

hb,xii =S0enWn(b) with the average growth rate

Wn(b) = 1 n

n

X

i=1

lnhb,xii.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(22)

log-optimum portfolio

The CRP is the optimal portfolio for special market process, where X1,X2, . . . is independent and identically distributed (i.i.d.)

Log-optimum portfoliob

E{lnhb,X1i}= max

b E{lnhb,X1i}

Best Constantly Re-balanced Portfolio (BCRP) Properties:

needed full-knowledge on the distribution

in experiments: not a causal strategy. We can calculate it only in hindsight.

(23)

log-optimum portfolio

The CRP is the optimal portfolio for special market process, where X1,X2, . . . is independent and identically distributed (i.i.d.)

Log-optimum portfoliob

E{lnhb,X1i}= max

b E{lnhb,X1i}

Best Constantly Re-balanced Portfolio (BCRP)

Properties:

needed full-knowledge on the distribution

in experiments: not a causal strategy. We can calculate it only in hindsight.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(24)

log-optimum portfolio

The CRP is the optimal portfolio for special market process, where X1,X2, . . . is independent and identically distributed (i.i.d.)

Log-optimum portfoliob

E{lnhb,X1i}= max

b E{lnhb,X1i}

Best Constantly Re-balanced Portfolio (BCRP) Properties:

needed full-knowledge on the distribution

in experiments: not a causal strategy. We can calculate it only in hindsight.

(25)

log-optimum portfolio

The CRP is the optimal portfolio for special market process, where X1,X2, . . . is independent and identically distributed (i.i.d.)

Log-optimum portfoliob

E{lnhb,X1i}= max

b E{lnhb,X1i}

Best Constantly Re-balanced Portfolio (BCRP) Properties:

needed full-knowledge on the distribution

in experiments: not a causal strategy. We can calculate it only in hindsight.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(26)

Optimality

IfSn =Sn(b) denotes the capital after trading periodn achieved by a log-optimum portfolio strategyb, then for any portfolio strategybwith capital Sn=Sn(b) and for any i.i.d. process {Xn}−∞,

n→∞lim 1

nlnSn≤ lim

n→∞

1

nlnSn almost surely

and

n→∞lim 1

n lnSn =W almost surely, where

W =E{lnhb,X1i} is the maximal growth rate of any portfolio.

(27)

Optimality

IfSn =Sn(b) denotes the capital after trading periodn achieved by a log-optimum portfolio strategyb, then for any portfolio strategybwith capital Sn=Sn(b) and for any i.i.d. process {Xn}−∞,

n→∞lim 1

nlnSn≤ lim

n→∞

1

nlnSn almost surely and

n→∞lim 1

n lnSn =W almost surely, where

W =E{lnhb,X1i}

is the maximal growth rate of any portfolio.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(28)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop. semi-log-optimal:

arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

(29)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal: arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(30)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal:

arg max

b

E{h(hb,X1i)}

=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

(31)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal:

arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(32)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal:

arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP)

Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

(33)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal:

arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88, 2007. http://www.szit.bme.hu/˜oti/portfolio/articles/marko.pdf

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(34)

Semi-log-optimal portfolio

log-optimal:

arg max

b

E{lnhb,X1i}

It is a non-linear (convex) optimization problem with linear constraints. Calculation: not cheap.

Idea: use the Taylor expansion:

lnz ≈h(z) =z−1−1

2(z−1)2

Only the two biggest principal components, others are drop.

semi-log-optimal:

arg max

b

E{h(hb,X1i)}=arg max

b

{hb,mi − hb,Cbi}

Cheaper: Quadratic Programming (QP) Connection to the Markowitz theory.

Gy. Ottucs´ak and I. Vajda, ”An Asymptotic Analysis of the

Mean-Variance portfolio selection”,Statistics&Decisions, 25, pp. 63-88,

(35)

Principal component

We may write

E{hb,X1i −1} −1

2E{(hb,X1i −1)2}

= 2E{hb,X1i} −1

2E{hb,X1i2} −3 2

= −1

2E{(hb,X1i −2)2}+1 2 then

arg max

b

−1

2E{(hb,X1i −2)2}+1 2 =

arg min

b

E{(hb,X1i −2)2}, that is, we are looking for the portfolio which minimize the expected squared error.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(36)

Principal component

We may write

E{hb,X1i −1} −1

2E{(hb,X1i −1)2}

= 2E{hb,X1i} −1

2E{hb,X1i2} −3 2

= −1

2E{(hb,X1i −2)2}+1 2 then

arg max

b

−1

2E{(hb,X1i −2)2}+1 2 =

arg min

b

E{(hb,X1i −2)2}, that is, we are looking for the portfolio which minimize the expected squared error.

(37)

Principal component

We may write

E{hb,X1i −1} −1

2E{(hb,X1i −1)2}

= 2E{hb,X1i} −1

2E{hb,X1i2} −3 2

= −1

2E{(hb,X1i −2)2}+1 2

then

arg max

b

−1

2E{(hb,X1i −2)2}+1 2 =

arg min

b

E{(hb,X1i −2)2}, that is, we are looking for the portfolio which minimize the expected squared error.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(38)

Principal component

We may write

E{hb,X1i −1} −1

2E{(hb,X1i −1)2}

= 2E{hb,X1i} −1

2E{hb,X1i2} −3 2

= −1

2E{(hb,X1i −2)2}+1 2 then

arg max

b

−1

2E{(hb,X1i −2)2}+1 2 =

arg min

b

E{(hb,X1i −2)2}, that is, we are looking for the portfolio which minimize the

(39)

Conditions of the model:

Assume that

the assets are arbitrarily divisible,

the assets are available in unbounded quantities at the current price at any given trading period,

there are no transaction costs, (go to Session 1 today at 17.30)

the behavior of the market is not affected by the actions of the investor using the strategy under investigation.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(40)

Conditions of the model:

Assume that

the assets are arbitrarily divisible,

the assets are available in unbounded quantities at the current price at any given trading period,

there are no transaction costs, (go to Session 1 today at 17.30)

the behavior of the market is not affected by the actions of the investor using the strategy under investigation.

(41)

Conditions of the model:

Assume that

the assets are arbitrarily divisible,

the assets are available in unbounded quantities at the current price at any given trading period,

there are no transaction costs, (go to Session 1 today at 17.30)

the behavior of the market is not affected by the actions of the investor using the strategy under investigation.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(42)

Conditions of the model:

Assume that

the assets are arbitrarily divisible,

the assets are available in unbounded quantities at the current price at any given trading period,

there are no transaction costs, (go to Session 1 today at 17.30)

the behavior of the market is not affected by the actions of the investor using the strategy under investigation.

(43)

NYSE data sets

Atwww.szit.bme.hu/~oti/portfolio there are two benchmark data sets fromNYSE:

The first data set consists of daily data of 36 stocks with length 22 years.

The second data set contains 23 stocks and has length 44 years.

Both sets are corrected with the dividends.

Our experiment is on the second data set.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(44)

NYSE data sets

Atwww.szit.bme.hu/~oti/portfolio there are two benchmark data sets fromNYSE:

The first data set consists of daily data of 36 stocks with length 22 years.

The second data set contains 23 stocks and has length 44 years.

Both sets are corrected with the dividends.

Our experiment is on the second data set.

(45)

Experimental results on CRP

Stock’s name AAY BCRP

log-NLP weights semi-log-QP weights

COMME 18% 0.3028 0.2962

HP 15% 0.0100 0.0317

KINAR 4% 0.2175 0.2130

MORRIS 20% 0.4696 0.4590

AAY 24% 24%

running time (sec) 9002 3

Table: Comparison of the two algorithms for CRPs.

The other 19 assets have 0 weight KINAR had the smallest AAY

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(46)

Experimental results on CRP

Stock’s name AAY BCRP

log-NLP weights semi-log-QP weights

COMME 18% 0.3028 0.2962

HP 15% 0.0100 0.0317

KINAR 4% 0.2175 0.2130

MORRIS 20% 0.4696 0.4590

AAY 24% 24%

running time (sec) 9002 3

Table: Comparison of the two algorithms for CRPs.

The other 19 assets have 0 weight

KINAR had the smallest AAY

(47)

Experimental results on CRP

Stock’s name AAY BCRP

log-NLP weights semi-log-QP weights

COMME 18% 0.3028 0.2962

HP 15% 0.0100 0.0317

KINAR 4% 0.2175 0.2130

MORRIS 20% 0.4696 0.4590

AAY 24% 24%

running time (sec) 9002 3

Table: Comparison of the two algorithms for CRPs.

The other 19 assets have 0 weight KINAR had the smallest AAY

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(48)

Dynamic portfolio selection: Causal-CRP

BCRP is not a causal strategy. A simple causal version could be, that we use the CRP that was optimal up ton−1 for the next (nth) day.

Stock’s name AAY BCRP CCRP Static

log-NLP w. semi-log-QP w.

COMME 18% 0.3028 0.2962

HP 15% 0.0100 0.0317

KINAR 4% 0.2175 0.2130

MORRIS 20% 0.4696 0.4590

AAY 24% 24% 14% 16%

running t. (sec) 9002 3 111 3

we can even do much better!!

(49)

Dynamic portfolio selection: Causal-CRP

BCRP is not a causal strategy. A simple causal version could be, that we use the CRP that was optimal up ton−1 for the next (nth) day.

Stock’s name AAY BCRP CCRP Static

log-NLP w. semi-log-QP w.

COMME 18% 0.3028 0.2962

HP 15% 0.0100 0.0317

KINAR 4% 0.2175 0.2130

MORRIS 20% 0.4696 0.4590

AAY 24% 24% 14% 16%

running t. (sec) 9002 3 111 3

we can even do much better!!

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(50)

Dynamic portfolio selection: general case

xi = (xi(1), . . .xi(d)) the return vector on day i b=b1 is the portfolio vector for the first day initial capitalS0

S1=S0· hb1,x1i

for the second day,S1 new initial capital, the portfolio vector b2=b(x1)

S2 =S0· hb1,x1i · hb(x1),x2i.

nth day a portfolio strategy bn=b(x1, . . . ,xn−1) =b(xn−11 ) Sn=S0

n

Y

i=1

D

b(xi−11 ),xi E

=

S0enWn(B)

with the average growth rate Wn(B) = 1

n

n

X

i=1

ln D

b(xi−11 ),xi

E .

(51)

Dynamic portfolio selection: general case

xi = (xi(1), . . .xi(d)) the return vector on day i b=b1 is the portfolio vector for the first day initial capitalS0

S1=S0· hb1,x1i

for the second day,S1 new initial capital, the portfolio vector b2=b(x1)

S2 =S0· hb1,x1i · hb(x1),x2i.

nth day a portfolio strategy bn=b(x1, . . . ,xn−1) =b(xn−11 ) Sn=S0

n

Y

i=1

D

b(xi−11 ),xi E

=

S0enWn(B)

with the average growth rate Wn(B) = 1

n

n

X

i=1

ln D

b(xi−11 ),xi

E .

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(52)

Dynamic portfolio selection: general case

xi = (xi(1), . . .xi(d)) the return vector on day i b=b1 is the portfolio vector for the first day initial capitalS0

S1=S0· hb1,x1i

for the second day,S1 new initial capital, the portfolio vector b2=b(x1)

S2 =S0· hb1,x1i · hb(x1),x2i.

nth day a portfolio strategy bn=b(x1, . . . ,xn−1) =b(xn−11 ) Sn=S0

n

Y

i=1

D

b(xi−11 ),xi E

=

S0enWn(B)

with the average growth rate Wn(B) = 1

n

n

X

i=1

ln D

b(xi−11 ),xi

E .

(53)

Dynamic portfolio selection: general case

xi = (xi(1), . . .xi(d)) the return vector on day i b=b1 is the portfolio vector for the first day initial capitalS0

S1=S0· hb1,x1i

for the second day,S1 new initial capital, the portfolio vector b2=b(x1)

S2 =S0· hb1,x1i · hb(x1),x2i.

nth day a portfolio strategy bn=b(x1, . . . ,xn−1) =b(xn−11 ) Sn=S0

n

Y

i=1

D

b(xi−11 ),xi E

=S0enWn(B) with the average growth rate

Wn(B) = 1 n

n

X

i=1

ln D

b(xi−11 ),xi

E .

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(54)

log-optimum portfolio

X1,X2, . . . drawn from the vector valued stationary and ergodic process

log-optimum portfolioB ={b(·)}

E{ln

b(Xn−11 ),Xn

|Xn−11 }= max

b(·) E{ln

b(Xn−11 ),Xn

|Xn−11 }

Xn−11 =X1, . . . ,Xn−1

(55)

Optimality

Algoet and Cover (1988): IfSn =Sn(B) denotes the capital after dayn achieved by a log-optimum portfolio strategyB, then for any portfolio strategyBwith capital Sn=Sn(B) and for any process{Xn}−∞,

lim sup

n→∞

1

n lnSn−1 nlnSn

≤0 almost surely for stationary ergodic process{Xn}−∞.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(56)

Kernel-based portfolio selection

fix integersk, `= 1,2, . . . elementary portfolios

choose the radiusrk,`>0 such that for any fixed k,

`→∞lim rk,`= 0.

forn >k+ 1, define the expertb(k,`) by b(k,`)(xn−11 ) =arg max

b

X

{k<i<n:kxi−1i−k−xn−1n−kk≤rk,`}

lnhb,xii,

if the sum is non-void, andb0= (1/d, . . . ,1/d) otherwise.

(57)

Kernel-based portfolio selection

fix integersk, `= 1,2, . . . elementary portfolios

choose the radiusrk,`>0 such that for any fixed k,

`→∞lim rk,`= 0.

forn >k+ 1, define the expertb(k,`) by b(k,`)(xn−11 ) =arg max

b

X

{k<i<n:kxi−1i−k−xn−1n−kk≤rk,`}

lnhb,xii,

if the sum is non-void, andb0= (1/d, . . . ,1/d) otherwise.

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(58)

Combining elementary portfolios

let{qk,`} be a probability distribution on the set of all pairs (k, `) such that for allk, `,qk,`>0.

The strategyBis the combination of the elementary portfolio strategiesB(k,`)={b(k,`)n }such that the investor’s capital becomes

Sn(B) =X

k,`

qk,`Sn(B(k,`)).

(59)

Combining elementary portfolios

let{qk,`} be a probability distribution on the set of all pairs (k, `) such that for allk, `,qk,`>0.

The strategyBis the combination of the elementary portfolio strategiesB(k,`)={b(k,`)n }such that the investor’s capital becomes

Sn(B) =X

k,`

qk,`Sn(B(k,`)).

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(60)

Experiments on average annual yields (AAY)

Kernel based log-optimal portfolio selection with k= 1, . . . ,5 and `= 1, . . . ,10

rk,`2 = 0.0001·d·k·`,

AAY of kernel based semi-log-optimal portfolio is 128% double the capital

MORRIS had the best AAY, 20% the BCRP had average AAY 24%

(61)

Experiments on average annual yields (AAY)

Kernel based log-optimal portfolio selection with k= 1, . . . ,5 and `= 1, . . . ,10

rk,`2 = 0.0001·d·k·`,

AAY of kernel based semi-log-optimal portfolio is 128%

double the capital

MORRIS had the best AAY, 20% the BCRP had average AAY 24%

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(62)

Experiments on average annual yields (AAY)

Kernel based log-optimal portfolio selection with k= 1, . . . ,5 and `= 1, . . . ,10

rk,`2 = 0.0001·d·k·`,

AAY of kernel based semi-log-optimal portfolio is 128%

double the capital

MORRIS had the best AAY, 20% the BCRP had average AAY 24%

(63)

Experiments on average annual yields (AAY)

Kernel based log-optimal portfolio selection with k= 1, . . . ,5 and `= 1, . . . ,10

rk,`2 = 0.0001·d·k·`,

AAY of kernel based semi-log-optimal portfolio is 128%

double the capital

MORRIS had the best AAY, 20%

the BCRP had average AAY 24%

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

(64)

Experiments on average annual yields (AAY)

Kernel based log-optimal portfolio selection with k= 1, . . . ,5 and `= 1, . . . ,10

rk,`2 = 0.0001·d·k·`,

AAY of kernel based semi-log-optimal portfolio is 128%

double the capital

MORRIS had the best AAY, 20%

the BCRP had average AAY 24%

(65)

The average annual yields of the individual experts.

k 1 2 3 4 5

`

1 20% 19% 16% 16% 16%

2 118% 77% 62% 24% 58%

3 71% 41% 26% 58% 21%

4 103% 94% 63% 97% 34%

5 134% 102% 100% 102% 67%

6 140% 125% 105% 108% 87%

7 148% 123% 107% 99% 96%

8 132% 112% 102% 85% 81%

9 127% 103% 98% 74% 72%

10 123% 92% 81% 65% 69%

Ottucs´ak, Gy¨orfi Principal component and constantly re-balanced portfolio

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

It was argued that a theory for portfolio selection and asset pricing based on the GOP would have properties which are more appealing than those implied by the mean- variance

Under memoryless assumption on the underlying process generating the asset prices, the log-optimal portfolio achieves the maximal asymptotic average growth rate, that is the

Theoretical results show the rate of underperformance of the risk aware Markowitz-type portfolio strategy in growth rate compared to the log-optimal portfolio strategy, which does

Under memoryless as- sumption on the underlying process generating the asset prices the Best Constantly Rebalanced Portfolio is studied, called log-optimal portfolio, which achieves

Gy¨ orfi, Ottucs´ ak, Vajda Growth Optimal Port. Strategies with Transaction Cost.. dynamic programming problem.. Strategies with Transaction Cost.. Strategies with Transaction

Walk (2006) ”Nonparametric nearest neighbor based empirical portfolio selection strategies”, (submitted), www.szit.bme.hu/˜gyorfi/NN.pdf... Walk (2006) ”Nonparametric nearest

HP4.1: The effectiveness of the Hungarian logistics provid- ers is determined by the composition of their service portfolio, HP4.2: The portfolio composition of the Hungarian service

transmission portfolio (SONET/SDH–based multiservice platforms and the optical portfolio) can choose to have their transmitter generate the correct wavelength directly and