Approximate Separability for Weak Interaction in Dynamic Systems

06/27/2012
by   Avi Pfeffer, et al.
0

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact propagation of marginals for prediction. This paper addresses two questions left open by the earlier paper: can we define a notion of approximate separability that occurs naturally in practice, and do separability and approximate separability lead to accurate monitoring? The answer to both questions is afirmative. The paper also analyzes the structure of approximately separable decompositions, and provides some explanation as to why these models perform well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2019

Superconvergence of gradient recovery on deviated discretized manifolds

This paper addresses open questions proposed by Wei, Chen and Huang [ SI...
research
12/03/2018

A Unified Approach to Dynamic Decision Problems with Asymmetric Information - Part II: Strategic Agents

We study a general class of dynamic games with asymmetric information wh...
research
07/30/2020

Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents

We propose a notion of algorithmic stability for scenarios where cardina...
research
12/20/2022

When Do Decompositions Help for Machine Reading?

Answering complex questions often requires multi-step reasoning in order...
research
12/21/2019

Bandit Multiclass Linear Classification for the Group Linear Separable Case

We consider the online multiclass linear classification under the bandit...
research
11/15/2022

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ_p Norms

We prove that the Minimum Distance Problem (MDP) on linear codes over an...

Please sign up or login with your details

Forgot password? Click here to reset