This monograph collects in one place the basic definitions, a careful description of the model, and discussion of how convex optimization can be used in multi-period trading, all in a common notation and framework.

Discover foundational and advanced techniques in quantitative equity trading from a veteran insider In Quantitative Portfolio Management: The Art and Science of Statistical Arbitrage, distinguished physicist-turned-quant Dr. Michael Isichenko delivers a systematic review of the quantitative trading of equities, or statistical arbitrage. The book teaches you how to source financial data, learn patterns of asset returns from historical data, generate and combine multiple forecasts, manage risk, build a stock portfolio optimized for risk and trading costs, and execute trades. In this important book, you’ll discover: Machine learning methods of forecasting stock returns in efficient financial markets How to combine multiple forecasts into a single model by using secondary machine learning, dimensionality reduction, and other methods Ways of avoiding the pitfalls of overfitting and the curse of dimensionality, including topics of active research such as “benign overfitting” in machine learning The theoretical and practical aspects of portfolio construction, including multi-factor risk models, multi-period trading costs, and optimal leverage Perfect for investment professionals, like quantitative traders and portfolio managers, Quantitative Portfolio Management will also earn a place in the libraries of data scientists and students in a variety of statistical and quantitative disciplines. It is an indispensable guide for anyone who hopes to improve their understanding of how to apply data science, machine learning, and optimization to the stock market.

In this book, theory of large scale optimization is introduced with case studies of real-world problems and applications of structured mathematical modeling. The large scale optimization methods are represented by various theories such as Benders’ decomposition, logic-based Benders’ decomposition, Lagrangian relaxation, Dantzig –Wolfe decomposition, multi-tree decomposition, Van Roy’ cross decomposition and parallel decomposition for mathematical programs such as mixed integer nonlinear programming and stochastic programming. Case studies of large scale optimization in supply chain management, smart manufacturing, and Industry 4.0 are investigated with efficient implementation for real-time solutions. The features of case studies cover a wide range of fields including the Internet of things, advanced transportation systems, energy management, supply chain networks, service systems, operations management, risk management, and financial and sales management. Instructors, graduate students, researchers, and practitioners, would benefit from this book finding the applicability of large scale optimization in asynchronous parallel optimization, real-time distributed network, and optimizing the knowledge-based expert system for convex and non-convex problems.

This book is the culmination of the authors’ industry-academic collaboration in the past several years. The investigation is largely motivated by bank balance sheet management problems. The main difference between a bank balance sheet management problem and a typical portfolio optimization problem is that the former involves multiple risks. The related theoretical investigation leads to a significant extension of the scope of portfolio theories. The book combines practitioners’ perspectives and mathematical rigor. For example, to guide the bank managers to trade off different Pareto efficient points, the topological structure of the Pareto efficient set is carefully analyzed. Moreover, on top of computing solutions, the authors focus the investigation on the qualitative properties of those solutions and their financial meanings. These relations, such as the role of duality, are most useful in helping bank managers to communicate their decisions to the different stakeholders. Finally, bank balance sheet management problems of varying levels of complexity are discussed to illustrate how to apply the central mathematical results. Although the primary motivation and application examples in this book are focused in the area of bank balance sheet management problems, the range of applications of the general portfolio theory is much wider. As a matter of fact, most financial problems involve multiple types of risks. Thus, the book is a good reference for financial practitioners in general and students who are interested in financial applications. This book can also serve as a nice example of a case study for applied mathematicians who are interested in engaging in industry-academic collaboration.

The study of Euclidean distance matrices (EDMs) fundamentally asks what can be known geometrically given onlydistance information between points in Euclidean space. Each point may represent simply locationor, abstractly, any entity expressible as a vector in finite-dimensional Euclidean space.The answer to the question posed is that very much can be known about the points;the mathematics of this combined study of geometry and optimization is rich and deep.Throughout we cite beacons of historical accomplishment.The application of EDMs has already proven invaluable in discerning biological molecular conformation.The emerging practice of localization in wireless sensor networks, the global positioning system (GPS), and distance-based pattern recognitionwill certainly simplify and benefit from this theory.We study the pervasive convex Euclidean bodies and their various representations.In particular, we make convex polyhedra, cones, and dual cones more visceral through illustration, andwe study the geometric relation of polyhedral cones to nonorthogonal bases biorthogonal expansion.We explain conversion between halfspace- and vertex-descriptions of convex cones,we provide formulae for determining dual cones,and we show how classic alternative systems of linear inequalities or linear matrix inequalities and optimality conditions can be explained by generalized inequalities in terms of convex cones and their duals.The conic analogue to linear independence, called conic independence, is introducedas a new tool in the study of classical cone theory; the logical next step in the progression:linear, affine, conic.Any convex optimization problem has geometric interpretation.This is a powerful attraction: the ability to visualize geometry of an optimization problem.We provide tools to make visualization easier.The concept of faces, extreme points, and extreme directions of convex Euclidean bodiesis explained here, crucial to understanding convex optimization.The convex cone of positive semidefinite matrices, in particular, is studied in depth.We mathematically interpret, for example,its inverse image under affine transformation, and we explainhow higher-rank subsets of its boundary united with its interior are convex.The Chapter on "Geometry of convex functions",observes analogies between convex sets and functions:The set of all vector-valued convex functions is a closed convex cone.Included among the examples in this chapter, we show how the real affinefunction relates to convex functions as the hyperplane relates to convex sets.Here, also, pertinent results formultidimensional convex functions are presented that are largely ignored in the literature;tricks and tips for determining their convexityand discerning their geometry, particularly with regard to matrix calculus which remains largely unsystematizedwhen compared with the traditional practice of ordinary calculus.Consequently, we collect some results of matrix differentiation in the appendices.The Euclidean distance matrix (EDM) is studied,its properties and relationship to both positive semidefinite and Gram matrices.We relate the EDM to the four classical axioms of the Euclidean metric;thereby, observing the existence of an infinity of axioms of the Euclidean metric beyondthe triangle inequality. We proceed byderiving the fifth Euclidean axiom and then explain why furthering this endeavoris inefficient because the ensuing criteria (while describing polyhedra)grow linearly in complexity and number.Some geometrical problems solvable via EDMs,EDM problems posed as convex optimization, and methods of solution arepresented;\eg, we generate a recognizable isotonic map of the United States usingonly comparative distance information (no distance information, only distance inequalities).We offer a new proof of the classic Schoenberg criterion, that determines whether a candidate matrix is an EDM. Our proofrelies on fundamental geometry; assuming, any EDM must correspond to a list of points contained in some polyhedron(possibly at its vertices) and vice versa.It is not widely known that the Schoenberg criterion implies nonnegativity of the EDM entries; proved here.We characterize the eigenvalues of an EDM matrix and then devisea polyhedral cone required for determining membership of a candidate matrix(in Cayley-Menger form) to the convex cone of Euclidean distance matrices (EDM cone); \ie,a candidate is an EDM if and only if its eigenspectrum belongs to a spectral cone for EDM^N.We will see spectral cones are not unique.In the chapter "EDM cone", we explain the geometric relationship betweenthe EDM cone, two positive semidefinite cones, and the elliptope.We illustrate geometric requirements, in particular, for projection of a candidate matrixon a positive semidefinite cone that establish its membership to the EDM cone. The faces of the EDM cone are described,but still open is the question whether all its faces are exposed as they are for the positive semidefinite cone.The classic Schoenberg criterion, relating EDM and positive semidefinite cones, isrevealed to be a discretized membership relation (a generalized inequality, a new Farkas''''''''-like lemma)between the EDM cone and its ordinary dual. A matrix criterion for membership to the dual EDM cone is derived thatis simpler than the Schoenberg criterion.We derive a new concise expression for the EDM cone and its dual involvingtwo subspaces and a positive semidefinite cone."Semidefinite programming" is reviewedwith particular attention to optimality conditionsof prototypical primal and dual conic programs,their interplay, and the perturbation method of rank reduction of optimal solutions(extant but not well-known).We show how to solve a ubiquitous platonic combinatorial optimization problem from linear algebra(the optimal Boolean solution x to Ax=b)via semidefinite program relaxation.A three-dimensional polyhedral analogue for the positive semidefinite cone of 3X3 symmetricmatrices is introduced; a tool for visualizing in 6 dimensions.In "EDM proximity"we explore methods of solution to a few fundamental and prevalentEuclidean distance matrix proximity problems; the problem of finding that Euclidean distance matrix closestto a given matrix in the Euclidean sense.We pay particular attention to the problem when compounded with rank minimization.We offer a new geometrical proof of a famous result discovered by Eckart \& Young in 1936 regarding Euclideanprojection of a point on a subset of the positive semidefinite cone comprising all positive semidefinite matriceshaving rank not exceeding a prescribed limit rho.We explain how this problem is transformed to a convex optimization for any rank rho.

Leveraging the research efforts of more than sixty experts in the area, this book reviews cutting-edge practices in machine learning for financial markets. Instead of seeing machine learning as a new field, the authors explore the connection between knowledge developed by quantitative finance over the past forty years and techniques generated by the current revolution driven by data sciences and artificial intelligence. The text is structured around three main areas: 'Interactions with investors and asset owners,' which covers robo-advisors and price formation; 'Risk intermediation,' which discusses derivative hedging, portfolio construction, and machine learning for dynamic optimization; and 'Connections with the real economy,' which explores nowcasting, alternative data, and ethics of algorithms. Accessible to a wide audience, this invaluable resource will allow practitioners to include machine learning driven techniques in their day-to-day quantitative practices, while students will build intuition and come to appreciate the technical tools and motivation for the theory.

The multi-volume set LNAI 13713 until 13718 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2022, which took place in Grenoble, France, in September 2022. The 236 full papers presented in these proceedings were carefully reviewed and selected from a total of 1060 submissions. In addition, the proceedings include 17 Demo Track contributions. The volumes are organized in topical sections as follows: Part I: Clustering and dimensionality reduction; anomaly detection; interpretability and explainability; ranking and recommender systems; transfer and multitask learning; Part II: Networks and graphs; knowledge graphs; social network analysis; graph neural networks; natural language processing and text mining; conversational systems; Part III: Deep learning; robust and adversarial machine learning; generative models; computer vision; meta-learning, neural architecture search; Part IV: Reinforcement learning; multi-agent reinforcement learning; bandits and online learning; active and semi-supervised learning; private and federated learning; . Part V: Supervised learning; probabilistic inference; optimal transport; optimization; quantum, hardware; sustainability; Part VI: Time series; financial machine learning; applications; applications: transportation; demo track.

Get to know the ‘why’ and ‘how’ of machine learning and big data in quantitative investment Big Data and Machine Learning in Quantitative Investment is not just about demonstrating the maths or the coding. Instead, it’s a book by practitioners for practitioners, covering the questions of why and how of applying machine learning and big data to quantitative finance. The book is split into 13 chapters, each of which is written by a different author on a specific case. The chapters are ordered according to the level of complexity; beginning with the big picture and taxonomy, moving onto practical applications of machine learning and finally finishing with innovative approaches using deep learning. • Gain a solid reason to use machine learning • Frame your question using financial markets laws • Know your data • Understand how machine learning is becoming ever more sophisticated Machine learning and big data are not a magical solution, but appropriately applied, they are extremely effective tools for quantitative investment — and this book shows you how.

This book introduces machine learning methods in finance. It presents a unified treatment of machine learning and various statistical and computational disciplines in quantitative finance, such as financial econometrics and discrete time stochastic control, with an emphasis on how theory and hypothesis tests inform the choice of algorithm for financial data modeling and decision making. With the trend towards increasing computational resources and larger datasets, machine learning has grown into an important skillset for the finance industry. This book is written for advanced graduate students and academics in financial econometrics, mathematical finance and applied statistics, in addition to quants and data scientists in the field of quantitative finance. Machine Learning in Finance: From Theory to Practice is divided into three parts, each part covering theory and applications. The first presents supervised learning for cross-sectional data from both a Bayesian and frequentist perspective. The more advanced material places a firm emphasis on neural networks, including deep learning, as well as Gaussian processes, with examples in investment management and derivative modeling. The second part presents supervised learning for time series data, arguably the most common data type used in finance with examples in trading, stochastic volatility and fixed income modeling. Finally, the third part presents reinforcement learning and its applications in trading, investment and wealth management. Python code examples are provided to support the readers' understanding of the methodologies and applications. The book also includes more than 80 mathematical and programming exercises, with worked solutions available to instructors. As a bridge to research in this emergent field, the final chapter presents the frontiers of machine learning in finance from a researcher's perspective, highlighting how many well-known concepts in statistical physics are likely to emerge as important methodologies for machine learning in finance.