88 citations · 311 across the 59 of their papers we have counts for
4 papers · 1 filter
Ten Steps of EM Suffice for Mixtures of Two Gaussians
Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis
The Expectation-Maximization (EM) algorithm is a widely used method for maximum likelihood estimation in models with latent variables. For estimating mixtures of Gaussians, its ite…
Faster Sublinear Algorithms using Conditional Sampling
Themistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis
A conditional sampling oracle for a probability distribution D returns samples from the conditional distribution of D restricted to a specified subset of the domain. A recent line…
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms
Arturs Backurs, Christos Tzamos
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model (HMM) that results in a given sequence of observations. It runs in time given a se…
Tight Hardness Results for Maximum Weight Rectangles
Arturs Backurs, Nishanth Dikkala, Christos Tzamos
Given weighted points (positive or negative) in dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorith…