Search Results for author:
Found 6 papers, 1 papers with code
Concentration properties of fractional posterior in 1-bit matrix completion
The problem of estimating a matrix based on a set of its observed entries is commonly referred to as the matrix completion problem.
Misclassification excess risk bounds for 1-bit matrix completion
This study investigates the misclassification excess risk bound in the context of 1-bit matrix completion, a significant problem in machine learning involving the recovery of an unknown matrix from a limited subset of its entries.
PAC-Bayesian Matrix Completion with a Spectral Scaled Student Prior
We study the problem of matrix completion in this paper.
Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion
In this paper, we study the low-rank matrix completion problem, a class of machine learning problems, that aims at the prediction of missing entries in a partially observed matrix.
On regret bounds for continual single-index learning
In this paper, we generalize the problem of single-index model to the context of continual learning in which a learner is challenged with a sequence of tasks one by one and the dataset of each task is revealed in an online fashion.
Regret Bounds for Lifelong Learning
We consider the problem of transfer learning in an online setting.
