# Constructing confidence sets for the matrix completion problem

**Authors:** Alexandra Carpentier, Olga Klopp (CREST, MODAL'X), Matthias L\"offler, (CAM)

arXiv: 1704.02760 · 2017-04-11

## TL;DR

This paper introduces a method for constructing honest and adaptive confidence sets in matrix completion, effectively accounting for unknown matrix rank under Bernoulli noise with known variance.

## Contribution

It presents a realizable approach to create confidence sets that adapt to the unknown rank of the matrix in the Bernoulli noise model.

## Key findings

- Confidence sets adapt to unknown matrix rank
- Method works under Bernoulli noise with known variance
- Provides honest and adaptive inference for matrix completion

## Abstract

In the present note we consider the problem of constructing honest and adaptive confidence sets for the matrix completion problem. For the Bernoulli model with known variance of the noise we provide a realizable method for constructing confidence sets that adapt to the unknown rank of the true matrix.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1704.02760/full.md

## References

17 references — full list in the complete paper: https://tomesphere.com/paper/1704.02760/full.md

---
Source: https://tomesphere.com/paper/1704.02760