English
Related papers

Related papers: Information-Theoretic Opacity-Enforcement in Marko…

200 papers

We study a general class of dynamic multi-agent decision problems with asymmetric information and non-strategic agents, which includes dynamic teams as a special case. When agents are non-strategic, an agent's strategy is known to the other…

Multiagent Systems · Computer Science 2018-12-05 Hamidreza Tavafoghi , Yi Ouyang , Demosthenis Teneketzis

We study data-driven learning of robust stochastic control for infinite-horizon systems with potentially continuous state and action spaces. In many managerial settings--supply chains, finance, manufacturing, services, and dynamic…

Machine Learning · Statistics 2025-11-18 Shengbo Wang , Jason Meng , Nian Si , Jose Blanchet , Zhengyuan Zhou

Partially observable Markov decision processes (POMDPs) form a prominent model for uncertainty in sequential decision making. We are interested in constructing algorithms with theoretical guarantees to determine whether the agent has a…

Artificial Intelligence · Computer Science 2024-12-17 Marius Belly , Nathanaël Fijalkow , Hugo Gimbert , Florian Horn , Guillermo A. Pérez , Pierre Vandenhove

For a network of discrete states with a periodically driven Markovian dynamics, we develop an inference scheme for an external observer who has access to some transitions. Based on waiting-time distributions between these transitions, the…

Statistical Mechanics · Physics 2024-09-12 Alexander M. Maier , Julius Degünther , Jann van der Meer , Udo Seifert

This paper investigates backdoor attack planning in stochastic control systems modeled as Markov Decision Processes (MDPs). A backdoor attack involves an adversary deploying a policy that performs well in the original MDP to pass testing,…

Systems and Control · Electrical Eng. & Systems 2026-04-27 Xinyi Wei , Shuo Han , Ahmed H. Hemida , Charles A. Kamhoua , Jie Fu

We study planning problems where autonomous agents operate inside environments that are subject to uncertainties and not fully observable. Partially observable Markov decision processes (POMDPs) are a natural formal model to capture such…

Artificial Intelligence · Computer Science 2018-02-28 Steven Carr , Nils Jansen , Ralf Wimmer , Jie Fu , Ufuk Topcu

We revisit the well-studied problem of estimating the Shannon entropy of a probability distribution, now given access to a probability-revealing conditional sampling oracle. In this model, the oracle takes as input the representation of a…

Cryptography and Security · Computer Science 2022-06-03 Priyanka Golia , Brendan Juba , Kuldeep S. Meel

Opacity is a property that characterizes the system's capability to keep its "secret" from being inferred by an intruder that partially observes the system's behavior. In this paper, we are concerned with enhancing the opacity using…

Cryptography and Security · Computer Science 2018-02-15 Bo Wu , Zhiyu Liu , Hai Lin

Multi-objective optimization models that encode ordered sequential constraints provide a solution to model various challenging problems including encoding preferences, modeling a curriculum, and enforcing measures of safety. A recently…

Artificial Intelligence · Computer Science 2022-09-16 Kyle Hollins Wray , Stas Tiomkin , Mykel J. Kochenderfer , Pieter Abbeel

Opacity is a confidentiality property that characterizes the non-disclosure of specified secret information of a system to an outside observer. In this paper, we consider the enforcement of opacity within the discrete-event system formalism…

Cryptography and Security · Computer Science 2018-02-19 Bo Wu , Jin Dai , Hai Lin

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents…

Machine Learning · Computer Science 2014-08-12 Aristide Tossou , Christos Dimitrakakis

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents…

Machine Learning · Statistics 2013-07-16 Aristide C. Y. Tossou , Christos Dimitrakakis

We consider a pair of correlated processes {Z_n} and {S_n} (two sided), where the former is observable and the later is hidden. The uncertainty in the estimation of Z_n upon its finite past history is H(Z_n|Z_0^{n-1}), and for estimation of…

Information Theory · Computer Science 2007-07-13 Mohammad Rezaeian

This work considers a novel information design problem and studies how the craft of payoff-relevant environmental signals solely can influence the behaviors of intelligent agents. The agents' strategic interactions are captured by an…

Multiagent Systems · Computer Science 2021-02-16 Tao Zhang , Quanyan Zhu

Explainable systems expose information about why certain observed effects are happening to the agents interacting with them. We argue that this constitutes a positive flow of information that needs to be specified, verified, and balanced…

Logic in Computer Science · Computer Science 2025-09-24 Bernd Finkbeiner , Hadar Frenkel , Julian Siber

The analyticity of the entropy and relative entropy rates of continuous-state hidden Markov models is studied here. Using the analytic continuation principle and the stability properties of the optimal filter, the analyticity of these rates…

Information Theory · Computer Science 2019-09-02 Vladislav Z. B. Tadic , Arnaud Doucet

We formulate notions of opacity for cyberphysical systems modeled as discrete-time linear time-invariant systems. A set of secret states is $k$-ISO with respect to a set of nonsecret states if, starting from these sets at time $0$, the…

Systems and Control · Computer Science 2019-07-23 Bhaskar Ramasubramanian , Rance Cleaveland , Steven I. Marcus

A new formulation of Stochastic Model Predictive Output Feedback Control is presented and analyzed as a translation of Stochastic Optimal Output Feedback Control into a receding horizon setting. This requires lifting the design into a…

Optimization and Control · Mathematics 2020-05-01 Martin A Sehr , Robert R Bitmead

We investigate stationary hidden Markov processes for which mutual information between the past and the future is infinite. It is assumed that the number of observable states is finite and the number of hidden states is countably infinite.…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

Strategic classification studies the interaction between a classification rule and the strategic agents it governs. Under the assumption that the classifier is known, rational agents respond to it by manipulating their features. However, in…

Machine Learning · Computer Science 2021-06-15 Ganesh Ghalme , Vineet Nair , Itay Eilat , Inbal Talgam-Cohen , Nir Rosenfeld
‹ Prev 1 3 4 5 6 7 10 Next ›