Asynchronous Stochastic Variational Inference

Stochastic variational inference (SVI) employs stochastic optimization to scale up Bayesian computation to massive data. Since SVI is at its core a stochastic gradient-based algorithm, horizontal parallelism can be harnessed to allow larger scale inference. We propose a lock-free parallel implementation for SVI which allows distributed computations over multiple slaves in an asynchronous style. We show that our implementation leads to linear speed-up while guaranteeing an asymptotic ergodic convergence rate O(1/√T) given that the number of slaves is bounded by √T (T is the total number of iterations). The implementation is done in a high-performance computing (HPC) environment using message passing interface (MPI) for python (MPI4py). The extensive empirical evaluation shows that our parallel SVI is lossless, performing comparably well to its counterpart serial SVI with linear speed-up

The IBMAP approach for Markov networks structure learning

In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by performing statistical independence tests on data, trusting completely the outcome of each test. In practice tests may be incorrect, resulting in potential cascading errors and the consequent reduction in the quality of the structures learned. IBMAP contemplates this uncertainty in the outcome of the tests through a probabilistic maximum-a-posteriori approach. The approach is instantiated in the IBMAP-HC algorithm, a structure selection strategy that performs a polynomial heuristic local search in the space of possible structures. We present an extensive empirical evaluation on synthetic and real data, showing that our algorithm outperforms significantly the current independence-based algorithms, in terms of data efficiency and quality of learned structures, with equivalent computational complexities. We also show the performance of IBMAP-HC in a real-world application of knowledge discovery: EDAs, which are evolutionary algorithms that use structure learning on each generation for modeling the distribution of populations. The experiments show that when IBMAP-HC is used to learn the structure, EDAs improve the convergence to the optimum

Adaptive Filtering Enhances Information Transmission in Visual Cortex

Sensory neuroscience seeks to understand how the brain encodes natural environments. However, neural coding has largely been studied using simplified stimuli. In order to assess whether the brain's coding strategy depend on the stimulus ensemble, we apply a new information-theoretic method that allows unbiased calculation of neural filters (receptive fields) from responses to natural scenes or other complex signals with strong multipoint correlations. In the cat primary visual cortex we compare responses to natural inputs with those to noise inputs matched for luminance and contrast. We find that neural filters adaptively change with the input ensemble so as to increase the information carried by the neural response about the filtered stimulus. Adaptation affects the spatial frequency composition of the filter, enhancing sensitivity to under-represented frequencies in agreement with optimal encoding arguments. Adaptation occurs over 40 s to many minutes, longer than most previously reported forms of adaptation.Comment: 20 pages, 11 figures, includes supplementary informatio

Optimal measurement of visual motion across spatial and temporal scales

Sensory systems use limited resources to mediate the perception of a great variety of objects and events. Here a normative framework is presented for exploring how the problem of efficient allocation of resources can be solved in visual perception. Starting with a basic property of every measurement, captured by Gabor's uncertainty relation about the location and frequency content of signals, prescriptions are developed for optimal allocation of sensors for reliable perception of visual motion. This study reveals that a large-scale characteristic of human vision (the spatiotemporal contrast sensitivity function) is similar to the optimal prescription, and it suggests that some previously puzzling phenomena of visual sensitivity, adaptation, and perceptual organization have simple principled explanations.Comment: 28 pages, 10 figures, 2 appendices; in press in Favorskaya MN and Jain LC (Eds), Computer Vision in Advanced Control Systems using Conventional and Intelligent Paradigms, Intelligent Systems Reference Library, Springer-Verlag, Berli

Bactericidal activity of biosynthesized silver nanoparticles against human pathogenic bacteria

Green synthesis is an attractive and eco-friendly approach to generate potent antibacterial silver nanoparticles (Ag-NPs). Such particles have long been used to fight bacteria and represent a promising tool to overcome the emergence of antibiotic-resistant bacteria. In this study, green synthesis of Ag-NPs was attempted using plant extracts of Aloe vera, Portulaca oleracea and Cynodon dactylon. The identity and size of Ag-NPs was characterized by ultraviolet–visible spectrophotometer and scanning electron microscopy. Monodispersed Ag-NPs were produced with a range of different sizes based on the plant extract used. The bactericidal activity of Ag-NPs against a number of human pathogenic bacteria was determined using the disc diffusion method. The results showed that Gram positive bacteria were more susceptible than Gram negative ones to these antibacterial agents. The minimum inhibitory concentration was determined using the 96-well plate method. Finally, the mechanism by which Ag-NPs affect bacteria was investigated by SEM analysis. Bacteria treated with Ag-NPs were seen to undergo shrinkage and to lose their viability. This study provides evidence for a cheap and effective method for synthesizing potent bactericidal Ag-NPs and demonstrates their effectiveness against human pathogenic bacteria

A novel intelligent system for securing cash levels using Markov random fields

Financial support from the Spanish Ministry of Universities "Disruptive group decision making systems in fuzzy context: Applications in smart energy and people analytics" (PID2019-103880RB-I00), and Junta de Andalucia (SEJ340) is gratefully acknowledged.The maintenance of cash levels under certain security thresholds is key for the health of the banking sector. In this paper, the monitoring process of branch network cash levels is performed using a single intelligent system which should provide an alert when there are cash shortages at any point of the network. Such an integral solution would provide a unified insight that guarantees that branches with similar cash features are secured as a whole. That is to say, a triggered alarm at a specific branch would indicate that attention must also be paid to similar (in-cash-feature) branches. The system also incorporates a (complementary) specific treatment for individual branches. The Early Warning System for securing cash levels presented in this paper (cash level EWS) is deliberately free of local demographic specifications, thereby overcoming the current lack of worldwide definitions for local demographics. This aspect would be particularly valuable for banking institutions with branch networks all over the world. A further benefit is the cost reductions that are a result of replacing several approaches with a single global one. Instead of local demographic parameters, a solid theoretical model based on Markov random fields (MRFs) has been developed. The use of MRFs means a reduction in the amount of information required. This would mean a higher processing speed as well as a significant reduction in the amount of storage capacity required. To the best of the author's knowledge, this is the first time that MRFs have been applied to cash monitoring.Spanish Ministry of Universities PID2019-103880RB-I00Junta de Andalucia SEJ34

A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems

International audienceSzeliski et al. published an influential study in 2006 on energy minimization methods for Markov Random Fields (MRF). This study provided valuable insights in choosing the best optimization technique for certain classes of problems. While these insights remain generally useful today, the phenomenal success of random field models means that the kinds of inference problems that have to be solved changed significantly. Specifically , the models today often include higher order interactions, flexible connectivity structures, large label-spaces of different car-dinalities, or learned energy tables. To reflect these changes, we provide a modernized and enlarged study. We present an empirical comparison of more than 27 state-of-the-art optimization techniques on a corpus of 2,453 energy minimization instances from diverse applications in computer vision. To ensure reproducibility, we evaluate all methods in the OpenGM 2 framework and report extensive results regarding runtime and solution quality. Key insights from our study agree with the results of Szeliski et al. for the types of models they studied. However, on new and challenging types of models our findings disagree and suggest that polyhedral methods and integer programming solvers are competitive in terms of runtime and solution quality over a large range of model types

Lifted graphical models: a survey

Lifted graphical models provide a language for expressing dependencies between different types of entities, their attributes, and their diverse relations, as well as techniques for probabilistic reasoning in such multi-relational domains. In this survey, we review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We discuss inference algorithms, including lifted inference algorithms, that efficiently compute the answers to probabilistic queries over such models. We also review work in learning lifted graphical models from data. There is a growing need for statistical relational models (whether they go by that name or another), as we are inundated with data which is a mix of structured and unstructured, with entities and relations extracted in a noisy manner from text, and with the need to reason effectively with this data. We hope that this synthesis of ideas from many different research groups will provide an accessible starting point for new researchers in this expanding field

Network deconvolution as a general method to distinguish direct dependencies in networks

Recognizing direct relationships between variables connected in a network is a pervasive problem in biological, social and information sciences as correlation-based networks contain numerous indirect relationships. Here we present a general method for inferring direct effects from an observed correlation matrix containing both direct and indirect effects. We formulate the problem as the inverse of network convolution, and introduce an algorithm that removes the combined effect of all indirect paths of arbitrary length in a closed-form solution by exploiting eigen-decomposition and infinite-series sums. We demonstrate the effectiveness of our approach in several network applications: distinguishing direct targets in gene expression regulatory networks; recognizing directly interacting amino-acid residues for protein structure prediction from sequence alignments; and distinguishing strong collaborations in co-authorship social networks using connectivity information alone. In addition to its theoretical impact as a foundational graph theoretic tool, our results suggest network deconvolution is widely applicable for computing direct dependencies in network science across diverse disciplines.National Institutes of Health (U.S.) (grant R01 HG004037)National Institutes of Health (U.S.) (grant HG005639)Swiss National Science Foundation (Fellowship)National Science Foundation (U.S.) (NSF CAREER Award 0644282

Protective Intestinal Effects of Pituitary Adenylate Cyclase Activating Polypeptide

Pituitary adenylate cyclase activating polypeptide (PACAP) is an endogenous neuropeptide widely distributed throughout the body, including the gastrointestinal tract. Several effects have been described in human and animal intestines. Among others, PACAP infl uences secretion of intestinal glands, blood fl ow, and smooth muscle contraction. PACAP is a well-known cytoprotective peptide with strong anti-apoptotic, anti-infl ammatory, and antioxidant effects. The present review gives an overview of the intestinal protective actions of this neuropeptide. Exogenous PACAP treatment was protective in a rat model of small bowel autotransplantation. Radioimmunoassay (RIA) analysis of the intestinal tissue showed that endogenous PACAP levels gradually decreased with longer-lasting ischemic periods, prevented by PACAP addition. PACAP counteracted deleterious effects of ischemia on oxidative stress markers and cytokines. Another series of experiments investigated the role of endogenous PACAP in intestines in PACAP knockout (KO) mice. Warm ischemia–reperfusion injury and cold preservation models showed that the lack of PACAP caused a higher vulnerability against ischemic periods. Changes were more severe in PACAP KO mice at all examined time points. This fi nding was supported by increased levels of oxidative stress markers and decreased expression of antioxidant molecules. PACAP was proven to be protective not only in ischemic but also in infl ammatory bowel diseases. A recent study showed that PACAP treatment prolonged survival of Toxoplasma gondii infected mice suffering from acute ileitis and was able to reduce the ileal expression of proinfl ammatory cytokines. We completed the present review with recent clinical results obtained in patients suffering from infl ammatory bowel diseases. It was found that PACAP levels were altered depending on the activity, type of the disease, and antibiotic therapy, suggesting its probable role in infl ammatory events of the intestine