Search

We develop a unifying framework for modeling multiple term structures arising in financial, insurance, and energy markets. We adopt the Heath-Jarrow-Morton approach under the real-world probability and provide a full description of the set of local martingale deflators, which ensure market viability. We perform a thorough analysis of the stochastic partial differential equation arising in the model, addressing existence and uniqueness of a solution, invariance properties and existence of affine realizations., Comment: 45 pages

We introduce Pixtral-12B, a 12--billion-parameter multimodal language model. Pixtral-12B is trained to understand both natural images and documents, achieving leading performance on various multimodal benchmarks, surpassing a number of larger models. Unlike many open-source models, Pixtral is also a cutting-edge text model for its size, and does not compromise on natural language performance to excel in multimodal tasks. Pixtral uses a new vision encoder trained from scratch, which allows it to ingest images at their natural resolution and aspect ratio. This gives users flexibility on the number of tokens used to process an image. Pixtral is also able to process any number of images in its long context window of 128K tokens. Pixtral 12B substanially outperforms other open models of similar sizes (Llama-3.2 11B \& Qwen-2-VL 7B). It also outperforms much larger open models like Llama-3.2 90B while being 7x smaller. We further contribute an open-source benchmark, MM-MT-Bench, for evaluating vision-language models in practical scenarios, and provide detailed analysis and code for standardized evaluation protocols for multimodal LLMs. Pixtral-12B is released under Apache 2.0 license.

The paper introduces benchmark-neutral pricing and hedging for long-term contingent claims. It employs the growth optimal portfolio of the stocks as numeraire and the new benchmark-neutral pricing measure for pricing. For a realistic parsimonious model, this pricing measure turns out to be an equivalent probability measure, which is not the case for the risk-neutral pricing measure. Many risk-neutral prices of long-term contracts are more expensive than necessary. Benchmark-neutral pricing identifies the minimal possible prices of contingent claims, which is illustrated with remarkable accuracy for a long-term zero-coupon bond.

Stable Diffusion XL (SDXL) has become the best open source text-to-image model (T2I) for its versatility and top-notch image quality. Efficiently addressing the computational demands of SDXL models is crucial for wider reach and applicability. In this work, we introduce two scaled-down variants, Segmind Stable Diffusion (SSD-1B) and Segmind-Vega, with 1.3B and 0.74B parameter UNets, respectively, achieved through progressive removal using layer-level losses focusing on reducing the model size while preserving generative quality. We release these models weights at https://hf.co/Segmind. Our methodology involves the elimination of residual networks and transformer blocks from the U-Net structure of SDXL, resulting in significant reductions in parameters, and latency. Our compact models effectively emulate the original SDXL by capitalizing on transferred knowledge, achieving competitive results against larger multi-billion parameter SDXL. Our work underscores the efficacy of knowledge distillation coupled with layer-level losses in reducing model size while preserving the high-quality generative capabilities of SDXL, thus facilitating more accessible deployment in resource-constrained environments.

We present aMUSEd, an open-source, lightweight masked image model (MIM) for text-to-image generation based on MUSE. With 10 percent of MUSE's parameters, aMUSEd is focused on fast image generation. We believe MIM is under-explored compared to latent diffusion, the prevailing approach for text-to-image generation. Compared to latent diffusion, MIM requires fewer inference steps and is more interpretable. Additionally, MIM can be fine-tuned to learn additional styles with only a single image. We hope to encourage further exploration of MIM by demonstrating its effectiveness on large-scale text-to-image generation and releasing reproducible training code. We also release checkpoints for two models which directly produce images at 256x256 and 512x512 resolutions.

By assuming the existence of the growth optimal portfolio (GOP), the stationarity of GOP-volatilities, and the maximization of relative entropy, the paper applies the benchmark approach to the modeling of the long-term dynamics of continuous markets. It reveals conservation laws, where the GOP is shown to follow a time-transformed squared Bessel process of dimension four. Moreover, it predicts the convergence of the averages of the GOP-volatilities with respect to the driving independent Brownian motions toward a common level.

Latent Consistency Models (LCMs) have achieved impressive performance in accelerating text-to-image generative tasks, producing high-quality images with minimal inference steps. LCMs are distilled from pre-trained latent diffusion models (LDMs), requiring only ~32 A100 GPU training hours. This report further extends LCMs' potential in two aspects: First, by applying LoRA distillation to Stable-Diffusion models including SD-V1.5, SSD-1B, and SDXL, we have expanded LCM's scope to larger models with significantly less memory consumption, achieving superior image generation quality. Second, we identify the LoRA parameters obtained through LCM distillation as a universal Stable-Diffusion acceleration module, named LCM-LoRA. LCM-LoRA can be directly plugged into various Stable-Diffusion fine-tuned models or LoRAs without training, thus representing a universally applicable accelerator for diverse image generation tasks. Compared with previous numerical PF-ODE solvers such as DDIM, DPM-Solver, LCM-LoRA can be viewed as a plug-in neural PF-ODE solver that possesses strong generalization abilities. Project page: https://github.com/luosiallen/latent-consistency-model., Comment: Technical Report

As the size of pre-trained speech recognition models increases, running these large models in low-latency or resource-constrained environments becomes challenging. In this work, we leverage pseudo-labelling to assemble a large-scale open-source dataset which we use to distill the Whisper model into a smaller variant, called Distil-Whisper. Using a simple word error rate (WER) heuristic, we select only the highest quality pseudo-labels for training. The distilled model is 5.8 times faster with 51% fewer parameters, while performing to within 1% WER on out-of-distribution test data in a zero-shot transfer setting. Distil-Whisper maintains the robustness of the Whisper model to difficult acoustic conditions, while being less prone to hallucination errors on long-form audio. Distil-Whisper is designed to be paired with Whisper for speculative decoding, yielding a 2 times speed-up while mathematically ensuring the same outputs as the original model. To facilitate further research in this domain, we make our training code, inference code and models publicly accessible., Comment: 30 pages, 2 figures, 25 tables

The advancement of speech technologies has been remarkable, yet its integration with African languages remains limited due to the scarcity of African speech corpora. To address this issue, we present AfroDigits, a minimalist, community-driven dataset of spoken digits for African languages, currently covering 38 African languages. As a demonstration of the practical applications of AfroDigits, we conduct audio digit classification experiments on six African languages [Igbo (ibo), Yoruba (yor), Rundi (run), Oshiwambo (kua), Shona (sna), and Oromo (gax)] using the Wav2Vec2.0-Large and XLS-R models. Our experiments reveal a useful insight on the effect of mixing African speech corpora during finetuning. AfroDigits is the first published audio digit dataset for African languages and we believe it will, among other things, pave the way for Afro-centric speech applications such as the recognition of telephone numbers, and street numbers. We release the dataset and platform publicly at https://huggingface.co/datasets/chrisjay/crowd-speech-africa and https://huggingface.co/spaces/chrisjay/afro-speech respectively., Comment: Accepted to the AfricaNLP Workshop at ICLR 2023

Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.

Speech recognition applications cover a range of different audio and text distributions, with different speaking styles, background noise, transcription punctuation and character casing. However, many speech recognition systems require dataset-specific tuning (audio filtering, punctuation removal and normalisation of casing), therefore assuming a-priori knowledge of both the audio and text distributions. This tuning requirement can lead to systems failing to generalise to other datasets and domains. To promote the development of multi-domain speech systems, we introduce the End-to-end Speech Benchmark (ESB) for evaluating the performance of a single automatic speech recognition (ASR) system across a broad set of speech datasets. Benchmarked systems must use the same data pre- and post-processing algorithm across datasets - assuming the audio and text data distributions are a-priori unknown. We compare a series of state-of-the-art (SoTA) end-to-end (E2E) systems on this benchmark, demonstrating how a single speech system can be applied and evaluated on a wide range of data distributions. We find E2E systems to be effective across datasets: in a fair comparison, E2E systems achieve within 2.6% of SoTA systems tuned to a specific dataset. Our analysis reveals that transcription artefacts, such as punctuation and casing, pose difficulties for ASR systems and should be included in evaluation. We believe E2E benchmarking over a range of datasets promotes the research of multi-domain speech recognition systems. ESB is available at https://huggingface.co/esb., Comment: 25 pages, 1 figure, submitted to ICLR 2023

We introduce XTREME-S, a new benchmark to evaluate universal cross-lingual speech representations in many languages. XTREME-S covers four task families: speech recognition, classification, speech-to-text translation and retrieval. Covering 102 languages from 10+ language families, 3 different domains and 4 task families, XTREME-S aims to simplify multilingual speech representation evaluation, as well as catalyze research in "universal" speech representation learning. This paper describes the new benchmark and establishes the first speech-only and speech-text baselines using XLS-R and mSLAM on all downstream tasks. We motivate the design choices and detail how to use the benchmark. Datasets and fine-tuning scripts are made easily accessible at https://hf.co/datasets/google/xtreme_s., Comment: Minor fix: language code for Filipino (Tagalog), "tg" -> "tl"

This paper presents XLS-R, a large-scale model for cross-lingual speech representation learning based on wav2vec 2.0. We train models with up to 2B parameters on nearly half a million hours of publicly available speech audio in 128 languages, an order of magnitude more public data than the largest known prior work. Our evaluation covers a wide range of tasks, domains, data regimes and languages, both high and low-resource. On the CoVoST-2 speech translation benchmark, we improve the previous state of the art by an average of 7.4 BLEU over 21 translation directions into English. For speech recognition, XLS-R improves over the best known prior work on BABEL, MLS, CommonVoice as well as VoxPopuli, lowering error rates by 14-34% relative on average. XLS-R also sets a new state of the art on VoxLingua107 language identification. Moreover, we show that with sufficient model size, cross-lingual pretraining can outperform English-only pretraining when translating English speech into other languages, a setting which favors monolingual pretraining. We hope XLS-R can help to improve speech processing tasks for many more languages of the world.

The scale, variety, and quantity of publicly-available NLP datasets has grown rapidly as researchers propose new tasks, larger models, and novel benchmarks. Datasets is a community library for contemporary NLP designed to support this ecosystem. Datasets aims to standardize end-user interfaces, versioning, and documentation, while providing a lightweight front-end that behaves similarly for small datasets as for internet-scale corpora. The design of the library incorporates a distributed, community-driven approach to adding datasets and documenting usage. After a year of development, the library now includes more than 650 unique datasets, has more than 250 contributors, and has helped support a variety of novel cross-dataset research projects and shared tasks. The library is available at https://github.com/huggingface/datasets., Comment: EMNLP Demo 2021

We show that in a financial market given by semimartingales an arbitrage opportunity, provided it exists, can only be exploited through short selling. This finding provides a theoretical basis for differences in regulation for financial services providers that are allowed to go short and those without short sales. The privilege to be allowed to short sell gives access to potential arbitrage opportunities, which creates by design a bankruptcy risk., Comment: 17 pages

Recursive marginal quantization (RMQ) allows the construction of optimal discrete grids for approximating solutions to stochastic differential equations in d-dimensions. Product Markovian quantization (PMQ) reduces this problem to d one-dimensional quantization problems by recursively constructing product quantizers, as opposed to a truly optimal quantizer. However, the standard Newton-Raphson method used in the PMQ algorithm suffers from numerical instabilities, inhibiting widespread adoption, especially for use in calibration. By directly specifying the random variable to be quantized at each time step, we show that PMQ, and RMQ in one dimension, can be expressed as standard vector quantization. This reformulation allows the application of the accelerated Lloyd's algorithm in an adaptive and robust procedure. Furthermore, in the case of stochastic volatility models, we extend the PMQ algorithm by using higher-order updates for the volatility or variance process. We illustrate the technique for European options, using the Heston model, and more exotic products, using the SABR model.

This paper offers a systematic investigation on the existence of equivalent local martingale deflators, which are multiplicative special semimartingales, in financial markets given by positive semimartingales. In particular, it shows that the existence of such deflators can be characterized by means of the modified semimartingale characteristics. Several examples illustrate our results. Furthermore, we provide interpretations of the deflators from an economic point of view., Comment: 41 pages

Consider a financial market with nonnegative semimartingales which does not need to have a num\'{e}raire. We are interested in the absence of arbitrage in the sense that no self-financing portfolio gives rise to arbitrage opportunities, where we are allowed to add a savings account to the market. We will prove that in this sense the market is free of arbitrage if and only if there exists an equivalent local martingale deflator which is a multiplicative special semimartingale. In this case, the additional savings account relates to the finite variation part of the multiplicative decomposition of the deflator., Comment: 37 pages

We provide a general framework for no-arbitrage concepts in topological vector lattices, which covers many of the well-known no-arbitrage concepts as particular cases. The main structural condition we impose is that the outcomes of trading strategies with initial wealth zero and those with positive initial wealth have the structure of a convex cone. As one consequence of our approach, the concepts NUPBR, NAA$_1$ and NA$_1$ may fail to be equivalent in our general setting. Furthermore, we derive abstract versions of the fundamental theorem of asset pricing (FTAP), including an abstract FTAP on Banach function spaces, and investigate when the FTAP is warranted in its classical form with a separating measure. We also consider a financial market with semimartingales which does not need to have a num\'{e}raire, and derive results which show the links between the no-arbitrage concepts by only using the theory of topological vector lattices and well-known results from stochastic analysis in a sequence of short proofs., Comment: 35 pages

Automatic speaker verification systems are vulnerable to audio replay attacks which bypass security by replaying recordings of authorized speakers. Replay attack detection (RA) detection systems built upon Residual Neural Networks (ResNet)s have yielded astonishing results on the public benchmark ASVspoof 2019 Physical Access challenge. With most teams using fine-tuned feature extraction pipelines and model architectures, the generalizability of such systems remains questionable though. In this work, we analyse the effect of discriminative feature learning in a multi-task learning (MTL) setting can have on the generalizability and discriminability of RA detection systems. We use a popular ResNet architecture optimized by the cross-entropy criterion as our baseline and compare it to the same architecture optimized by MTL using Siamese Neural Networks (SNN). It can be shown that SNN outperform the baseline by relative 26.8 % Equal Error Rate (EER). We further enhance the model's architecture and demonstrate that SNN with additional reconstruction loss yield another significant improvement of relative 13.8 % EER., Comment: Submit to INTERSPEECH2020

Recent progress in natural language processing has been driven by advances in both model architecture and model pretraining. Transformer architectures have facilitated building higher-capacity models and pretraining has made it possible to effectively utilize this capacity for a wide variety of tasks. \textit{Transformers} is an open-source library with the goal of opening up these advances to the wider machine learning community. The library consists of carefully engineered state-of-the art Transformer architectures under a unified API. Backing this library is a curated collection of pretrained models made by and available for the community. \textit{Transformers} is designed to be extensible by researchers, simple for practitioners, and fast and robust in industrial deployments. The library is available at \url{https://github.com/huggingface/transformers}., Comment: 8 pages, 4 figures, more details at https://github.com/huggingface/transformers

We investigate the existence of affine realizations for L\'{e}vy driven interest rate term structure models under the real-world probability measure, which so far has only been studied under an assumed risk-neutral probability measure. For models driven by Wiener processes, all results obtained under the risk-neutral approach concerning the existence of affine realizations are transferred to the general case. A similar result holds true for models driven by compound Poisson processes with finite jump size distributions. However, in the presence of jumps with infinite activity we obtain severe restrictions on the structure of the market price of risk; typically, it must even be constant., Comment: 31 pages

Traditional automatic speech recognition (ASR) systems often use an acoustic model (AM) built on handcrafted acoustic features, such as log Mel-filter bank (FBANK) values. Recent studies found that AMs with convolutional neural networks (CNNs) can directly use the raw waveform signal as input. Given sufficient training data, these AMs can yield a competitive word error rate (WER) to those built on FBANK features. This paper proposes a novel multi-span structure for acoustic modelling based on the raw waveform with multiple streams of CNN input layers, each processing a different span of the raw waveform signal. Evaluation on both the single channel CHiME4 and AMI data sets show that multi-span AMs give a lower WER than FBANK AMs by an average of about 5% (relative). Analysis of the trained multi-span model reveals that the CNNs can learn filters that are rather different to the log Mel filters. Furthermore, the paper shows that a widely used single span raw waveform AM can be improved by using a smaller CNN kernel size and increased stride to yield improved WERs., Comment: To appear in INTERSPEECH 2019

In this paper we consider the pricing of variable annuities (VAs) with guaranteed minimum withdrawal benefits. We consider two pricing approaches, the classical risk-neutral approach and the benchmark approach, and we examine the associated static and optimal behaviors of both the investor and insurer. The first model considered is the so-called minimal market model, where pricing is achieved using the benchmark approach. The benchmark approach was introduced by Platen in 2001 and has received wide acceptance in the finance community. Under this approach, valuing an asset involves determining the minimum-valued replicating portfolio, with reference to the growth optimal portfolio under the real-world probability measure, and it both subsumes classical risk-neutral pricing as a particular case and extends it to situations where risk-neutral pricing is impossible. The second model is the Black-Scholes model for the equity index, where the pricing of contracts is performed within the risk-neutral framework. Crucially, we demonstrate that when the insurer prices and reserves using the Black-Scholes model, while the insured employs a dynamic withdrawal strategy based on the minimal market model, the insurer may be underestimating the value and associated reserves of the contract.

This paper provides a methodology for fast and accurate pricing of the long-dated contracts that arise as the building blocks of insurance and pension fund agreements. It applies the recursive marginal quantization (RMQ) and joint recursive marginal quantization (JRMQ) algorithms outside the framework of traditional risk-neutral methods by pricing options under the real-world probability measure, using the benchmark approach. The benchmark approach is reviewed, and the real-world pricing theorem is presented and applied to various long-dated claims to obtain less expensive prices than suggested by traditional risk-neutral valuation. The growth-optimal portfolio (GOP), the central object of the benchmark approach, is modelled using the time-dependent constant elasticity of variance model (TCEV). Analytic European option prices are derived and the RMQ algorithm is used to efficiently and accurately price Bermudan options on the GOP. The TCEV model is then combined with a $3/2$ stochastic short-rate model and RMQ is used to price zero-coupon bonds and zero-coupon bond options, highlighting the departure from risk-neutral pricing.

This paper proposes a paradigm shift in the valuation of long term annuities, away from classical no-arbitrage valuation towards valuation under the real world probability measure. Furthermore, we apply this valuation method to two examples of annuity products, one having annual payments linked to a mortality index and the savings account and the other having annual payments linked to a mortality index and an equity index with a guarantee that is linked to the same mortality index and the savings account. Out-of-sample hedge simulations demonstrate the effectiveness of real world valuation. In contrast to risk neutral valuation, which is a form of relative valuation, the long term average excess return of the equity market comes into play. Instead of the savings account, the num\'eraire portfolio is employed as the fundamental unit of value in the analysis. The num\'eraire portfolio is the strictly positive, tradable portfolio that when used as benchmark makes all benchmarked nonnegative portfolios supermartingales. The benchmarked real world value of a benchmarked contingent claim equals its real world conditional expectation. This yields the minimal possible value for its hedgeable part and minimizes the fluctuations for its benchmarked hedge error. Under classical assumptions, actuarial and risk neutral valuation emerge as special cases of the proposed real world valuation. In long term liability and asset valuation, the proposed real world valuation can lead to significantly lower values than suggested by classical approaches when an equivalent risk neutral probability measure does not exist., Comment: 30-40 pages, 11 figures

We introduce and study the notion of sure profit via flash strategy, consisting of a high-frequency limit of buy-and-hold trading strategies. In a fully general setting, without imposing any semimartingale restriction, we prove that there are no sure profits via flash strategies if and only if asset prices do not exhibit predictable jumps. This result relies on the general theory of processes and provides the most general formulation of the well-known fact that, in an arbitrage-free financial market, asset prices (including dividends) should not exhibit jumps of a predictable direction or magnitude at predictable times. We furthermore show that any price process is always right-continuous in the absence of sure profits. Our results are robust under small transaction costs and imply that, under minimal assumptions, price changes occurring at scheduled dates should only be due to unanticipated information releases., Comment: 16 pages; revised and expanded version

The paper predicts an Efficient Market Property for the equity market, where stocks, when denominated in units of the growth optimal portfolio (GP), have zero instantaneous expected returns. Well-diversified equity portfolios are shown to approximate the GP, which explains the well-observed good performance of equally weighted portfolios. The proposed hierarchically weighted index (HWI) is shown to be an even better proxy of the GP. It sets weights equal within industrial and geographical groupings of stocks. When using the HWI as proxy of the GP the Efficient Market Property cannot be easily rejected and appears to be very robust., Comment: 32 pages, 5 figures

This paper studies long term investing by an investor that maximizes either expected utility from terminal wealth or from consumption. We introduce the concepts of a generalized stochastic discount factor (SDF) and of the minimum price to attain target payouts. The paper finds that the dynamics of the SDF needs to be captured and not the entire market dynamics, which simplifies significantly practical implementations of optimal portfolio strategies. We pay particular attention to the case where the SDF is equal to the inverse of the growth-optimal portfolio in the given market. Then, optimal wealth evolution is closely linked to the growth optimal portfolio. In particular, our concepts allow us to reconcile utility optimization with the practitioner approach of growth investing. We illustrate empirically that our new framework leads to improved lifetime consumption-portfolio choice and asset allocation strategies.

The cosmic web is one of the most striking features of the distribution of galaxies and dark matter on the largest scales in the Universe. It is composed of dense regions packed full of galaxies, long filamentary bridges, flattened sheets and vast low density voids. The study of the cosmic web has focused primarily on the identification of such features, and on understanding the environmental effects on galaxy formation and halo assembly. As such, a variety of different methods have been devised to classify the cosmic web -- depending on the data at hand, be it numerical simulations, large sky surveys or other. In this paper we bring twelve of these methods together and apply them to the same data set in order to understand how they compare. In general these cosmic web classifiers have been designed with different cosmological goals in mind, and to study different questions. Therefore one would not {\it a priori} expect agreement between different techniques however, many of these methods do converge on the identification of specific features. In this paper we study the agreements and disparities of the different methods. For example, each method finds that knots inhabit higher density regions than filaments, etc. and that voids have the lowest densities. For a given web environment, we find substantial overlap in the density range assigned by each web classification scheme. We also compare classifications on a halo-by-halo basis; for example, we find that 9 of 12 methods classify around a third of group-mass haloes (i.e. $M_{\rm halo}\sim10^{13.5}h^{-1}M_{\odot}$) as being in filaments. Lastly, so that any future cosmic web classification scheme can be compared to the 12 methods used here, we have made all the data used in this paper public., Comment: 24 pages, 8 figures, 2 tables. Submitted to MN. Comments Welcome

Recursive Marginal Quantization (RMQ) allows fast approximation of solutions to stochastic differential equations in one-dimension. When applied to two factor models, RMQ is inefficient due to the fact that the optimization problem is usually performed using stochastic methods, e.g., Lloyd's algorithm or Competitive Learning Vector Quantization. In this paper, a new algorithm is proposed that allows RMQ to be applied to two-factor stochastic volatility models, which retains the efficiency of gradient-descent techniques. By margining over potential realizations of the volatility process, a significant decrease in computational effort is achieved when compared to current quantization methods. Additionally, techniques for modelling the correct zero-boundary behaviour are used to allow the new algorithm to be applied to cases where the previous methods would fail. The proposed technique is illustrated for European options on the Heston and Stein-Stein models, while a more thorough application is considered in the case of the popular SABR model, where various exotic options are also priced.

Quantization techniques have been applied in many challenging finance applications, including pricing claims with path dependence and early exercise features, stochastic optimal control, filtering problems and efficient calibration of large derivative books. Recursive Marginal Quantization of the Euler scheme has recently been proposed as an efficient numerical method for evaluating functionals of solutions of stochastic differential equations. This method involves recursively quantizing the conditional marginals of the discrete-time Euler approximation of the underlying process. By generalizing this approach, we show that it is possible to perform recursive marginal quantization for two higher-order schemes: the Milstein scheme and a simplified weak order 2.0 scheme. As part of this generalization a simple matrix formulation is presented, allowing efficient implementation. We further extend the applicability of recursive marginal quantization by showing how absorption and reflection at the zero boundary may be incorporated, when this is necessary. To illustrate the improved accuracy of the higher order schemes, various computations are performed using geometric Brownian motion and its generalization, the constant elasticity of variance model. For both processes, we show numerical evidence of improved weak order convergence and we compare the marginal distributions implied by the three schemes to the known analytical distributions. By pricing European, Bermudan and Barrier options, further evidence of improved accuracy of the higher order schemes is demonstrated.

Catastrophe risk is a major threat faced by individuals, companies, and entire economies. Catastrophe (CAT) bonds have emerged as a method to offset this risk and a corresponding literature has developed that attempts to provide a market-consistent pricing methodology for these and other long-dated, insurance-type contracts. This paper aims to unify and generalize several of the widely-used pricing approaches for long-dated contracts with a focus on stylized CAT bonds and market-consistent valuation. It proposes a loading pricing concept that combines the theoretically possible minimal price of a contract with its formally obtained risk neutral price, without creating economically meaningful arbitrage. A loading degree controls how much influence the formally obtained risk neutral price has on the market price. A key finding is that this loading degree has to be constant for a minimally fluctuating contract, and is an important, measurable characteristic for prices of long-dated contracts. Loading pricing allows long-dated, insurance-type contracts to be priced less expensively and with higher return on investment than under classical pricing approaches. Loading pricing enables insurance companies to accumulate systematically reserves needed to manage its risk of ruin in a market consistent manner.

In this paper we show how to hedge a zero coupon bond with a smaller amount of initial capital than required by the classical risk neutral paradigm, whose (trivial) hedging strategy does not suggest to invest in the risky assets. Long dated zero coupon bonds we derive, invest first primarily in risky securities and when approaching more and more the maturity date they increase also more and more the fraction invested in fixed income. The conventional wisdom of financial planners suggesting investor to invest in risky securities when they are young and mostly in fixed income when they approach retirement, is here made rigorous. The paper provides a strong warning for life insurers, pension fund managers and long term investors to take the possibility of less expensive products seriously to avoid the adverse consequences of the low interest rate regimes that many developed economies face., Comment: 42 pages

In recent years several trading platforms appeared which provide a backtest engine to calculate historic performance of self designed trading strategies on underlying candle data. The construction of a correct working backtest engine is, however, a subtle task as shown by Maier-Paape and Platen (cf. arXiv:1412.5558 [q-fin.TR]). Several platforms are struggling on the correctness. In this work, we discuss the problem how the correctness of backtest engines can be verified. We provide models for candles and for intra-period prices which will be applied to conduct a proof of correctness for a given backtest engine if the here provided tests on specific model candles are successful. Furthermore, we hint to algorithmic considerations in order to allow for a fast implementation of these tests necessary for the proof of correctness., Comment: 15 pages, 6 figures; Keywords: backtest evaluation, historical simulation, trading system, candle chart, imperfect data, price model, correctness test, backtest correctness