Randomized Full Waveform Inversion
|
|
- Aileen Barber
- 6 years ago
- Views:
Transcription
1 Consortium 2010 Randomized Full Waveform Inversion Peyman P. Moghaddam SLIM University of British Columbia
2 Motivation Cost of the FWI is propor?onal to the number of shots and it requires hundreds of RTM (Reverse Time Migra?on). Dimensionality reduc?on with compressive sensing aims at compressing the data volume in inversion. Stochas?c op?miza?on provides bejer solu?on to randomized inversion problem than conven?onal op?miza?on.
3 Overview Full Waveform Inversion (FWI) Simultaneous Source Experiment Randomized FWI Stochastic Optimization Methods Examples Conclusion Future Plans
4 Full Waveform Inversion Mathema?cally FWI can be formed as min σ J(σ) = 1 2 d Du(σ) 2 subject to F(u, σ) = 0 d : data D : detection operator σ : sloweness F(u, σ) = (ω 2 σ )u + q = 0 u(σ) : wavefield ω : angular frequency q : source 2 : Laplacian (Ben Hadj Ali 08)
5 Full Waveform Inversion Gradient of the cost func?on with respect to slowness is defined as, J(σ)/ σ = R{( u/ σ) H D T [d Du(σ)]} R : real part (.) H : Hermitian with u/ σ defined as, u/ σ = 2ω 2 (ω 2 σ ) 1 σu = K K : de-migration operator, linearized Born (Plessix 2009)
6 Conventional Optimization Limited memory BFGS (Plessix 2009) σ k+1 = σ k τh k J(σ k ) H k : inverse Hessian τ : line search value Precondi?oned Gradient method (Ravaut 2004) σ k+1 = σ k τdiag(k T K + ɛi) 1 J(σ k ) Conjugate Gradient method (Virieux 2009)
7 Simultaneous Source Experiment 0.1 Shot time (s) Shot Shot offset (m) 0.2 time (s) time (s) time (s) offset (m) offset (m) Super-Shot offset (m) (Krebs 2009)
8 updates read Simultaneous Source Experiment σ k+1 = σ k τ J(σ k, Q) Q : all sources with J(σ k, Q) 1 i=n s N s J(σ k, Q i ) i=1 Q i : a simultaneous source ( ) i=n 1 s E J(σ k, Q i ) N s i=1 J(σ k, Q) E(.) : expectation
9 Randomized FWI σ σ 0 initial model {J(σ, Q i ), σ J(σ, Q i )} new randomized super-shot While σ J(σ) ɛ σ update model with J(σ, Q i ), σ J(σ, Q i ) {J(σ, Q i ), σ J(σ, Q i )} new randomized super-shot end (Moghaddam 2010, Krebs 2009)
10 Stochastic Optimization Approaches Stochastic Gradient Descent σ k+1 = σ k τ J(σ k, d k ) Integrated Stochastic Gradient Descent (isgd) J(σ k ) σ k+1 = σ k η k J(σ k ) with is averaging on the past numbers of gradients with weights, k i=k m eα[i (k m)] J(σ i, d i ) J(σ k )= k i=k m eα[i (k m)] (Moghaddam 2010)
11 Stochastic Optimization Limited Memory BFGS (quasi Newton methods), σ k+1 = σ k η k H k J(σ k, d k ) with updates: H k+1 = V T k H k V k + ρ k s k s T k s k = σ k+1 σ k y k = J(σ k+1 ) J(σ k ) V k = I ρ k y k s T k On line Limited Memory BFGS H 0 = m i=1 s T k i y k i y T k i y k i (Schraudolph 2007)
12 Stochastic Optimization Regular Limited Memory BFSG (quasi Newton methods), min H subject to H k+1 H k F H T k+1 = H k+1, H T k+1y k = s k s k = σ k+1 σ k y k = J(σ k+1 ) J(σ k ) Integrated Limited Memory BFSG (ilbfgs), min H H k+1 k H k F subject to H T k+1 = H k+1, H T k+1y k = s k
13 Examples (Marmoussi Model) depth (m) offset (m) 113 shots with 40 (m) spacing, 249 receivers with 20 (m) spacing, WAZ survey with 5 (km) max. aperture, Ricker source with 10 Hz central frequency, 3.6 second recording?me with.9 (ms)?me sampling. 1.5
14 Examples (Ini?al Model) depth (m) offset (m)
15 Examples (Inverted Model) depth (m) offset (m) inverted model acer 18 itera?ons of LBFGS, 113 sequen?al shots, 50 frequency components has been used from 5 to 33 Hz with.55 Hz resolu?on 1.5
16 Randomized FWI (Inverted Model) depth (m) offset (m) Stochas?c Gradient Descent, SNR= 4.65 db, 1.5 SNR = 20 log 10 ( δm δ m 2 δm 2 ) 16 Randomized simultaneous shots, 4 frequencies, 40?mes speed up
17 Randomized FWI (Inverted Model) depth (m) online LBFGS, SNR= 7.17 db offset (m) Randomized simultaneous shots, 4 frequencies, 40?mes speed up
18 Randomized FWI (Inverted Model) depth (m) ilbfgs, SNR= 9.10dB offset (m) Randomized simultaneous shots, 4 frequencies, 40?mes speed up
19 Randomized FWI (Inverted Model) depth (m) isgd, SNR= 10.85dB offset (m) Randomized simultaneous shots, 4 frequencies, 40?mes speed up
20 Comparison depth (m) offset (m) Inversion for all the shots, 1 week on the 32 CPU cluster offset (m) isgd, SNR= 10.85dB 8 hours on the 32 CPU cluster 16 Randomized simultaneous shots, 4 frequencies, 40?mes speed up
21 Comparison 12 ISGD SGD 10 8 SNR (db) iteration Comparison between conven?onal gradient descent and stochas?c gradient descent.
22 Examples (Marmoussi Model) 900 shots with 10 (m) spacing, 900 receivers with 10 (m) spacing, WAZ survey with 5 (km) max. aperture, Ricker source with 10 Hz central frequency, 3.6 second recording?me with.9 (ms)?me sampling.
23 Examples (Ini?al Model)
24 Randomized FWI (Inverted Model) isgd method, 1 Randomized simultaneous shots, 900?mes speed up!
25 Conclusion Super shot experiment combined with stochas?c op?miza?on methods produce promising results for solu?on for FWI Randomized FWI greatly increases the performance of the FWI. Dimensionality reduc?on algorithms, open possibility of replacing migra?on with FWI with no extra cost.
26 Future Plans Further inves?ga?on on the choice of random frequency and super shot Stochas?c op?miza?on strategies for FWI, improved ilbfgs, Natural gradient Regulariza?on for the FWI Solving the uniqueness problem, exploi?ng the mul? scale nature of the FWI
27 Acknowledgements The authors would like to thank Yogi Erlangga and Tim Lin for their Helmoltz operator. The authors would like to thank Eldad Haber for discussion on stochastic optimization and regularized inverse problem. This work was in part financially supported by the Natural Sciences and Engineering Research Council of Canada Discovery Grant (22R81254) and the Collaborative Research and Development Grant DNOISE II ( ). This research was carried out as part of the SINBAD II project with support from the following organizations: BG Group, BP, Chevron, ConocoPhillips, Petrobras, Total SA, and WesternGeco.
Large-Scale SVM Optimization: Taking a Machine Learning Perspective
Large-Scale SVM Optimization: Taking a Machine Learning Perspective Shai Shalev-Shwartz Toyota Technological Institute at Chicago Joint work with Nati Srebro Talk at NEC Labs, Princeton, August, 2008 Shai
More informationAccelerated Stochastic Gradient Descent Praneeth Netrapalli MSR India
Accelerated Stochastic Gradient Descent Praneeth Netrapalli MSR India Presented at OSL workshop, Les Houches, France. Joint work with Prateek Jain, Sham M. Kakade, Rahul Kidambi and Aaron Sidford Linear
More informationSupport Vector Machines: Training with Stochastic Gradient Descent
Support Vector Machines: Training with Stochastic Gradient Descent Machine Learning Spring 2018 The slides are mainly from Vivek Srikumar 1 Support vector machines Training by maximizing margin The SVM
More informationMachine Learning (CSE 446): Learning as Minimizing Loss
Machine Learning (CSE 446): Learning as Minimizing Loss oah Smith c 207 University of Washington nasmith@cs.washington.edu October 23, 207 / 2 Sorry! o office hour for me today. Wednesday is as usual.
More informationPart 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)
Part 3: Trust-region methods for unconstrained optimization Nick Gould (RAL) minimize x IR n f(x) MSc course on nonlinear optimization UNCONSTRAINED MINIMIZATION minimize x IR n f(x) where the objective
More informationTrust Region Methods for Unconstrained Optimisation
Trust Region Methods for Unconstrained Optimisation Lecture 9, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Trust
More informationEquity correlations implied by index options: estimation and model uncertainty analysis
1/18 : estimation and model analysis, EDHEC Business School (joint work with Rama COT) Modeling and managing financial risks Paris, 10 13 January 2011 2/18 Outline 1 2 of multi-asset models Solution to
More informationScaling SGD Batch Size to 32K for ImageNet Training
Scaling SGD Batch Size to 32K for ImageNet Training Yang You Computer Science Division of UC Berkeley youyang@cs.berkeley.edu Yang You (youyang@cs.berkeley.edu) 32K SGD Batch Size CS Division of UC Berkeley
More informationPortfolio selection with multiple risk measures
Portfolio selection with multiple risk measures Garud Iyengar Columbia University Industrial Engineering and Operations Research Joint work with Carlos Abad Outline Portfolio selection and risk measures
More informationExercise List: Proving convergence of the (Stochastic) Gradient Descent Method for the Least Squares Problem.
Exercise List: Proving convergence of the (Stochastic) Gradient Descent Method for the Least Squares Problem. Robert M. Gower. October 3, 07 Introduction This is an exercise in proving the convergence
More informationConvergence of trust-region methods based on probabilistic models
Convergence of trust-region methods based on probabilistic models A. S. Bandeira K. Scheinberg L. N. Vicente October 24, 2013 Abstract In this paper we consider the use of probabilistic or random models
More informationCSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems
CSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems January 26, 2018 1 / 24 Basic information All information is available in the syllabus
More informationFair Dynamic Resource Alloca2on in Transit-based Evacua2on Planning
Fair Dynamic Resource Alloca2on in Transit-based Evacua2on Planning Soheila Aalami PhD Candidate, & Lina Ka.an, PEng, PhD Professor, Urban Alliance Professor in Transporta;on Systems Op;miza;on Department
More informationGraph signal processing for clustering
Graph signal processing for clustering Nicolas Tremblay PANAMA Team, INRIA Rennes with Rémi Gribonval, Signal Processing Laboratory 2, EPFL, Lausanne with Pierre Vandergheynst. What s clustering? N. Tremblay
More informationCalibration Lecture 1: Background and Parametric Models
Calibration Lecture 1: Background and Parametric Models March 2016 Motivation What is calibration? Derivative pricing models depend on parameters: Black-Scholes σ, interest rate r, Heston reversion speed
More informationImplementing an Agent-Based General Equilibrium Model
Implementing an Agent-Based General Equilibrium Model 1 2 3 Pure Exchange General Equilibrium We shall take N dividend processes δ n (t) as exogenous with a distribution which is known to all agents There
More informationFinding Zeros of Single- Variable, Real Func7ons. Gautam Wilkins University of California, San Diego
Finding Zeros of Single- Variable, Real Func7ons Gautam Wilkins University of California, San Diego General Problem - Given a single- variable, real- valued func7on, f, we would like to find a real number,
More informationStatistical and Computational Inverse Problems with Applications Part 5B: Electrical impedance tomography
Statistical and Computational Inverse Problems with Applications Part 5B: Electrical impedance tomography Aku Seppänen Inverse Problems Group Department of Applied Physics University of Eastern Finland
More informationLecture 2 - Calibration of interest rate models and optimization
- Calibration of interest rate models and optimization Elisabeth Larsson Uppsala University, Uppsala, Sweden March 2015 E. Larsson, March 2015 (1 : 23) Introduction to financial instruments Introduction
More informationPortfolio Management and Optimal Execution via Convex Optimization
Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize
More informationComprehensive Exam. August 19, 2013
Comprehensive Exam August 19, 2013 You have a total of 180 minutes to complete the exam. If a question seems ambiguous, state why, sharpen it up and answer the sharpened-up question. Good luck! 1 1 Menu
More informationStochastic Grid Bundling Method
Stochastic Grid Bundling Method GPU Acceleration Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee London - December 17, 2015 A. Leitao &
More informationA Stochastic Levenberg-Marquardt Method Using Random Models with Application to Data Assimilation
A Stochastic Levenberg-Marquardt Method Using Random Models with Application to Data Assimilation E Bergou Y Diouane V Kungurtsev C W Royer July 5, 08 Abstract Globally convergent variants of the Gauss-Newton
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2018 Last Time: Markov Chains We can use Markov chains for density estimation, p(x) = p(x 1 ) }{{} d p(x
More informationIs Greedy Coordinate Descent a Terrible Algorithm?
Is Greedy Coordinate Descent a Terrible Algorithm? Julie Nutini, Mark Schmidt, Issam Laradji, Michael Friedlander, Hoyt Koepke University of British Columbia Optimization and Big Data, 2015 Context: Random
More informationStochastic Proximal Algorithms with Applications to Online Image Recovery
1/24 Stochastic Proximal Algorithms with Applications to Online Image Recovery Patrick Louis Combettes 1 and Jean-Christophe Pesquet 2 1 Mathematics Department, North Carolina State University, Raleigh,
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2019 Last Time: Markov Chains We can use Markov chains for density estimation, d p(x) = p(x 1 ) p(x }{{}
More informationDistributed Approaches to Mirror Descent for Stochastic Learning over Rate-Limited Networks
Distributed Approaches to Mirror Descent for Stochastic Learning over Rate-Limited Networks, Detroit MI (joint work with Waheed Bajwa, Rutgers) Motivation: Autonomous Driving Network of autonomous automobiles
More informationOptimal energy management and stochastic decomposition
Optimal energy management and stochastic decomposition F. Pacaud P. Carpentier J.P. Chancelier M. De Lara JuMP-dev workshop, 2018 ENPC ParisTech ENSTA ParisTech Efficacity 1/23 Motivation We consider a
More informationFinancial Mathematics and Supercomputing
GPU acceleration in early-exercise option valuation Álvaro Leitao and Cornelis W. Oosterlee Financial Mathematics and Supercomputing A Coruña - September 26, 2018 Á. Leitao & Kees Oosterlee SGBM on GPU
More informationGradient Descent and the Structure of Neural Network Cost Functions. presentation by Ian Goodfellow
Gradient Descent and the Structure of Neural Network Cost Functions presentation by Ian Goodfellow adapted for www.deeplearningbook.org from a presentation to the CIFAR Deep Learning summer school on August
More informationLearning from Data: Learning Logistic Regressors
Learning from Data: Learning Logistic Regressors November 1, 2005 http://www.anc.ed.ac.uk/ amos/lfd/ Learning Logistic Regressors P(t x) = σ(w T x + b). Want to learn w and b using training data. As before:
More informationFunc%on Approxima%on. Pieter Abbeel UC Berkeley EECS
Func%on Approxima%on Pieter Abbeel UC Berkeley EECS Value Itera5on Algorithm: Start with for all s. For i = 1,, H For all states s in S: Imprac5cal for large state spaces This is called a value update
More informationLecture 17: More on Markov Decision Processes. Reinforcement learning
Lecture 17: More on Markov Decision Processes. Reinforcement learning Learning a model: maximum likelihood Learning a value function directly Monte Carlo Temporal-difference (TD) learning COMP-424, Lecture
More informationAn adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity Coralia Cartis, Nick Gould and Philippe Toint Department of Mathematics,
More informationBudget Management In GSP (2018)
Budget Management In GSP (2018) Yahoo! March 18, 2018 Miguel March 18, 2018 1 / 26 Today s Presentation: Budget Management Strategies in Repeated auctions, Balseiro, Kim, and Mahdian, WWW2017 Learning
More informationDynamic Replication of Non-Maturing Assets and Liabilities
Dynamic Replication of Non-Maturing Assets and Liabilities Michael Schürle Institute for Operations Research and Computational Finance, University of St. Gallen, Bodanstr. 6, CH-9000 St. Gallen, Switzerland
More informationOvernight Index Rate: Model, calibration and simulation
Research Article Overnight Index Rate: Model, calibration and simulation Olga Yashkir and Yuri Yashkir Cogent Economics & Finance (2014), 2: 936955 Page 1 of 11 Research Article Overnight Index Rate: Model,
More informationRobust Longevity Risk Management
Robust Longevity Risk Management Hong Li a,, Anja De Waegenaere a,b, Bertrand Melenberg a,b a Department of Econometrics and Operations Research, Tilburg University b Netspar Longevity 10 3-4, September,
More informationLecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall Financial mathematics
Lecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall 2014 Reduce the risk, one asset Let us warm up by doing an exercise. We consider an investment with σ 1 =
More information1 Overview. 2 The Gradient Descent Algorithm. AM 221: Advanced Optimization Spring 2016
AM 22: Advanced Optimization Spring 206 Prof. Yaron Singer Lecture 9 February 24th Overview In the previous lecture we reviewed results from multivariate calculus in preparation for our journey into convex
More informationWhat can we do with numerical optimization?
Optimization motivation and background Eddie Wadbro Introduction to PDE Constrained Optimization, 2016 February 15 16, 2016 Eddie Wadbro, Introduction to PDE Constrained Optimization, February 15 16, 2016
More informationLecture Neyman Allocation vs Proportional Allocation and Stratified Random Sampling vs Simple Random Sampling
Math 408 - Mathematical Statistics Lecture 20-21. Neyman Allocation vs Proportional Allocation and Stratified Random Sampling vs Simple Random Sampling March 8-13, 2013 Konstantin Zuev (USC) Math 408,
More informationPrincipal-Agent Problems in Continuous Time
Principal-Agent Problems in Continuous Time Jin Huang March 11, 213 1 / 33 Outline Contract theory in continuous-time models Sannikov s model with infinite time horizon The optimal contract depends on
More informationEstimating Macroeconomic Models of Financial Crises: An Endogenous Regime-Switching Approach
Estimating Macroeconomic Models of Financial Crises: An Endogenous Regime-Switching Approach Gianluca Benigno 1 Andrew Foerster 2 Christopher Otrok 3 Alessandro Rebucci 4 1 London School of Economics and
More informationLending Club Loan Portfolio Optimization Fred Robson (frobson), Chris Lucas (cflucas)
CS22 Artificial Intelligence Stanford University Autumn 26-27 Lending Club Loan Portfolio Optimization Fred Robson (frobson), Chris Lucas (cflucas) Overview Lending Club is an online peer-to-peer lending
More informationTowards efficient option pricing in incomplete markets
Towards efficient option pricing in incomplete markets GPU TECHNOLOGY CONFERENCE 2016 Shih-Hau Tan 1 2 1 Marie Curie Research Project STRIKE 2 University of Greenwich Apr. 6, 2016 (University of Greenwich)
More informationReforming the Social Security Earnings Cap: The Role of Endogenous Human Capital
Reforming the Social Security Earnings Cap: The Role of Endogenous Human Capital Adam Blandin Arizona State University May 20, 2016 Motivation Social Security payroll tax capped at $118, 500 Policy makers
More informationThe Correlation Smile Recovery
Fortis Bank Equity & Credit Derivatives Quantitative Research The Correlation Smile Recovery E. Vandenbrande, A. Vandendorpe, Y. Nesterov, P. Van Dooren draft version : March 2, 2009 1 Introduction Pricing
More informationFrequency of Price Adjustment and Pass-through
Frequency of Price Adjustment and Pass-through Gita Gopinath Harvard and NBER Oleg Itskhoki Harvard CEFIR/NES March 11, 2009 1 / 39 Motivation Micro-level studies document significant heterogeneity in
More informationECON 815. A Basic New Keynesian Model II
ECON 815 A Basic New Keynesian Model II Winter 2015 Queen s University ECON 815 1 Unemployment vs. Inflation 12 10 Unemployment 8 6 4 2 0 1 1.5 2 2.5 3 3.5 4 4.5 5 Core Inflation 14 12 10 Unemployment
More informationA Stochastic Approximation Algorithm for Making Pricing Decisions in Network Revenue Management Problems
A Stochastic Approximation Algorithm for Making ricing Decisions in Network Revenue Management roblems Sumit Kunnumkal Indian School of Business, Gachibowli, Hyderabad, 500032, India sumit kunnumkal@isb.edu
More informationIE 495 Lecture 11. The LShaped Method. Prof. Jeff Linderoth. February 19, February 19, 2003 Stochastic Programming Lecture 11 Slide 1
IE 495 Lecture 11 The LShaped Method Prof. Jeff Linderoth February 19, 2003 February 19, 2003 Stochastic Programming Lecture 11 Slide 1 Before We Begin HW#2 $300 $0 http://www.unizh.ch/ior/pages/deutsch/mitglieder/kall/bib/ka-wal-94.pdf
More informationQuasi-Convex Stochastic Dynamic Programming
Quasi-Convex Stochastic Dynamic Programming John R. Birge University of Chicago Booth School of Business JRBirge SIAM FM12, MSP, 10 July 2012 1 General Theme Many dynamic optimization problems dealing
More information7 pages 1. Premia 14
7 pages 1 Premia 14 Calibration of Stochastic Volatility model with Jumps A. Ben Haj Yedder March 1, 1 The evolution process of the Heston model, for the stochastic volatility, and Merton model, for the
More informationDerivation Of The Capital Asset Pricing Model Part I - A Single Source Of Uncertainty
Derivation Of The Capital Asset Pricing Model Part I - A Single Source Of Uncertainty Gary Schurman MB, CFA August, 2012 The Capital Asset Pricing Model CAPM is used to estimate the required rate of return
More informationRisk Management for Chemical Supply Chain Planning under Uncertainty
for Chemical Supply Chain Planning under Uncertainty Fengqi You and Ignacio E. Grossmann Dept. of Chemical Engineering, Carnegie Mellon University John M. Wassick The Dow Chemical Company Introduction
More informationChapter 7: Estimation Sections
1 / 40 Chapter 7: Estimation Sections 7.1 Statistical Inference Bayesian Methods: Chapter 7 7.2 Prior and Posterior Distributions 7.3 Conjugate Prior Distributions 7.4 Bayes Estimators Frequentist Methods:
More informationUnblinded Sample Size Re-Estimation in Bioequivalence Trials with Small Samples. Sam Hsiao, Cytel Lingyun Liu, Cytel Romeo Maciuca, Genentech
Unblinded Sample Size Re-Estimation in Bioequivalence Trials with Small Samples Sam Hsiao, Cytel Lingyun Liu, Cytel Romeo Maciuca, Genentech Goal Describe simple adjustment to CHW method (Cui, Hung, Wang
More informationPricing Early-exercise options
Pricing Early-exercise options GPU Acceleration of SGBM method Delft University of Technology - Centrum Wiskunde & Informatica Álvaro Leitao Rodríguez and Cornelis W. Oosterlee Lausanne - December 4, 2016
More informationAsymmetric Labor Market Fluctuations in an Estimated Model of Equilibrium Unemployment
Asymmetric Labor Market Fluctuations in an Estimated Model of Equilibrium Unemployment Nicolas Petrosky-Nadeau FRB San Francisco Benjamin Tengelsen CMU - Tepper Tsinghua - St.-Louis Fed Conference May
More informationContents Critique 26. portfolio optimization 32
Contents Preface vii 1 Financial problems and numerical methods 3 1.1 MATLAB environment 4 1.1.1 Why MATLAB? 5 1.2 Fixed-income securities: analysis and portfolio immunization 6 1.2.1 Basic valuation of
More informationThe Irrevocable Multi-Armed Bandit Problem
The Irrevocable Multi-Armed Bandit Problem Ritesh Madan Qualcomm-Flarion Technologies May 27, 2009 Joint work with Vivek Farias (MIT) 2 Multi-Armed Bandit Problem n arms, where each arm i is a Markov Decision
More informationInterest Rate Curves Calibration with Monte-Carlo Simulatio
Interest Rate Curves Calibration with Monte-Carlo Simulation 24 june 2008 Participants A. Baena (UCM) Y. Borhani (Univ. of Oxford) E. Leoncini (Univ. of Florence) R. Minguez (UCM) J.M. Nkhaso (UCM) A.
More informationMultilevel quasi-monte Carlo path simulation
Multilevel quasi-monte Carlo path simulation Michael B. Giles and Ben J. Waterhouse Lluís Antoni Jiménez Rugama January 22, 2014 Index 1 Introduction to MLMC Stochastic model Multilevel Monte Carlo Milstein
More informationInteractive Multiobjective Fuzzy Random Programming through Level Set Optimization
Interactive Multiobjective Fuzzy Random Programming through Level Set Optimization Hideki Katagiri Masatoshi Sakawa Kosuke Kato and Ichiro Nishizaki Member IAENG Abstract This paper focuses on multiobjective
More informationSupplementary Appendix to Parametric Inference and Dynamic State Recovery from Option Panels
Supplementary Appendix to Parametric Inference and Dynamic State Recovery from Option Panels Torben G. Andersen Nicola Fusari Viktor Todorov December 4 Abstract In this Supplementary Appendix we present
More informationHierarchical Models of Mnemonic Processes.
July, 2008 Collaborators Mike Pratte (Hire Him) Richard Morey (Too Late) We have seen a plethora of signal detection and multinomial processing tree models We have seen a plethora of signal detection and
More informationApproximate Composite Minimization: Convergence Rates and Examples
ISMP 2018 - Bordeaux Approximate Composite Minimization: Convergence Rates and S. Praneeth Karimireddy, Sebastian U. Stich, Martin Jaggi MLO Lab, EPFL, Switzerland sebastian.stich@epfl.ch July 4, 2018
More informationSTK 3505/4505: Summary of the course
November 22, 2016 CH 2: Getting started the Monte Carlo Way How to use Monte Carlo methods for estimating quantities ψ related to the distribution of X, based on the simulations X1,..., X m: mean: X =
More informationECO 317 Economics of Uncertainty Fall Term 2009 Tuesday October 6 Portfolio Allocation Mean-Variance Approach
ECO 317 Economics of Uncertainty Fall Term 2009 Tuesday October 6 ortfolio Allocation Mean-Variance Approach Validity of the Mean-Variance Approach Constant absolute risk aversion (CARA): u(w ) = exp(
More informationVladimir Spokoiny (joint with J.Polzehl) Varying coefficient GARCH versus local constant volatility modeling.
W e ie rstra ß -In stitu t fü r A n g e w a n d te A n a ly sis u n d S to c h a stik STATDEP 2005 Vladimir Spokoiny (joint with J.Polzehl) Varying coefficient GARCH versus local constant volatility modeling.
More informationONERA Fatigue Model. Z-set group. March 14, Mines ParisTech, CNRS UMR 7633 Centre des Matériaux BP 87, Evry cedex, France
ONERA Fatigue Model Z-set group Mines ParisTech, CNRS UMR 7633 Centre des Matériaux BP 87, 91003 Evry cedex, France March 14, 2013 Plan 1 ONERA Fatigue Model 2 Basic Tools Multiaxial stress amplitude (SEH)
More informationASSET PRICING WITH LIMITED RISK SHARING AND HETEROGENOUS AGENTS
ASSET PRICING WITH LIMITED RISK SHARING AND HETEROGENOUS AGENTS Francisco Gomes and Alexander Michaelides Roine Vestman, New York University November 27, 2007 OVERVIEW OF THE PAPER The aim of the paper
More informationMATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS
MATH307/37 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS School of Mathematics and Statistics Semester, 04 Tutorial problems should be used to test your mathematical skills and understanding of the lecture material.
More informationTangent Lévy Models. Sergey Nadtochiy (joint work with René Carmona) Oxford-Man Institute of Quantitative Finance University of Oxford.
Tangent Lévy Models Sergey Nadtochiy (joint work with René Carmona) Oxford-Man Institute of Quantitative Finance University of Oxford June 24, 2010 6th World Congress of the Bachelier Finance Society Sergey
More informationGlobal convergence rate analysis of unconstrained optimization methods based on probabilistic models
Math. Program., Ser. A DOI 10.1007/s10107-017-1137-4 FULL LENGTH PAPER Global convergence rate analysis of unconstrained optimization methods based on probabilistic models C. Cartis 1 K. Scheinberg 2 Received:
More informationMaking Gradient Descent Optimal for Strongly Convex Stochastic Optimization
for Strongly Convex Stochastic Optimization Microsoft Research New England NIPS 2011 Optimization Workshop Stochastic Convex Optimization Setting Goal: Optimize convex function F ( ) over convex domain
More informationSensitivity Analysis with Data Tables. 10% annual interest now =$110 one year later. 10% annual interest now =$121 one year later
Sensitivity Analysis with Data Tables Time Value of Money: A Special kind of Trade-Off: $100 @ 10% annual interest now =$110 one year later $110 @ 10% annual interest now =$121 one year later $100 @ 10%
More information9th Financial Risks International Forum
Calvet L., Czellar V.and C. Gouriéroux (2015) Structural Dynamic Analysis of Systematic Risk Duarte D., Lee K. and Scwenkler G. (2015) The Systemic E ects of Benchmarking University of Orléans March 21,
More informationA Model with Costly-State Verification
A Model with Costly-State Verification Jesús Fernández-Villaverde University of Pennsylvania December 19, 2012 Jesús Fernández-Villaverde (PENN) Costly-State December 19, 2012 1 / 47 A Model with Costly-State
More informationHousehold Debt, Financial Intermediation, and Monetary Policy
Household Debt, Financial Intermediation, and Monetary Policy Shutao Cao 1 Yahong Zhang 2 1 Bank of Canada 2 Western University October 21, 2014 Motivation The US experience suggests that the collapse
More informationNonlinear programming without a penalty function or a filter
Report no. NA-07/09 Nonlinear programming without a penalty function or a filter Nicholas I. M. Gould Oxford University, Numerical Analysis Group Philippe L. Toint Department of Mathematics, FUNDP-University
More informationDynamic Resource Allocation for Spot Markets in Cloud Computi
Dynamic Resource Allocation for Spot Markets in Cloud Computing Environments Qi Zhang 1, Quanyan Zhu 2, Raouf Boutaba 1,3 1 David. R. Cheriton School of Computer Science University of Waterloo 2 Department
More informationParameter estimation in SDE:s
Lund University Faculty of Engineering Statistics in Finance Centre for Mathematical Sciences, Mathematical Statistics HT 2011 Parameter estimation in SDE:s This computer exercise concerns some estimation
More informationExact shape-reconstruction by one-step linearization in EIT
Exact shape-reconstruction by one-step linearization in EIT Bastian von Harrach harrach@ma.tum.de Department of Mathematics - M1, Technische Universität München, Germany Joint work with Jin Keun Seo, Yonsei
More informationLong-Run Market Configurations in a Dynamic Quality-Ladder Model with Externalities. June 2, 2018
Long-Run Market Configurations in a Dynamic Quality-Ladder Model with Externalities Mario Samano HEC Montreal Marc Santugini University of Virginia June, 8 Introduction Motivation: A firm may decide to
More informationNonlinear programming without a penalty function or a filter
Math. Program., Ser. A (2010) 122:155 196 DOI 10.1007/s10107-008-0244-7 FULL LENGTH PAPER Nonlinear programming without a penalty function or a filter N. I. M. Gould Ph.L.Toint Received: 11 December 2007
More informationOptimal trading strategies under arbitrage
Optimal trading strategies under arbitrage Johannes Ruf Columbia University, Department of Statistics The Third Western Conference in Mathematical Finance November 14, 2009 How should an investor trade
More informationChapter 7 One-Dimensional Search Methods
Chapter 7 One-Dimensional Search Methods An Introduction to Optimization Spring, 2014 1 Wei-Ta Chu Golden Section Search! Determine the minimizer of a function over a closed interval, say. The only assumption
More informationSimple Improvement Method for Upper Bound of American Option
Simple Improvement Method for Upper Bound of American Option Koichi Matsumoto (joint work with M. Fujii, K. Tsubota) Faculty of Economics Kyushu University E-mail : k-matsu@en.kyushu-u.ac.jp 6th World
More informationA Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization
A Generic Quasi-Newton Algorithm for Faster Gradient-Based Optimization Hongzhou Lin 1, Julien Mairal 1, Zaid Harchaoui 2 1 Inria, Grenoble 2 University of Washington LCCC Workshop on large-scale and distributed
More informationA simple wealth model
Quantitative Macroeconomics Raül Santaeulàlia-Llopis, MOVE-UAB and Barcelona GSE Homework 5, due Thu Nov 1 I A simple wealth model Consider the sequential problem of a household that maximizes over streams
More informationVariable Annuities with Lifelong Guaranteed Withdrawal Benefits
Variable Annuities with Lifelong Guaranteed Withdrawal Benefits presented by Yue Kuen Kwok Department of Mathematics Hong Kong University of Science and Technology Hong Kong, China * This is a joint work
More informationEC316a: Advanced Scientific Computation, Fall Discrete time, continuous state dynamic models: solution methods
EC316a: Advanced Scientific Computation, Fall 2003 Notes Section 4 Discrete time, continuous state dynamic models: solution methods We consider now solution methods for discrete time models in which decisions
More informationCalibrating to Market Data Getting the Model into Shape
Calibrating to Market Data Getting the Model into Shape Tutorial on Reconfigurable Architectures in Finance Tilman Sayer Department of Financial Mathematics, Fraunhofer Institute for Industrial Mathematics
More informationOn modelling of electricity spot price
, Rüdiger Kiesel and Fred Espen Benth Institute of Energy Trading and Financial Services University of Duisburg-Essen Centre of Mathematics for Applications, University of Oslo 25. August 2010 Introduction
More informationPrinciples of Financial Computing
Principles of Financial Computing Prof. Yuh-Dauh Lyuu Dept. Computer Science & Information Engineering and Department of Finance National Taiwan University c 2008 Prof. Yuh-Dauh Lyuu, National Taiwan University
More informationOptimal Taxation Under Capital-Skill Complementarity
Optimal Taxation Under Capital-Skill Complementarity Ctirad Slavík, CERGE-EI, Prague (with Hakki Yazici, Sabanci University and Özlem Kina, EUI) January 4, 2019 ASSA in Atlanta 1 / 31 Motivation Optimal
More informationBeauty Contests and the Term Structure
Beauty Contests and the Term Structure By Martin Ellison & Andreas Tischbirek Discussion by Julian Kozlowski, Federal Reserve Bank of St. Louis Expectations in Dynamic Macroeconomics Model, Birmingham,
More information