arXiv subjects

Hilbert J. Kappen

Publications and source records attributed to Hilbert J. Kappen.

At least 19 recordsLinked to original sources

arXiv2026

Hybrid Lindblad dynamics and Bayesian inference from stochastic processes

We develop a Bayesian formulation of diffusive quantum-classical dynamics by treating the wave function and classical variables as components of an ordinary stochastic process. The joint probability density P(psi,x,t) obeys a classical Fokker-Planck equation, while the quantum state appears as its second moment. Requiring autonomous second-moment evolution and trace preservation, together with a full-column-rank quantum-classical noise correlation matrix, forces the ensemble dynamics into hybrid Lindblad form. The same result also determines the general class of diffusive stochastic unravelings compatible with this hybrid evolution. Notably, this construction makes positivity immediate and does not take complete positivity or an underlying unitary quantum dilation as assumptions, but instead relies on the presence of a sufficiently coupled classical sector. The same stochastic representation turns quantum-classical state estimation into a classical hidden-state inference problem. Filtering and smoothing are Bayesian conditioning on the observed classical trajectory. We recover the stochastic master equation from the Kushner-Stratonovich equation with correlated noise and show how the quantum effect operator is related to the Bayesian backward message through the adjoint dynamics of the linear unraveling. The Bayesian posterior also defines a smoothed density matrix and, more generally, a posterior distribution over latent quantum-classical trajectories. These quantities can be approximated with standard particle filtering and smoothing methods. Numerical examples show that smoothing improves reconstruction of a hidden quantum-classical trajectory and that the full trajectory posterior can retain structure, such as multimodality, that is absent from its density-matrix second moment.

quant-ph↗

arXiv2025

Fröhlich versus Bose-Einstein Condensation in Pumped Bosonic Systems

Magnon-condensation, which emerges in pumped bosonic systems at room temperature, continues to garner great interest for its long-lived coherence. While traditionally formulated in terms of Bose-Einstein condensation, which typically occurs at ultra-low temperatures, it could potentially also be explained by Fröhlich-condensation, a hypothesis of Bose-Einstein-like condensation in living systems at ambient temperatures. This prompts general questions relating to fundamental differences between coherence phenomena in open and isolated quantum systems. To that end, we introduce a simple model of bosonic condensation in an open quantum system (OQS) formulation, wherein bosons dissipatively interact with an oscillator (phonon) bath. Our derived equations of motion for expected boson occupations turns out to be similar in form to the rate equations governing Fröhlich-condensation. Provided that specific system parameters result in correlations that amplify or diminish the condensation effects, we thereby posit that our treatment offers a better description of high-temperature condensation compared to traditional formulations obtained using equilibrium thermodynamics. By comparing our OQS derivation with the original uncorrelated and previous semi-classical rate equations, we furthermore highlight how both classical anti-correlations and quantum correlations alter the bosonic occupation distribution.

cond-mat.quant-gas↗

arXiv2024

Training Quantum Boltzmann Machines with the $β$-Variational Quantum Eigensolver

The quantum Boltzmann machine (QBM) is a generative machine learning model for both classical data and quantum states. Training the QBM consists of minimizing the relative entropy from the model to the target state. This requires QBM expectation values which are computationally intractable for large models in general. It is therefore important to develop heuristic training methods that work well in practice. In this work, we study a heuristic method characterized by a nested loop: the inner loop trains the $β$-variational quantum eigensolver ($β$-VQE) by Liu et al (2021 Mach. Learn.: Sci. Technol.2 025011) to approximate the QBM expectation values; the outer loop trains the QBM to minimize the relative entropy to the target. We show that low-rank representations obtained by $β$-VQE provide an efficient way to learn low-rank target states, such as classical data and low-temperature quantum tomography. We test the method on both classical and quantum target data with numerical simulations of up to 10 qubits. For the cases considered here, the obtained QBMs can model the target to high fidelity. We implement a trained model on a physical quantum device. The approach offers a valuable route towards variationally training QBMs on near-term quantum devices.

quant-ph↗

arXiv2023

Why adiabatic quantum annealing is unlikely to yield speed-up

We study quantum annealing for combinatorial optimization with Hamiltonian $H = z H_f + H_0$ where $H_f$ is diagonal, $H_0=-|ϕ\rangle \langle ϕ|$ is the equal superposition state projector and $z$ the annealing parameter. We analytically compute the minimal spectral gap as $\mathcal{O}(1/\sqrt{N})$ with $N$ the total number of states and its location $z_*$. We show that quantum speed-up requires an annealing schedule which demands a precise knowledge of $z_*$, which can be computed only if the density of states of the optimization problem is known. However, in general the density of states is intractable to compute, making quadratic speed-up unfeasible for any practical combinatoric optimization problems. We conjecture that it is likely that this negative result also applies for any other instance independent transverse Hamiltonians such as $H_0 = -\sum_{i=1}^n σ_i^x$.

quant-ph↗

arXiv2023

Stochastic syncing in sinusoidally driven atomic orbital memory

Stochastically fluctuating multi-well systems as physical implementations of energy-based machine learning models promise a route towards neuromorphic hardware. Understanding the response of multi-well systems to dynamic input signals is crucial in this regard. Here, we investigate the stochastic response of binary orbital memory states derived from individual Fe and Co atoms on a black phosphorus surface to sinusoidal input voltages. Using scanning tunneling microscopy, we quantify the state residence times for DC and AC voltage drive with various input frequencies. We find that Fe and Co atoms both exhibit features of synchronization to the AC input, but only Fe atoms demonstrate a significant frequency-dependent change in the time-averaged state occupations. By modeling the underlying stochastic process, we show that the frequency response of the system is directly related to the DC voltage dependence of the state asymmetry. This relation provides a tunable way to induce population changes in stochastic systems and lays the foundation for understanding the response of multi-well systems to dynamical input signals.

cond-mat.mes-hall↗

arXiv2021

An atomic Boltzmann machine capable of on-chip learning

The Boltzmann Machine (BM) is a neural network composed of stochastically firing neurons that can learn complex probability distributions by adapting the synaptic interactions between the neurons. BMs represent a very generic class of stochastic neural networks that can be used for data clustering, generative modelling and deep learning. A key drawback of software-based stochastic neural networks is the required Monte Carlo sampling, which scales intractably with the number of neurons. Here, we realize a physical implementation of a BM directly in the stochastic spin dynamics of a gated ensemble of coupled cobalt atoms on the surface of semiconducting black phosphorus. Implementing the concept of orbital memory utilizing scanning tunnelling microscopy, we demonstrate the bottom-up construction of atomic ensembles whose stochastic current noise is defined by a reconfigurable multi-well energy landscape. Exploiting the anisotropic behaviour of black phosphorus, we build ensembles of atoms with two well-separated intrinsic time scales that represent neurons and synapses. By characterizing the conditional steady-state distribution of the neurons for given synaptic configurations, we illustrate that an ensemble can represent many distinct probability distributions. By probing the intrinsic synaptic dynamics, we reveal an autonomous reorganization of the synapses in response to external electrical stimuli. This self-adaptive architecture paves the way for on-chip learning directly in atomic-scale machine learning hardware.

cond-mat.mes-hall↗

arXiv2020

Adaptive Smoothing Path Integral Control

In Path Integral control problems a representation of an optimally controlled dynamical system can be formally computed and serve as a guidepost to learn a parametrized policy. The Path Integral Cross-Entropy (PICE) method tries to exploit this, but is hampered by poor sample efficiency. We propose a model-free algorithm called ASPIC (Adaptive Smoothing of Path Integral Control) that applies an inf-convolution to the cost function to speedup convergence of policy optimization. We identify PICE as the infinite smoothing limit of such technique and show that the sample efficiency problems that PICE suffers disappear for finite levels of smoothing. For zero smoothing this method becomes a greedy optimization of the cost, which is the standard approach in current reinforcement learning. We show analytically and empirically that intermediate levels of smoothing are optimal, which renders the new method superior to both PICE and direct cost-optimization.

eess.SY↗

arXiv2020

Real-Time Stochastic Optimal Control for Multi-agent Quadrotor Systems

This paper presents a novel method for controlling teams of unmanned aerial vehicles using Stochastic Optimal Control (SOC) theory. The approach consists of a centralized high-level planner that computes optimal state trajectories as velocity sequences, and a platform-specific low-level controller which ensures that these velocity sequences are met. The planning task is expressed as a centralized path-integral control problem, for which optimal control computation corresponds to a probabilistic inference problem that can be solved by efficient sampling methods. Through simulation we show that our SOC approach (a) has significant benefits compared to deterministic control and other SOC methods in multimodal problems with noise-dependent optimal solutions, (b) is capable of controlling a large number of platforms in real-time, and (c) yields collective emergent behaviour in the form of flight formations. Finally, we show that our approach works for real platforms, by controlling a team of three quadrotors in outdoor conditions.

eess.SY↗

arXiv2019

Atom-by-atom construction of attractors in a tunable finite size spin array

We demonstrate that a two-dimensional finite and periodic array of Ising spins coupled via RKKY-like exchange can exhibit tunable magnetic states ranging from three distinct magnetic regimes: (1) a conventional ferromagnetic regime, (2) a glass-like regime, and (3) a new multi-well regime. These magnetic regimes can be tuned by one gate-like parameter, namely the ratio between the lattice constant and the oscillating interaction wavelength. We characterize the various magnetic regimes, quantifying the distribution of low energy states, aging relaxation dynamics, and scaling behavior. The glassy and multi-well behavior results from the competing character of the oscillating long-range exchange interactions. The multi-well structure features multiple attractors, each with a sizable basin of attraction. This may open the possible application of such atomic arrays as associative memories.

cond-mat.stat-mech↗

arXiv2018

Nonlinear Deconvolution by Sampling Biophysically Plausible Hemodynamic Models

Non-invasive methods to measure brain activity are important to understand cognitive processes in the human brain. A prominent example is functional magnetic resonance imaging (fMRI), which is a noisy measurement of a delayed signal that depends non-linearly on the neuronal activity through the neurovascular coupling. These characteristics make the inference of neuronal activity from fMRI a difficult but important step in fMRI studies that require information at the neuronal level. In this article, we address this inference problem using a Bayesian approach where we model the latent neural activity as a stochastic process and assume that the observed BOLD signal results from a realistic physiological (Balloon) model. We apply a recently developed smoothing method called APIS to efficiently sample the posterior given single event fMRI time series. To infer neuronal signals with high likelihood for multiple time series efficiently, a modification of the original algorithm is introduced. We demonstrate that our adaptive procedure is able to compensate the lacking of inputs in the model to infer the neuronal activity and that it outperforms dramatically the standard bootstrap particle filter-smoother in this setting. This makes the proposed procedure especially attractive to deconvolve resting state fMRI data. To validate the method, we evaluate the quality of the signals inferred using the timing information contained in them. APIS obtains reliable event timing estimates based on fMRI data gathered during a reaction time experiment with short stimuli. Hence, we show for the first time that one can obtain accurate absolute timing of neuronal activity by reconstructing the latent neural signal.

q-bio.NC↗

arXiv2018

On the role of synaptic stochasticity in training low-precision neural networks

Stochasticity and limited precision of synaptic weights in neural network models are key aspects of both biological and hardware modeling of learning processes. Here we show that a neural network model with stochastic binary weights naturally gives prominence to exponentially rare dense regions of solutions with a number of desirable properties such as robustness and good generalization performance, while typical solutions are isolated and hard to find. Binary solutions of the standard perceptron problem are obtained from a simple gradient descent procedure on a set of real values parametrizing a probability distribution over the binary synapses. Both analytical and numerical results are presented. An algorithmic extension aimed at training discrete deep neural networks is also investigated.

cond-mat.dis-nn↗

arXiv2016

Action selection in growing state spaces: Control of Network Structure Growth

The dynamical processes taking place on a network depend on its topology. Influencing the growth process of a network therefore has important implications on such dynamical processes. We formulate the problem of influencing the growth of a network as a stochastic optimal control problem in which a structural cost function penalizes undesired topologies. We approximate this control problem with a restricted class of control problems that can be solved using probabilistic inference methods. To deal with the increasing problem dimensionality, we introduce an adaptive importance sampling method for approximating the optimal control. We illustrate this methodology in the context of formation of information cascades, considering the task of influencing the structure of a growing conversation thread, as in Internet forums. Using a realistic model of growing trees, we show that our approach can yield conversation threads with better structural properties than the ones observed without control.

cs.SI↗

arXiv2016

Learning universal computations with spikes

Providing the neurobiological basis of information processing in higher animals, spiking neural networks must be able to learn a variety of complicated computations, including the generation of appropriate, possibly delayed reactions to inputs and the self-sustained generation of complex activity patterns, e.g.~for locomotion. Many such computations require previous building of intrinsic world models. Here we show how spiking neural networks may solve these different tasks. Firstly, we derive constraints under which classes of spiking neural networks lend themselves to substrates of powerful general purpose computing. The networks contain dendritic or synaptic nonlinearities and have a constrained connectivity. We then combine such networks with learning rules for outputs or recurrent connections. We show that this allows to learn even difficult benchmark tasks such as the self-sustained generation of desired low-dimensional chaotic dynamics or memory-dependent computations. Furthermore, we show how spiking networks can build models of external world systems and use the acquired knowledge to control them.

q-bio.NC↗

arXiv2016

Linear PDEs and eigenvalue problems corresponding to ergodic stochastic optimization problems on compact manifolds

We consider long term average or `ergodic' optimal control poblems with a special structure: Control is exerted in all directions and the control costs are proportional to the square of the norm of the control field with respect to the metric induced by the noise. The long term stochastic dynamics on the manifold will be completely characterized by the long term density $ρ$ and the long term current density $J$. As such, control problems may be reformulated as variational problems over $ρ$ and $J$. We discuss several optimization problems: the problem in which both $ρ$ and $J$ are varied freely, the problem in which $ρ$ is fixed and the one in which $J$ is fixed. These problems lead to different kinds of operator problems: linear PDEs in the first two cases and a nonlinear PDE in the latter case. These results are obtained through through variational principle using infinite dimensional Lagrange multipliers. In the case where the initial dynamics are reversible we obtain the result that the optimally controlled diffusion is also symmetrizable. The particular case of constraining the dynamics to be reversible of the optimally controlled process leads to a linear eigenvalue problem for the square root of the density process.

math.OC↗

arXiv2014

Latent Kullback Leibler Control for Continuous-State Systems using Probabilistic Graphical Models

Kullback Leibler (KL) control problems allow for efficient computation of optimal control by solving a principal eigenvector problem. However, direct applicability of such framework to continuous state-action systems is limited. In this paper, we propose to embed a KL control problem in a probabilistic graphical model where observed variables correspond to the continuous (possibly high-dimensional) state of the system and latent variables correspond to a discrete (low-dimensional) representation of the state amenable for KL control computation. We present two examples of this approach. The first one uses standard hidden Markov models (HMMs) and computes exact optimal control, but is only applicable to low-dimensional systems. The second one uses factorial HMMs, it is scalable to higher dimensional problems, but control computation is approximate. We illustrate both examples in several robot motor control tasks.

eess.SY↗

arXiv2014

Explicit solution of relative entropy weighted control

We consider the minimization over probability measures of the expected value of a random variable, regularized by relative entropy with respect to a given probability distribution. In the general setting we provide a complete characterization of the situations in which a finite optimal value exists and the situations in which a minimizing probability distribution exists. Specializing to the case where the underlying probability distribution is Wiener measure, we characterize finite relative entropy changes of measure in terms of square integrability of the corresponding change of drift. For the optimal change of measure for the relative entropy weighted optimization, an expression involving the Malliavin derivative of the cost random variable is derived. The theory is illustrated by its application to several examples, including the case where the cost variable is the maximum of a standard Brownian motion over a finite time horizon. For this example we obtain an exact optimal drift, as well as an approximation of the optimal drift through a Monte-Carlo algorithm.

math.PR↗

arXiv2013

Stochastic Optimal Control as Non-equilibrium Statistical Mechanics: Calculus of Variations over Density and Current

In Stochastic Optimal Control (SOC) one minimizes the average cost-to-go, that consists of the cost-of-control (amount of efforts), cost-of-space (where one wants the system to be) and the target cost (where one wants the system to arrive), for a system participating in forced and controlled Langevin dynamics. We extend the SOC problem by introducing an additional cost-of-dynamics, characterized by a vector potential. We propose derivation of the generalized gauge-invariant Hamilton-Jacobi-Bellman equation as a variation over density and current, suggest hydrodynamic interpretation and discuss examples, e.g., ergodic control of a particle-within-a-circle, illustrating non-equilibrium space-time complexity.

cond-mat.stat-mech↗

arXiv2012

The Variational Garrote

In this paper, we present a new variational method for sparse regression using $L_0$ regularization. The variational parameters appear in the approximate model in a way that is similar to Breiman's Garrote model. We refer to this method as the variational Garrote (VG). We show that the combination of the variational approximation and $L_0$ regularization has the effect of making the problem effectively of maximal rank even when the number of samples is small compared to the number of variables. The VG is compared numerically with the Lasso method, ridge regression and the recently introduced paired mean field method (PMF) (M. Titsias & M. Lázaro-Gredilla., NIPS 2012). Numerical results show that the VG and PMF yield more accurate predictions and more accurately reconstruct the true model than the other methods. It is shown that the VG finds correct solutions when the Lasso solution is inconsistent due to large input correlations. Globally, VG is significantly faster than PMF and tends to perform better as the problems become denser and in problems with strongly correlated inputs. The naive implementation of the VG scales cubic with the number of features. By introducing Lagrange multipliers we obtain a dual formulation of the problem that scales cubic in the number of samples, but close to linear in the number of features.

stat.ME↗