default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Minyi Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]Lizhen Lin
, Bayan Saparbayeva, Michael Minyi Zhang, David B. Dunson:
Accelerated algorithms for convex and non-convex optimization on manifolds. Mach. Learn. 114(3): 52 (2025)- 2024
- [c6]Ying Li, Zhidi Lin, Feng Yin, Michael Minyi Zhang:
Preventing Model Collapse in Gaussian Process Latent Variable Models. ICML 2024 - [i15]Ying Li, Zhidi Lin, Feng Yin, Michael Minyi Zhang:
Preventing Model Collapse in Gaussian Process Latent Variable Models. CoRR abs/2404.01697 (2024) - [i14]Ying Li, Zhidi Lin, Yuhao Liu, Michael Minyi Zhang, Pablo M. Olmos, Petar M. Djuric:
Scalable Random Feature Latent Variable Models. CoRR abs/2410.17700 (2024) - 2023
- [j6]Michael Minyi Zhang, Bianca Dumitrascu, Sinead A. Williamson, Barbara E. Engelhardt:
Sequential Gaussian Processes for Online Learning of Nonstationary Functions. IEEE Trans. Signal Process. 71: 1539-1550 (2023) - [c5]Ying Li, Lei Cheng, Feng Yin, Michael Minyi Zhang, Sergios Theodoridis:
Overcoming Posterior Collapse in Variational Autoencoders Via EM-Type Training. ICASSP 2023: 1-5 - [i13]Forough Fazeli-Asl, Michael Minyi Zhang, Lizhen Lin:
A Semi-Bayesian Nonparametric Hypothesis Test Using Maximum Mean Discrepancy with Applications in Generative Adversarial Networks. CoRR abs/2303.02637 (2023) - [i12]Michael Minyi Zhang, Gregory W. Gundersen, Barbara E. Engelhardt:
Bayesian Non-linear Latent Variable Modeling via Random Fourier Features. CoRR abs/2306.08352 (2023) - [i11]Forough Fazeli-Asl, Michael Minyi Zhang:
A Bayesian Non-parametric Approach to Generative Models: Integrating Variational Autoencoder and Generative Adversarial Networks using Wasserstein and Maximum Mean Discrepancy. CoRR abs/2308.14048 (2023) - [i10]Taole Sha, Michael Minyi Zhang:
Online Student-t Processes with an Overall-local Scale Structure for Modelling Non-stationary Data. CoRR abs/2311.00564 (2023) - 2022
- [j5]Michael Minyi Zhang, Sinead A. Williamson, Fernando Pérez-Cruz:
Accelerated parallel non-conjugate sampling for Bayesian non-parametric models. Stat. Comput. 32(3): 50 (2022) - [i9]Michael Minyi Zhang:
Sparse Infinite Random Feature Latent Variable Modeling. CoRR abs/2205.09909 (2022) - 2021
- [c4]Gregory W. Gundersen, Michael Minyi Zhang, Barbara E. Engelhardt:
Latent variable modeling with random features. AISTATS 2021: 1333-1341 - 2020
- [j4]Sinead A. Williamson, Michael Minyi Zhang, Paul Damien:
A New Class of Time Dependent Latent Factor Models with Applications. J. Mach. Learn. Res. 21: 27:1-27:24 (2020) - [c3]Kumar Avinava Dubey, Michael Minyi Zhang, Eric P. Xing, Sinead Williamson:
Distributed, partially collapsed MCMC for Bayesian Nonparametrics. AISTATS 2020: 3685-3695 - [c2]Li-Fang Cheng, Bianca Dumitrascu, Michael Minyi Zhang, Corey Chivers, Michael Draugelis, Kai Li, Barbara E. Engelhardt:
Patient-Specific Effects of Medication Using Latent Force Models with Gaussian Processes. AISTATS 2020: 4045-4055 - [i8]Avinava Dubey, Michael Minyi Zhang, Eric P. Xing, Sinead A. Williamson:
Distributed, partially collapsed MCMC for Bayesian Nonparametrics. CoRR abs/2001.05591 (2020) - [i7]Gregory W. Gundersen, Michael Minyi Zhang, Barbara E. Engelhardt:
Latent variable modeling with random features. CoRR abs/2006.11145 (2020) - [i6]Lizhen Lin, Bayan Saparbayeva, Michael Minyi Zhang, David B. Dunson:
Accelerated Algorithms for Convex and Non-Convex Optimization on Manifolds. CoRR abs/2010.08908 (2020)
2010 – 2019
- 2019
- [j3]Michael Minyi Zhang, Sinead A. Williamson:
Embarrassingly Parallel Inference for Gaussian Processes. J. Mach. Learn. Res. 20: 169:1-169:26 (2019) - [j2]Fernando Pérez-Cruz, Pablo M. Olmos, Michael Minyi Zhang, Howard Huang:
Probabilistic Time of Arrival Localization. IEEE Signal Process. Lett. 26(11): 1683-1687 (2019) - [i5]Sinead A. Williamson, Michael Minyi Zhang, Paul Damien:
A New Class of Time Dependent Latent Factor Models with Applications. CoRR abs/1904.08548 (2019) - [i4]Michael Minyi Zhang, Bianca Dumitrascu, Sinead A. Williamson, Barbara E. Engelhardt:
Sequential Gaussian Processes for Online Learning of Nonstationary Functions. CoRR abs/1905.10003 (2019) - [i3]Li-Fang Cheng, Bianca Dumitrascu, Michael Minyi Zhang, Corey Chivers, Michael Draugelis, Kai Li, Barbara E. Engelhardt:
Patient-Specific Effects of Medication Using Latent Force Models with Gaussian Processes. CoRR abs/1906.00226 (2019) - [i2]Fernando Pérez-Cruz, Pablo M. Olmos, Michael Minyi Zhang, Howard Huang:
Probabilistic Time of Arrival Localization. CoRR abs/1910.06569 (2019) - 2018
- [j1]Michael Minyi Zhang, Henry Lam, Lizhen Lin:
Robust and parallel Bayesian model selection. Comput. Stat. Data Anal. 127: 229-247 (2018) - [c1]Bayan Saparbayeva, Michael Minyi Zhang, Lizhen Lin:
Communication Efficient Parallel Algorithms for Optimization on Manifolds. NeurIPS 2018: 3578-3588 - [i1]Bayan Saparbayeva, Michael Minyi Zhang, Lizhen Lin:
Communication Efficient Parallel Algorithms for Optimization on Manifolds. CoRR abs/1810.11155 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
