• Corpus ID: 201645434

Exact inference under the perfect phylogeny model

@article{Ray2019ExactIU,
  title={Exact inference under the perfect phylogeny model},
  author={Surjyendu Ray and Bei Jia and Sam Safavi and Tim van Opijnen and Ralph R. Isberg and Jason Rosch and Jos{\'e} Bento},
  journal={ArXiv},
  year={2019},
  volume={abs/1908.08623}
}
Motivation: Many inference tools use the Perfect Phylogeny Model (PPM) to learn trees from noisy variant allele frequency (VAF) data. Learning in this setting is hard, and existing tools use approximate or heuristic algorithms. An algorithmic improvement is important to help disentangle the limitations of the PPM's assumptions from the limitations in our capacity to learn under it. Results: We make such improvement in the scenario, where the mutations that are relevant for evolution can be… 

Figures and Tables from this paper

References

SHOWING 1-7 OF 7 REFERENCES
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
TLDR
It is argued that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas.
Testing Fine-Grained Parallelism for the ADMM on a Factor-Graph
TLDR
This work proposes a problem-independent scheme of accelerating the Alternating Direction Method of Multipliers that can automatically exploit fine-grained parallelism both in GPUs and shared-memory multi-core computers and achieves significant speedup in such diverse application domains as combinatorial optimization, machine learning, and optimal control.
An explicit rate bound for over-relaxed ADMM
  • G. França, José Bento
  • Computer Science, Mathematics
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
This paper provides an exact analytical solution to this semi-definite programming SDP and obtains a general and explicit upper bound on the convergence rate of the entire family of over-relaxed ADMM.
SPARTA : Fast global planning of collision-avoiding robot trajectories
TLDR
This work presents an algorithm for obtaining collision-avoiding robot trajectories called SPARTA (SPline-based ADMM for Robot Trajectory Avoidance), using a recently developed generalization of ADMM, the Three Weight Algorithm, which can be elegantly understood as a message passing algorithm.
Proximal Operators for Multi-Agent Path Planning
TLDR
New operators to deal with agents moving in arbitrary dimensions that are faster to compute than their 2D predecessors are introduced and landmarks, space-time positions that are automatically assigned to the set of agents under different optimality criteria are introduced.
Shape and Illumination from Shading using the Generic Viewpoint Assumption
TLDR
A novel linearized Spherical Harmonics (SH) shading model is proposed which enables a computationally efficient form of the GVA term and a model whose unknowns are shape and SH illumination is built, requiring fewer assumptions than competing methods.
A message-passing algorithm for multi-agent trajectory planning
TLDR
A novel approach for computing collision-free global trajectories for p agents with specified initial and final configurations, based on an improved version of the alternating direction method of multipliers (ADMM), which allows for incorporating different cost functionals with only minor adjustments.