19,362 research outputs found
Message-Passing Inference on a Factor Graph for Collaborative Filtering
This paper introduces a novel message-passing (MP) framework for the
collaborative filtering (CF) problem associated with recommender systems. We
model the movie-rating prediction problem popularized by the Netflix Prize,
using a probabilistic factor graph model and study the model by deriving
generalization error bounds in terms of the training error. Based on the model,
we develop a new MP algorithm, termed IMP, for learning the model. To show
superiority of the IMP algorithm, we compare it with the closely related
expectation-maximization (EM) based algorithm and a number of other matrix
completion algorithms. Our simulation results on Netflix data show that, while
the methods perform similarly with large amounts of data, the IMP algorithm is
superior for small amounts of data. This improves the cold-start problem of the
CF systems in practice. Another advantage of the IMP algorithm is that it can
be analyzed using the technique of density evolution (DE) that was originally
developed for MP decoding of error-correcting codes
Singularly perturbed forward-backward stochastic differential equations: application to the optimal control of bilinear systems
We study linear-quadratic stochastic optimal control problems with bilinear
state dependence for which the underlying stochastic differential equation
(SDE) consists of slow and fast degrees of freedom. We show that, in the same
way in which the underlying dynamics can be well approximated by a reduced
order effective dynamics in the time scale limit (using classical
homogenziation results), the associated optimal expected cost converges in the
time scale limit to an effective optimal cost. This entails that we can well
approximate the stochastic optimal control for the whole system by the reduced
order stochastic optimal control, which is clearly easier to solve because of
lower dimensionality. The approach uses an equivalent formulation of the
Hamilton-Jacobi-Bellman (HJB) equation, in terms of forward-backward SDEs
(FBSDEs). We exploit the efficient solvability of FBSDEs via a least squares
Monte Carlo algorithm and show its applicability by a suitable numerical
example
Randomized Dynamic Mode Decomposition
This paper presents a randomized algorithm for computing the near-optimal
low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging
techniques to compute low-rank matrix approximations at a fraction of the cost
of deterministic algorithms, easing the computational challenges arising in the
area of `big data'. The idea is to derive a small matrix from the
high-dimensional data, which is then used to efficiently compute the dynamic
modes and eigenvalues. The algorithm is presented in a modular probabilistic
framework, and the approximation quality can be controlled via oversampling and
power iterations. The effectiveness of the resulting randomized DMD algorithm
is demonstrated on several benchmark examples of increasing complexity,
providing an accurate and efficient approach to extract spatiotemporal coherent
structures from big data in a framework that scales with the intrinsic rank of
the data, rather than the ambient measurement dimension. For this work we
assume that the dynamics of the problem under consideration is evolving on a
low-dimensional subspace that is well characterized by a fast decaying singular
value spectrum
A Partially Reflecting Random Walk on Spheres Algorithm for Electrical Impedance Tomography
In this work, we develop a probabilistic estimator for the voltage-to-current
map arising in electrical impedance tomography. This novel so-called partially
reflecting random walk on spheres estimator enables Monte Carlo methods to
compute the voltage-to-current map in an embarrassingly parallel manner, which
is an important issue with regard to the corresponding inverse problem. Our
method uses the well-known random walk on spheres algorithm inside subdomains
where the diffusion coefficient is constant and employs replacement techniques
motivated by finite difference discretization to deal with both mixed boundary
conditions and interface transmission conditions. We analyze the global bias
and the variance of the new estimator both theoretically and experimentally. In
a second step, the variance is considerably reduced via a novel control variate
conditional sampling technique
GPU Based Path Integral Control with Learned Dynamics
We present an algorithm which combines recent advances in model based path
integral control with machine learning approaches to learning forward dynamics
models. We take advantage of the parallel computing power of a GPU to quickly
take a massive number of samples from a learned probabilistic dynamics model,
which we use to approximate the path integral form of the optimal control. The
resulting algorithm runs in a receding-horizon fashion in realtime, and is
subject to no restrictive assumptions about costs, constraints, or dynamics. A
simple change to the path integral control formulation allows the algorithm to
take model uncertainty into account during planning, and we demonstrate its
performance on a quadrotor navigation task. In addition to this novel
adaptation of path integral control, this is the first time that a
receding-horizon implementation of iterative path integral control has been run
on a real system.Comment: 6 pages, NIPS 2014 - Autonomously Learning Robots Worksho
- …