130 citations · 317 across the 27 of their papers we have counts for
6 papers · 1 filter
Efficient Projection onto the Perfect Phylogeny Model
Bei Jia, Surjyendu Ray, Sam Safavi +1
Several algorithms build on the perfect phylogeny model to infer evolutionary trees. This problem is particularly hard when evolutionary trees are inferred from the fraction of gen…
Estimating Cellular Goals from High-Dimensional Biological Data
Laurence Yang, Michael A. Saunders, Jean-Christophe Lachance +2
Optimization-based models have been used to predict cellular behavior for over 25 years. The constraints in these models are derived from genome annotations, measured macro-molecul…
Tractable -Metrics for Multiple Graphs
Sam Safavi, José Bento
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence…
An Explicit Convergence Rate for Nesterov's Method from SDP
Sam Safavi, Bikash Joshi, Guilherme França +1
The framework of Integral Quadratic Constraints (IQC) introduced by Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization al…
A Family of Tractable Graph Distances
Jose Bento, Stratis Ioannidis
Important data mining problems such as nearest-neighbor search and clustering admit theoretical guarantees when restricted to objects embedded in a metric space. Graphs are ubiquit…
On the Complexity of the Weighted Fused Lasso
Jose Bento, Ralph Furmaniak, Surjyendu Ray
The solution path of the 1D fused lasso for an -dimensional input is piecewise linear with segments (Hoefling et al. 2010 and Tibshirani et al 2011). However, e…