Contrast function estimation for the drift parameter of ergodic jump diffusion process

In this paper we consider an ergodic diffusion process with jumps whose drift coefficient depends on an unknown parameter $\theta$. We suppose that the process is discretely observed at the instants (t n i)i=0,...,n with $\Delta$n = sup i=0,...,n--1 (t n i+1 -- t n i) $\rightarrow$ 0. We introduce an estimator of $\theta$, based on a contrast function, which is efficient without requiring any conditions on the rate at which $\Delta$n $\rightarrow$ 0, and where we allow the observed process to have non summable jumps. This extends earlier results where the condition n$\Delta$ 3 n $\rightarrow$ 0 was needed (see [10],[24]) and where the process was supposed to have summable jumps. Moreover, in the case of a finite jump activity, we propose explicit approximations of the contrast function, such that the efficient estimation of $\theta$ is feasible under the condition that n$\Delta$ k n $\rightarrow$ 0 where k > 0 can be arbitrarily large. This extends the results obtained by Kessler [15] in the case of continuous processes. L{\'e}vy-driven SDE, efficient drift estimation, high frequency data, ergodic properties, thresholding methods

A Novel FastICA Method for the Reference-based Contrast Functions

This paper deals with the efficient optimization problem of Cumulant-based contrast criteria in the Blind Source Separation (BSS) framework, in which sources are retrieved by maximizing the Kurtosis contrast function. Combined with the recently proposed reference-based contrast schemes, a new fast fixed-point (FastICA) algorithm is proposed for the case of linear and instantaneous mixture. Due to its quadratic dependence on the number of searched parameters, the main advantage of this new method consists in the significant decrement of computational speed, which is particularly striking with large number of samples. The method is essentially similar to the classical algorithm based on the Kurtosis contrast function, but differs in the fact that the reference-based idea is utilized. The validity of this new method was demonstrated by simulations

New Negentropy Optimization Schemes for Blind Signal Extraction of Complex Valued Sources

Blind signal extraction, a hot issue in the field of communication signal processing, aims to retrieve the sources through the optimization of contrast functions. Many contrasts based on higher-order statistics such as kurtosis, usually behave sensitive to outliers. Thus, to achieve robust results, nonlinear functions are utilized as contrasts to approximate the negentropy criterion, which is also a classical metric for non-Gaussianity. However, existing methods generally have a high computational cost, hence leading us to address the problem of efficient optimization of contrast function. More precisely, we design a novel “reference-based” contrast function based on negentropy approximations, and then propose a new family of algorithms (Alg.1 and Alg.2) to maximize it. Simulations confirm the convergence of our method to a separating solution, which is also analyzed in theory. We also validate the theoretic complexity analysis that Alg.2 has a much lower computational cost than Alg.1 and existing optimization methods based on negentropy criterion. Finally, experiments for the separation of single sideband signals illustrate that our method has good prospects in real-world applications

Contrastive learning and neural oscillations

The concept of Contrastive Learning (CL) is developed as a family of possible learning algorithms for neural networks. CL is an extension of Deterministic Boltzmann Machines to more general dynamical systems. During learning, the network oscillates between two phases. One phase has a teacher signal and one phase has no teacher signal. The weights are updated using a learning rule that corresponds to gradient descent on a contrast function that measures the discrepancy between the free network and the network with a teacher signal. The CL approach provides a general unified framework for developing new learning algorithms. It also shows that many different types of clamping and teacher signals are possible. Several examples are given and an analysis of the landscape of the contrast function is proposed with some relevant predictions for the CL curves. An approach that may be suitable for collective analog implementations is described. Simulation results and possible extensions are briefly discussed together with a new conjecture regarding the function of certain oscillations in the brain. In the appendix, we also examine two extensions of contrastive learning to time-dependent trajectories

An Efficient Algorithm by Kurtosis Maximization in Reference-Based Framework

This paper deals with the optimization of kurtosis for complex-valued signals in the independent component analysis (ICA) framework, where source signals are linearly and instantaneously mixed. Inspired by the recently proposed reference-based contrast schemes, a similar contrast function is put forward, based on which a new fast fixed-point (FastICA) algorithm is proposed. The new optimization method is similar in spirit to the former classical kurtosis-based FastICA algorithm but differs in the fact that it is much more efficient than the latter in terms of computational speed, which is significantly striking with large number of samples. The performance of this new algorithm is confirmed through computer simulations