Abel Rodriguez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Abel Rodriguez has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Juan Sosa
Universidad Nacional de Colombia
4 shared publications - Adrian Dobra
Department of Statistics, University of Washington, Washington, WA
3 shared publications - Rayleigh Lei
Center for Statistical Training and Consulting, Michigan State University, East Lansing, MI 48824, USA
3 shared publications - Scott Moser
School of Politics and International Relations, University of Nottingham, Nottingham, UK
3 shared publications - Alan. E. Gelfand
Department of Statistical Science, Duke University, Durham, USA
2 shared publications - Alex Lenkoski
Statistical Analysis and Machine Learning, Norwegian Computing Center, P.O. Box 114, Blindern, 0314 Oslo, Oslo, 0314, NORWAY
2 shared publications
Latest Publications
- 28 August 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-7
“Rebuilding” Statistics in the Age of AI: Culture, Infrastructure, and Training
1. The rapid expansion of artificial intelligence (AI) and large-scale data technologies is transforming how scientific research, industry, and society operate (Goodfellow et al. 2016; Vaswani et a...
- 28 August 2026
- Published by Taylor & Francis in Journal of the American Statistical Association
- p. 1-7
“Rebuilding” Statistics in the Age of AI: Culture, Infrastructure, and Training
1. The rapid expansion of artificial intelligence (AI) and large-scale data technologies is transforming how scientific research, industry, and society operate (Goodfellow et al. 2016; Vaswani et a...
- 28 May 2026
- Published by Ubiquity Press, Ltd. in Journal of Open Research Software
- Vol. 14
pumBayes: Estimating Ideal Points from Voting Data in R Using Unfolding Models
- 28 May 2026
- Published by Ubiquity Press, Ltd. in Journal of Open Research Software
- Vol. 14
pumBayes: Estimating Ideal Points from Voting Data in R Using Unfolding Models
- Open Access
- 27 August 2025
- Published by Cambridge University Press (CUP) in Political Analysis
- Vol. 34 (2) , 237-257
Explaining Differences in Voting Patterns across Voting Domains Using Hierarchical Bayesian Models
Spatial voting models are widely used in political science to analyze legislators’ preferences and voting behavior. Traditional models assume that legislators’ ideal points are static across different types of votes. This article extends the Bayesian spatial voting model to incorporate hierarchical Bayesian methods, allowing for the identification of covariates that explain differences in legislators’ ideal points across voting domains. We apply this model to procedural and final passage votes in the U.S. House of Representatives from the 93rd through 113th Congresses. Our findings indicate that legislators in the minority party and those representing moderate constituencies are more likely to exhibit different ideal points between procedural and final passage votes. This research advances the methodology of ideal point estimation by simultaneously scaling ideal points and explaining variation in these points, providing a more nuanced understanding of legislative voting behavior.
- 27 August 2025
- Published by Cambridge University Press (CUP) in Political Analysis
- Vol. 34 (2) , 237-257
Open AccessExplaining Differences in Voting Patterns across Voting Domains Using Hierarchical Bayesian Models
Spatial voting models are widely used in political science to analyze legislators’ preferences and voting behavior. Traditional models assume that legislators’ ideal points are static across different types of votes. This article extends the Bayesian spatial voting model to incorporate hierarchical Bayesian methods, allowing for the identification of covariates that explain differences in legislators’ ideal points across voting domains. We apply this model to procedural and final passage votes in the U.S. House of Representatives from the 93rd through 113th Congresses. Our findings indicate that legislators in the minority party and those representing moderate constituencies are more likely to exhibit different ideal points between procedural and final passage votes. This research advances the methodology of ideal point estimation by simultaneously scaling ideal points and explaining variation in these points, providing a more nuanced understanding of legislative voting behavior.
- 30 May 2025
- Published by The R Foundation
pumBayes: Bayesian Estimation of Probit Unfolding Models for Binary Preference Data
Bayesian estimation and analysis methods for Probit Unfolding Models (PUMs), a novel class of scaling models designed for binary preference data. These models allow for both monotonic and non-monotonic response functions. The package supports Bayesian inference for both static and dynamic PUMs using Markov chain Monte Carlo (MCMC) algorithms with minimal or no tuning. Key functionalities include posterior sampling, hyperparameter selection, data preprocessing, model fit evaluation, and visualization. The methods are particularly suited to analyzing voting data, such as from the U.S. Congress or Supreme Court, but can also be applied in other contexts where non-monotonic responses are expected. For methodological details, see Shi et al. (2025) .
- 30 May 2025
- Published by The R Foundation
pumBayes: Bayesian Estimation of Probit Unfolding Models for Binary Preference Data
Bayesian estimation and analysis methods for Probit Unfolding Models (PUMs), a novel class of scaling models designed for binary preference data. These models allow for both monotonic and non-monotonic response functions. The package supports Bayesian inference for both static and dynamic PUMs using Markov chain Monte Carlo (MCMC) algorithms with minimal or no tuning. Key functionalities include posterior sampling, hyperparameter selection, data preprocessing, model fit evaluation, and visualization. The methods are particularly suited to analyzing voting data, such as from the U.S. Congress or Supreme Court, but can also be applied in other contexts where non-monotonic responses are expected. For methodological details, see Shi et al. (2025) .
- Open Access
- 25 March 2025
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 55 (7) , 1-25
Stochastic gradient variational Bayes in the stochastic blockmodel
- 25 March 2025
- Published by Taylor & Francis in Communications in Statistics - Simulation and Computation
- Vol. 55 (7) , 1-25
Open AccessStochastic gradient variational Bayes in the stochastic blockmodel
- Open Access
- 30 September 2024
- Published by Cambridge University Press (CUP) in Political Analysis
- Vol. 33 (1) , 32-48
A Novel Class of Unfolding Models for Binary Preference Data
We develop a new class of spatial voting models for binary preference data that can accommodate both monotonic and non-monotonic response functions, and are more flexible than alternative “unfolding” models previously introduced in the literature. We then use these models to estimate revealed preferences for legislators in the U.S. House of Representatives and justices on the U.S. Supreme Court. The results from these applications indicate that the new models provide superior complexity-adjusted performance to various alternatives and that the additional flexibility leads to preferences’ estimates that more closely match the perceived ideological positions of legislators and justices.
- 30 September 2024
- Published by Cambridge University Press (CUP) in Political Analysis
- Vol. 33 (1) , 32-48
Open AccessA Novel Class of Unfolding Models for Binary Preference Data
We develop a new class of spatial voting models for binary preference data that can accommodate both monotonic and non-monotonic response functions, and are more flexible than alternative “unfolding” models previously introduced in the literature. We then use these models to estimate revealed preferences for legislators in the U.S. House of Representatives and justices on the U.S. Supreme Court. The results from these applications indicate that the new models provide superior complexity-adjusted performance to various alternatives and that the additional flexibility leads to preferences’ estimates that more closely match the perceived ideological positions of legislators and justices.
- 27 February 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (2) , 1-24
Improvements on scalable stochastic Bayesian inference methods for multivariate Hawkes process
- 27 February 2024
- Published by Springer Nature in Statistics and Computing
- Vol. 34 (2) , 1-24
Improvements on scalable stochastic Bayesian inference methods for multivariate Hawkes process
- Open Access
On Data Analysis Pipelines and Modular Bayesian Modeling
The most common approach to implementing data analysis pipelines involves obtaining point estimates from the upstream modules and then treating these as known quantities when working with the downstream ones. This approach is straightforward, but it is likely to underestimate the overall uncertainty associated with any final estimates. An alternative approach involves estimating parameters from the modules jointly using a Bayesian hierarchical model, which has the advantage of propagating upstream uncertainty into the downstream estimates. However, when modules are misspecified, such a joint model can behave in unexpected ways. Furthermore, hierarchical models require the development of ad-hoc computational implementations that can be laborious and computationally expensive. Cut inference modifies the posterior distribution to prevent information flow between certain parameters and provides a third alternative for statistical inference in data analysis pipelines. This paper presents a unified framework that encompasses two-step, cut, and joint inference in the context of data analysis pipelines with two modules and uses two examples to illustrate the tradeoffs associated with these approaches. Our work shows that cut inference provides both some level of robustness and ease of implementation for data analysis pipelines at a lower cost in terms of statistical inference.
Open AccessOn Data Analysis Pipelines and Modular Bayesian Modeling
The most common approach to implementing data analysis pipelines involves obtaining point estimates from the upstream modules and then treating these as known quantities when working with the downstream ones. This approach is straightforward, but it is likely to underestimate the overall uncertainty associated with any final estimates. An alternative approach involves estimating parameters from the modules jointly using a Bayesian hierarchical model, which has the advantage of propagating upstream uncertainty into the downstream estimates. However, when modules are misspecified, such a joint model can behave in unexpected ways. Furthermore, hierarchical models require the development of ad-hoc computational implementations that can be laborious and computationally expensive. Cut inference modifies the posterior distribution to prevent information flow between certain parameters and provides a third alternative for statistical inference in data analysis pipelines. This paper presents a unified framework that encompasses two-step, cut, and joint inference in the context of data analysis pipelines with two modules and uses two examples to illustrate the tradeoffs associated with these approaches. Our work shows that cut inference provides both some level of robustness and ease of implementation for data analysis pipelines at a lower cost in terms of statistical inference.
- Open Access
- 1 December 2023
- Published by Institute of Mathematical Statistics in Bayesian Analysis
- Vol. 18 (4) , 1-30
High-Dimensional Bayesian Network Classification with Network Global-Local Shrinkage Priors
This article proposes a novel Bayesian binary classification framework for networks with labeled nodes. Our approach is motivated by applications in brain connectome studies, where the overarching goal is to identify both regions of interest (ROIs) in the brain and connections between ROIs that influence how study subjects are classified. We propose a novel binary logistic regression framework with the network as the predictor, and model the associated network coefficient using a novel class of global-local network shrinkage priors. We perform a theoretical analysis of a member of this class of priors (which we call the Network Lasso Prior) and show asymptotically correct classification of networks even when the number of network edges grows faster than the sample size. Two representative members from this class of priors, the Network Lasso prior and the Network Horseshoe prior, are implemented using an efficient Markov Chain Monte Carlo algorithm, and empirically evaluated through simulation studies and the analysis of a real brain connectome dataset.
- 1 December 2023
- Published by Institute of Mathematical Statistics in Bayesian Analysis
- Vol. 18 (4) , 1-30
Open AccessHigh-Dimensional Bayesian Network Classification with Network Global-Local Shrinkage Priors
This article proposes a novel Bayesian binary classification framework for networks with labeled nodes. Our approach is motivated by applications in brain connectome studies, where the overarching goal is to identify both regions of interest (ROIs) in the brain and connections between ROIs that influence how study subjects are classified. We propose a novel binary logistic regression framework with the network as the predictor, and model the associated network coefficient using a novel class of global-local network shrinkage priors. We perform a theoretical analysis of a member of this class of priors (which we call the Network Lasso Prior) and show asymptotically correct classification of networks even when the number of network edges grows faster than the sample size. Two representative members from this class of priors, the Network Lasso prior and the Network Horseshoe prior, are implemented using an efficient Markov Chain Monte Carlo algorithm, and empirically evaluated through simulation studies and the analysis of a real brain connectome dataset.