no code implementations • 6 Jan 2021 • Daniel Kane, Andreas Fackler, Adam Gągol, Damian Straszak, Vlad Zamfir
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
1 code implementation • 14 Aug 2019 • Adam Gągol, Damian Leśniak, Damian Straszak, Michał Świętek
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
1 code implementation • ICML 2018 • L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi
Sampling methods that choose a subset of the data proportional to its diversity in the feature space are popular for data summarization.
no code implementations • 6 Nov 2017 • Damian Straszak, Nisheeth K. Vishnoi
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.
no code implementations • 8 Aug 2017 • Damian Straszak, Nisheeth K. Vishnoi
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.
no code implementations • 10 Jul 2017 • Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi
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.
2 code implementations • 22 Apr 2017 • L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi
Ranking algorithms are deployed widely to order a set of items in applications such as search engines, news feeds, and recommendation systems.
no code implementations • 1 Aug 2016 • L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi
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.
1 code implementation • 12 Jan 2016 • Damian Straszak, Nisheeth K. Vishnoi
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.