An Algorithmic Inference Approach to Learn Copulas

10/07/2019
by   Bruno Apolloni, et al.
0

We introduce a new method for estimating the parameter of the bivariate Clayton copulas within the framework of Algorithmic Inference. The method consists of a variant of the standard boot-strapping procedure for inferring random parameters, which we expressly devise to bypass the two pitfalls of this specific instance: the non independence of the Kendall statistics, customarily at the basis of this inference task, and the absence of a sufficient statistic w.r.t. α. The variant is rooted on a numerical procedure in order to find the α estimate at a fixed point of an iterative routine. Although paired with the customary complexity of the program which computes them, numerical results show an outperforming accuracy of the estimates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2021

TENT: Efficient Quantization of Neural Networks on the tiny Edge with Tapered FixEd PoiNT

In this research, we propose a new low-precision framework, TENT, to lev...
research
04/04/2023

On algorithmically boosting fixed-point computations

This paper is a thought experiment on exponentiating algorithms. One of ...
research
09/07/2021

On the CUSUM procedure for phase-type distributions: a Lévy fluctuation theory approach

We introduce a new method analyzing the cumulative sum (CUSUM) procedure...
research
03/05/2019

Preconditioning Kaczmarz method by sketching

We propose a new method for preconditioning Kaczmarz method by sketching...
research
06/06/2021

An L^p-weak Galerkin method for second order elliptic equations in non-divergence form

This article presents a new primal-dual weak Galerkin method for second ...
research
02/19/2015

Finding Dantzig selectors with a proximity operator based fixed-point algorithm

In this paper, we study a simple iterative method for finding the Dantzi...

Please sign up or login with your details

Forgot password? Click here to reset