We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...
It is known that the pitchfork bifurcation of Kelvin-Helmholtz instability occurring at minimum gradient Richardson number Ri(m) similar or equal to 1/4 in viscous stratified shear flows can be subcritical or supercritical depending on the value of the Pra ...
Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topological-equivalent subspace with a sequence of elementary moves. Recently, discrete Morse theory techniques provided an efficient way to construct deformatio ...
This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...
In competing event settings, a counterfactual contrast of cause-specific cumulative incidences quantifies the total causal effect of a treatment on the event of interest. However, effects of treatment on the competing event may indirectly contribute to thi ...
Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalize ...
The direct construction of stereogenic axes by enantioselective C-H arylation has been regarded as a very challenging transformation. Very few examples have been reported, despite the indisputable straight-forwardness of the methodology. This is due to the ...
We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...
Stochastic gradient descent (SGD) and randomized coordinate descent (RCD) are two of the workhorses for training modern automated decision systems. Intriguingly, convergence properties of these methods are not well-established as we move away from the spec ...
