Search

In the recent paradigm of Federated Learning (FL), multiple clients train a shared model while keeping their local data private. Resource constraints of clients and communication costs pose major problems for training large models in FL. On the one hand, addressing the resource limitations of the clients, sparse training has proven to be a powerful tool in the centralized setting. On the other hand, communication costs in FL can be addressed by local training, where each client takes multiple gradient steps on its local data. Recent work has shown that local training can provably achieve the optimal accelerated communication complexity [Mishchenko et al., 2022]. Hence, one would like an accelerated sparse training algorithm. In this work we show that naive integration of sparse training and acceleration at the server fails, and how to fix it by letting the clients perform these tasks appropriately. We introduce Sparse-ProxSkip, our method developed for the nonconvex setting, inspired by RandProx [Condat and Richt\'arik, 2022], which provably combines sparse training and acceleration in the convex setting. We demonstrate the good performance of Sparse-ProxSkip in extensive experiments.

Point-SAGA is a randomized algorithm for minimizing a sum of convex functions using their proximity operators (proxs), proposed by Defazio (2016). At every iteration, the prox of only one randomly chosen function is called. We generalize the algorithm to any number of prox calls per iteration, not only one, and propose a simple proof of linear convergence when the functions are smooth and strongly convex.

Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of possibly set-valued monotone operators, using at every iteration one call to the resolvent of a randomly sampled operator. We also introduce a notion of similarity between the operators, which holds even for discontinuous operators. We leverage it to derive linear convergence results in the strongly monotone setting.

Federated Learning (FL) has garnered increasing attention due to its unique characteristic of allowing heterogeneous clients to process their private data locally and interact with a central server, while being respectful of privacy. A critical bottleneck in FL is the communication cost. A pivotal strategy to mitigate this burden is \emph{Local Training}, which involves running multiple local stochastic gradient descent iterations between communication phases. Our work is inspired by the innovative \emph{Scaffnew} algorithm, which has considerably advanced the reduction of communication complexity in FL. We introduce FedComLoc (Federated Compressed and Local Training), integrating practical and effective compression into \emph{Scaffnew} to further enhance communication efficiency. Extensive experiments, using the popular TopK compressor and quantization, demonstrate its prowess in substantially reducing communication overheads in heterogeneous settings.

In Distributed optimization and Learning, and even more in the modern framework of federated learning, communication, which is slow and costly, is critical. We introduce LoCoDL, a communication-efficient algorithm that leverages the two popular and effective techniques of Local training, which reduces the communication frequency, and Compression, in which short bitstreams are sent instead of full-dimensional vectors of floats. LoCoDL works with a large class of unbiased compressors that includes widely-used sparsification and quantization methods. LoCoDL provably benefits from local training and compression and enjoys a doubly-accelerated communication complexity, with respect to the condition number of the functions and the model dimension, in the general heterogenous regime with strongly convex functions. This is confirmed in practice, with LoCoDL outperforming existing algorithms.

The ProxSkip algorithm for decentralized and federated learning is gaining increasing attention due to its proven benefits in accelerating communication complexity while maintaining robustness against data heterogeneity. However, existing analyses of ProxSkip are limited to the strongly convex setting and do not achieve linear speedup, where convergence performance increases linearly with respect to the number of nodes. So far, questions remain open about how ProxSkip behaves in the non-convex setting and whether linear speedup is achievable. In this paper, we revisit decentralized ProxSkip and address both questions. We demonstrate that the leading communication complexity of ProxSkip is $\mathcal{O}\left(\frac{p\sigma^2}{n\epsilon^2}\right)$ for non-convex and convex settings, and $\mathcal{O}\left(\frac{p\sigma^2}{n\epsilon}\right)$ for the strongly convex setting, where $n$ represents the number of nodes, $p$ denotes the probability of communication, $\sigma^2$ signifies the level of stochastic noise, and $\epsilon$ denotes the desired accuracy level. This result illustrates that ProxSkip achieves linear speedup and can asymptotically reduce communication overhead proportional to the probability of communication. Additionally, for the strongly convex setting, we further prove that ProxSkip can achieve linear speedup with network-independent stepsizes.

Looking for sparsity is nowadays crucial to speed up the training of large-scale neural networks. Projections onto the $\ell_{1,2}$ and $\ell_{1,\infty}$ are among the most efficient techniques to sparsify and reduce the overall cost of neural networks. In this paper, we introduce a new projection algorithm for the $\ell_{1,\infty}$ norm ball. The worst-case time complexity of this algorithm is $\mathcal{O}\big(nm+J\log(nm)\big)$ for a matrix in $\mathbb{R}^{n\times m}$. $J$ is a term that tends to 0 when the sparsity is high, and to $nm$ when the sparsity is low. Its implementation is easy and it is guaranteed to converge to the exact solution in a finite time. Moreover, we propose to incorporate the $\ell_{1,\infty}$ ball projection while training an autoencoder to enforce feature selection and sparsity of the weights. Sparsification appears in the encoder to primarily do feature selection due to our application in biology, where only a very small part ($<2\%$) of the data is relevant. We show that both in the biological case and in the general case of sparsity that our method is the fastest., Comment: 22 pages, 8 figures

Federated Learning is an evolving machine learning paradigm, in which multiple clients perform computations based on their individual private data, interspersed by communication with a remote server. A common strategy to curtail communication costs is Local Training, which consists in performing multiple local stochastic gradient descent steps between successive communication rounds. However, the conventional approach to local training overlooks the practical necessity for client-specific personalization, a technique to tailor local models to individual needs. We introduce Scafflix, a novel algorithm that efficiently integrates explicit personalization with local training. This innovative approach benefits from these two techniques, thereby achieving doubly accelerated communication, as we demonstrate both in theory and practice.

The growth of many solid tumors has been found to be driven by chemo- and radiotherapy-resistant cancer stem cells (CSCs). A suitable therapeutic avenue in these cases may involve the use of a differentiating agent (DA) to force the differentiation of the CSCs and of conventional therapies to eliminate the remaining differentiated cancer cells (DCCs). To describe the effects of a DA that reprograms CSCs into DCCs, we adapt a differential equation model developed to investigate tumorspheres, which are assumed to consist of jointly evolving CSC and DCC populations. We analyze the mathematical properties of the model, finding the equilibria and their stability. We also present numerical solutions and phase diagrams to describe the system evolution and the therapy effects, denoting the DA strength by a parameter \(a_{dif}\).To obtain realistic predictions, we choose the other model parameters to be those determined previously from fits to various experimental datasets. These datasets characterize the progression of the tumor under various culture conditions. Typically, for small values of \(a_{dif}\) the tumor evolves towards a final state that contains a CSC fraction, but a strong therapy leads to the suppression of this phenotype. Nonetheless, different external conditions lead to very diverse behaviors. For some environmental conditions, the model predicts a threshold not only in the therapy strength, but also in its starting time, an early beginning being potentially crucial. In summary, our model shows how the effects of a DA depend critically not only on the dosage and timing of the drug application, but also on the tumor nature and its environment., Comment: 21 pages, 10 figures (17 images)

In distributed optimization and learning, several machines alternate between local computations in parallel and communication with a distant server. Communication is usually slow and costly and forms the main bottleneck. This is particularly true in federated learning, where a large number of users collaborate toward a global training task. In addition, it is desirable for a robust algorithm to allow for partial participation, since it is often the case that some clients are not able to participate to the entire process and are idle at certain times. Two strategies are popular to reduce the communication burden: 1) local training, which consists in communicating less frequently, or equivalently performing more local computations between the communication rounds; and 2) compression, whereby compressed information instead of full-dimensional vectors is communicated. We propose TAMUNA, the first algorithm for distributed optimization that leveraged the two strategies of local training and compression jointly and allows for partial participation. In the strongly convex setting, TAMUNA converges linearly to the exact solution and provably benefits from the two mechanisms: it exhibits a doubly-accelerated convergence rate, with respect to the condition number of the functions and the model dimension., Comment: This work is a follow-up of our previous work introducing CompressedScaffnew in paper arXiv:2210.13277

In federated learning, a large number of users are involved in a global learning task, in a collaborative way. They alternate local computations and two-way communication with a distant orchestrating server. Communication, which can be slow and costly, is the main bottleneck in this setting. To reduce the communication load and therefore accelerate distributed gradient descent, two strategies are popular: 1) communicate less frequently; that is, perform several iterations of local computations between the communication rounds; and 2) communicate compressed information instead of full-dimensional vectors. We propose the first algorithm for distributed optimization and federated learning, which harnesses these two strategies jointly and converges linearly to an exact solution in the strongly convex setting, with a doubly accelerated rate: our algorithm benefits from the two acceleration mechanisms provided by local training and compression, namely a better dependency on the condition number of the functions and on the dimension of the model, respectively.

Novel optical imaging devices allow for hybrid acquisition modalities such as compressed acquisitions with locally different spatial and spectral resolutions captured by a single focal plane array. In this work, we propose to model the capturing system of a multiresolution coded acquisition (MRCA) in a unified framework, which natively includes conventional systems such as those based on spectral/color filter arrays, compressed coded apertures, and multiresolution sensing. We also propose a model-based image reconstruction algorithm performing a joint demosaicing and fusion (JoDeFu) of any acquisition modeled in the MRCA framework. The JoDeFu reconstruction algorithm solves an inverse problem with a proximal splitting technique and is able to reconstruct an uncompressed image datacube at the highest available spatial and spectral resolution. An implementation of the code is available at https://github.com/danaroth83/jodefu., Comment: 15 pages, 7 figures; regular paper

Proximal splitting algorithms are well suited to solving large-scale nonsmooth optimization problems, in particular those arising in machine learning. We propose a new primal-dual algorithm, in which the dual update is randomized; equivalently, the proximity operator of one of the function in the problem is replaced by a stochastic oracle. For instance, some randomly chosen dual variables, instead of all, are updated at each iteration. Or, the proximity operator of a function is called with some small probability only. A nonsmooth variance-reduction technique is implemented so that the algorithm finds an exact minimizer of the general problem involving smooth and nonsmooth functions, possibly composed with linear operators. We derive linear convergence results in presence of strong convexity; these results are new even in the deterministic case, when our algorithms reverts to the recently proposed Primal-Dual Davis-Yin algorithm. Some randomized algorithms of the literature are also recovered as particular cases (e.g., Point-SAGA). But our randomization technique is general and encompasses many unbiased mechanisms beyond sampling and probabilistic updates, including compression. Since the convergence speed depends on the slowest among the primal and dual contraction mechanisms, the iteration complexity might remain the same when randomness is used. On the other hand, the computation complexity can be significantly reduced. Overall, randomness helps getting faster algorithms. This has long been known for stochastic-gradient-type algorithms, and our work shows that this fully applies in the more general primal-dual setting as well., Comment: International Conference on Learning Representations (ICLR) 2023

It is common to have to process signals, whose values are points on the 3-D sphere. We consider a Tikhonov-type regularization model to smoothen or interpolate sphere-valued signals defined on arbitrary graphs. We propose a convex relaxation of this nonconvex problem as a semidefinite program, which is easy to solve numerically and is efficient in practice.

In distributed or federated optimization and learning, communication between the different computing units is often the bottleneck and gradient compression is widely used to reduce the number of bits sent within each communication round of iterative methods. There are two classes of compression operators and separate algorithms making use of them. In the case of unbiased random compressors with bounded variance (e.g., rand-k), the DIANA algorithm of Mishchenko et al. (2019), which implements a variance reduction technique for handling the variance introduced by compression, is the current state of the art. In the case of biased and contractive compressors (e.g., top-k), the EF21 algorithm of Richt\'arik et al. (2021), which instead implements an error-feedback mechanism, is the current state of the art. These two classes of compression schemes and algorithms are distinct, with different analyses and proof techniques. In this paper, we unify them into a single framework and propose a new algorithm, recovering DIANA and EF21 as particular cases. Our general approach works with a new, larger class of compressors, which has two parameters, the bias and the variance, and includes unbiased and biased compressors as particular cases. This allows us to inherit the best of the two worlds: like EF21 and unlike DIANA, biased compressors, like top-k, whose good performance in practice is recognized, can be used. And like DIANA and unlike EF21, independent randomness at the compressors allows to mitigate the effects of compression, with the convergence rate improving when the number of parallel workers is large. This is the first time that an algorithm with all these features is proposed. We prove its linear convergence under certain conditions. Our approach takes a step towards better understanding of two so-far distinct worlds of communication-efficient distributed learning., Comment: Conference NeurIPS 2022

It is common to have to process signals or images whose values are cyclic and can be represented as points on the complex circle, like wrapped phases, angles, orientations, or color hues. We consider a Tikhonov-type regularization model to smoothen or interpolate circle-valued signals defined on arbitrary graphs. We propose a convex relaxation of this nonconvex problem as a semidefinite program, and an efficient algorithm to solve it.

We propose a generic variance-reduced algorithm, which we call MUltiple RANdomized Algorithm (MURANA), for minimizing a sum of several smooth functions plus a regularizer, in a sequential or distributed manner. Our method is formulated with general stochastic operators, which allow us to model various strategies for reducing the computational complexity. For example, MURANA supports sparse activation of the gradients, and also reduction of the communication load via compression of the update vectors. This versatility allows MURANA to cover many existing randomization mechanisms within a unified framework, which also makes it possible to design new methods as special cases., Comment: 3rd Annual Conference on Mathematical and Scientific Machine Learning (MSML), Aug. 2022. PMLR 190:81-96

Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of the gradient of F and multiplications by K and its transpose. We provide lower bounds on the number of gradient computations and matrix multiplications to achieve a given accuracy. Then we propose an accelerated primal-dual algorithm achieving these lower bounds. Our algorithm is the first optimal algorithm for this class of problems.

Communicating information, like gradient vectors, between computing nodes in distributed and federated learning is typically an unavoidable burden, resulting in scalability issues. Indeed, communication might be slow and costly. Recent advances in communication-efficient training algorithms have reduced this bottleneck by using compression techniques, in the form of sparsification, quantization, or low-rank approximation. Since compression is a lossy, or inexact, process, the iteration complexity is typically worsened; but the total communication complexity can improve significantly, possibly leading to large computation time savings. In this paper, we investigate the fundamental trade-off between the number of bits needed to encode compressed vectors and the compression error. We perform both worst-case and average-case analysis, providing tight lower bounds. In the worst-case analysis, we introduce an efficient compression operator, Sparse Dithering, which is very close to the lower bound. In the average-case analysis, we design a simple compression operator, Spherical Compression, which naturally achieves the lower bound. Thus, our new compression schemes significantly outperform the state of the art. We conduct numerical experiments to illustrate this improvement.

We analyze several generic proximal splitting algorithms well suited for large-scale convex nonsmooth optimization. We derive sublinear and linear convergence results with new rates on the function value suboptimality or distance to the solution, as well as new accelerated versions, using varying stepsizes. In addition, we propose distributed variants of these algorithms, which can be accelerated as well. While most existing results are ergodic, our nonergodic results significantly broaden our understanding of primal-dual optimization algorithms.

We consider minimizing the sum of three convex functions, where the first one F is smooth, the second one is nonsmooth and proximable and the third one is the composition of a nonsmooth proximable function with a linear operator L. This template problem has many applications, for instance, in image processing and machine learning. First, we propose a new primal-dual algorithm, which we call PDDY, for this problem. It is constructed by applying Davis-Yin splitting to a monotone inclusion in a primal-dual product space, where the operators are monotone under a specific metric depending on L. We show that three existing algorithms (the two forms of the Condat-Vu algorithm and the PD3O algorithm) have the same structure, so that PDDY is the fourth missing link in this self-consistent class of primal-dual algorithms. This representation eases the convergence analysis: it allows us to derive sublinear convergence rates in general, and linear convergence results in presence of strong convexity. Moreover, within our broad and flexible analysis framework, we propose new stochastic generalizations of the algorithms, in which a variance-reduced random estimate of the gradient of F is used, instead of the true gradient. Furthermore, we obtain, as a special case of PDDY, a linearly converging algorithm for the minimization of a strongly convex function F under a linear constraint; we discuss its important application to decentralized optimization.

Most algorithms for solving optimization problems or finding saddle points of convex-concave functions are fixed-point algorithms. In this work we consider the generic problem of finding a fixed point of an average of operators, or an approximation thereof, in a distributed setting. Our work is motivated by the needs of federated learning. In this context, each local operator models the computations done locally on a mobile device. We investigate two strategies to achieve such a consensus: one based on a fixed number of local steps, and the other based on randomized computations. In both cases, the goal is to limit communication of the locally-computed variables, which is often the bottleneck in distributed frameworks. We perform convergence analysis of both methods and conduct a number of experiments highlighting the benefits of our approach., Comment: Accepted to ICML 2020

Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they consist of simple operations, handling the terms in the objective function separately. In this overview, we demystify a selection of recent proximal splitting algorithms: we present them within a unified framework, which consists in applying splitting methods for monotone inclusions in primal-dual product spaces, with well-chosen metrics. Along the way, we easily derive new variants of the algorithms and revisit existing convergence results, extending the parameter ranges in several cases. In particular, we emphasize that when the smooth term in the objective function is quadratic, e.g., for least-squares problems, convergence is guaranteed with larger values of the relaxation parameter than previously known. Such larger values are usually beneficial for the convergence speed in practice., Comment: To appear in SIAM Review

Cancer stem cells have been shown to be critical to the development of a variety of solid cancers. The precise interplay mechanisms between cancer stem cells and the rest of a tissue are still not elucidated. To shed light on the interactions between stem and non-stem cancer cell populations we develop a two-population mathematical model, which is suitable to describe tumorsphere growth. Both interspecific and intraspecific interactions, mediated by the microenvironment, are included. We show that there is a tipping point, characterized by a transcritical bifurcation, where a purely non-stem cell attractor is replaced by a new attractor that contains both stem and differentiated cancer cells. The model is then applied to describe the outcome of a recent experiment. This description reveals that, while the intraspecific interactions are inhibitory, the interspecific interactions stimulate growth. This can be understood in terms of stem cells needing differentiated cells to reinforce their niches, and phenotypic plasticity favoring the de-differentiation of differentiated cells into cancer stem cells. We posit that this is a consequence of the deregulation of the quorum sensing that maintains homeostasis in healthy tissues., Comment: 18 pg

Can machines design? Can they come up with creative solutions to problems and build tools and artifacts across a wide range of domains? Recent advances in the field of computational creativity and formal Artificial General Intelligence (AGI) provide frameworks for machines with the general ability to design. In this paper we propose to integrate a formal computational creativity framework into the G\"odel machine framework. We call the resulting framework design G\"odel machine. Such a machine could solve a variety of design problems by generating novel concepts. In addition, it could change the way these concepts are generated by modifying itself. The design G\"odel machine is able to improve its initial design program, once it has proven that a modification would increase its return on the utility function. Finally, we sketch out a specific version of the design G\"odel machine which specifically addresses the design of complex software and hardware systems. Future work aims at the development of a more formal version of the design G\"odel machine and a proof of concept implementation.

Aedes aegypti is the main vector of multiple diseases, such as Dengue, Zika, and Chikungunya. Due to modifications in weather patterns, its geographical range is continuously evolving. Temperature is a key factor for its expansion into regions with cool winters, but rainfall can also have a strong impact on the colonization of these regions, since larvae emerging after a rainfall are likely to die at temperatures below $10^{\circ}$C. As climate change is expected to affect rainfall regimes, with a higher frequency of heavy storms and an increase in drought-affected areas, it is important to understand how different rainfall scenarios may shape Ae. aegypti's range. We develop a model for the population dynamics of Ae. aegypti, coupled with a rainfall model to study the effect of the temporal distribution of rainfall on mosquito abundance. Using a fracturing process, we then investigate the effect of a higher variability in the daily rainfall. As an example, we show that rainfall distribution is necessary to explain the geographic range of Ae. aegypti in Taiwan, an island characterized by rainy winters in the north and dry winters in the south. We also predict that a higher variability in the rainfall time distribution will decrease the maximum abundance of Ae. aegypti during the summer. An increase in daily rainfall variability will likewise enhance its extinction probability. Finally, we obtain a nonlinear relationship between dry season duration and extinction probability. These findings can have a significant impact on our ability to predict disease outbreaks.

In this work we give a sense to the notion of orientation for self-similar Gaussian fields with stationary increments, based on a Riesz analysis of these fields, with isotropic zero-mean analysis functions. We propose a structure tensor formulation and provide an intrinsic definition of the orientation vector as eigenvector of this tensor. That is, we show that the orientation vector does not depend on the analysis function, but only on the anisotropy encoded in the spectral density of the field. Then, we generalize this definition to a larger class of random fields called localizable Gaussian fields, whose orientation is derived from the orientation of their tangent fields. Two classes of Gaussian models with prescribed orientation are studied in the light of these new analysis tools.

The dynamics of a mosquito population depends heavily on climatic variables such as temperature and precipitation. Since climate change models predict that global warming will impact on the frequency and intensity of rainfall, it is important to understand how these variables affect the mosquito populations. We present a model of the dynamics of a {\it Culex quinquefasciatus} mosquito population that incorporates the effect of rainfall and use it to study the influence of the number of rainy days and the mean monthly precipitation on the maximum yearly abundance of mosquitoes $M_{max}$. Additionally, using a fracturing process, we investigate the influence of the variability in daily rainfall on $M_{max}$. We find that, given a constant value of monthly precipitation, there is an optimum number of rainy days for which $M_{max}$ is a maximum. On the other hand, we show that increasing daily rainfall variability reduces the dependence of $M_{max}$ on the number of rainy days, leading also to a higher abundance of mosquitoes for the case of low mean monthly precipitation. Finally, we explore the effect of the rainfall in the months preceding the wettest season, and we obtain that a regimen with high precipitations throughout the year and a higher variability tends to advance slightly the time at which the peak mosquito abundance occurs, but could significantly change the total mosquito abundance in a year., Comment: In press in Journal of Theoretical Biology

In the context of change-point detection, addressed by Total Variation minimization strategies, an efficient on-the-fly algorithm has been designed leading to exact solutions for univariate data. In this contribution, an extension of such an on-the-fly strategy to multivariate data is investigated. The proposed algorithm relies on the local validation of the Karush-Kuhn-Tucker conditions on the dual problem. Showing that the non-local nature of the multivariate setting precludes to obtain an exact on-the-fly solution, we devise an on-the-fly algorithm delivering an approximate solution, whose quality is controlled by a practitioner-tunable parameter, acting as a trade-off between quality and computational cost. Performance assessment shows that high quality solutions are obtained on-the-fly while benefiting of computational costs several orders of magnitude lower than standard iterative procedures. The proposed algorithm thus provides practitioners with an efficient multivariate change-point detection on-the-fly procedure.

This paper presents two new models of oriented texture, based on a new class of Gaussian fields, called locally anisotropic fractional Brownian fields, with prescribed local orientation at any point. These fields are a local version of a specific class of anisotropic self-similar Gaussian fields with stationary increments. The simulation of such textures is obtained using a new algorithm mixing the tangent field formulation with the Cholesky method or the turning band method, this latter method having proved its efficiency for generating stationary anisotropic textures. Numerical experiments show the ability of the method for synthesis of textures with prescribed local orientation., Comment: in French

Many self-propelled microorganisms are attracted to surfaces. This makes their dynamics in restricted geometries very different from that observed in the bulk. Swimming along walls is beneficial for directing and sorting cells, but may be detrimental if homogeneous populations are desired, such as in counting microchambers. In this work, we characterize the motion of human sperm cells $60 \mu m$ long, strongly confined to $25 \mu m$ shallow chambers. We investigate the nature of the cell trajectories between the confining surfaces and their accumulation near the borders. Observed cell trajectories are composed of a succession of quasi-circular and quasi-linear segments. This suggests that the cells follow a path of intermittent trappings near the top and bottom surfaces separated by stretches of quasi-free motion in between the two surfaces, as confirmed by depth resolved confocal microscopy studies. We show that the introduction of artificial petal-shaped corrugation in the lateral boundaries removes the tendency of cells to accumulate near the borders, an effect which we hypothesize may be valuable for microfluidic applications in biomedicine., Comment: 9 pages, latex. In accepted version on April 14, v2: abstract modified, information added to Sec. II.A and experiments added to Sec. III.A and Fig.3. Sec. III.C was deleted. Requested references added

A wide array of image recovery problems can be abstracted into the problem of minimizing a sum of composite convex functions in a Hilbert space. To solve such problems, primal-dual proximal approaches have been developed which provide efficient solutions to large-scale optimization problems. The objective of this paper is to show that a number of existing algorithms can be derived from a general form of the forward-backward algorithm applied in a suitable product space. Our approach also allows us to develop useful extensions of existing algorithms by introducing a variable metric. An illustration to image restoration is provided.

This paper presents a new framework for oriented texture modeling. We introduce a new class of Gaussian fields, called Locally Anisotropic Fractional Brownian Fields, with prescribed local orientation at any point. These fields are a local version of a specific class of anisotropic self-similar Gaussian fields with stationary increments. The simulation of such textures is obtained using a new algorithm mixing the tangent field formulation and a turning band method, this latter method having proved its efficiency for generating stationary anisotropic textures. Numerical experiments show the ability of the method for synthesis of textures with prescribed local orientation., Comment: Article de 4 pages accept\'e \`a l'ICIP 2014 (http://www.icip2014.org)

This work proposes an extension of the 1-D Hilbert Huang transform for the analysis of images. The proposed method consists in (i) adaptively decomposing an image into oscillating parts called intrinsic mode functions (IMFs) using a mode decomposition procedure, and (ii) providing a local spectral analysis of the obtained IMFs in order to get the local amplitudes, frequencies, and orientations. For the decomposition step, we propose two robust 2-D mode decompositions based on non-smooth convex optimization: a "Genuine 2-D" approach, that constrains the local extrema of the IMFs, and a "Pseudo 2-D" approach, which constrains separately the extrema of lines, columns, and diagonals. The spectral analysis step is based on Prony annihilation property that is applied on small square patches of the IMFs. The resulting 2-D Prony-Huang transform is validated on simulated and real data., Comment: 24 pages, 7 figures

Tumor growth is often the result of the simultaneous development of two or more cancer cell populations. Their interaction between them characterizes the system evolution. To obtain information about these interactions we apply the recently developed vector universality (VUN) formalism to various instances of competition between tumor populations. The formalism allows us: (a) to quantify the growth mechanisms of a HeLa cell colony, describing the phenotype switching responsible for its fast expansion, (b) to reliably reconstruct the evolution of the necrotic and viable fractions in both in vitro and in vivo tumors using data for the time dependences of the total masses, and (c) to show how the shedding of cells leading to subspheroid formation is beneficial to both the spheroid and subspheroid populations, suggesting that shedding is a strong positive influence on cancer dissemination.

The guidance of human sperm cells under confinement in quasi 2D microchambers is investigated using a purely physical method to control their distribution. Transport property measurements and simulations are performed with dilute sperm populations, for which effects of geometrical guidance and concentration are studied in detail. In particular, a trapping transition at convex angular wall features is identified and analyzed. We also show that highly efficient microratchets can be fabricated by using curved asymmetric obstacles to take advantage of the spermatozoa specific swimming strategy.

Marine microorganisms often reach high swimming speeds, either to take advantage of evanescent nutrient patches or to beat Brownian forces. Since this implies that a sizable part of their energetic budget must be allocated to motion, it is reasonable to assume that some fast-swimming microorganisms may increase their nutrient intake by increasing their speed v. We formulate a model to investigate this hypothesis and its consequences, finding the steady state solutions and analyzing their stability. Surprisingly, we find that even modest increases in nutrient absorption may lead to a significant increase of the microbial speed. In fact, evaluations obtained using realistic parameter values for bacteria indicate that the speed increase due to the enhanced nutrient absorption may be quite large., Comment: 20 pages, 6 figures

Suitable asymmetric microstructures can be used to control the direction of motion in microorganism populations. This rectification process makes it possible to accumulate swimmers in a region of space or to sort different swimmers. Here we study numerically how the separation process depends on the specific motility strategies of the microorganisms involved. Crucial properties such as the separation efficiency and the separation time for two bacterial strains are precisely defined and evaluated. In particular, the sorting of two bacterial populations inoculated in a box consisting of a series of chambers separated by columns of asymmetric obstacles is investigated. We show how the sorting efficiency is enhanced by these obstacles and conclude that this kind of sorting can be efficiently used even when the involved populations differ only in one aspect of their swimming strategy., Comment: 8 pages, 3 figures Central European Journal of Physics (2013)

It has been shown that a nanoliter chamber separated by a wall of asymmetric obstacles can lead to an inhomogeneous distribution of self-propelled microorganisms. Although it is well established that this rectification effect arises from the interaction between the swimmers and the non-centrosymmetric pillars, here we demonstrate numerically that its efficiency is strongly dependent on the detailed dynamics of the individual microorganism. In particular, for the case of run-and-tumble dynamics, the distribution of run lengths, the rotational diffusion and the partial preservation of run orientation memory through a tumble are important factors when computing the rectification efficiency. In addition, we optimize the geometrical dimensions of the asymmetric pillars in order to maximize the swimmer concentration and we illustrate how it can be used for sorting by swimming strategy in a long array of parallel obstacles., Comment: 10 pages, 10 figures