Constructing banking networks under decreasing costs of link formation

The structure of networks plays a central role in the behavior of financial systems and their response to policy. Real-world networks, however, are rarely directly observable: banks’ assets and liabilities are typically known, but not who is lending how much and to whom. This paper adds to the existing literature in two ways. First, it shows how to simulate realistic networks that are based on balance-sheet information. To do so, we introduce a model where links cause fixed-costs, independent of contract size; but the costs per link decrease the more connected a bank is (scale economies). Second, to approach the optimization problem, we develop a new algorithm inspired by the transportation planning literature and research in stochastic search heuristics. Computational experiments find that the resulting networks are not only consistent with the balance sheets, but also resemble real-world financial networks in their density (which is sparse but not minimally dense) and in their core-periphery and disassortative structure.

     

Exact and heuristic approaches for the index tracking problem with UCITS constraints

Index tracking aims at determining an optimal portfolio that replicates the performance of an index or benchmark by investing in a smaller number of constituents or assets. The tracking portfolio should be cheap to maintain and update, i.e., invest in a smaller number of constituents than the index, have low turnover and low transaction costs, and should avoid large positions in few assets, as required by the European Union Directive UCITS (Undertaking for Collective Investments in Transferable Securities) rules. The UCITS rules make the problem hard to be satisfactorily modeled and solved to optimality: no exact methods but only heuristics have been proposed so far. The aim of this paper is twofold. First, we present the first Mixed Integer Quadratic Programming (MIQP) formulation for the constrained index tracking problem with the UCITS rules compliance. This allows us to obtain exact solutions for small- and medium-size problems based on real-world datasets. Second, we compare these solutions with the ones provided by the state-of-art heuristic Differential Evolution and Combinatorial Search for Index Tracking (DECS-IT), obtaining information about the heuristic performance and its reliability for the solution of large-size problems that cannot be solved with the exact approach. Empirical results show that DECS-IT is indeed appropriate to tackle the index tracking problem in such cases. Furthermore, we propose a method that combines the good characteristics of the exact and of the heuristic approaches.     

Differential evolution and combinatorial search for constrained index-tracking

Index-tracking is a low-cost alternative to active portfolio management. The implementation of a quantitative approach, however, is a major challenge from an optimization perspective. The optimal selection of a group of assets that can replicate the index of a much larger portfolio requires both to find the optimal subset of assets and to fine-tune their weights. The former is a combinatorial, the latter a continuous numerical problem. Both problems need to be addressed simultaneously, because whether or not a selection of assets is promising depends on the allocation weights and vice versa. Moreover, the problem is usually of high dimension. Typically, an optimal subset of 30–150 positions out of 100–600 need to be selected and their weights determined. Search heuristics can be a valuable alternative to traditional methods, which often cannot deal with the problem. In this paper, we propose a new optimization method, which is partly based on Differential Evolution (DE) and on combinatorial search. The main advantage of our method is that it can tackle the index-tracking problem as complex as it is, generating accurate and robust results.     

The Maximum Lq-Likelihood Method: An Application to Extreme Quantile Estimation in Finance

Estimating financial risk is a critical issue for banks and insurance companies. Recently, quantile estimation based on extreme value theory (EVT) has found a successful domain of application in such a context, outperforming other methods. Given a parametric model provided by EVT, a natural approach is maximum likelihood estimation. Although the resulting estimator is asymptotically efficient, often the number of observations available to estimate the parameters of the EVT models is too small to make the large sample property trustworthy. In this paper, we study a new estimator of the parameters, the maximum Lq-likelihood estimator (MLqE), introduced by Ferrari and Yang (Estimation of tail probability via the maximum Lq-likelihood method, Technical Report 659, School of Statistics, University of Minnesota, 2007 ). We show that the MLqE outperforms the standard MLE, when estimating tail probabilities and quantiles of the generalized extreme value (GEV) and the generalized Pareto (GP) distributions. First, we assess the relative efficiency between the MLqE and the MLE for various sample sizes, using Monte Carlo simulations. Second, we analyze the performance of the MLqE for extreme quantile estimation using real-world financial data. The MLqE is characterized by a distortion parameter q and extends the traditional log-likelihood maximization procedure. When q→1, the new estimator approaches the traditional maximum likelihood estimator (MLE), recovering its desirable asymptotic properties; when q ≠ 1 and the sample size is moderate or small, the MLqE successfully trades bias for variance, resulting in an overall gain in terms of accuracy (mean squared error).      

Un-diversifying during crises: Is it a good idea?

Computational Management Science - High levels of correlation among financial assets and extreme losses are typical during crises. In such situations, investing in few assets might be a better...     

Multiobjective optimization using differential evolution for real-world portfolio optimization

Portfolio optimization is an important aspect of decision-support in investment management. Realistic portfolio optimization, in contrast to simplistic mean-variance optimization, is a challenging problem, because it requires to determine a set of optimal solutions with respect to multiple objectives, where the objective functions are often multimodal and non-smooth. Moreover, the objectives are subject to various constraints of which many are typically non-linear and discontinuous. Conventional optimization methods, such as quadratic programming, cannot cope with these realistic problem properties. A valuable alternative are stochastic search heuristics, such as simulated annealing or evolutionary algorithms. We propose a new multiobjective evolutionary algorithm for portfolio optimization, which we call DEMPO??Differential Evolution for Multiobjective Portfolio Optimization. In our experimentation, we compare DEMPO with quadratic programming and another well-known evolutionary algorithm for multiobjective optimization called NSGA-II. The main advantage of DEMPO is its ability to tackle a portfolio optimization task without simplifications, while obtaining very satisfying results in reasonable runtime.     

Sparse precision matrices for minimum variance portfolios

Computational Management Science - Financial crises are typically characterized by highly positively correlated asset returns due to the simultaneous distress on almost all securities, high...     

Polarization modulation Fourier transform infrared spectroscopy

Polarization modulation Fourier transform infrared spectroscopy can be measured by either double modulation FTIR or interferometric modulation FTIR techniques. The principles of both techniques are presented with examples of representative measurements. The relative advantages and disadvantages of each method are compared.