Compressed Online Learning of Conditional Mean Embedding
<|reference_start|>Compressed Online Learning of Conditional Mean Embedding: The conditional mean embedding (CME) encodes Markovian stochastic kernels through their actions on probability distributions embedded within the reproducing kernel Hilbert spaces (RKHS). The CME plays a key role in several well-known machine learning tasks such as reinforcement learning, analysis of dynamical systems, etc. We present an algorithm to learn the CME incrementally from data via an operator-valued stochastic gradient descent. As is well-known, function learning in RKHS suffers from scalability challenges from large data. We utilize a compression mechanism to counter the scalability challenge. The core contribution of this paper is a finite-sample performance guarantee on the last iterate of the online compressed operator learning algorithm with fast-mixing Markovian samples, when the target CME may not be contained in the hypothesis space. We illustrate the efficacy of our algorithm by applying it to the analysis of an example dynamical system.<|reference_end|>
@article{hou2024compressed,
    title={Compressed Online Learning of Conditional Mean Embedding},
    author={Boya Hou, Sina Sanjari, Alec Koppel, Subhonmesh Bose},
    journal={arXiv preprint arXiv:2405.07432},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.07432},
    primaryClass={stat.ML cs.LG cs.SY eess.SY}
}