Ryan P. Browne
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ryan P. Browne has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Paul D. McNicholas
Department of Mathematics & Statistics, McMaster University, Hamilton, Canada
6 shared publications - Jason Hou-Liu
Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Canada
4 shared publications - Jeffrey L. Andrews
Department of Computer Science, Mathematics, Physics and Statistics, Irving K. Barber Faculty of Science University of British Columbia Okanagan Kelowna British Columbia Canada
3 shared publications Paula M. Murray
McMaster University
2 shared publications- Alex Sharp
Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Canada
1 shared publication - Alexa A. Sochaniwsky1 shared publication
Latest Publications
- Open Access
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 19 (2) , 3564-3600
An analysis of precision in estimation with the stochastic EM algorithm
The stochastic em algorithm replaces the e-stepwith a Monte Carlo approximation, trading monotonicity for the potential to escape local maxima. Estimation techniques include averaging the tail of the chain, and choosing the value in the chain associated with the largest likelihood value. We demonstrate that the latter estimator diverges from the maximum likelihood estimate with high probability as the dimensionality of the parameter increases, but that it is also more precise in terms of chain length when the parameter is a scalar. Based on these findings, we propose a new estimator which we prove achieves this same level of precision for inference of multidimensional parameters. Simulation studies demonstrate the benefits of the proposed estimator when compared to topical approaches.
- 1 January 2025
- Published by Institute of Mathematical Statistics in Electronic Journal of Statistics
- Vol. 19 (2) , 3564-3600
Open AccessAn analysis of precision in estimation with the stochastic EM algorithm
The stochastic em algorithm replaces the e-stepwith a Monte Carlo approximation, trading monotonicity for the potential to escape local maxima. Estimation techniques include averaging the tail of the chain, and choosing the value in the chain associated with the largest likelihood value. We demonstrate that the latter estimator diverges from the maximum likelihood estimate with high probability as the dimensionality of the parameter increases, but that it is also more precise in terms of chain length when the parameter is a scalar. Based on these findings, we propose a new estimator which we prove achieves this same level of precision for inference of multidimensional parameters. Simulation studies demonstrate the benefits of the proposed estimator when compared to topical approaches.
- Open Access
- 1 July 2024
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 13 (3)
Statistical inference for sketching algorithms
Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling. Complete and partial sketch regression estimates can be constructed using information from only the sketched data set or a combination of the full and sketched data sets. Previous work has obtained the distribution of these estimators under repeated sketching, along with the first two moments for both estimators. Using an alternative approach, we derive the distribution of the complete sketch estimator and additionally consider the error term under both repeated sketching and repeated sampling. Importantly, we obtain pivotal quantities which are based solely on the sketched data set—specifically not requiring information from the full data model fit. These pivotal quantities can be used for inference on the full data set regression estimates or the model parameters. For partial sketching, we derive pivotal quantities for a marginal test and an approximate distribution for the partial sketch under repeated sketching or repeated sampling—again avoiding reliance on a full data model fit. We extend these results to include the Hadamard and Clarkson–Woodruff sketches then compare them in a simulation study.
- 1 July 2024
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 13 (3)
Open AccessStatistical inference for sketching algorithms
Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling. Complete and partial sketch regression estimates can be constructed using information from only the sketched data set or a combination of the full and sketched data sets. Previous work has obtained the distribution of these estimators under repeated sketching, along with the first two moments for both estimators. Using an alternative approach, we derive the distribution of the complete sketch estimator and additionally consider the error term under both repeated sketching and repeated sampling. Importantly, we obtain pivotal quantities which are based solely on the sketched data set—specifically not requiring information from the full data model fit. These pivotal quantities can be used for inference on the full data set regression estimates or the model parameters. For partial sketching, we derive pivotal quantities for a marginal test and an approximate distribution for the partial sketch under repeated sketching or repeated sampling—again avoiding reliance on a full data model fit. We extend these results to include the Hadamard and Clarkson–Woodruff sketches then compare them in a simulation study.
- 26 February 2024
- Published by Springer Nature in TEST
- Vol. 33 (3) , 752-785
The orthogonal skew model: computationally efficient multivariate skew-normal and skew-t distributions with applications to model-based clustering
- 26 February 2024
- Published by Springer Nature in TEST
- Vol. 33 (3) , 752-785
The orthogonal skew model: computationally efficient multivariate skew-normal and skew-t distributions with applications to model-based clustering
- 13 November 2023
- Published by Springer Nature in Journal of Classification
- Vol. 41 (1) , 39-64
Model-Based Clustering with Nested Gaussian Clusters
- 13 November 2023
- Published by Springer Nature in Journal of Classification
- Vol. 41 (1) , 39-64
Model-Based Clustering with Nested Gaussian Clusters
- Open Access
- 27 September 2023
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 18 (3) , 597-625
Parsimony and parameter estimation for mixtures of multivariate leptokurtic-normal distributions
Mixtures of multivariate leptokurtic-normal distributions have been recently introduced in the clustering literature based on mixtures of elliptical heavy-tailed distributions. They have the advantage of having parameters directly related to the moments of practical interest. We derive two estimation procedures for these mixtures. The first one is based on the majorization-minimization algorithm, while the second is based on a fixed point approximation. Moreover, we introduce parsimonious forms of the considered mixtures and we use the illustrated estimation procedures to fit them. We use simulated and real data sets to investigate various aspects of the proposed models and algorithms.
- 27 September 2023
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 18 (3) , 597-625
Open AccessParsimony and parameter estimation for mixtures of multivariate leptokurtic-normal distributions
Mixtures of multivariate leptokurtic-normal distributions have been recently introduced in the clustering literature based on mixtures of elliptical heavy-tailed distributions. They have the advantage of having parameters directly related to the moments of practical interest. We derive two estimation procedures for these mixtures. The first one is based on the majorization-minimization algorithm, while the second is based on a fixed point approximation. Moreover, we introduce parsimonious forms of the considered mixtures and we use the illustrated estimation procedures to fit them. We use simulated and real data sets to investigate various aspects of the proposed models and algorithms.
- 19 July 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (5) , 1-19
Generalized linear models for massive data via doubly-sketching
- 19 July 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (5) , 1-19
Generalized linear models for massive data via doubly-sketching
- Open Access
Statistical inference for sketching algorithms
Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling. Complete and partial sketch regression estimates can be constructed using information from only the sketched data set or a combination of the full and sketched data sets. Previous work has obtained the distribution of these estimators under repeated sketching, along with the first two moments for both estimators. Using a different approach, we also derive the distribution of the complete sketch estimator, but additionally consider the error term under both repeated sketching and sampling. Importantly, we obtain pivotal quantities which are based solely on the sketched data set which specifically not requiring information from the full data model fit. These pivotal quantities can be used for inference on the full data set regression estimates or the model parameters. For partial sketching, we derive pivotal quantities for a marginal test and an approximate distribution for the partial sketch under repeated sketching or repeated sampling, again avoiding reliance on a full data model fit. We extend these results to include the Hadamard and Clarkson-Woodruff sketches then compare them in a simulation study.
Open AccessStatistical inference for sketching algorithms
Sketching algorithms use random projections to generate a smaller sketched data set, often for the purposes of modelling. Complete and partial sketch regression estimates can be constructed using information from only the sketched data set or a combination of the full and sketched data sets. Previous work has obtained the distribution of these estimators under repeated sketching, along with the first two moments for both estimators. Using a different approach, we also derive the distribution of the complete sketch estimator, but additionally consider the error term under both repeated sketching and sampling. Importantly, we obtain pivotal quantities which are based solely on the sketched data set which specifically not requiring information from the full data model fit. These pivotal quantities can be used for inference on the full data set regression estimates or the model parameters. For partial sketching, we derive pivotal quantities for a marginal test and an approximate distribution for the partial sketch under repeated sketching or repeated sampling, again avoiding reliance on a full data model fit. We extend these results to include the Hadamard and Clarkson-Woodruff sketches then compare them in a simulation study.
- 15 February 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (1) , 145-167
Model-Based Clustering and Classification Using Mixtures of Multivariate Skewed Power Exponential Distributions
- 15 February 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (1) , 145-167
Model-Based Clustering and Classification Using Mixtures of Multivariate Skewed Power Exponential Distributions
- Open Access
Estimation of Gaussian Bi-Clusters with General Block-Diagonal Covariance Matrix and Applications
Bi-clustering is a technique that allows for the simultaneous clustering of observations and features in a dataset. This technique is often used in bioinformatics, text mining, and time series analysis. An important advantage of biclustering algorithm is the ability to uncover multiple ``views'' (i.e., through rows and column groupings) in the data. Several Gaussian mixture model based biclustering approach currently exist in the literature. However, they impose severe restrictions on the structure of the covariance matrix. Here, we propose a Gaussian mixture model-based bi-clustering approach that provides a more flexible block-diagonal covariance structure. We show that the clustering accuracy of the proposed model is comparable to other known techniques but our approach provides a more flexible covariance structure and has substantially lower computational time. We demonstrate the application of the proposed model in bioinformatics and topic modelling.
Open AccessEstimation of Gaussian Bi-Clusters with General Block-Diagonal Covariance Matrix and Applications
Bi-clustering is a technique that allows for the simultaneous clustering of observations and features in a dataset. This technique is often used in bioinformatics, text mining, and time series analysis. An important advantage of biclustering algorithm is the ability to uncover multiple ``views'' (i.e., through rows and column groupings) in the data. Several Gaussian mixture model based biclustering approach currently exist in the literature. However, they impose severe restrictions on the structure of the covariance matrix. Here, we propose a Gaussian mixture model-based bi-clustering approach that provides a more flexible block-diagonal covariance structure. We show that the clustering accuracy of the proposed model is comparable to other known techniques but our approach provides a more flexible covariance structure and has substantially lower computational time. We demonstrate the application of the proposed model in bioinformatics and topic modelling.
- 4 January 2023
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 18 (1) , 33-60
Flexible mixture regression with the generalized hyperbolic distribution
- 4 January 2023
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 18 (1) , 33-60
Flexible mixture regression with the generalized hyperbolic distribution