A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New expressive losses improve adversarial robustness without sacrificing accuracy.
Unified binary and multiclass margin-based classification methods.
In this paper, we address the aggregation of dependent stop loss reinsurance risks where the dependence among the ceding insurer(s) risks is governed by the Sarmanov distribution and each individual risk belongs to the class of Erlang mixtures. We investigate the effects of the ceding insurer(s) risk dependencies on th…
LogGENE uses log-cosh loss for deep learning in gene expression datasets, improving accuracy and interpretability.
Explains deep learning models and their geometric properties.
In this paper we study a class of insurance products where the policy holder has the option to insure of its annual Operational Risk losses in a horizon of years. This involves a choice of out of years in which to apply the insurance policy coverage by making claims against losses in the given year. The…
We demonstrate that almost all non-parametric dimensionality reduction methods can be expressed by a simple procedure: regularized loss minimization plus singular value truncation. By distinguishing the role of the loss and regularizer in such a process, we recover a factored perspective that reveals some gaps in the c…
The paper examines optimal insurance design using Lambda-Value-at-Risk.
We analyze the loss landscape and expressiveness of practical deep convolutional neural networks (CNNs) with shared weights and max pooling layers. We show that such CNNs produce linearly independent features at a "wide" layer which has more neurons than the number of training samples. This condition holds e.g. for the…
A new Branch-and-Bound solver tackles L0-penalized problems with flexible loss functions.
New method prevents neural network breakdown by combining trimmed loss and variation regularization.
This paper addresses the problem of inferring a regular expression from a given set of strings that resembles, as closely as possible, the regular expression that a human expert would have written to identify the language. This is motivated by our goal of automating the task of postmasters of an email service who use r…
Paper proposes dp-VAE for preserving spatial context in gene expression data.
Study reveals different types of critical points in shallow neural networks.
New approach connects quantum phases to VQA trainability, enabling better scaling.
Paper finds exact Hessian sharpness in deep matrix factorization.
This paper considers the problem of optimal liquidation of a position in a risky security in a financial market, where price evolution are risky and trades have an impact on price as well as uncertainty in the filling orders. The problem is formulated as a continuous time stochastic optimal control problem aiming at ma…
In the hypothesis of rare loss events, the general expression of the policy value has been determined as a functional of the "expected frequency / loss severity" function and of the retention function. Exponential disutility has been chosen after mathematical characterization of some of its economical aspects, where fu…
Loss to followup is a significant issue in healthcare and has serious consequences for a study's validity and cost. Methods available at present for recovering loss to followup information are restricted by their expressive capabilities and struggle to model highly non-linear relations and complex interactions. In this…
Deep neural networks (DNNs) have great expressive power, which can even memorize samples with wrong labels. It is vitally important to reiterate robustness and generalization in DNNs against label corruption. To this end, this paper studies the 0-1 loss, which has a monotonic relationship with an empirical adversary (r…
Transformer-based models overfit financial time series data, leading to increased prediction variance.
New loss function reduces outage probability in ML-assisted resource allocation.
New hypergraph method improves scRNA-seq clustering.
This paper extends stock trading results to include stop-loss orders.
Transformers struggle to learn Markovian dynamics, showing NP-hard optimization challenges.
In this paper we provide a valuation formula for different classes of actuarial and financial contracts which depend on a general loss process, by using the Malliavin calculus. In analogy with the celebrated Black-Scholes formula, we aim at expressing the expected cash flow in terms of a building block. The former is r…
In most machine learning applications, classification accuracy is not the primary metric of interest. Binary classifiers which face class imbalance are often evaluated by the score, area under the precision-recall curve, Precision at K, and more. The maximization of many of these metrics can be expressed as a con…
This work explains why online imitation learning improves faster than theory predicts.
Diffusion-QL uses diffusion models to improve offline RL performance.
Most network-based protein (or gene) function prediction methods are based on the assumption that the labels of two adjacent proteins in the network are likely to be the same. However, assuming the pairwise relationship between proteins or genes is not complete, the information a group of genes that show very similar p…
We consider a financial contract that delivers a single cash flow given by the terminal value of a cumulative gains process. The problem of modelling and pricing such an asset and associated derivatives is important, for example, in the determination of optimal insurance claims reserve policies, and in the pricing of r…
This paper presents the hierarchical generalized linear model (HGLM) for loss reserving in a non-life insurance company. Because in this case the error of prediction is expressed by a complex analytical formula, the error bootstrap estimator is proposed instead. Moreover, the bootstrap procedure is used to obtain full …
Extends graph similarity theory to improve MPNNs' generalization abilities.
This paper presents an asynchronous incremental aggregated gradient algorithm and its implementation in a parameter server framework for solving regularized optimization problems. The algorithm can handle both general convex (possibly non-smooth) regularizers and general convex constraints. When the empirical data loss…
Study feature representations induced by dependence between variables.
New formula identifies and quantifies costs for automated market makers.
Loss minimization leads to multicalibration for neural networks.
We prove that the empirical risk of most well-known loss functions factors into a linear term aggregating all labels with a term that is label free, and can further be expressed by sums of the loss. This holds true even for non-smooth, non-convex losses and in any RKHS. The first term is a (kernel) mean operator --the …
The study quantifies decision-making risks from suboptimal classifiers and proposes methods to reduce these risks.
Mini-batch SGD with momentum is a fundamental algorithm for learning large predictive models. In this paper we develop a new analytic framework to analyze noise-averaged properties of mini-batch SGD for linear models at constant learning rates, momenta and sizes of batches. Our key idea is to consider the dynamics of t…
Token-adaptive FFN design improves LLM expressivity.
In this paper we model the loss function of high-dimensional optimization problems by a Gaussian random field, or equivalently a Gaussian process. Our aim is to study gradient descent in such loss functions or energy landscapes and compare it to results obtained from real high-dimensional optimization problems such as …
Under the Basel II standards, the Operational Risk (OpRisk) advanced measurement approach is not prescriptive regarding the class of statistical model utilised to undertake capital estimation. It has however become well accepted to utlise a Loss Distributional Approach (LDA) paradigm to model the individual OpRisk loss…
We shall provide in this paper good deal pricing bounds for contingent claims induced by the shortfall risk with some loss function. Assumptions we impose on loss functions and contingent claims are very mild. We prove that the upper and lower bounds of good deal pricing bounds are expressed by convex risk measures on …
Bernard et al. (2015) study an optimal insurance design problem where an individual's preference is of the rank-dependent utility (RDU) type, and show that in general an optimal contract covers both large and small losses. However, their contracts suffer from a problem of moral hazard for paying more compensation for a…
Individual risk models need to capture possible correlations as failing to do so typically results in an underestimation of extreme quantiles of the aggregate loss. Such dependence modelling is particularly important for managing credit risk, for instance, where joint defaults are a major cause of concern. Often, the d…
Under-parameterization hinders deep RL's efficiency.
Recently, fully-connected and convolutional neural networks have been trained to achieve state-of-the-art performance on a wide variety of tasks such as speech recognition, image classification, natural language processing, and bioinformatics. For classification tasks, most of these "deep learning" models employ the so…