Dataset Information

Proximal Distance Algorithms: Theory and Practice.

ABSTRACT: Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If f(x) is the loss function, and C is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss f(x)+?2dist(x,C)2 and following the solution x ? to its limit as ? tends to ?. At each iteration the squared Euclidean distance dist(x,C)2 is majorized by the spherical quadratic ?x- P C (x k )?2, where P C (x k ) denotes the projection of the current iterate x k onto C. The minimum of the surrogate function f(x)+?2?x-PC(xk)?2 is given by the proximal map prox ? -1f [P C (x k )]. The next iterate x k+1 automatically decreases the original penalized loss for fixed ?. Since many explicit projections and proximal maps are known, it is straightforward to derive and implement novel optimization algorithms in this setting. These algorithms can take hundreds if not thousands of iterations to converge, but the simple nature of each iteration makes proximal distance algorithms competitive with traditional algorithms. For convex problems, proximal distance algorithms reduce to proximal gradient algorithms and therefore enjoy well understood convergence properties. For nonconvex problems, one can attack convergence by invoking Zangwill's theorem. Our numerical examples demonstrate the utility of proximal distance algorithms in various high-dimensional settings, including a) linear programming, b) constrained least squares, c) projection to the closest kinship matrix, d) projection onto a second-order cone constraint, e) calculation of Horn's copositive matrix index, f) linear complementarity programming, and g) sparse principal components analysis. The proximal distance algorithm in each case is competitive or superior in speed to traditional methods such as the interior point method and the alternating direction method of multipliers (ADMM). Source code for the numerical examples can be found at https://github.com/klkeys/proxdist.

SUBMITTER: Keys KL

PROVIDER: S-EPMC6812563 | biostudies-literature | 2019 Apr

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Proximal Distance Algorithms: Theory and Practice.

Keys Kevin L KL Zhou Hua H Lange Kenneth K

Journal of machine learning research : JMLR 20190401

Proximal distance algorithms combine the classical penalty method of constrained minimization with distance majorization. If f(x) is the loss function, and C is the constraint set in a constrained minimization problem, then the proximal distance principle mandates minimizing the penalized loss f ( x ) + ρ 2 dist ( x , C ) 2 and following the solution x ρ to its limit as ρ tends to ∞. At each iteration the squared Euclidean distance dist(<i ...[more]

PMID: 31649491

Similar Datasets

Project description:BackgroundGiven the exceptional diversity of orchids (26 000+ species), improving strategies for the conservation of orchids will benefit a vast number of taxa. Furthermore, with rapidly increasing numbers of endangered orchids and low success rates in orchid conservation translocation programmes worldwide, it is evident that our progress in understanding the biology of orchids is not yet translating into widespread effective conservation.ScopeWe highlight unusual aspects of the reproductive biology of orchids that can have important consequences for conservation programmes, such as specialization of pollination systems, low fruit set but high seed production, and the potential for long-distance seed dispersal. Further, we discuss the importance of their reliance on mycorrhizal fungi for germination, including quantifying the incidence of specialized versus generalized mycorrhizal associations in orchids. In light of leading conservation theory and the biology of orchids, we provide recommendations for improving population management and translocation programmes.ConclusionsMajor gains in orchid conservation can be achieved by incorporating knowledge of ecological interactions, for both generalist and specialist species. For example, habitat management can be tailored to maintain pollinator populations and conservation translocation sites selected based on confirmed availability of pollinators. Similarly, use of efficacious mycorrhizal fungi in propagation will increase the value of ex situ collections and likely increase the success of conservation translocations. Given the low genetic differentiation between populations of many orchids, experimental genetic mixing is an option to increase fitness of small populations, although caution is needed where cytotypes or floral ecotypes are present. Combining demographic data and field experiments will provide knowledge to enhance management and translocation success. Finally, high per-fruit fecundity means that orchids offer powerful but overlooked opportunities to propagate plants for experiments aimed at improving conservation outcomes. Given the predictions of ongoing environmental change, experimental approaches also offer effective ways to build more resilient populations.

Project description:X-ray crystallography is a powerful method that has significantly contributed to our understanding of the biological function of proteins and other molecules. This method relies on the production of crystals that, however, are usually a bottleneck in the process. For some molecules, no crystallization has been achieved or insufficient crystals were obtained. Some other systems do not crystallize at all, such as nanoparticles which, because of their dimensions, cannot be treated by the usual crystallographic methods. To solve this, whole pair distribution function has been proposed to bridge the gap between Bragg and Debye scattering theories. To execute a fitting, the spectra of several different constructs, composed of millions of particles each, should be computed using a particle-pair or particle-particle (pp) distance algorithm. Using this computation as a test bench for current field-programmable gate array (FPGA) technology, we evaluate how the parallel computation capability of FPGAs can be exploited to reduce the computation time. We present two different solutions to the problem using two state-of-the-art FPGA technologies. In the first one, the main C program uses OmpSs (a high-level programming model developed at the Barcelona Supercomputing Center, that enables task offload to different high-performance computing devices) for task invocation, and kernels are built with OpenCL using reduced data sizes to save transmission time. The second approach uses task and data parallelism to operate on data locally and update data globally in a decoupled task. Benchmarks have been evaluated over an Intel D5005 Programmable Acceleration Card, computing a model of 2 million particles in 81.57 s - 24.5 billion atom pairs per second (bapps)- and over a ZU102 in 115.31 s. In our last test, over an up-to-date Alveo U200 board, the computation lasted for 34.68 s (57.67 bapps). In this study, we analyze the results in relation to the classic terms of speed-up and efficiency and give hints for future improvements focused on reducing the global job time.

Dataset Information

Proximal Distance Algorithms: Theory and Practice.

Publications

Proximal Distance Algorithms: Theory and Practice.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets