Fixed-Size Determinantal Point Processes Sampling For Species Phylogeny

نویسندگان

چکیده

Determinantal point processes (DPPs) are popular tools that supply useful information for repulsiveness. They provide coherent probabilistic models when negative correlations arise and also represent new algorithms inference problems like sampling, marginalization conditioning. Recently, DPPs have played an increasingly important role in machine learning statistics, since they used diverse subset selection problems. In this paper we use k-DPP, a conditional DPP only sets of cardinality k, to sample species from large phylogenetic tree. The tree sampling task is many studies modern bioinformatics. results show fast mixing sampler which polynomial bound on the time given. This approach applied real-world dataset species, observe leaves joined by higher subtree more likely appear.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

k-DPPs: Fixed-Size Determinantal Point Processes

Determinantal point processes (DPPs) have recently been proposed as models for set selection problems where diversity is preferred. For example, they can be used to select diverse sets of sentences to form document summaries, or to find multiple nonoverlapping human poses in an image. However, DPPs conflate the modeling of two distinct characteristics: the size of the set, and its content. For ...

متن کامل

Efficient Sampling for k-Determinantal Point Processes

Determinantal Point Processes (Dpps) are elegant probabilistic models of repulsion and diversity over discrete sets of items. But their applicability to large sets is hindered by expensive cubic-complexity matrix operations for basic tasks such as sampling. In light of this, we propose a new method for approximate sampling from discrete k-Dpps. Our method takes advantage of the diversity proper...

متن کامل

Fixed-point algorithms for learning determinantal point processes

Determinantal point processes (DPPs) offer an elegant tool for encoding probabilities over subsets of a ground set. Discrete DPPs are parametrized by a positive semidefinite matrix (called the DPP kernel), and estimating this kernel is key to learning DPPs from observed data. We consider the task of learning the DPP kernel, and develop for it a surprisingly simple yet effective new algorithm. O...

متن کامل

Exact Sampling from Determinantal Point Processes

Determinantal point processes (DPPs) are an important concept in random matrix theory and combinatorics. They have also recently attracted interest in the study of numerical methods for machine learning, as they offer an elegant “missing link” between independent Monte Carlo sampling and deterministic evaluation on regular grids, applicable to a general set of spaces. This is helpful whenever a...

متن کامل

Balanced Mini-batch Sampling for SGD Using Determinantal Point Processes

We study a mini-batch diversification scheme for stochastic gradient descent (SGD). While classical SGD relies on uniformly sampling data points to form a mini-batch, we propose a non-uniform sampling scheme based on the Determinantal Point Process (DPP). The DPP relies on a similarity measure between data points and gives low probabilities to mini-batches which contain redundant data, and high...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MathematicS in action

سال: 2021

ISSN: ['2102-5754']

DOI: https://doi.org/10.5802/msia.13