A Caltech Library Service

Maximum Drawdown of a Brownian Motion and AlphaBoost: a Boosting Algorithm


Pratap, Amrit (2004) Maximum Drawdown of a Brownian Motion and AlphaBoost: a Boosting Algorithm. Master's thesis, California Institute of Technology. doi:10.7907/J2H0-XV66.


We study two problems, one in the field of computational finance and the other one in machine learning.

Firstly we study the Maximal drawdown statistics of the Brownian random walk. We give the infinite series representation of its distribution and consider its expected value. For the case when drift is zero, we give an exact expression of the expected value and for the other cases, we give an infinite series representation. For all the cases, we compute the limiting behavior of the expected value.

Secondly, we propose a new algorithm for boosting, AlphaBoost, which does better than AdaBoost in reducing the cost function. We study its generalization properties and compare it to AdaBoost. However, this algorithm does not always give better out-of-sample performance.

Item Type:Thesis (Master's thesis)
Subject Keywords:boosting; computational finance; machine learning; maximum drawdown; sterling ratio
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Computer Science
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Abu-Mostafa, Yaser S.
Thesis Committee:
  • Unknown, Unknown
Defense Date:28 May 2004
Funding AgencyGrant Number
NSF Cooperative AgreementEEC-9402726
Record Number:CaltechETD:etd-05272004-115820
Persistent URL:
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2132
Deposited By: Imported from ETD-db
Deposited On:01 Jun 2004
Last Modified:05 Jan 2021 23:06

Thesis Files

PDF - Final Version
See Usage Policy.


Repository Staff Only: item control page