Generalized maximum entropy estimation
We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. We further demonstrate how the presented scheme can be used for approximating the chemical master equation through the zero-information moment closure method, and for an approximate dynamic programming approach in the context of constrained Markov decision processes with uncountable state and action spaces.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Generalized Multi-kernel Maximum Correntropy Kalman Filter for Disturbance Estimation
Disturbance observers have been attracting continuing research efforts and are widely used in many applications. Among them, the Kalman filter-based disturbance observer is an attractive one since it estimates both the s…
Generalized Maximum Causal Entropy for Inverse Reinforcement Learning
We consider the problem of learning from demonstrated trajectories with inverse reinforcement learning (IRL). Motivated by a limitation of the classical maximum entropy model in capturing the structure of the network of …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Generalized Maximum Entropy for Supervised Classification
The maximum entropy principle advocates to evaluate events' probabilities using a distribution that maximizes entropy among those that satisfy certain expectations' constraints. Such principle can be generalized for arbi…
ClassificationGeneral ClassificationGeneralized Correntropy for Robust Adaptive Filtering
As a robust nonlinear similarity measure in kernel space, correntropy has received increasing attention in domains of machine learning and signal processing. In particular, the maximum correntropy criterion (MCC) has rec…
FLAC: Maximum Entropy RL via Kinetic Energy Regularized Bridge Matching
Iterative generative policies, such as diffusion models and flow matching, offer superior expressivity for continuous control but complicate Maximum Entropy Reinforcement Learning because their action log-densities are n…
Reinforcement LearningContinuous ControlDensity Estimation