arXiv research

Analyzes securitization impacts on monetary and fiscal policies.

Firms should keep capital to offer sufficient protection against the risks they are facing. In the insurance context methods have been developed to determine the minimum capital level required, but less so in the context of firms with multiple business lines including allocation. The individual capital reserve of each …

We consider the problem of governing systemic risk in an assets-liabilities dynamical model of banking system. In the model considered each bank is represented by its assets and its liabilities.The capital reserves of a bank are the difference between assets and liabilities of the bank. A bank is solvent when its capit…

We propose a new backtesting framework for Expected Shortfall that could be used by the regulator. Instead of looking at the estimated capital reserve and the realised cash-flow separately, one could bind them into the secured position, for which risk measurement is much easier. Using this simple concept combined with …

Paper introduces a new method for allocating capital based on risk measures from ruin theory.

This paper presents a novel scaling method for unbiased risk estimation.

[Context:] Model-based testing is an instrument for automated generation of test cases. It requires identifying requirements in documents, understanding them syntactically and semantically, and then translating them into a test model. One light-weight language for these test models are Cause-Effect-Graphs (CEG) that ca…

Mini-batch stochastic gradient descent (SGD) and variants thereof approximate the objective function's gradient with a small number of training examples, aka the batch size. Small batch sizes require little computation for each model update but can yield high-variance gradient estimates, which poses some challenges for…

This letter assesses model risk in credit capital requirements and finds substantial tail risk.

Study introduces new methods to estimate equity and liability required rates of return.

Requirements elicitation requires extensive knowledge and deep understanding of the problem domain where the final system will be situated. However, in many software development projects, analysts are required to elicit the requirements from an unfamiliar domain, which often causes communication barriers between analys…

Study introduces new methods to estimate stock return rates.

Quantum advantage in derivative pricing requires 8k qubits and 54M T-depth.

Paper develops a model to assess capital requirement for demographic risk using stochastic methods.

Key to the imposition of appropriate minimum capital requirements on a daily basis requires accurate volatility estimation. Here, measures are presented based on discrete estimation of aggregated high frequency UK futures realisations underpinned by a continuous time framework. Squared and absolute returns are incorpor…

A Nash game theory approach allocates capital requirements among financial institutions.

This paper provides a framework for modeling the financial system with multiple illiquid assets when liquidation of illiquid assets is caused by failure to meet a leverage requirement. This extends the network model of Cifuentes, Shin & Ferrucci (2005) which incorporates a single asset with fire sales and capital adequ…

In this paper the dependence of wealth distribution and the velocity of money on the required reserve ratio is examined based on a random transfer model of money and computer simulations. A fractional reserve banking system is introduced to the model where money creation can be achieved by bank loans and the monetary a…

Financial institutions are currently required to meet more stringent capital requirements than they were before the recent financial crisis; in particular, the capital requirement for a large bank's trading book under the Basel 2.5 Accord more than doubles that under the Basel II Accord. The significant increase in cap…

Bayes classifier cannot be learned from noisy labels without knowing noise distribution.

This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard t…

Boosting combines weak classifiers to form highly accurate predictors. Although the case of binary classification is well understood, in the multiclass setting, the "correct" requirements on the weak classifier, or the notion of the most efficient boosting algorithms are missing. In this paper, we create a broad and ge…

We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.

Develops deep learning for optimizing 5G radio resource allocation.

Study assesses health plan risk measures for Solvency Capital Requirement.

We propose an online convex optimization algorithm (RescaledExp) that achieves optimal regret in the unconstrained setting without prior knowledge of any bounds on the loss functions. We prove a lower bound showing an exponential separation between the regret of existing algorithms that require a known bound on the los…

The aim of this paper is to define the market-consistent multi-period value of an insurance liability cash flow in discrete time subject to repeated capital requirements, and explore its properties. In line with current regulatory frameworks, the approach presented is based on a hypothetical transfer of the original li…

Three hard diagrams of the unknot require extra crossings to simplify.

Clarifies the theory of the deconfounder by Imai and Jiang.

For each g greater than one there is a 3-manifold with two genus g Heegaard splittings that require g stabilizations to become equivalent. Previously known examples required at most one stabilization. Control of families of Heegaard surfaces is obtained through a deformation to harmonic maps.

Boosting can efficiently optimize any loss function without requiring first-order information.

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

In this paper, we investigate a new form of automated curriculum learning based on adaptive selection of accuracy requirements, called accuracy-based curriculum learning. Using a reinforcement learning agent based on the Deep Deterministic Policy Gradient algorithm and addressing the Reacher environment, we first show …

We propose a model for the credit and liquidity risks faced by clearing members of Central Counterparty Clearing houses (CCPs). This model aims to capture the features of: gap risk; feedback between clearing member default, market volatility and margining requirements; the different risks faced by various types of mark…

This paper contains a feasibility study of deep neural networks for the classification of Euro banknotes with respect to requirements of central banks on the ATM and high speed sorting industry. Instead of concentrating on the accuracy for a large number of classes as in the famous ImageNet Challenge we focus thus on c…

We indicate two short proofs of the Goresky-MacPherson topological invariance of intersection homology. One proof is very short but requires the Goresky-MacPherson support and cosupport axioms; the other is slightly longer but does not require these axioms and so is adaptable to more general perversities.

This paper proposes a simple technical approach for the analytical derivation of Point-in-Time PD (probability of default) forecasts, with minimal data requirements. The inputs required are the current and future Through-the-Cycle PDs of the obligors, their last known default rates, and a measurement of the systematic …

DNN pruning reduces memory footprint and computational work of DNN-based solutions to improve performance and energy-efficiency. An effective pruning scheme should be able to systematically remove connections and/or neurons that are unnecessary or redundant, reducing the DNN size without any loss in accuracy. In this p…

Kernel-based K-means clustering has gained popularity due to its simplicity and the power of its implicit non-linear representation of the data. A dominant concern is the memory requirement since memory scales as the square of the number of data points. We provide a new analysis of a class of approximate kernel methods…

Logistic regression for brain imaging without p-values.

Adversarial training is a technique for training robust machine learning models. To encourage robustness, it iteratively computes adversarial examples for the model, and then re-trains on these examples via some update rule. This work analyzes the performance of adversarial training on linearly separable data, and prov…

Study analyzes cost-benefit of CBM for unmanned systems.

We note that known methods achieving the optimal oracle complexity for first order convex optimization require quadratic memory, and ask whether this is necessary, and more broadly seek to characterize the minimax number of first order queries required to optimize a convex Lipschitz function subject to a memory constra…

This work optimizes mean estimation under varying user privacy demands.

Requirements elicitation can be very challenging in projects that require deep domain knowledge about the system at hand. As analysts have the full control over the elicitation process, their lack of knowledge about the system under study inhibits them from asking related questions and reduces the accuracy of requireme…

Memory is increasingly often the bottleneck when training neural network models. Despite this, techniques to lower the overall memory requirements of training have been less widely studied compared to the extensive literature on reducing the memory requirements of inference. In this paper we study a fundamental questio…

Machine learning predicts quantum advantage in noisy quantum walks.

Regulating causal effects through averaged constraints fails to enforce conditional independence.