A Fast and Deterministic Algorithm for Consensus Set Maximization
نویسندگان
چکیده
منابع مشابه
Deterministic Quantum Annealing Expectation-Maximization Algorithm
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization appro...
متن کاملA Fast Newton Algorithm for Entropy Maximization in Phase Determination
A long-standing issue in the Bayesian statistical approach to the phase problem in X-ray crystallography is to solve an entropy maxi-mization subproblem eeciently in every iteration of phase estimation. The entropy maximization problem is a semi-innnite convex program and can be solved in a nite dual space by using a standard Newton's method. However, the Newton's method is too expensive for th...
متن کاملA Fast+practical+deterministic Algorithm for Triangularizing Integer Matrices
This paper presents a new algorithm for computing the row reduced echelon form triangularization H of an n m integer input matrix A. The cost of the algorithm is O(nmr 2 log 2 rjjAjj + r 4 log 3 rjjAjj) bit operations where r is the rank of A and jjAjj = max ij jA ij j. This complexity result assumes standard (quadratic) integer arithmetic but still matches, in the paramaters n, m and r, the be...
متن کاملDeterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We present a new deterministic algorithm for it and prove that, asymptotically in the sizes of the arrays, it is optimal in the alternation model used to study adaptive algorithms. We define the Opt-Threshold problem as fin...
متن کاملA Fast Bisimulation Algorithm Fast (hyper) Set Equivalence
In this paper we propose an eecient algorithmic solution to the problem of determining a Bisimulation Relation on a nite structure. In fact, we consider the so-called Relational Coarsest Partition problem: the search of the coarsest partition reening a given one and stable with respect to a given initial relation. Starting from a set-theoretic point of view we propose an algorithm that optimize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2835302