MFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 18, 2015

Similar documents
Bayesian Optimization

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 3, 2010

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. January 25, 2012

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. January 28, 2015

Outline. Motivation Contest Sample. Estimator. Loss. Standard Error. Prior Pseudo-Data. Bayesian Estimator. Estimators. John Dodson.

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. February 4, 2015

FE670 Algorithmic Trading Strategies. Stevens Institute of Technology

Fundamentals in Optimal Investments. Lecture I

Attilio Meucci. Issues in Quantitative Portfolio Management: Handling Estimation Risk

Market Risk. MFM Practitioner Module: Quantitiative Risk Management. John Dodson. February 8, Market Risk. John Dodson.

Markowitz Efficient Portfolio Frontier as Least-Norm Analytic Solution to Underdetermined Equations

Prior Information: Shrinkage and Black-Litterman. Prof. Daniel P. Palomar

Aggregate Risk. MFM Practitioner Module: Quantitative Risk Management. John Dodson. February 6, Aggregate Risk. John Dodson.

MFM Practitioner Module: Risk & Asset Allocation. John Dodson. September 7, 2011

F & B Approaches to a simple model

A Dynamic Model for Investment Strategy

Model Selection and Geometry

Optimizing allocations

Portfolios that Contain Risky Assets 17: Fortune s Formulas

Frequentist-Bayesian Model Comparisons: A Simple Example

Information Choice in Macroeconomics and Finance.

Dependence. MFM Practitioner Module: Risk & Asset Allocation. John Dodson. September 11, Dependence. John Dodson. Outline.

Parametric Techniques Lecture 3

Parametric Techniques

Robust Optimization: Applications in Portfolio Selection Problems

A Very Brief Summary of Statistical Inference, and Examples

6.079/6.975 S. Boyd & P. Parrilo December 10 11, Final exam

Robust Efficient Frontier Analysis with a Separable Uncertainty Model

Notes on Discriminant Functions and Optimal Classification

ECON4510 Finance Theory Lecture 2

Performance Measures for Ranking and Selection Procedures

Estimating Covariance Using Factorial Hidden Markov Models

Optimal Investment Strategies: A Constrained Optimization Approach

Multivariate GARCH models.

Portfolios that Contain Risky Assets 15: Central Limit Theorem Objectives

IEOR E4703: Monte-Carlo Simulation

Particle swarm optimization approach to portfolio optimization

Miloš Kopa. Decision problems with stochastic dominance constraints

Lecture 20 May 18, Empirical Bayes Interpretation [Efron & Morris 1973]

ORIGINS OF STOCHASTIC PROGRAMMING

Decision theory. 1 We may also consider randomized decision rules, where δ maps observed data D to a probability distribution over

Online Question Asking Algorithms For Measuring Skill

The Behaviour of the Akaike Information Criterion when Applied to Non-nested Sequences of Models

A Very Brief Summary of Bayesian Inference, and Examples

Maximum Likelihood, Logistic Regression, and Stochastic Gradient Training

Lecture Notes 1: Decisions and Data. In these notes, I describe some basic ideas in decision theory. theory is constructed from

Z = (X Loc X) (DisSq X) 1 (X Loc X).

Minimum Error Rate Classification

CSC321 Lecture 18: Learning Probabilistic Models

ECON4515 Finance theory 1 Diderik Lund, 5 May Perold: The CAPM

Econ 2148, spring 2019 Statistical decision theory

A BAYESIAN SOLUTION TO INCOMPLETENESS

COS513 LECTURE 8 STATISTICAL CONCEPTS

The Black Litterman Model: A Detailed Exploration

Robustness and bootstrap techniques in portfolio efficiency tests

Statistics: Learning models from data

Birgit Rudloff Operations Research and Financial Engineering, Princeton University

Food delivered. Food obtained S 3

Computational Connections Between Robust Multivariate Analysis and Clustering

Bargaining, Contracts, and Theories of the Firm. Dr. Margaret Meyer Nuffield College

Graduate Microeconomics II Lecture 5: Cheap Talk. Patrick Legros

Introduction & Random Variables. John Dodson. September 3, 2008

Predictive Hypothesis Identification

ECO 317 Economics of Uncertainty Fall Term 2009 Slides to accompany 13. Markets and Efficient Risk-Bearing: Examples and Extensions

A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance

Model comparison and selection

On the unbiased efficient frontier: some analytical and computational remarks

The Jackknife-Like Method for Assessing Uncertainty of Point Estimates for Bayesian Estimation in a Finite Gaussian Mixture Model

AN ADAPTIVE PROCEDURE FOR ESTIMATING COHERENT RISK MEASURES BASED ON GENERALIZED SCENARIOS. Vadim Lesnevski Barry L. Nelson Jeremy Staum

For more information about how to cite these materials visit

Empirical Risk Minimization is an incomplete inductive principle Thomas P. Minka

Minimax-Regret Sample Design in Anticipation of Missing Data, With Application to Panel Data. Jeff Dominitz RAND. and

LECTURE 5 NOTES. n t. t Γ(a)Γ(b) pt+a 1 (1 p) n t+b 1. The marginal density of t is. Γ(t + a)γ(n t + b) Γ(n + a + b)

Bayesian Decision Theory

DRAFT. Edward Ngailo. Department of Mathematics, University of Dar es Salaam Department of Mathematics, Stockholm University

Higher order moments of the estimated tangency portfolio weights

The comparative studies on reliability for Rayleigh models

High-dimensional Problems in Finance and Economics. Thomas M. Mertens

Filling in the Blanks: Network Structure and Systemic Risk

Speculation and the Bond Market: An Empirical No-arbitrage Framework

Statistical Approaches to Learning and Discovery. Week 4: Decision Theory and Risk Minimization. February 3, 2003

THE CHOICE BETWEEN MULTIPLICATIVE AND ADDITIVE OUTPUT UNCERTAINTY

Hypothesis Testing. 1 Definitions of test statistics. CB: chapter 8; section 10.3

Statistical Data Mining and Machine Learning Hilary Term 2016

Christian Hellwig 1 Sebastian Kohls 2 Laura Veldkamp 3. May 2012

3.0.1 Multivariate version and tensor product of experiments

Mathematics for Economics and Finance

Bayesian Decision and Bayesian Learning

Advanced Statistics I : Gaussian Linear Model (and beyond)

ROBUST ESTIMATOR FOR MULTIPLE INLIER STRUCTURES

Bandit Algorithms. Zhifeng Wang ... Department of Statistics Florida State University

Sensor Tasking and Control

Bayesian Model Comparison

Eco517 Fall 2014 C. Sims FINAL EXAM

SOME HISTORY OF STOCHASTIC PROGRAMMING

Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization

Density Estimation. Seungjin Choi

Sparse Linear Models (10/7/13)

Correlated Equilibrium in Games with Incomplete Information

OPTIMAL DESIGN INPUTS FOR EXPERIMENTAL CHAPTER 17. Organization of chapter in ISSO. Background. Linear models

Transcription:

MFM Practitioner Module: Risk & Asset Allocation February 18, 2015

No introduction to portfolio optimization would be complete without acknowledging the significant contribution of the Markowitz mean-variance efficient frontier concept which lies at the heart of the two-step procedure Nonetheless, the mean-variance analysis has two major shortcomings which subsequent researchers and practitioners have tried to address: It is not robust, and there is no clear accommodation for expert views. N.B.: These were not issues for Markowitz original application, because he argued that all investors were attempting to solve the same problem with all available information, and therefore a broad capitalization-weighted index should serve as a proxy for α SR for all 1. 1 Meucci argues that in fact α MV is the implicit benchmark.

Refinements Meucci discusses four approaches to these shortcomings. Coherent Allocations It may be valuable to re-cast the optimization problem in an explicitly setting. utility maximization optimization In the former case we use subjective probabilities; in the latter case we introduce a risk functional. Heuristic Techniques These are becoming more common in practice. re-sampling subjective characterization These address each of the mean-variance shortcomings in turn and can be applied separately or together within the two-step procedure.

Recall that we denote by θ the parameters that we have chosen to characterize the market vector random variable M (θ). Since the investor satisfaction S θ (α) and the feasible set C θ associated with an portfolio α C θ are estimable, the optimal portfolio α = arg max α C θ S θ (α) also depends in an estimable (non-random) way on θ. But we can only estimate θ; and we may have doubts about the characterization of M. These are two varieties of estimation risk. How can we express our risk aversion to estimation risk in our allocation decision?

This is not a theoretical or academic issue. The procedures we have outlined so far effectively seek out and try to exploit fine-grained details in the markets in their attempt to optimize satisfaction. Decisions We would be ill-advised to incur transaction costs and undue risks if these details weare artificial. We need our portfolio allocation procedure to be robust. In analogy to the concept of estimator loss that was introduced in chapter 4, Meucci introduces here the concept of opportunity cost, OC θ (α) = S θ (α ) S θ (α) 0 where α plays the role of the estimator and θ plays the role of the random sample.

In contrast to the situation in classical estimation theory with quadratic loss, we do not have a direct decomposition of expected loss into contributions from bias and inefficiency. Decision Strategies But Meucci shows us two examples of extreme allocation decision strategies that attempt to illustrate this trade-off. prior allocation strategy high bias low inefficiency sample-based allocation strategy low bias high inefficiency

Utility Maximization We have already discussed the limitations of expected utility as an index of satisfaction; in particular objective support and treatment of diversification. One advantage that utility has is it readily accommodates estimation risk. As before, denote the unknown parameters of the market vector by θ. As long as the constraints do not depend upon on these parameters, we can write arg max CE θ(α) α C ( ( )) = arg max E u Ψ θ α α C = arg max u ( α m ) f M θ (m)f θ Y (N)(θ) dθ dm α C where f θ Y (N)( ) is posterior parameter density, based on the prior density f θ ( ) and the data y (N) = (x 1,..., x N ).

Utility Maximization Two-Step Procedure As long as the utility u( ) is increasing, this index is consistent with weak stochastic dominance, so the integral needs to be evaluated only along the efficient frontier based upon the predictive characterization with E M = mf M θ (m)f θ Y (N)(θ) dθ dm cov M = mm f M θ (m)f θ Y (N)(θ) dθ dm E M E M N.B.: Often the two-step procedure can be complicated by constraints that depend upon the parameters of the market vector. In this case, the approach will probably fail because we may not be able to pull the maximization out of the outer integral.

optimization is based on the concept of opportunity cost. OC θ (α) = S θ (α) + max α C θ S θ (α ) 0 In classical optimization, θ is known with certainty and we can choose the allocation with zero opportunity cost. When we only have an estimate for θ, we can obtain a more robust result using a minimax criterion. Minimax Criterion Say we can be confident that the unknown true value of the market vector parameters lies in some range θ Θ. If the allocation constraints depend upon θ, we can define the smallest possible feasible set for this range, C Θ, and choose the optimal allocation as α Θ = arg min α C Θ max θ Θ OC θ(α)

There is a trade-off in selecting the range for the market vector parameters, θ Θ. large enough so that you can be confident that it includes the true value small enough so that the actual opportunity cost incurred from sub-optimality is not too large The author proposes the minimum-measure ellipsoid at some level of confidence based on the posterior characterization of the market vector parameters. Aversion to Market & The problem for the mean-variance efficient frontier can be reduced to second-order cone programming. arg max α ˆµ γ m α ˆΣα γ e α T α α C for M µ N (µ, ˆΣ) and µ N (ˆµ, T ).

re-sampling 2 is neither motivated nor justified by probability or decision theory (nor is it re-sampling in the statistical sense). It is a heuristic intended to directly address the instability of optimal portfolios. Simulations Once the parameters for the market vector have been estimated from y (N), instead of using ˆθ to maximize S θ (α), 1. use them to generate a large number of random samples of the invariants each of length N, { y (N,1),..., y (N,Q)} 2. use the new samples to re-estimate the parameters, {ˆθ (1),..., ˆθ (Q) } 3. use the re-estimated parameters to re-solve the optimization problem, { α (1),..., α (Q)} report back the mean allocation, α RS = 1 Q Q q=1 α(q) 2 The text acknowledges relevant intellectual property rights.

Presumably an argument based upon the Law of Large Numbers can be made to show that this procedure converges. But the author points out several considerations: If the constraints are not linear in the allocations, there is nothing to prevent the procedure from converging to an infeasible portfolio. We know nothing about the relationship between the resampled allocation and the true optimal allocation. This technique is comparable to other heuristics for stabilizing the optimal portfolio such as the inclusion of transactions penalties or exogenous diversification rules. Pseudo-Data Interpretation My own speculation is that one could develop a more coherent version of this technique with the pseudo-data interpretation of the conjugate prior, where the pseudo-data vector of length NQ is drawn from a prior based on ˆθ.

The procedure can be interpreted as a technique for specifying a prior on the market vector parameters based on manager advantage. It can be generalized, but was originally presented and is most easily understood in terms of linear views on a normal model for the market invariants. Objective Market Model We assume that the market vector is distributed according to M N (µ, Σ) where µ and Σ are given (perhaps by Σ = Σ and µ = 1 ζ 0 Σα 0 in equilibrium). Manager Expertise The manager s expertise may be limited to a subset of the market, defined by a picks matrix P that defines the linear combinations of factors for which the manager is prepared to provide a view.

Manager View The manager expresses his view, v, on the picks and a scalar confidence, 0 c 1 ( ( ) ) 1 V PM N v, c 1 PΣP Subjective Measure Conditioning the objective characterization with the view leads to the subjective characterization M V N (µ BL, Σ BL ) with µ BL = µ + cσp ( PΣP ) 1 (v Pµ) Σ BL = Σ cσp ( PΣP ) 1 PΣ

We can then proceed with classical equivalent optimization using the subjective characterization of the market vector. Consistency of The Subjective Measure It may be difficult to quantify the manager s confidence, c. To that end, it is useful to measure how consistent the manager s subjective characterization is with the objective characterization. Focusing on the subjective location, the author notes that Mahalanobis distance (squared) for a normal is chi-squared. He defines the consistency between µ BL and µ as C = 1 F χ 2 N ( (µbl µ) Σ 1 (µ BL µ) ) where χ 2 N G ( N 2, 1 2). A low level of consistency reflects bold views.

The approach is reminiscent of updating a prior to obtain a posterior, but it is not strictly. Interpretation For one, we take the market vector to be normal with mean and covariance parameters, but we never specify a prior characterization for those parameters; rather, we condition the parameters directly on the view. This is an application of Bayes Theorem, but not an application of estimation theory. Opinion Pooling In subsequent publications 3, Meucci introduces a more general version of this model, which has the immediate practical appeal of allowing one to extend the concept of a view into non-normal characterizations of the market. 3 E.g. RISK Magazine, 2/06.