Search Results for author:
Found 9 papers, 4 papers with code
Highway: Efficient Consensus with Flexible Finality
We propose Highway, a new consensus protocol that is safe and live in the classical partially synchronous BFT model, while at the same time offering practical improvements over existing solutions.
Distributed, Parallel, and Cluster Computing Cryptography and Security
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes
Virtually every cryptocurrency system has such a protocol at its core, and it is the efficiency of this protocol that determines the overall throughput and latency of the system.
Distributed, Parallel, and Cluster Computing Cryptography and Security
Fair and Diverse DPP-based Data Summarization
Sampling methods that choose a subset of the data proportional to its diversity in the feature space are popular for data summarization.
Maximum Entropy Distributions: Bit Complexity and Stability
Our main result shows a ${\rm poly}(m, \log 1/\varepsilon)$ bound on the bit complexity of $\varepsilon$-optimal dual solutions to the maximum entropy convex program -- for very general support sets and with no restriction on the marginal vector.
Belief Propagation, Bethe Approximation and Polynomials
While it is known that the stationary points of the Bethe approximation coincide with the fixed points of belief propagation, in general, the relation between the Bethe approximation and the partition function is not well understood.
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration
The volume of a set of vectors is used as a measure of their diversity, and partition or matroid constraints over $[m]$ are imposed in order to ensure resource or fairness constraints.
On the Complexity of Constrained Determinantal Point Processes
Consequently, we obtain a few algorithms of independent interest: 1) to count over the base polytope of regular matroids when there are additional (succinct) budget constraints and, 2) to evaluate and compute the mixed characteristic polynomials, that played a central role in the resolution of the Kadison-Singer problem, for certain special cases.
IRLS and Slime Mold: Equivalence and Convergence
In this paper we present a connection between two dynamical systems arising in entirely different contexts: one in signal processing and the other in biology.
