Stock Portfolio Selection Using Two-tiered Lazy Updates
2014-04-16
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Stock Portfolio Selection Using Two-tiered Lazy Updates
Published Date
2014-04-16
Publisher
Type
Presentation
Abstract
People make and lose vast sums of money every day on stock exchanges around the world. This research focused on developing a computer algorithm to build profitable portfolios, while taking into account transaction costs associated with trading stocks. The theory behind our algorithm is based on a subset of Machine Learning called Online Learning. Online Learning makes updated decisions as new information is provided. For our case, a new decision is made each day on what stocks to buy/sell based on transaction costs and the previous day’s stock performance. The Lazy Update part of our algorithm seeks to minimize the quantity of trading, since this leads to transaction costs being incurred. Our algorithm builds on prior work and dynamically learns which sectors to invest in and takes into account risk, which has not been considered before in the literature. Our Online Lazy Updates algorithm runs at a low level on choosing stocks within a sector, and at a high level on choosing the best sectors to invest in. We successfully establish our ability to be profitable with transaction costs on real-world datasets.
Description
Adviser: Dr. Arindam Banerjee
Related to
Replaces
License
Series/Report Number
Funding information
This research was supported by the Undergraduate Research Opportunities Program (UROP).
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Cook, Alexander; Johnson, Nicholas; Banerjee, Arindam. (2014). Stock Portfolio Selection Using Two-tiered Lazy Updates. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/163162.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.