Reinforcement learning of pomdps using spectral methods

K Azizzadenesheli, A Lazaric… - … on Learning Theory, 2016 - proceedings.mlr.press
We propose a new reinforcement learning algorithm for partially observable Markov
decision processes (POMDP) based on spectral decomposition methods. While spectral …

State aggregation learning from markov transition data

Y Duan, T Ke, M Wang - Advances in Neural Information …, 2019 - proceedings.neurips.cc
State aggregation is a popular model reduction method rooted in optimal control. It reduces
the complexity of engineering systems by map** the system's states into a small number …

Contrastive learning using spectral methods

JY Zou, DJ Hsu, DC Parkes… - Advances in Neural …, 2013 - proceedings.neurips.cc
In many natural settings, the analysis goal is not to characterize a single data set in isolation,
but rather to understand the difference between one set of observations and another. For …

Statistical and computational guarantees for the Baum-Welch algorithm

F Yang, S Balakrishnan, MJ Wainwright - Journal of Machine Learning …, 2017 - jmlr.org
The Hidden Markov Model (HMM) is one of the mainstays of statistical modeling of discrete
time series, with applications including speech recognition, computational biology, computer …

Implementation and learning of quantum hidden markov models

V Markov, V Rastunkov, A Deshmukh, D Fry… - arxiv preprint arxiv …, 2022 - arxiv.org
In this article we use the theory of quantum channels and open quantum systems to provide
an efficient unitary characterization of a class of stochastic generators known as quantum …

Provable hierarchical imitation learning via EM

Z Zhang, I Paschalidis - International Conference on Artificial …, 2021 - proceedings.mlr.press
Due to recent empirical successes, the options framework for hierarchical reinforcement
learning is gaining increasing popularity. Rather than learning from rewards, we consider …

Uniform Chernoff and Dvoretzky-Kiefer-Wolfowitz-type inequalities for Markov chains and related processes

A Kontorovich, R Weiss - Journal of Applied Probability, 2014 - cambridge.org
We observe that the technique of Markov contraction can be used to establish measure
concentration for a broad class of noncontracting chains. In particular, geometric ergodicity …

SDP relaxation with randomized rounding for energy disaggregation

K Shaloudegi, A György… - Advances in Neural …, 2016 - proceedings.neurips.cc
We develop a scalable, computationally efficient method for the task of energy
disaggregation for home appliance monitoring. In this problem the goal is to estimate the …

Low-rank spectral learning

A Kulesza, NR Rao, S Singh - Artificial Intelligence and …, 2014 - proceedings.mlr.press
Spectral learning methods have recently been proposed as alternatives to slow, non-convex
optimization algorithms like EM for a variety of probabilistic models in which hidden …

Learning Hidden Markov Models Using Conditional Samples

G Mahajan, S Kakade… - The Thirty Sixth …, 2023 - proceedings.mlr.press
This paper is concerned with the computational and statistical complexity of learning the
Hidden Markov model (HMM). Although HMMs are some of the most widely used tools in …