Pages that link to "Item:Q2340879"
From MaRDI portal
The following pages link to A Bayesian approach for noisy matrix completion: optimal rate under general sampling distribution (Q2340879):
Displaying 22 items.
- Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification (Q123602) (← links)
- Pseudo-Bayesian quantum tomography with rank-adaptation (Q511674) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- An oracle inequality for quasi-Bayesian nonnegative matrix factorization (Q1678528) (← links)
- On the exponentially weighted aggregate with the Laplace prior (Q1800807) (← links)
- Robust low-rank matrix estimation (Q1990590) (← links)
- Matrix factorization for multivariate time series analysis (Q2008611) (← links)
- Oracle posterior contraction rates under hierarchical priors (Q2044331) (← links)
- Tight risk bound for high dimensional time series completion (Q2137821) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Concentration of tempered posteriors and of their variational approximations (Q2196229) (← links)
- Bayesian matrix completion approach to causal inference with panel data (Q2241470) (← links)
- Sharp oracle inequalities for low-complexity priors (Q2304249) (← links)
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions (Q2313281) (← links)
- Empirical Bayes matrix completion (Q2416781) (← links)
- Optimal estimation and completion of matrices with biclustering structures (Q2834492) (← links)
- On the properties of variational approximations of Gibbs posteriors (Q2958606) (← links)
- Inference and uncertainty quantification for noisy matrix completion (Q5218483) (← links)
- A reduced-rank approach to predicting multiple binary responses through machine learning (Q6089192) (← links)
- Bayesian uncertainty quantification for low-rank matrix completion (Q6122033) (← links)
- An efficient adaptive MCMC algorithm for pseudo-Bayesian quantum tomography (Q6177006) (← links)
- High-dimensional sparse classification using exponential weighting with empirical hinge loss (Q6668598) (← links)