2,243 research outputs found
Submodularity of Energy Related Controllability Metrics
The quantification of controllability and observability has recently received
new interest in the context of large, complex networks of dynamical systems. A
fundamental but computationally difficult problem is the placement or selection
of actuators and sensors that optimize real-valued controllability and
observability metrics of the network. We show that several classes of energy
related metrics associated with the controllability Gramian in linear dynamical
systems have a strong structural property, called submodularity. This property
allows for an approximation guarantee by using a simple greedy heuristic for
their maximization. The results are illustrated for randomly generated systems
and for placement of power electronic actuators in a model of the European
power grid.Comment: 7 pages, 2 figures; submitted to the 2014 IEEE Conference on Decision
and Contro
Learning and Testing Variable Partitions
Let be a multivariate function from a product set to an
Abelian group . A -partition of with cost is a partition of
the set of variables into non-empty subsets such that is -close to
for some with
respect to a given error metric. We study algorithms for agnostically learning
partitions and testing -partitionability over various groups and error
metrics given query access to . In particular we show that
Given a function that has a -partition of cost , a partition
of cost can be learned in time
for any .
In contrast, for and learning a partition of cost is NP-hard.
When is real-valued and the error metric is the 2-norm, a
2-partition of cost can be learned in time
.
When is -valued and the error metric is Hamming
weight, -partitionability is testable with one-sided error and
non-adaptive queries. We also show that even
two-sided testers require queries when .
This work was motivated by reinforcement learning control tasks in which the
set of control variables can be partitioned. The partitioning reduces the task
into multiple lower-dimensional ones that are relatively easier to learn. Our
second algorithm empirically increases the scores attained over previous
heuristic partitioning methods applied in this context.Comment: Innovations in Theoretical Computer Science (ITCS) 202
- …