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.
This letter assesses model risk in credit capital requirements and finds substantial tail risk.
In this article we consider the parameter risk in the context of internal modelling of the reserve risk under Solvency II. We discuss two opposed perspectives on parameter uncertainty and point out that standard methods of classical reserving focusing on the estimation error of claims reserves are in general not approp…
Many banks adopt the Loss Distribution Approach to quantify the operational risk capital charge under Basel II requirements. It is common practice to estimate the capital charge using the 0.999 quantile of the annual loss distribution, calculated using point estimators of the frequency and severity distribution paramet…
Computational limitations require more model parameters for robust learning.
New method achieves optimal performance without needing problem parameters.
Training-free model learns SDE dynamics without training, accelerating parameter studies.
A method to automatically and symbolically detect and resolve degenerate parameter combinations from parameter-data pairs.
Interactive applications incorporating high-data rate sensing and computer vision are becoming possible due to novel runtime systems and the use of parallel computation resources. To allow interactive use, such applications require careful tuning of multiple application parameters to meet required fidelity and latency …
NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.
A new method debiases multiple target parameters without IFs.
Approximate Bayesian computation (ABC) using a sequential Monte Carlo method provides a comprehensive platform for parameter estimation, model selection and sensitivity analysis in differential equations. However, this method, like other Monte Carlo methods, incurs a significant computational cost as it requires explic…
We consider the problem of estimating the parameters of a linear univariate autoregressive model with sub-Gaussian innovations from a limited sequence of consecutive observations. Assuming that the parameters are compressible, we analyze the performance of the -regularized least squares as well as a greedy esti…
New algorithms solve nonconvex-concave minimax problems without parameter knowledge.
KM method reduces ConvNet parameters to 9% higher accuracy with minimal additional memory.
The Fisher information matrix (FIM) is a foundational concept in statistical signal processing. The FIM depends on the probability distribution, assumed to belong to a smooth parametric family. Traditional approaches to estimating the FIM require estimating the probability distribution function (PDF), or its parameters…
A new method to prune neural networks with iterative randomization improves efficiency.
Hybrid method improves accuracy and speed of breast model parameter estimation.
Transformer improves parameter estimation without needing closed-form solutions.
Kernelised flows improve density estimation and generation with fewer parameters.
FNFs model parameter-dependent densities by combining a fixed flow with a polynomial parameter-dependent transformation.
In recent years, car makers and tech companies have been racing towards self driving cars. It seems that the main parameter in this race is who will have the first car on the road. The goal of this paper is to add to the equation two additional crucial parameters. The first is standardization of safety assurance --- wh…
New method uses machine learning to optimize Fourier pricing methods.
We simplify SVI volatility smile constraints for three sub-SVIs without numerical methods.
Meta-learning has been widely used for implementing few-shot learning and fast model adaptation. One kind of meta-learning methods attempt to learn how to control the gradient descent process in order to make the gradient-based learning have high speed and generalization. This work proposes a method that controls the g…
Despite the great achievements of deep neural networks (DNNs), the vulnerability of state-of-the-art DNNs raises security concerns of DNNs in many application domains requiring high reliability.We propose the fault sneaking attack on DNNs, where the adversary aims to misclassify certain input images into any target lab…
New method uses neural networks to estimate parameters without needing detector simulations.
Iterative methods for fitting a Gaussian Random Field (GRF) model via maximum likelihood (ML) estimation requires solving a nonconvex optimization problem. The problem is aggravated for anisotropic GRFs where the number of covariance function parameters increases with the dimension. Even evaluation of the likelihood fu…
A new method reduces memory requirements for sorting high-dimensional data.
A new cycleGAN architecture reduces memory and parameter requirements for low-dose CT denoising.
New IDS algorithm refines parameter norm bounds for better bandit performance.
Large size models are implemented in recently ASR system to deal with complex speech recognition problems. The num- ber of parameters in these models makes them hard to deploy, especially on some resource-short devices such as car tablet. Besides this, at most of time, ASR system is used to deal with real-time problem …
Most of the banks' operational risk internal models are based on loss pooling in risk and business line categories. The parameters and outputs of operational risk models are sensitive to the pooling of the data and the choice of the risk classification. In a simple model, we establish the link between the number of ris…
Robust PCA, the problem of PCA in the presence of outliers has been extensively investigated in the last few years. Here we focus on Robust PCA in the column sparse outlier model. The existing methods for column sparse outlier model assumes either the knowledge of the dimension of the lower dimensional subspace or the …
Lasso is a seminal contribution to high-dimensional statistics, but it hinges on a tuning parameter that is difficult to calibrate in practice. A partial remedy for this problem is Square-Root Lasso, because it inherently calibrates to the noise variance. However, Square-Root Lasso still requires the calibration of a t…
Learning the parameters of a (potentially partially observable) random field model is intractable in general. Instead of focussing on a single optimal parameter value we propose to treat parameters as dynamical quantities. We introduce an algorithm to generate complex dynamics for parameters and (both visible and hidde…
A new method distills material models from noisy data without prior selection.
Saliency maps are often used in computer vision to provide intuitive interpretations of what input regions a model has used to produce a specific prediction. A number of approaches to saliency map generation are available, but most require access to model parameters. This work proposes an approach for saliency map gene…
New method for NMF without tuning parameter.
Purpose: Machine learning is broadly used for clinical data analysis. Before training a model, a machine learning algorithm must be selected. Also, the values of one or more model parameters termed hyper-parameters must be set. Selecting algorithms and hyper-parameter values requires advanced machine learning knowledge…
Time series anomaly detection is an important task, with applications in a broad variety of domains. Many approaches have been proposed in recent years, but often they require that the length of the anomalies be known in advance and provided as an input parameter. This limits the practicality of the algorithms, as such…
Although deep learning has produced dazzling successes for applications of image, speech, and video processing in the past few years, most trainings are with suboptimal hyper-parameters, requiring unnecessarily long training times. Setting the hyper-parameters remains a black art that requires years of experience to ac…
We introduce a new embarrassingly parallel parameter learning algorithm for Markov random fields with untied parameters which is efficient for a large class of practical models. Our algorithm parallelizes naturally over cliques and, for graphs of bounded degree, its complexity is linear in the number of cliques. Unlike…
Optimized neural network approximates high-dimensional functions with minimal parameters.
Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.
Paper uses neural networks to compress large portfolios of options, reducing risk and capital requirements.
Algorithm efficiently learns deep ReLU networks with polynomial runtime in depth and parameters.
Efficiently estimates missing data parameters without iterations.
Subspace clustering, the task of clustering high dimensional data when the data points come from a union of subspaces is one of the fundamental tasks in unsupervised machine learning. Most of the existing algorithms for this task require prior knowledge of the number of clusters along with few additional parameters whi…