Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning Quantitative Finance with R

You're reading from   Learning Quantitative Finance with R Implement machine learning, time-series analysis, algorithmic trading and more

Arrow left icon
Product type Paperback
Published in Mar 2017
Publisher Packt
ISBN-13 9781786462411
Length 284 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
PRASHANT VATS PRASHANT VATS
Author Profile Icon PRASHANT VATS
PRASHANT VATS
Dr. Param Jeet Dr. Param Jeet
Author Profile Icon Dr. Param Jeet
Dr. Param Jeet
Arrow right icon
View More author details
Toc

Table of Contents (10) Chapters Close

Preface 1. Introduction to R 2. Statistical Modeling FREE CHAPTER 3. Econometric and Wavelet Analysis 4. Time Series Modeling 5. Algorithmic Trading 6. Trading Using Machine Learning 7. Risk Management 8. Optimization 9. Derivative Pricing

Grid testing


Let us consider a typical classification problem. Assume you have a dataset and you divide it into training (T) and validating (V) datasets. Here you are trying to solve an optimization problem, let's say P, in which one is trying to reduce the training error in addition to regularization terms, where the optimization problem is a function of model parameter m, training sample T, and some hyperparameters and . Solving for given  and  gives you the value of parameter m. Now one can apply the estimated parameters on the validation sample to get the validation error function, and optimize it to get the set of  and  to minimize the error function. But this optimization problem will be very expensive as, for each set of  and , you need to optimize the objective function, which might not be a convex, concave, or smooth function.

So we subset the set of  and  and, for each pair of selected  and , we solve the optimization problem. This looks like a grid in space so we call it a grid...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime