A Model Selection criterion for the Mixture Reduction problem based on the Kullback-Leibler Divergence

D'Ortenzio, Alessandro
Manes, Costanzo
Orguner, Umut
In order to be properly addressed, many practical problems require an accurate stochastic characterization of the involved uncertainties. In this regard, a common approach is the use of mixtures of parametric densities which allow, in general, to arbitrarily approximate complex distributions by a sum of simpler elements. Nonetheless, in contexts like target tracking in clutter, where mixtures of densities are commonly used to approximate the posterior distribution, the optimal Bayesian recursion leads to a combinatorial explosion in the number of mixture components. For this reason, many mixture reduction algorithms have been proposed in the literature to keep limited the number of hypotheses, but very few of them have addressed the problem of finding a suitable model order for the resulting approximation. The commonly followed approach in those algorithms is to reduce the mixture to a fixed number of components, disregarding its features which may vary over time. In general, finding an optimal number of mixture components is a very difficult task: once a meaningful optimality criterion is identified, potentially burdensome computational procedures must be devised to reach the optimum. In this work, by exploiting the optimal transport theory, an efficient and intuitive model selection criterion for the mixture reduction problem is proposed.
25th International Conference of Information Fusion (FUSION)


An Optimal Transport Perspective on Gamma Gaussian Inverse-Wishart Mixture Reduction
D'Ortenzio, Alessandro; Manes, Costanzo; Orguner, Umut (2022-01-01)
Recent advances in the Optimal Transport theory allow to rewrite several known problems in a neat way, while providing a more general perspective. When dealing with mixture densities, or in general with intensities, such a framework naturally induces composite dissimilarities, together with corresponding Greedy Reduction and Refinement algorithms. In applications like target tracking in clutter, it is common to deal with the Mixture Reduction problem, since the optimal Bayesian recursion leads to a combinat...
A Stochastic Maximum Principle for a Markov Regime-Switching Jump-Diffusion Model with Delay and an Application to Finance
Savku, Emel; Weber, Gerhard Wilhelm (2018-11-01)
We study a stochastic optimal control problem for a delayed Markov regime-switching jump-diffusion model. We establish necessary and sufficient maximum principles under full and partial information for such a system. We prove the existence-uniqueness theorem for the adjoint equations, which are represented by an anticipated backward stochastic differential equation with jumps and regimes. We illustrate our results by a problem of optimal consumption problem from a cash flow with delay and regimes.
An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study
Guden, H.; Meral, Fatma Sedef (2016-05-01)
In this study, we address the deterministic assembly line balancing problem (ALBP) in a multiple product-models environment with multiple objectives. We have been motivated by the assembly line balancing problem of a white goods product production line that is a multi-model type line with 68 stations through which four product-models are assembled, each with approximately 400 precedence relations and 300 tasks. In the plant, to cope with the increasing demand in the medium term, the efficiency of the line i...
A simulink model for the induction machine with an inter-turn short circuit fault
Şahin, İlker; Bayazıt, Göksenin Hande; Keysan, Ozan (2020-08-23)
In this study, an analytical model for the induction machine (IM) with an inter-turn short circuit (ITSC) fault is developed based on the voltage-behind-reactance (VBR) approach. The main motivation is to provide a simulation tool that can be used for fault detection and condition monitoring research. The proposed simulation model is implemented in Simulink, and compared with the outcomes of both finite element analysis (FEA) and experimental studies. The results show the effectiveness of the proposed model...
A statistical unified framework for rank-based multiple classifier decision combination
Saranlı, Afşar (2001-04-01)
This study presents a theoretical investigation of the rank-based multiple classifier decision combination problem, with the aim of providing a unified framework to understand a variety of such systems. The combination of the decisions of more than one classifiers with the aim of improving overall system performance is a concept of general interest in pattern recognition, as a viable alternative to designing a single sophisticated classifier. The problem of combining the classifier decisions in the raw form...
Citation Formats
A. D’Ortenzio, C. Manes, and U. Orguner, “A Model Selection criterion for the Mixture Reduction problem based on the Kullback-Leibler Divergence,” presented at the 25th International Conference of Information Fusion (FUSION), Linköping, İsveç, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/100793.