English
Related papers

Related papers: Patterned non-determinism in communication complex…

200 papers

Complex continuous or mixed joint distributions (e.g., P(Y | z_1, z_2, ..., z_N)) generally lack closed-form solutions, often necessitating approximations such as MCMC. This paper proposes Indeterminate Probability Theory (IPT), which makes…

Machine Learning · Computer Science 2025-06-24 Tao Yang , Chuang Liu , Xiaofeng Ma , Weijia Lu , Ning Wu , Bingyang Li , Zhifei Yang , Peng Liu , Lin Sun , Xiaodong Zhang , Can Zhang

The prevalence of employing attention mechanisms has brought along concerns on the interpretability of attention distributions. Although it provides insights about how a model is operating, utilizing attention as the explanation of model…

Computer Vision and Pattern Recognition · Computer Science 2022-09-16 Tristan Gomez , Suiyi Ling , Thomas Fréour , Harold Mouchère

Binary multirelations can model alternating nondeterminism, for instance, in games or nondeterministically evolving systems interacting with an environment. Such systems can show partial or total functional behaviour at both levels of…

Logic in Computer Science · Computer Science 2023-06-16 Hitoshi Furusawa , Walter Guttmann , Georg Struth

While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact computational complexity of these problems has not been established…

Artificial Intelligence · Computer Science 2012-06-18 Johan Kwisthout , Linda C. van der Gaag

Pattern learning in an important problem in Natural Language Processing (NLP). Some exhaustive pattern learning (EPL) methods (Bod, 1992) were proved to be flawed (Johnson, 2002), while similar algorithms (Och and Ney, 2004) showed great…

Artificial Intelligence · Computer Science 2011-04-21 Libin Shen

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…

Quantum Physics · Physics 2019-08-17 Peng Xue , Yun-Feng Huang , Yong-Sheng Zhang , Chuan-Feng Li , Guang-Can Guo

We study a subclass of POMDPs, called Deterministic POMDPs, that is characterized by deterministic actions and observations. These models do not provide the same generality of POMDPs yet they capture a number of interesting and challenging…

Artificial Intelligence · Computer Science 2012-05-14 Blai Bonet

We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 bit communication, can be exponentially improved by N-1 (unentangled) qubit communication. Taking into account, for a fair comparison, all…

Identifying how much a model ${\widehat{p}}_{\theta}(Y|X)$ knows about the stochastic real-world process $p(Y|X)$ it was trained on is important to ensure it avoids producing incorrect or "hallucinated" answers or taking unsafe actions. But…

Machine Learning · Computer Science 2024-05-29 Daniel D. Johnson , Daniel Tarlow , David Duvenaud , Chris J. Maddison

In physics we often use very simple models to describe systems with many degrees of freedom, but it is not clear why or how this success can be transferred to the more complex biological context. We consider models for the joint…

Neurons and Cognition · Quantitative Biology 2024-12-06 Luisa Ramirez , William Bialek , Stephanie E. Palmer , David J. Schwab

We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…

Computational Complexity · Computer Science 2025-04-29 Markus Bläser , Julian Dörfler , Maciej Liśkiewicz , Benito van der Zander

We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions $p$ and $q$ over domains $X$ and $Y$, respectively. Their goal is to estimate \[ \mathbb{E}_{x \sim p,\, y \sim…

Computational Complexity · Computer Science 2025-12-02 Parikshit Gopalan , Raghu Meka , Prasad Raghavendra , Mihir Singhal , Avi Wigderson

Dynamics of arbitrary communication system is analysed as unreduced interaction process. The applied generalised, universally nonperturbative method of effective potential reveals the phenomenon of dynamic multivaluedness of competing…

General Physics · Physics 2007-05-23 Andrei P. Kirilyuk

In this work we analyze the problem of, given the probability distribution of a population, questioning an unknown individual that is representative of the distribution so that our uncertainty about certain characteristics is significantly…

Computational Complexity · Computer Science 2026-01-22 David Pantoja , Ismael Rodriguez , Fernando Rubio , Clara Segura

Explanations on relational data are hard to verify since the explanation structures are more complex (e.g. graphs). To verify interpretable explanations (e.g. explanations of predictions made in images, text, etc.), typically human subjects…

Artificial Intelligence · Computer Science 2024-01-08 Abisha Thapa Magar , Anup Shakya , Somdeb Sarkhel , Deepak Venugopal

The non-trivial structure of such complex systems makes the analysis of their collective behavior a challenge. The problem is even more difficult when the information is distributed across networks (e.g., communication networks in different…

Social and Information Networks · Computer Science 2018-02-08 Carlo Spatocco , Giovanni Stilo , Carlotta Domeniconi , Alessandro D'Andrea

We consider multi-party protocols for classification that are motivated by applications such as e-discovery in court proceedings. We identify a protocol that guarantees that the requesting party receives all responsive documents and the…

Cryptography and Security · Computer Science 2022-09-07 Jinshuo Dong , Jason Hartline , Aravindan Vijayaraghavan

As data-driven intelligent systems advance, the need for reliable and transparent decision-making mechanisms has become increasingly important. Therefore, it is essential to integrate uncertainty quantification and model explainability…

Machine Learning · Computer Science 2023-04-13 Nijat Mehdiyev , Maxim Majlatow , Peter Fettke

Recent progress in theories of quantum information has determined nonclassical correlation defined differently from widely-used entanglement as an important property to evaluate computation and communication with mixed quantum states. We…

Quantum Physics · Physics 2010-08-13 Robabeh Rahimi , Akira SaiToh

Non-binding communication is common in daily life and crucial for fostering cooperation, even though it has no direct payoff consequences. However, despite robust empirical evidence, its evolutionary basis remains poorly understood. Here,…

Physics and Society · Physics 2025-07-15 Zhao Song , Chen Shen , The Anh Han