ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1412.2632
  4. Cited By
Probabilistic low-rank matrix completion on finite alphabets

Probabilistic low-rank matrix completion on finite alphabets

8 December 2014
Jean Lafond
Olga Klopp
Eric Moulines
Joseph Salmon
ArXivPDFHTML

Papers citing "Probabilistic low-rank matrix completion on finite alphabets"

5 / 5 papers shown
Title
Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax
  Rates, Covariate Quantization, and Uniform Recovery
Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery
Junren Chen
Michael Kwok-Po Ng
Di Wang
MQ
24
12
0
30 Dec 2022
Color Image Inpainting via Robust Pure Quaternion Matrix Completion:
  Error Bound and Weighted Loss
Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss
Junren Chen
Michael Kwok-Po Ng
14
20
0
04 Feb 2022
Matrix Completion with Model-free Weighting
Matrix Completion with Model-free Weighting
Jiayi Wang
R. K. Wong
Xiaojun Mao
Kwun Chuen Gary Chan
29
5
0
09 Jun 2021
Estimation bounds and sharp oracle inequalities of regularized
  procedures with Lipschitz loss functions
Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
Pierre Alquier
V. Cottet
Guillaume Lecué
18
59
0
05 Feb 2017
Low Rank Matrix Completion with Exponential Family Noise
Low Rank Matrix Completion with Exponential Family Noise
Jean Lafond
28
44
0
24 Feb 2015
1