In this talk I provide an overview of information-theoretic bounded-rationality for planning in sequential decision problems. I show how to ground the theory on a stochastic computation model for large-scale choice spaces and then derive…
Many problems in real-world applications involve predicting several random variables which are statistically related. A structured model, like a Markov random field, is a great mathematical tool to encode those dependencies. Within the first part…
The price of anarchy (PoA), which quantifies the degradation in the quality of outcomes in a (pure) Nash equilibrium of a game, is of fundamental importance in computational game theory. For many games, a pure…
In the setting of cloud computing a user wishes to delegate its data, as well as computations over this data, to a cloud provider. Each computation may read and modify the data, and these modifications…
Interactive proofs have had a dramatic impact on Complexity Theory and Cryptography. In particular, the celebrated IP=PSPACE Theorem [LFKN92,Shamir92] allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely…
Latent or hidden variable models have applications in almost every domain, e.g., social network analysis, natural language processing, computer vision and computational biology. Training latent variable models is challenging due to non-convexity of the likelihood…
Homomorphic encryption is an encryption function which permits encrypted data to be computed without decryption. It is considered as a solution for protecting privacy information in present situations such as cloud computing and machine communication.…
