Provides functions for the simulation and
  the nonparametric estimation of elliptical distributions,
  meta-elliptical copulas and trans-elliptical distributions,
  following the article Derumigny and Fermanian (2022) <doi:10.1016/j.jmva.2022.104962>.

A suite of elliptic and related functions including Weierstrass and
 Jacobi forms.  Also includes various tools for manipulating and
 visualizing complex functions.

Given the omnipresence of the assumption of elliptical symmetry, it is essential to be able to test whether that assumption actually holds true or not for the data
            at hand. This package provides several statistical tests for elliptical symmetry that are described in Babic et al. (2021) <arXiv:2011.12560v2>.

Training and predict functions for Single Hidden-layer Feedforward Neural Networks (SLFN) using the Extreme Learning Machine (ELM) algorithm. The ELM algorithm differs from the traditional gradient-based algorithms for very short training times (it doesn't need any iterative tuning, this makes learning time very fast) and there is no need to set any other parameters like learning rate, momentum, epochs, etc. This is a reimplementation of the 'elmNN' package using 'RcppArmadillo' after the 'elmNN' package was archived. For more information, see "Extreme learning machine: Theory and applications" by Guang-Bin Huang, Qin-Yu Zhu, Chee-Kheong Siew (2006), Elsevier B.V, <doi:10.1016/j.neucom.2005.12.126>.

Training and prediction functions are provided for the Extreme Learning Machine algorithm (ELM). The ELM use a Single Hidden Layer Feedforward Neural Network (SLFN) with random generated weights and no gradient-based backpropagation. The training time is very short and the online version allows to update the model using small chunk of the training set at each iteration. The only parameter to tune is the hidden layer size and the learning function.

An implementation of the algorithm described in "Efficient Large-
    Scale Internet Media Selection Optimization for Online Display Advertising"
    by Paulson, Luo, and James (Journal of Marketing Research 2018; see URL below
    for journal text/citation and <http://faculty.marshall.usc.edu/gareth-james/Research/ELMSO.pdf>
    for a full-text version of the paper). The algorithm here is designed to 
    allocate budget across a set of online advertising opportunities using a 
    coordinate-descent approach, but it can be used in any resource-allocation 
    problem with a matrix of visitation (in the case of the paper, website page-
    views) and channels (in the paper, websites). The package contains allocation
    functions both in the presence of bidding, when allocation is dependent on 
    channel-specific cost curves, and when advertising costs are fixed at each channel.