English
Related papers

Related papers: Auditing a collection of races simultaneously

200 papers

Bootstrap aggregating (bagging) is an effective ensemble protocol, which is believed can enhance robustness by its majority voting mechanism. Recent works further prove the sample-wise robustness certificates for certain forms of bagging…

Cryptography and Security · Computer Science 2022-09-07 Ruoxin Chen , Zenan Li , Jie Li , Chentao Wu , Junchi Yan

Despite empirical risk minimization (ERM) is widely applied in the machine learning community, its performance is limited on data with spurious correlation or subpopulation that is introduced by hidden attributes. Existing literature…

Machine Learning · Computer Science 2024-12-18 Hongyu Shen , Zhizhen Zhao

Ensemble-based approaches are very effective in various fields in raising the accuracy of its individual members, when some voting rule is applied for aggregating the individual decisions. In this paper, we investigate how to find and…

Artificial Intelligence · Computer Science 2019-04-10 Attila Tiba , Andras Hajdu , Gyorgy Terdik , Henrietta Toman

A common approach to aggregate classification estimates in an ensemble of decision trees is to either use voting or to average the probabilities for each class. The latter takes uncertainty into account, but not the reliability of the…

Machine Learning · Computer Science 2022-08-17 Florian Busch , Moritz Kulessa , Eneldo Loza Mencía , Hendrik Blockeel

In this paper, a new method of detection of election fraud is proposed. This method is based on the calculation of the ratio of two standard normal random variables; estimation of parameters of obtained sample and comparison of these…

Methodology · Statistics 2022-09-20 Ivan H. Krykun

Risk-limiting audits (RLAs), an ingredient in evidence-based elections, are increasingly common. They are a rigorous statistical means of ensuring that electoral results are correct, usually without having to perform an expensive full…

Computers and Society · Computer Science 2021-10-05 Michelle Blom , Jurlind Budurushi , Ronald L. Rivest , Philip B. Stark , Peter J. Stuckey , Vanessa Teague , Damjan Vukcevic

Probabilistic predictions can be evaluated through comparisons with observed label frequencies, that is, through the lens of calibration. Recent scholarship on algorithmic fairness has started to look at a growing variety of…

Machine Learning · Computer Science 2023-05-16 Benedikt Höltgen , Robert C Williamson

The number of votes correlates strongly with the money spent in a campaign, but the relation between the two is not straightforward. Among other factors, the output of a ballot depends on the number of candidates, voters, and available…

Physics and Society · Physics 2020-07-01 H. P. M. Melo , N. A. M. Araujo , J. S. Andrade

Strategic manipulation of elections is typically studied in the context of promoting individual candidates. In parliamentary elections, however, the focus shifts: voters may care more about the overall governing coalition than the…

Computer Science and Game Theory · Computer Science 2026-01-13 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

Risk-limiting post-election audits limit the chance of certifying an electoral outcome if the outcome is not what a full hand count would show. Building on previous work, we report on pilot risk-limiting audits in four elections during 2008…

The margin of victory of an election is a useful measure to capture the robustness of an election outcome. It also plays a crucial role in determining the sample size of various algorithms in post election audit, polling etc. In this work,…

Artificial Intelligence · Computer Science 2015-05-05 Palash Dey , Y. Narahari

For more than a century, election officials across the United States have inspected voting machines before elections using a procedure called Logic and Accuracy Testing (LAT). This procedure consists of election officials casting a test…

Cryptography and Security · Computer Science 2024-10-01 Braden L. Crimmins , J. Alex Halderman , Bradley Sturt

Given a random sample from a random variable $T$ which is bounded from above, $T\le\tau$ a.s., we define processes that are positive supermartingales if $E(T)\ge\mu$. Such processes are called test martingales. Tests of the supermartingale…

Methodology · Statistics 2018-02-20 Harrie Hendriks

Comparing the differences in outcomes (that is, in "dependent variables") between two subpopulations is often most informative when comparing outcomes only for individuals from the subpopulations who are similar according to "independent…

Methodology · Statistics 2021-12-20 Mark Tygert

Random sampling has become a critical tool in solving massive matrix problems. For linear regression, a small, manageable set of data rows can be randomly selected to approximate a tall, skinny data matrix, improving processing time…

Data Structures and Algorithms · Computer Science 2014-08-22 Michael B. Cohen , Yin Tat Lee , Cameron Musco , Christopher Musco , Richard Peng , Aaron Sidford

Identifying leading measurement units from a large collection is a common inference task in various domains of large-scale inference. Testing approaches, which measure evidence against a null hypothesis rather than effect magnitude, tend to…

Methodology · Statistics 2020-11-17 Nicholas C. Henderson , Michael A. Newton

When scholars suspect units are dependent on each other within clusters but independent of each other across clusters, they employ cluster-robust standard errors (CRSEs). Nevertheless, what to cluster over is sometimes unknown. For…

Methodology · Statistics 2025-11-12 Kentaro Fukumoto

In this paper, we study the problem of Participatory Budgeting (PB) with approval ballots, inspired by Multi-Winner Voting schemes. We present generalized preference aggregation methods for participatory budgeting, especially for finding…

Computational Engineering, Finance, and Science · Computer Science 2024-10-10 Rutvik Page , Arnav Doifode , Jitendra Tembhurne , Aishwarya Sagar Anand Ukey

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

Elections involving a very large voter population often lead to outcomes that surprise many. This is particularly important for the elections in which results affect the economy of a sizable population. A better prediction of the true…

Computer Science and Game Theory · Computer Science 2018-01-31 Palash Dey , Pravesh K. Kothari , Swaprava Nath
‹ Prev 1 3 4 5 6 7 10 Next ›