English
Related papers

Related papers: Binary Hypothesis Testing Game with Training Data

200 papers

Game theory serves as a powerful tool for distributed optimization in multi-agent systems in different applications. In this paper we consider multi-agent systems that can be modeled by means of potential games whose potential function…

Optimization and Control · Mathematics 2018-04-13 Tatiana Tatarenko

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

Logic in Computer Science · Computer Science 2016-11-29 Romain Brenguier , Guillermo A. Pérez , Jean-François Raskin , Ocan Sankur

We investigate the discrimination of two candidates of an unknown parameter in quantum systems with continuous weak measurement, inspired by the application of hypothesis testing in distinguish-ing two Hamiltonians [Kiilerich and M{\o}lmer,…

Quantum Physics · Physics 2019-07-24 Beili Gong , Wei Cui

Deploying machine learning models in production may allow adversaries to infer sensitive information about training data. There is a vast literature analyzing different types of inference risks, ranging from membership inference to…

Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight.…

Logic in Computer Science · Computer Science 2014-10-22 Yaron Velner

In the context of machine learning, disparate impact refers to a form of systematic discrimination whereby the output distribution of a model depends on the value of a sensitive attribute (e.g., race or gender). In this paper, we propose an…

Information Theory · Computer Science 2018-05-14 Hao Wang , Berk Ustun , Flavio P. Calmon

We study a generalisation of B\"uchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only Player I can elapse time. We show that for fixed number…

Formal Languages and Automata Theory · Computer Science 2020-04-28 Lorenzo Clemente , Sławomir Lasota , Radosław Piórkowski

Algorithms are now routinely used to make consequential decisions that affect human lives. Examples include college admissions, medical interventions or law enforcement. While algorithms empower us to harness all information hidden in vast…

Machine Learning · Computer Science 2020-12-10 Bahar Taskesen , Jose Blanchet , Daniel Kuhn , Viet Anh Nguyen

In this paper we put forward the viewpoint that the notion of stress testing financial institutions and engineered systems can also be made viable appropos the stress testing an individual's strength of conviction in a probability…

Artificial Intelligence · Computer Science 2020-03-31 Nozer Singpurwalla

In this work, we consider a binary classification problem and cast it into a binary hypothesis testing framework, where the observations can be perturbed by an adversary. To improve the adversarial robustness of a classifier, we include an…

Machine Learning · Computer Science 2021-10-01 Abed AlRahman Al Makdah , Vaibhav Katewa , Fabio Pasqualetti

We study the setting in which the bits of an unknown infinite binary sequence x are revealed sequentially to an observer. We show that very limited assumptions about x allow one to make successful predictions about unseen bits of x. First,…

Data Structures and Algorithms · Computer Science 2011-01-25 Andrew Drucker

Poker is ideal for testing automated reasoning under uncertainty. It introduces uncertainty both by physical randomization and by incomplete information about opponents hands.Another source OF uncertainty IS the limited information…

Artificial Intelligence · Computer Science 2013-01-30 Kevin B. Korb , Ann Nicholson , Nathalie Jitnah

Consider the problem of binary hypothesis testing. Given $Z$ coming from either $\mathbb P^{\otimes m}$ or $\mathbb Q^{\otimes m}$, to decide between the two with small probability of error it is sufficient, and in many cases necessary, to…

Statistics Theory · Mathematics 2024-03-11 Patrik Róbert Gerber , Yury Polyanskiy

Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and the second scenario is the online learning, completely…

Machine Learning · Statistics 2011-04-28 Alexander Rakhlin , Karthik Sridharan , Ambuj Tewari

We study the Chernoff-Stein exponent of the following binary hypothesis testing problem: Associated with each hypothesis is a set of channels. A transmitter, without knowledge of the hypothesis, chooses the vector of inputs to the channel.…

Information Theory · Computer Science 2025-06-19 Eeshan Modak , Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temporal constraints. A distinguishing feature of timeline-based…

Artificial Intelligence · Computer Science 2019-05-28 Nicola Gigante , Angelo Montanari , Marta Cialdea Mayer , Andrea Orlandini , Mark Reynolds

This thesis presents some geometric insights into three different types of two player prediction games -- namely general learning task, prediction with expert advice, and online convex optimization. These games differ in the nature of the…

Machine Learning · Computer Science 2018-05-23 Parameswaran Kamalaruban

In this article, we consider the problem of simultaneous testing of hypotheses when the individual test statistics are not necessarily independent. Specifically, we consider the problem of simultaneous testing of point null hypotheses…

Statistics Theory · Mathematics 2018-07-17 Prasenjit Ghosh , Arijit Chakrabarti

The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world,…

Computer Science and Game Theory · Computer Science 2020-09-07 Robert Prentner

In many common interactive scenarios, participants lack information about other participants, and specifically about the preferences of other participants. In this work, we model an extreme case of incomplete information, which we term…

Computer Science and Game Theory · Computer Science 2016-11-04 Ilan Nehama