DeepAI AI Chat
Log In Sign Up

Efficient learning of simplices

by   Joseph Anderson, et al.
The Ohio State University

We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan [FJK]. Our result can also be interpreted as efficiently learning the intersection of n+1 half-spaces in R^n in the model where the intersection is bounded and we are given polynomially many uniform samples from it. Our proof uses the local search technique from Independent Component Analysis (ICA), also used by [FJK]. Unlike these previous algorithms, which were based on analyzing the fourth moment, ours is based on the third moment. We also show a direct connection between the problem of learning a simplex and ICA: a simple randomized reduction to ICA from the problem of learning a simplex. The connection is based on a known representation of the uniform measure on a simplex. Similar representations lead to a reduction from the problem of learning an affine transformation of an n-dimensional l_p ball to ICA.


page 1

page 2

page 3

page 4


The Sparse Hausdorff Moment Problem, with Application to Topic Models

We consider the problem of identifying, from its first m noisy moments, ...

Efficient Algorithms for Sparse Moment Problems without Separation

We consider the sparse moment problem of learning a k-spike mixture in h...

Learning an arbitrary mixture of two multinomial logits

In this paper, we consider mixtures of multinomial logistic models (MNL)...

Learning a mixture of two subspaces over finite fields

We study the problem of learning a mixture of two subspaces over 𝔽_2^n. ...

Non-Gaussian Component Analysis via Lattice Basis Reduction

Non-Gaussian Component Analysis (NGCA) is the following distribution lea...

PAC-Learning Uniform Ergodic Communicative Networks

This work addressed the problem of learning a network with communication...

On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves

Given a parametric polynomial curve γ:[a,b]→ℝ^n, how can we sample a ran...