This document provides an introduction to stochastic calculus. It begins with a review of key probability concepts such as the Lebesgue integral, change of measure, and the Radon-Nikodym derivative. It then discusses information and σ-algebras, including filtrations and adapted processes. Conditional expectation is explained. The document concludes by introducing random walks and their connection to Brownian motion through the scaled random walk process. Key concepts such as martingales and quadratic variation are defined.
Time Series basic concepts and ARIMA family of models. There is an associated video session along with code in github: https://github.com/bhaskatripathi/timeseries-autoregressive-models
https://drive.google.com/file/d/1yXffXQlL6i4ufQLSpFFrJgymhHNXL1Mf/view?usp=sharing
3. Linear Algebra for Machine Learning: Factorization and Linear TransformationsCeni Babaoglu, PhD
The seminar series will focus on the mathematical background needed for machine learning. The first set of the seminars will be on "Linear Algebra for Machine Learning". Here are the slides of the third part which is discussing factorization and linear transformations.
Here is the link of the first part which was discussing linear systems: https://www.slideshare.net/CeniBabaogluPhDinMat/linear-algebra-for-machine-learning-linear-systems/1
Here are the slides of the second part which was discussing basis and dimension:
https://www.slideshare.net/CeniBabaogluPhDinMat/2-linear-algebra-for-machine-learning-basis-and-dimension
Time Series basic concepts and ARIMA family of models. There is an associated video session along with code in github: https://github.com/bhaskatripathi/timeseries-autoregressive-models
https://drive.google.com/file/d/1yXffXQlL6i4ufQLSpFFrJgymhHNXL1Mf/view?usp=sharing
3. Linear Algebra for Machine Learning: Factorization and Linear TransformationsCeni Babaoglu, PhD
The seminar series will focus on the mathematical background needed for machine learning. The first set of the seminars will be on "Linear Algebra for Machine Learning". Here are the slides of the third part which is discussing factorization and linear transformations.
Here is the link of the first part which was discussing linear systems: https://www.slideshare.net/CeniBabaogluPhDinMat/linear-algebra-for-machine-learning-linear-systems/1
Here are the slides of the second part which was discussing basis and dimension:
https://www.slideshare.net/CeniBabaogluPhDinMat/2-linear-algebra-for-machine-learning-basis-and-dimension
Careers outside Academia - USC Computer Science Masters and Ph.D. StudentsAshwin Rao
Talk given at USC CS Colloquium to grad students (http://viterbi.usc.edu/news/events/?event=10265). The topic was - Prospective Careers outside Academia.
IIT Bombay - First Steps to a Successful CareerAshwin Rao
Career-Advice for IIT Bombay students. Emphasis on Quant Finance Jobs. Decisions-making on Tech versus Finance, Startups versus Large Firms. Introduction to ZLemma.com to help students identify the right jobs/careers.
Pseudo and Quasi Random Number GenerationAshwin Rao
Talk given at Morgan Stanley on efficient Monte Carlo simulation using Pseudo random numbers and low-discrepancy sequences (i.e., Quasi random numbers)
AACIMP 2010 Summer School lecture by Leonidas Sakalauskas. "Applied Mathematics" stream. "Stochastic Programming and Applications" course. Part 3.
More info at http://summerschool.ssa.org.ua
Basics of probability in statistical simulation and stochastic programmingSSA KPI
AACIMP 2010 Summer School lecture by Leonidas Sakalauskas. "Applied Mathematics" stream. "Stochastic Programming and Applications" course. Part 2.
More info at http://summerschool.ssa.org.ua
Stochastic Control/Reinforcement Learning for Optimal Market MakingAshwin Rao
Optimal Market Making is the problem of dynamically adjusting bid and ask prices/sizes on the Limit Order Book so as to maximize Expected Utility of Gains. This is a stochastic control problem that can be tackled with classical Dynamic Programming techniques or with Reinforcement Learning (using a market-learnt simulator)
Understanding Dynamic Programming through Bellman OperatorsAshwin Rao
Policy Iteration and Value Iteration algorithms are best understood by viewing them from the lens of Bellman Policy Operator and Bellman Optimality Operator
A.I. for Dynamic Decisioning under Uncertainty (for real-world problems in Re...Ashwin Rao
Slides from the Research Seminar talk I gave at Nvidia. The topic was: A.I. for Dynamic Decisioning under Uncertainty (for Real-World problems in Retail and in Financial Trading)
Overview of Stochastic Calculus FoundationsAshwin Rao
This is a quick refresher/overview of Stochastic Calculus Foundations. This assumes you have done a Stochastic Calculus course previously and now want to review/revise the material to prepare for a course that lists Stochastic Calculus as a pre-req. In these 11 slides, I list the key content you must be familiar with within Stochastic Calculus.
Risk-Aversion, Risk-Premium and Utility TheoryAshwin Rao
This lecture helps understand the concepts of Risk-Aversion and Risk-Premium viewed from the lens of Utility Theory. These are foundational economic concepts used widely in Financial applications - Portfolio problems and Pricing problems, to name a couple.
To make Reinforcement Learning Algorithms work in the real-world, one has to get around (what Sutton calls) the "deadly triad": the combination of bootstrapping, function approximation and off-policy evaluation. The first step here is to understand Value Function Vector Space/Geometry and then make one's way into Gradient TD Algorithms (a big breakthrough to overcome the "deadly triad").
Stanford CME 241 - Reinforcement Learning for Stochastic Control Problems in ...Ashwin Rao
I am pleased to introduce a new and exciting course, as part of ICME at Stanford University. I will be teaching CME 241 (Reinforcement Learning for Stochastic Control Problems in Finance) in Winter 2019.
HJB Equation and Merton's Portfolio ProblemAshwin Rao
Deriving the solution to Merton's Portfolio Problem (Optimal Asset Allocation and Consumption) using the elegant formulation of Hamilton-Jacobi-Bellman equation.
A Quick and Terse Introduction to Efficient Frontier MathematicsAshwin Rao
A Quick and Terse Introduction to Efficient Frontier Mathematics. Only a basic background in Linear Algebra, Probability and Optimization is expected to cover this material and gain a reasonable understanding of this topic within one hour.
Recursive Formulation of Gradient in a Dense Feed-Forward Deep Neural NetworkAshwin Rao
Recursive Formulation of Gradient in a Dense Feed-Forward Deep Neural Network. Derived for a fairly general setting where the supervisory variable has a conditional probability density modeled as an arbitrary Generalized Linear Model's "normal-form" probability density, and whose output layer activation function is the GLM canonical link function.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
UiPath Test Automation using UiPath Test Suite series, part 4
Introduction to Stochastic calculus
1. Introduction to Stochastic Calculus
Introduction to Stochastic Calculus
Dr. Ashwin Rao
Morgan Stanley, Mumbai
March 11, 2011
Dr. Ashwin Rao Introduction to Stochastic Calculus
2. Introduction to Stochastic Calculus
Review of key concepts from Probability/Measure Theory
Lebesgue Integral
(Ω, F, P )
Lebesgue Integral: Ω X (ω)dP (ω) = EP X
Dr. Ashwin Rao Introduction to Stochastic Calculus
3. Introduction to Stochastic Calculus
Review of key concepts from Probability/Measure Theory
Change of measure
Random variable Z with EP Z = 1
Define probability Q (A) = A Z (ω)dP (ω) ∀A ∈ F
EQ X = EP [XZ ]
EQ Y = EP Y
Z
Dr. Ashwin Rao Introduction to Stochastic Calculus
4. Introduction to Stochastic Calculus
Review of key concepts from Probability/Measure Theory
Radon-Nikodym derivative
Equivalence of measures P and Q: ∀A ∈ F, P (A) = 0 iff Q (A) = 0
if P and Q are equivalent, ∃Z such that EP Z = 1 and
Q (A) = A Z (ω)dP (ω) ∀A ∈ F
Z is called the Radon-Nikodym derivative of Q w.r.t. P and
denoted Z = dQdP
Dr. Ashwin Rao Introduction to Stochastic Calculus
5. Introduction to Stochastic Calculus
Review of key concepts from Probability/Measure Theory
Simplified Girsanov’s Theorem
X = N (0, 1)
θ2
Z (ω) = e θX (ω)− 2 ∀ω ∈ Ω
Ep Z = 1
∀A ∈ F , Q = ZdP
A
EQ X = EP [XZ ] = θ
Dr. Ashwin Rao Introduction to Stochastic Calculus
6. Introduction to Stochastic Calculus
Information and σ-Alebgras
Finite Example
Set with n elements {a1 , . . . , an }
Step i: consider all subsets of {a1 , . . . , ai } and its complements
At step i, we have 2i +1 elements
∀i, Fi ⊂ Fi +1
Dr. Ashwin Rao Introduction to Stochastic Calculus
7. Introduction to Stochastic Calculus
Information and σ-Alebgras
Uncountable example
Fi = Information available after first i coin tosses
i
Size of Fi = 22 elements
Fi has 2i ”atoms”
Dr. Ashwin Rao Introduction to Stochastic Calculus
8. Introduction to Stochastic Calculus
Information and σ-Alebgras
Stochastic Process Example
Ω = set of continuous functions f defined on [0, T ] with f (0) = 0
FT = set of all subsets of Ω
Ft : elements of Ft can be described only by constraining function
values from [0, t ]
Dr. Ashwin Rao Introduction to Stochastic Calculus
9. Introduction to Stochastic Calculus
Information and σ-Alebgras
Filtration and Adaptation
Filtration: ∀t ∈ [0, T ], σ-Algebra Ft . foralls t, Fs ⊂ Ft
σ-Algebra σ(X ) generated by a random var X = {ω ∈ Ω|X (ω) ∈ B }
where B ranges over all Borel sets.
X is G-measurable if σ(X ) ⊂ G
A collection of random vars X (t ) indexed by t ∈ [0, T ] is called an
adapted stochastic process if ∀t, X (t ) is Ft -measurable.
Dr. Ashwin Rao Introduction to Stochastic Calculus
10. Introduction to Stochastic Calculus
Information and σ-Alebgras
Multiple random variables and Independence
σ-Algebras F and G are independent if P (A ∩ B ) = P (A) · P (B )
∀A ∈ F , B ∈ G
Independence of random variables, independence of a random
variable and a σ-Algebra
Joint density fX ,Y (x, y ) = P ({ω|X (ω) = x, Y (ω) = y })
∞
Marginal density fX (x ) = P ({ω|X (ω) = x }) = −∞ fX ,Y (x, y )dy
X , Y independent implies fX ,Y (x, y ) = fX (x ) · fY (y ) and
E [XY ] = E [X ]E [Y ]
Covariance(X , Y ) = E [(X − E [X ])(Y − E [Y ])]
Covariance (X ,Y )
Correlation pX ,Y = √
Varaince (X )Variance (Y )
1 −1
1 (x −µ)T
Multivariate normal density fX (x ) = √
¯ ¯ e − 2 (x −µ)C
¯ ¯ ¯ ¯
(2π)n det (C )
X , Y normal with correlation ρ. Create independent normal
variables as a linear combination of X , Y
Dr. Ashwin Rao Introduction to Stochastic Calculus
11. Introduction to Stochastic Calculus
Conditional Expectation
E [X |G] is G-measurable
E [X |G](ω)dP (ω) = X (ω)dP (ω)∀A ∈ G
A A
Dr. Ashwin Rao Introduction to Stochastic Calculus
12. Introduction to Stochastic Calculus
An important Theorem
G a sub-σ-Algebra of F
X1 , . . . , Xm are G-measurable
Y1 , . . . , Yn are independent of G
E [f (X1 , . . . , Xm , Y1 , . . . , Yn )|G] = g (X1 , . . . , Xm )
How do we evaluate this conditional expectation ?
Treat X1 , . . . , Xm as constants
Y1 , . . . , Yn should be integrated out since they don’t care about G
g (x1 , . . . , xm ) = E [f (x1 , . . . , xm , Y1 , . . . , Yn )]
Dr. Ashwin Rao Introduction to Stochastic Calculus
13. Introduction to Stochastic Calculus
Quadratic Variation and Brownian Motion
Random Walk
At step i, random variable Xi = 1 or -1 with equal probability
i
Mi = Xj
j =1
The process Mn , n = 0, 1, 2, . . . is called the symmetric random walk
3 basic observations to make about the ”increments”
Independent increments: for any i0 < i1 < . . . < in ,
(Mi1 − Mi0 ), (Mi2 − Mi1 ), . . . (Min − Min−1 ) are independent
Each incerement has expected value of 0
Each increment has a variance = number of steps (i.e.,
variance of 1 per step)
Dr. Ashwin Rao Introduction to Stochastic Calculus
14. Introduction to Stochastic Calculus
Quadratic Variation and Brownian Motion
Two key properties of the random walk
Martingale: E [Mi |Fj ] = Mj
i
Quadratic Variation: [M, M ]i = j =1 (Mj − Mj −1 )2 = i
Don’t confuse quadratic variation with variance of the process Mi .
Dr. Ashwin Rao Introduction to Stochastic Calculus
15. Introduction to Stochastic Calculus
Quadratic Variation and Brownian Motion
Scaled Random Walk
We speed up time and scale down the step size of a random walk
1
For a fixed positive integer n, define W (n )(t ) = √
n
Mnt
Usual properties: independent increments with mean 0 and variance
of 1 per unit of time t
Show that this is a martingale and has quadratic variation
As n → ∞, scaled random walk becomes brownian motion (proof by
central limit theorem)
Dr. Ashwin Rao Introduction to Stochastic Calculus
16. Introduction to Stochastic Calculus
Quadratic Variation and Brownian Motion
Brownian Motion
Definition of Brownian motion W (t ).
W ( 0) = 0
For each ω ∈ Ω, W (t ) is a continuous function of time t.
independent increments that are normally distributed with mean 0
and variance of 1 per unit of time.
Dr. Ashwin Rao Introduction to Stochastic Calculus
17. Introduction to Stochastic Calculus
Quadratic Variation and Brownian Motion
Key concepts
Joint distribution of brownian motion at specific times
Martingale property
Derivative w.r.t. time is almost always undefined
Quadratic variation (dW · dW = dt)
dW · dt = 0, dt · dt = 0
Dr. Ashwin Rao Introduction to Stochastic Calculus
18. Introduction to Stochastic Calculus
Ito Calculus
Ito’s Integral
T
I (T ) = ∆(t )dW (t )
0
Remember that Brownian motion cannot be differentiated w.r.t time
T
Therefore, we cannot write I (T ) as 0 ∆(t )W (t )dt
Dr. Ashwin Rao Introduction to Stochastic Calculus
19. Introduction to Stochastic Calculus
Ito Calculus
Simple Integrands
T
∆(t )dW (t )
0
Let Π = {t0 , t1 , . . . , tn } be a partition of [0, t ]
Assume ∆(t ) is constant in t in each subinterval [tj , tj +1 ]
t k −1
I (t ) = ∆(u )dW (u ) = ∆(tj )[W (tj +1 )−W (tj )]+∆(tk )[W (t )−W (tk )]
0 j =0
Dr. Ashwin Rao Introduction to Stochastic Calculus
20. Introduction to Stochastic Calculus
Ito Calculus
Properties of the Ito Integral
I (t ) is a martingale
t 2
Ito Isometry: E [I 2 (t )] = E [ 0 ∆ (u )du ]
t 2
Quadratic Variation: [I , I ](t ) = 0 ∆ (u )du
General Integrands
T
An example: 0 W (t )dW (t )
Dr. Ashwin Rao Introduction to Stochastic Calculus
21. Introduction to Stochastic Calculus
Ito Calculus
Ito’s Formula
T
f (T , W (T )) = f (0, W (0)) + ft (t, W (t ))dt
0
T T
1
+ fx (t, W (t ))dW (t ) + fxx (t, W (t ))dt
0 2 0
t t
Ito Process: X (t ) = X (0) + 0 ∆(u )dW (u ) + 0 Θ(u )dW (u )
t 2
Quadratic variation [X , X ](t ) = 0 ∆ (u )du
Dr. Ashwin Rao Introduction to Stochastic Calculus
22. Introduction to Stochastic Calculus
Ito Calculus
Ito’s Formula
T T
f (T , X (T )) = f (0, X (0)) + ft (t, X (t ))dt + fx (t, X (t ))dX (t )
0 0
T
1
+ fxx (t, X (t ))d [X , X ](t )
2 0
T T
= f (0, X (0)) + ft (t, X (t ))dt + fx (t, X (t ))∆(t )dW (t )
0 0
T T
1
+ fx (t, X (t ))Θ(t )dt + fxx (t, X (t ))∆2 (t )dt
0 2 0
Dr. Ashwin Rao Introduction to Stochastic Calculus