41,882 research outputs found
A quantum causal discovery algorithm
Finding a causal model for a set of classical variables is now a
well-established task---but what about the quantum equivalent? Even the notion
of a quantum causal model is controversial. Here, we present a causal discovery
algorithm for quantum systems. The input to the algorithm is a process matrix
describing correlations between quantum events. Its output consists of
different levels of information about the underlying causal model. Our
algorithm determines whether the process is causally ordered by grouping the
events into causally-ordered non-signaling sets. It detects if all relevant
common causes are included in the process, which we label Markovian, or
alternatively if some causal relations are mediated through some external
memory. For a Markovian process, it outputs a causal model, namely the causal
relations and the corresponding mechanisms, represented as quantum states and
channels. Our algorithm provides a first step towards more general methods for
quantum causal discovery.Comment: 11 pages, 10 figures, revised to match published versio
Sparse Modeling for Image and Vision Processing
In recent years, a large amount of multi-disciplinary research has been
conducted on sparse models and their applications. In statistics and machine
learning, the sparsity principle is used to perform model selection---that is,
automatically selecting a simple model among a large collection of them. In
signal processing, sparse coding consists of representing data with linear
combinations of a few dictionary elements. Subsequently, the corresponding
tools have been widely adopted by several scientific communities such as
neuroscience, bioinformatics, or computer vision. The goal of this monograph is
to offer a self-contained view of sparse modeling for visual recognition and
image processing. More specifically, we focus on applications where the
dictionary is learned and adapted to data, yielding a compact representation
that has been successful in various contexts.Comment: 205 pages, to appear in Foundations and Trends in Computer Graphics
and Visio
Data-driven PDE discovery with evolutionary approach
The data-driven models allow one to define the model structure in cases when
a priori information is not sufficient to build other types of models. The
possible way to obtain physical interpretation is the data-driven differential
equation discovery techniques. The existing methods of PDE (partial derivative
equations) discovery are bound with the sparse regression. However, sparse
regression is restricting the resulting model form, since the terms for PDE are
defined before regression. The evolutionary approach described in the article
has a symbolic regression as the background instead and thus has fewer
restrictions on the PDE form. The evolutionary method of PDE discovery (EPDE)
is described and tested on several canonical PDEs. The question of robustness
is examined on a noised data example
Recommended from our members
The Swiss army knife of time series data mining: ten useful things you can do with the matrix profile and ten lines of code
- …