File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.csda.2018.05.016
- Scopus: eid_2-s2.0-85048259822
- WOS: WOS:000439748700015
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Robust and parallel Bayesian model selection
Title | Robust and parallel Bayesian model selection |
---|---|
Authors | |
Keywords | Scalable inference Bayesian statistics Model selection Machine learning |
Issue Date | 2018 |
Citation | Computational Statistics and Data Analysis, 2018, v. 127, p. 229-247 How to Cite? |
Abstract | © 2018 Elsevier B.V. Effective and accurate model selection is an important problem in modern data analysis. One of the major challenges is the computational burden required to handle large datasets that cannot be stored or processed on one machine. Another challenge one may encounter is the presence of outliers and contaminations that damage the inference quality. The parallel “divide and conquer” model selection strategy divides the observations of the full dataset into roughly equal subsets and perform inference and model selection independently on each subset. After local subset inference, this method aggregates the posterior model probabilities or other model/variable selection criteria to obtain a final model by using the notion of geometric median. This approach leads to improved concentration in finding the “correct” model and model parameters and also is provably robust to outliers and data contamination. |
Persistent Identifier | http://hdl.handle.net/10722/296174 |
ISSN | 2023 Impact Factor: 1.5 2023 SCImago Journal Rankings: 1.008 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Michael Minyi | - |
dc.contributor.author | Lam, Henry | - |
dc.contributor.author | Lin, Lizhen | - |
dc.date.accessioned | 2021-02-11T04:52:59Z | - |
dc.date.available | 2021-02-11T04:52:59Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Computational Statistics and Data Analysis, 2018, v. 127, p. 229-247 | - |
dc.identifier.issn | 0167-9473 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296174 | - |
dc.description.abstract | © 2018 Elsevier B.V. Effective and accurate model selection is an important problem in modern data analysis. One of the major challenges is the computational burden required to handle large datasets that cannot be stored or processed on one machine. Another challenge one may encounter is the presence of outliers and contaminations that damage the inference quality. The parallel “divide and conquer” model selection strategy divides the observations of the full dataset into roughly equal subsets and perform inference and model selection independently on each subset. After local subset inference, this method aggregates the posterior model probabilities or other model/variable selection criteria to obtain a final model by using the notion of geometric median. This approach leads to improved concentration in finding the “correct” model and model parameters and also is provably robust to outliers and data contamination. | - |
dc.language | eng | - |
dc.relation.ispartof | Computational Statistics and Data Analysis | - |
dc.subject | Scalable inference | - |
dc.subject | Bayesian statistics | - |
dc.subject | Model selection | - |
dc.subject | Machine learning | - |
dc.title | Robust and parallel Bayesian model selection | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.csda.2018.05.016 | - |
dc.identifier.scopus | eid_2-s2.0-85048259822 | - |
dc.identifier.volume | 127 | - |
dc.identifier.spage | 229 | - |
dc.identifier.epage | 247 | - |
dc.identifier.isi | WOS:000439748700015 | - |
dc.identifier.issnl | 0167-9473 | - |