arXiv subjects

Brenda Betancourt

Publications and source records attributed to Brenda Betancourt.

17 recordsLinked to original sources

arXiv2026

Statistics in the Age of AI

Artificial intelligence (AI) can automate programming, model fitting, visualization, simulation, literature synthesis, and increasingly sophisticated methodological tasks, but it cannot remove the logical conditions under which data support scientific claims or consequential decisions. We formalize these conditions through statistical warrant, which connects data to a claim through the target, observation regime, assumptions, procedure, uncertainty assessment, validation criterion, loss structure, governance and accountability. No algorithm can consistently recover a target that is not identified by the observation regime without additional information or assumptions. From this principle, we organize the argument around five statements. Questions and targets are integral to statistical methods. Data acquire evidential meaning only through design, provenance, and assumptions. Description, prediction, causal inference, and decision are mathematically distinct tasks. Analytical abundance requires accounting for how analyses are selected, uncertainty across the analytical system, and deployment validation. The statistician's fundamental role is therefore to construct, criticize, and safeguard statistical warrant, including by developing new methodology when existing theory is inadequate. This role requires statistical reasoning and attributable human and institutional responsibility.

stat.OT↗

arXiv2025

Hybrid Bayesian Models for Community Detection with Application to a Colombian Conflict Network

We introduce a flexible Bayesian framework for clustering nodes in undirected binary networks, motivated by the need to uncover structural patterns in complex environments. Building on the stochastic block model, we develop two hybrid extensions: the Class-Distance Model, which governs interaction probabilities through Euclidean distances between cluster-level latent positions, and the Class-Bilinear Model, which captures more complex relational patterns via bilinear interactions. We apply this framework to a novel network derived from the Colombian armed conflict, where municipalities are connected through the co-presence of armed actors, violence, and illicit economies. The resulting clusters align with empirical patterns of territorial control and trafficking corridors, highlighting the models' capacity to recover and explain complex dynamics. Full Bayesian inference is carried out via MCMC under both finite and nonparametric clustering priors. While the main application centers on the Colombian conflict, we also assess model performance using synthetic data as well as other two benchmark datasets.

stat.ME↗

arXiv2024

Generative Filtering for Recursive Bayesian Inference with Streaming Data

In the streaming data setting, where data arrive continuously or in frequent batches and there is no pre-determined amount of total data, Bayesian models can employ recursive updates, incorporating each new batch of data into the model parameters' posterior distribution. Filtering methods are currently used to perform these updates efficiently, however, they suffer from eventual degradation as the number of unique values within the filtered samples decreases. We propose Generative Filtering, a method for efficiently performing recursive Bayesian updates in the streaming setting. Generative Filtering retains the speed of a filtering method while using parallel updates to avoid degenerate distributions after repeated applications. We derive rates of convergence for Generative Filtering and conditions for the use of sufficient statistics instead of fully storing all past data. We investigate the alleviation of filtering degradation through simulation and Ecological species count data.

stat.CO↗

arXiv2024

A robust Bayesian latent position approach for community detection in networks with continuous attributes

The increasing prevalence of multiplex networks has spurred a critical need to take into account potential dependencies across different layers, especially when the goal is community detection, which is a fundamental learning task in network analysis. We propose a full Bayesian mixture model for community detection in both single-layer and multi-layer networks. A key feature of our model is the joint modeling of the nodal attributes that often come with the network data as a spatial process over the latent space. In addition, our model for multi-layer networks allows layers to have different strengths of dependency in the unique latent position structure and assumes that the probability of a relation between two actors (in a layer) depends on the distances between their latent positions (multiplied by a layer-specific factor) and the difference between their nodal attributes. Under our prior specifications, the actors' positions in the latent space arise from a finite mixture of Gaussian distributions, each corresponding to a cluster. Simulated examples show that our model outperforms existing benchmark models and exhibits significantly greater robustness when handling datasets with missing values. The model is also applied to a real-world three-layer network of employees in a law firm.

stat.AP↗

arXiv2023

Fast Bayesian Record Linkage for Streaming Data Contexts

Record linkage is the task of combining records from multiple files which refer to overlapping sets of entities when there is no unique identifying field. In streaming record linkage, files arrive sequentially in time and estimates of links are updated after the arrival of each file. This problem arises in settings such as longitudinal surveys, electronic health records, and online events databases, among others. The challenge in streaming record linkage is to efficiently update parameter estimates as new data arrive. We approach the problem from a Bayesian perspective with estimates calculated from posterior samples of parameters and present methods for updating link estimates after the arrival of a new file that are faster than fitting a joint model with each new data file. In this paper, we generalize a two-file Bayesian Fellegi-Sunter model to the multi-file case and propose two methods to perform streaming updates. We examine the effect of prior distribution on the resulting linkage accuracy as well as the computational trade-offs between the methods when compared to a Gibbs sampler through simulated and real-world survey panel data. We achieve near-equivalent posterior inference at a small fraction of the compute time. Supplemental materials for this article are available online.

stat.CO↗

arXiv2022

Fast Generation of Exchangeable Sequence of Clusters Data

Recent advances in Bayesian models for random partitions have led to the formulation and exploration of Exchangeable Sequences of Clusters (ESC) models. Under ESC models, it is the cluster sizes that are exchangeable, rather than the observations themselves. This property is particularly useful for obtaining microclustering behavior, whereby cluster sizes grow sublinearly in the number of observations, as is common in applications such as record linkage, sparse networks and genomics. Unfortunately, the exchangeable clusters property comes at the cost of projectivity. As a consequence, in contrast to more traditional Dirichlet Process or Pitman-Yor process mixture models, samples a priori from ESC models cannot be easily obtained in a sequential fashion and instead require the use of rejection or importance sampling. In this work, drawing on connections between ESC models and discrete renewal theory, we obtain closed-form expressions for certain ESC models and develop faster methods for generating samples a priori from these models compared with the existing state of the art. In the process, we establish analytical expressions for the distribution of the number of clusters under ESC models, which was unknown prior to this work.

math.ST↗

arXiv2022

A Practical Approach to Proper Inference with Linked Data

Entity resolution (ER), comprising record linkage and de-duplication, is the process of merging noisy databases in the absence of unique identifiers to remove duplicate entities. One major challenge of analysis with linked data is identifying a representative record among determined matches to pass to an inferential or predictive task, referred to as the \emph{downstream task}. Additionally, incorporating uncertainty from ER in the downstream task is critical to ensure proper inference. To bridge the gap between ER and the downstream task in an analysis pipeline, we propose five methods to choose a representative (or canonical) record from linked data, referred to as canonicalization. Our methods are scalable in the number of records, appropriate in general data scenarios, and provide natural error propagation via a Bayesian canonicalization stage. The proposed methodology is evaluated on three simulated data sets and one application -- determining the relationship between demographic information and party affiliation in voter registration data from the North Carolina State Board of Elections. We first perform Bayesian ER and evaluate our proposed methods for canonicalization before considering the downstream tasks of linear and logistic regression. Bayesian canonicalization methods are empirically shown to improve downstream inference in both settings through prediction and coverage.

stat.ME↗

arXiv2021

A Prior for Record Linkage Based on Allelic Partitions

In database management, record linkage aims to identify multiple records that correspond to the same individual. This task can be treated as a clustering problem, in which a latent entity is associated with one or more noisy database records. However, in contrast to traditional clustering applications, a large number of clusters with a few observations per cluster is expected in this context. In this paper, we introduce a new class of prior distributions based on allelic partitions that is specially suited for the small cluster setting of record linkage. Our approach makes it straightforward to introduce prior information about the cluster size distribution at different scales, and naturally enforces sublinear growth of the maximum cluster size -known as the microclustering property. We also introduce a set of novel microclustering conditions in order to impose further constraints on the cluster sizes a priori. We evaluate the performance of our proposed class of priors using simulated data and three official statistics data sets, and show that our models provide competitive results compared to state-of-the-art microclustering models in the record linkage literature. Moreover, we compare the performance of different loss functions for optimal point estimation of the partitions using decision-theoretical based approaches recently proposed in the literature.

stat.ME↗

arXiv2021

A Latent Space Model for Multilayer Network Data

In this work, we propose a Bayesian statistical model to simultaneously characterize two or more social networks defined over a common set of actors. The key feature of the model is a hierarchical prior distribution that allows us to represent the entire system jointly, achieving a compromise between dependent and independent networks. Among others things, such a specification easily allows us to visualize multilayer network data in a low-dimensional Euclidean space, generate a weighted network that reflects the consensus affinity between actors, establish a measure of correlation between networks, assess cognitive judgements that subjects form about the relationships among actors, and perform clustering tasks at different social instances. Our model's capabilities are illustrated using several real-world data sets, taking into account different types of actors, sizes, and relations.

cs.SI↗

arXiv2020

Random Partition Models for Microclustering Tasks

Traditional Bayesian random partition models assume that the size of each cluster grows linearly with the number of data points. While this is appealing for some applications, this assumption is not appropriate for other tasks such as entity resolution, modeling of sparse networks, and DNA sequencing tasks. Such applications require models that yield clusters whose sizes grow sublinearly with the total number of data points -- the microclustering property. Motivated by these issues, we propose a general class of random partition models that satisfy the microclustering property with well-characterized theoretical properties. Our proposed models overcome major limitations in the existing literature on microclustering models, namely a lack of interpretability, identifiability, and full characterization of model asymptotic properties. Crucially, we drop the classical assumption of having an exchangeable sequence of data points, and instead assume an exchangeable sequence of clusters. In addition, our framework provides flexibility in terms of the prior distribution of cluster sizes, computational tractability, and applicability to a large number of microclustering tasks. We establish theoretical properties of the resulting class of priors, where we characterize the asymptotic behavior of the number of clusters and of the proportion of clusters of a given size. Our framework allows a simple and efficient Markov chain Monte Carlo algorithm to perform statistical inference. We illustrate our proposed methodology on the microclustering task of entity resolution, where we provide a simulation study and real experiments on survey panel data.

stat.ME↗

arXiv2017

Modelling and prediction of financial trading networks: An application to the NYMEX natural gas futures market

Over the last few years there has been a growing interest in using financial trading networks to understand the microstructure of financial markets. Most of the methodologies developed so far for this purpose have been based on the study of descriptive summaries of the networks such as the average node degree and the clustering coefficient. In contrast, this paper develops novel statistical methods for modeling sequences of financial trading networks. Our approach uses a stochastic blockmodel to describe the structure of the network during each period, and then links multiple time periods using a hidden Markov model. This structure allows us to identify events that affect the structure of the market and make accurate short-term prediction of future transactions. The methodology is illustrated using data from the NYMEX natural gas futures market from January 2005 to December 2008.

stat.AP↗

arXiv2017

Investigating Competition in Financial Markets: A Sparse Autologistic Model for Dynamic Network Data

We develop a sparse autologistic model for investigating the impact of diversification and disintermediation strategies in the evolution of financial trading networks. In order to induce sparsity in the model estimates and address substantive questions about the underlying processes the model includes an $L^1$ regularization penalty. This makes implementation feasible for complex dynamic networks in which the number of parameters is considerably greater than the number of observations over time. We use the model to characterize trader behavior in the NYMEX natural gas futures market, where we find that disintermediation and not diversification or momentum tend to drive market microstructure.

stat.AP↗

arXiv2017

Bayesian Fused Lasso regression for dynamic binary networks

We propose a multinomial logistic regression model for link prediction in a time series of directed binary networks. To account for the dynamic nature of the data we employ a dynamic model for the model parameters that is strongly connected with the fused lasso penalty. In addition to promoting sparseness, this prior allows us to explore the presence of change points in the structure of the network. We introduce fast computational algorithms for estimation and prediction using both optimization and Bayesian approaches. The performance of the model is illustrated using simulated data and data from a financial trading network in the NYMEX natural gas futures market. Supplementary material containing the trading network data set and code to implement the algorithms is available online.

stat.AP↗

arXiv2017

A weakly informative prior for Bayesian dynamic model selection with applications in fMRI

In recent years, Bayesian statistics methods in neuroscience have been showing important advances. In particular, detection of brain signals for studying the complexity of the brain is an active area of research. Functional magnetic resonance imagining (fMRI) is an important tool to determine which parts of the brain are activated by different types of physical behavior. According to recent results there is evidence that the values of the connectivity brain signal parameters are close to zero and due to the nature of time series fMRI data with high frequency behavior, Bayesian dynamic models for identifying sparsity are indeed far-reaching. We propose a multivariate Bayesian dynamic approach for model selection and shrinkage estimation of the connectivity parameters. We describe the coupling or lead-lag between any pair of regions by using mixture priors for the connectivity parameters and propose a new weakly informative default prior for the state variances. This framework produces one-step-ahead proper posterior predictive results and induces shrinkage and robustness suitable for fMRI data in the presence of sparsity. To explore the performance of the proposed methodology we present simulation studies and an application to functional magnetic resonance imaging data.

stat.ME↗

arXiv2016

Flexible Models for Microclustering with Application to Entity Resolution

Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable clustering models. However, for some applications, this assumption is inappropriate. For example, when performing entity resolution, the size of each cluster should be unrelated to the size of the data set, and each cluster should contain a negligible fraction of the total number of data points. These applications require models that yield clusters whose sizes grow sublinearly with the size of the data set. We address this requirement by defining the microclustering property and introducing a new class of models that can exhibit this property. We compare models within this class to two commonly used clustering models using four entity-resolution data sets.

stat.ME↗

arXiv2015

Microclustering: When the Cluster Sizes Grow Sublinearly with the Size of the Data Set

Most generative models for clustering implicitly assume that the number of data points in each cluster grows linearly with the total number of data points. Finite mixture models, Dirichlet process mixture models, and Pitman--Yor process mixture models make this assumption, as do all other infinitely exchangeable clustering models. However, for some tasks, this assumption is undesirable. For example, when performing entity resolution, the size of each cluster is often unrelated to the size of the data set. Consequently, each cluster contains a negligible fraction of the total number of data points. Such tasks therefore require models that yield clusters whose sizes grow sublinearly with the size of the data set. We address this requirement by defining the \emph{microclustering property} and introducing a new model that exhibits this property. We compare this model to several commonly used clustering models by checking model fit using real and simulated data sets.

stat.ME↗

arXiv2012

Heavy tailed priors: an alternative to non-informative priors in the estimation of proportions on small areas

We explore the Cauchy and a new heavy tailed (Fuquene, Perez and Pericchi (2011)) priors to estimate proportions on small areas. Hierarchical models and the Binomial likelihood in the exponential family form are used. We believe that the heavy tailed priors in survey sampling settings could be more effective than the choice of noninformative priors to eliminate antipathy towards methods that involve subjective elements or assumptions. To illustrate the robust Bayesian approach, we apply this methodology in a popular example: "the clement problem". Finally, we recommend to use the Cauchy prior in absence or presence of outliers within the small areas and the Fuquene et al. (2011) prior when the outlier is a particular small area.

stat.ME↗