|
|
|
|
| LEADER |
01469 am a22001933u 4500 |
| 001 |
137449 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Daskalakis, Constantinos
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 700 |
1 |
0 |
|a Gouleakis, Themis
|e author
|
| 700 |
1 |
0 |
|a Tzamos, Chistos
|e author
|
| 700 |
1 |
0 |
|a Zampetakis, Manolis
|e author
|
| 245 |
0 |
0 |
|a Efficient Statistics, in High Dimensions, from Truncated Samples
|
| 260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2021-11-05T13:34:56Z.
|
| 856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/137449
|
| 520 |
|
|
|a We provide an efficient algorithm for the classical problem, going back to Galton, Pearson,and Fisher, of estimating, with arbitrary accuracy the parameters of a multivariate normal distribution from truncated samples. Truncated samples from ad-variate normal N(μ,Σ) means a samples is only revealed if it falls in some subset S⊆Rd; otherwise the samples are hidden and their count in proportion to the revealed samples is also hidden. We show that the meanμand covariance matrixΣcan be estimated with arbitrary accuracy in polynomial-time, as long as we have oracle access to S, and S has non-trivial measure under the unknown d-variate normal distribution. Additionally we show that without oracle access to S, any non-trivial estimation is impossible.
|
| 546 |
|
|
|a en
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t 10.1109/focs.2018.00067
|
