Both frequentist and Bayesian probability have a role to play in machine learning. For example, if dealing with truly random and discrete variables, such as landing a six in a die roll, the traditional approach of simply calculating the odds (frequency) is the fastest way to model a likely outcome. However, if the six keeps coming up far more often than the predicated 1/6 odds, only Bayesian probability would take that new observation into account and increase the confidence level that someone is playing with loaded dice.

Modeling stochastic traffic behaviors at the microscopic level, such as car-following and lane-changing, is a crucial task to understand the interactions between individual vehicles in traffic streams. Leveraging a recently developed theory named physics regularized Gaussian process (PRGP), this study presents a stochastic microscopic traffic model that can capture the randomness and measure errors in the real world. Physical knowledge from classical car-following models is converted as physics regularizers, in the form of shadow Gaussian process (GP), of a multivariate PRGP for improving the modeling accuracy. More specifically, a Bayesian inference algorithm is developed to estimate the mean and kernel of GPs, and an enhanced latent force model is formulated to encode physical knowledge into stochastic processes. Also, based on the posterior regularization inference framework, an efficient stochastic optimization algorithm is developed to maximize the evidence lower-bound of the system likelihood. To evaluate the performance of the proposed models, this study conducts empirical studies on real-world vehicle trajectories from the NGSIM dataset. Since one unique feature of the proposed framework is the capability of capturing both car-following and lane-changing behaviors with one single model, numerical tests are carried out with two separated datasets, one contains lane-changing maneuvers and the other doesn't. The results show the proposed method outperforms the previous influential methods in estimation precision.

Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function. We propose a new parameter fitting method, Minimum Probability Flow (MPF), which is applicable to any parametric model. We demonstrate parameter estimation using MPF in two cases: a continuous state space model, and an Ising spin glass. In the latter case it outperforms current techniques by at least an order of magnitude in convergence time with lower error in the recovered coupling parameters.

Of these, probably the most common is the use of supervised classification to construct low-dimensional event summaries, which are informative to carry out statistical inference for a given set of parameters of interest. The learned summary statistics -functions of the data that are informative on their relevant properties-can efficiently combine high-dimensional information from each event into one or a few variables which can be used as the basis of statistical inference. The informational source for this compression are simulated observations produced by a complex generative model; the latter reproduces the chain of physical processes occurring in subatomic collisions and the subsequent interaction of the produced final state particles with the detection elements.

Recent advances in computational methods, material science, and manufacturing technologies reveal promising potentials for using geometrically complex parts to optimize the performance of structural systems. However, this potential has not yet been activated partly due to the immaturity of nondestructive testing (NDT) of such complex parts. Process compensated resonance testing (PCRT) is one of the methods that are in the focus of researchers for this purpose. The key to success for the PCRT approach is to use high-frequency vibration data in conjunction with statistical pattern recognition methods for supervised classification of parts in terms of their structural quality. In this paper, a multi classifier selection-fusion framework based on the Dempster-Shafer theory is proposed. Two new weighting approaches are introduced to enhance the fusion performance, and as such the classification performance. The effectiveness of the proposed framework is validated by its application to six UCI machine learning datasets and one experimental dataset collected from polycrystalline Nickel alloy first-stage turbine blades with a variety of damage features. Comparison with four state-of-the-art fusion techniques shows the good performance of the introduced classifier selection-fusion framework.

Cells regulate themselves via dizzyingly complex biochemical processes called signaling pathways. These are usually depicted as a network, where nodes represent proteins and edges indicate their influence on each other. In order to understand diseases and therapies at the cellular level, it is crucial to have an accurate understanding of the signaling pathways at work. Since signaling pathways can be modified by disease, the ability to infer signaling pathways from condition- or patient-specific data is highly valuable. A variety of techniques exist for inferring signaling pathways. We build on past works that formulate signaling pathway inference as a Dynamic Bayesian Network structure estimation problem on phosphoproteomic time course data. We take a Bayesian approach, using Markov Chain Monte Carlo to estimate a posterior distribution over possible Dynamic Bayesian Network structures. Our primary contributions are (i) a novel proposal distribution that efficiently samples sparse graphs and (ii) the relaxation of common restrictive modeling assumptions. We implement our method, named Sparse Signaling Pathway Sampling, in Julia using the Gen probabilistic programming language. Probabilistic programming is a powerful methodology for building statistical models. The resulting code is modular, extensible, and legible. The Gen language, in particular, allows us to customize our inference procedure for biological graphs and ensure efficient sampling. We evaluate our algorithm on simulated data and the HPN-DREAM pathway reconstruction challenge, comparing our performance against a variety of baseline methods. Our results demonstrate the vast potential for probabilistic programming, and Gen specifically, for biological network inference. Find the full codebase at https://github.com/gitter-lab/ssps

At IBM Research's recent "The Path to More Flexible AI" virtual roundtable, a panel of MIT and IBM experts discussed some of the biggest obstacles they face in developing artificial intelligence that can perform optimally in real-world situations. The solution, they agreed during the July 8 panel, is to embrace an integrated AI paradigm that amplifies the strengths and compensates for the weaknesses found in different approaches, including symbolic programming and deep learning. AI and automation are largely synonymous when you talk about industrial uses, said panelist David Cox, IBM Director of the MIT-IBM Watson AI Lab. "A lot of what people mean when they talk about AI today is automation," he added. "But automation is incredibly labor-intensive today, in a way that really just doesn't work for the problems we want to solve."

Even before the recent George Floyd case, there has been much debate about the extent to which claims of systemic racism are supported by statistical evidence. For example (Ross 2015) claims that unarmed blacks are 3.5 times more likely to be shot by police than unarmed whites when adjusting for relative differences in population size. However, (Fryer 2016) - formally published later as (Fryer 2019) - found that there was no such racial disparity when the data were conditioned on people being stopped by police, and there was a similar conclusion in (Patty and Hanson 2020) that was produced in direct response to public concerns about the Floyd case. In response to Fryer, (Ross, Winterhalder, and McElreath 2018) argued that Fryer's analysis was compromised because it was essentially an example of Simpson's paradox (Simpson 1951; Bickel, Hammel, and O'Connell 1975; Fenton, Neil, and Constantinou 2019) whereby conclusions based on pooled statistics are reversed when drilling down into relevant subcategories. A new paper (Knox, Lowe, and Mummolo 2020) explains why Simpson's paradox is not the only statistical explanation for the apparently contradictory conclusions of Ross and Fryer.

Stochastic block models (SBM) are widely used in network science due to their interpretable structure that allows inference on groups of nodes having common connectivity patterns. Although providing a well established model-based approach for community detection, such formulations are still the object of intense research to address the key problem of inferring the unknown number of communities. This has motivated the development of several probabilistic mechanisms to characterize the node partition process, covering solutions with fixed, random and infinite number of communities. In this article we provide a unified view of all these formulations within a single extended stochastic block model (ESBM), that relies on Gibbs-type processes and encompasses most existing representations as special cases. Connections with Bayesian nonparametric literature open up new avenues that allow the natural inclusion of several unexplored options to model the nodes partition process and to incorporate node attributes in a principled manner. Among these new alternatives, we focus on the Gnedin process as an example of a probabilistic mechanism with desirable theoretical properties and nice empirical performance. A collapsed Gibbs sampler that can be applied to the whole ESBM class is proposed, and refined methods for estimation, uncertainty quantification and model assessment are outlined. The performance of ESBM is assessed in simulations and an application to bill co-sponsorship networks in the Italian parliament, where we find key hidden block structures and core-periphery patterns.

There has been increased interest in missing sensor data imputation, which is ubiquitous in the field of structural health monitoring (SHM) due to discontinuous sensing caused by sensor malfunction. To address this fundamental issue, this paper presents an incremental Bayesian tensor learning method for reconstruction of spatiotemporal missing data in SHM and forecasting of structural response. In particular, a spatiotemporal tensor is first constructed followed by Bayesian tensor factorization that extracts latent features for missing data imputation. To enable structural response forecasting based on incomplete sensing data, the tensor decomposition is further integrated with vector autoregression in an incremental learning scheme. The performance of the proposed approach is validated on continuous field-sensing data (including strain and temperature records) of a concrete bridge, based on the assumption that strain time histories are highly correlated to temperature recordings. The results indicate that the proposed probabilistic tensor learning approach is accurate and robust even in the presence of large rates of random missing, structured missing and their combination. The effect of rank selection on the imputation and prediction performance is also investigated. The results show that a better estimation accuracy can be achieved with a higher rank for random missing whereas a lower rank for structured missing.