9 citations · 12 across the 5 of their papers we have counts for
6 papers
An Analysis of Loss Functions for Binary Classification and Regression
Jeffrey Buzas
This paper explores connections between margin-based loss functions and consistency in binary classification and regression applications. It is shown that a large class of margin-b…
Simulated packing and cracking
Jeffrey S. Buzas, Gregory S. Warrington
We introduce simulated packing and cracking as a technique for evaluating partisan-gerrymandering measures. We apply it to historical congressional and legislative elections to eva…
Gerrymandering and the net number of US House seats won due to vote-distribution asymmetries
Jeffrey S. Buzas, Gregory S. Warrington
Using the recently introduced declination function, we estimate the net number of seats won in the US House of Representatives due to asymmetries in vote distributions. Such asymme…
Tunably Rugged Landscapes with Known Maximum and Minimum
Narine Manukyan, Margaret J. Eppstein, Jeffrey S. Buzas
We propose NM landscapes as a new class of tunably rugged benchmark problems. NM landscapes are well-defined on alphabets of any arity, including both discrete and real-valued alph…
Optimized random chemistry
Jeffrey S. Buzas, Gregory S. Warrington
The random chemistry algorithm of Kauffman can be used to determine an unknown subset S of a fixed set V. The algorithm proceeds by zeroing in on S through a succession of nested s…
An analysis of NK and generalized NK landscapes
Jeffrey S. Buzas, Jeffrey Dinitz
Simulated landscapes have been used for decades to evaluate search strategies whose goal is to find the landscape location with maximum fitness. Applications include modeling the c…