arXiv subjects
Publications and source records attributed to Pierre Bertrand.
For some smooth special case of generalized $\varphi-$divergences as well as of new divergences (called scaled shift divergences), we derive approximations of the omnipresent (weighted) $\ell_{1}-$distance and (weighted) $\ell_{1}-$norm.
We propose a new random method to minimize deterministic continuous functions over subsets $\mathcal{S}$ of high-dimensional space $\mathbb{R}^K$ without assuming convexity. Our procedure alternates between a Global Search (GS) regime to identify candidates and a Concentrated Search (CS) regime to improve an eligible candidate in the constraint set $\mathcal{S}$. Beyond the alternation between those completely different regimes, the originality of our approach lies in leveraging high dimensionality. We demonstrate rigorous concentration properties under the $CS$ regime. In parallel, we also show that $GS$ reaches any point in $\mathcal{S}$ in finite time. Finally, we demonstrate the relevance of our new method by giving two concrete applications. The first deals with the reduction of the $\ell_{1}-$norm of a LASSO solution. Secondly, we compress a neural network by pruning weights while maintaining performance; our approach achieves significant weight reduction with minimal performance loss, offering an effective solution for network optimization.
The authors transpose a discrete notion of indetermination coupling in the case of continuous probabilities. They show that this coupling, expressed on densities, cannot be captured by a specific copula which acts on cumulative distribution functions without a high dependence on the margins. Furthermore, they define a notion of average likelihood which extends the discrete notion of couple matchings and demonstrate it is minimal under indetermination. Eventually, they leverage this property to build up a statistical test to distinguish indetermination and estimate its efficiency using the Bahadur's slope.
This paper provides constructive procedures for the indeterminacy coupling between two marginal distributions, an alternative to independence coupling. It also introduces a drawing under indeterminacy into a mixture of three independent couplings. Leveraging on this decomposition it states that indeterminacy optimally reduces couple matchings, minimizing the expected number of equal couples drawn in a row. Besides it is seen that the Janson Vegelius coefficient is nothing but a deviation to indeterminacy and it is shown that it tends to 0 when the number of modalities increases.
This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "optimal transport theory" as a starting point, and a way as well, to derive two canonical couplings: "statistical independence" and "logical indetermination". A symmetric list of properties is provided and notably the so called "Monge's properties", applied to contingency matrices, and justifying the $\otimes$ versus $\oplus$ notation. A study is proposed, highlighting "logical indetermination", because it is, by far, lesser known. Eventually we estimate the average difference between both couplings as the key explanation of their usually close results in network clustering.
We consider a model for the propagation and absorption of electromagnetic waves (in the time-harmonic regime) in a magnetised plasma. We present a rigorous derivation of the model and several boundary conditions modelling wave injection into the plasma. Then we propose several variational formulations, mixed and non-mixed, and prove their well-posedness thanks to a theorem by Sébelin et~al. Finally, we propose a non-overlapping domain decomposition framework, show its well-posedness and equivalence with the one-domain formulation. These results appear strongly linked to the spectral properties of the plasma dielectric tensor.
In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of messages each ball sends in a given round, and (iii) whether each such message is given a rank expressing the sender's inclination to commit to the receiving bin (if feasible). This novel ranking mechanism results in notable improvements, in particular in the number of balls that may commit to a bin in the first round of the algorithm. Simulations independently verify the correctness of the results and confirm that our approximation is highly accurate even for a moderate number of $10^6$ balls and bins.
In numerous applications data are observed at random times and an estimated graph of the spectral density may be relevant for characterizing and explaining phenomena. By using a wavelet analysis, one derives a nonparametric estimator of the spectral density of a Gaussian process with stationary increments (or a stationary Gaussian process) from the observation of one path at random discrete times. For every positive frequency, this estimator is proved to satisfy a central limit theorem with a convergence rate depending on the roughness of the process and the moment of random durations between successive observations. In the case of stationary Gaussian processes, one can compare this estimator with estimators based on the empirical periodogram. Both estimators reach the same optimal rate of convergence, but the estimator based on wavelet analysis converges for a different class of random times. Simulation examples and application to biological data are also provided.
From a wavelet analysis, one derives a nonparametrical estimator for the spectral density of a Gaussian process with stationary increments. First, the idealistic case of a continuous time path of the process is considered. A punctual Central Limit Theorem (CLT) and an estimation of the Mean Integrate Square Error (MISE) are established. Next, to fit the applications, one considers the case where one observes a path at random times. One built a second estimator obtained by replacing the wavelet coefficients by their discretizations. A second CLT and the corresponding estimation of the MISE are provided. Finally, simulation results and an application on the heartbeat time series of marathon runners are presented.
In certain applications, for instance biomechanics, turbulence, finance, or Internet traffic, it seems suitable to model the data by a generalization of a fractional Brownian motion for which the Hurst parameter $H$ is depending on the frequency as a piece-wise constant function. These processes are called multiscale fractional Brownian motions. In this contribution, we provide a statistical study of the multiscale fractional Brownian motions. We develop a method based on wavelet analysis. By using this method, we find initially the frequency changes, then we estimate the different parameters and afterwards we test the goodness-of-fit. Lastly, we give the numerical algorithm. Biomechanical data are then studied with these new tools.