On Greedy Maximization of Entropy
نویسندگان
چکیده
Submodular function maximization is one of the key problems that arise in many machine learning tasks. Greedy selection algorithms are the proven choice to solve such problems, where prior theoretical work guarantees (1 − 1/e) approximation ratio. However, it has been empirically observed that greedy selection provides almost optimal solutions in practice. The main goal of this paper is to explore and answer why the greedy selection does significantly better than the theoretical guarantee of (1 − 1/e). Applications include, but are not limited to, sensor selection tasks which use both entropy and mutual information as a maximization criteria. We give a theoretical justification for the nearly optimal approximation ratio via detailed analysis of the curvature of these objective functions for Gaussian RBF kernels.
منابع مشابه
PAC Greedy Maximization with Efficient Bounds on Information Gain for Sensor Selection
Submodular function maximization finds application in a variety of real-world decision-making problems. However, most existing methods, based on greedy maximization, assume it is computationally feasible to evaluate F , the function being maximized. Unfortunately, in many realistic settings F is too expensive to evaluate exactly even once. We present probably approximately correct greedy maximi...
متن کاملProbably Approximately Correct Greedy Maximization
Submodular function maximization finds application in a variety of real-world decision-making problems. However, most existing methods, based on greedy maximization, assume it is computationally feasible to evaluate F , the function being maximized. Unfortunately, in many realistic settings F is too expensive to evaluate exactly even once. We present probably approximately correct greedy maximi...
متن کاملPersistent Monitoring of Stochastic Spatio-temporal Phenomena with a Small Team of Robots
This paper presents a solution for persistent monitoring of real-world stochastic phenomena, where the underlying covariance structure changes sharply across time, using a small number of mobile robot sensors. We propose an adaptive solution for the problem where stochastic real-world dynamics are modeled as a Gaussian Process (GP). The belief on the underlying covariance structure is learned f...
متن کاملEffects of Anticipation in Individually Motivated Behaviour on Survival and Control in a Multi-Agent Scenario with Resource Constraints
Self-organization and survival are inextricably bound to an agent’s ability to control and anticipate its environment. Here we assess both skills when multiple agents compete for a scarce resource. Drawing on insights from psychology, microsociology and control theory, we examine how different assumptions about the behaviour of an agent’s peers in the anticipation process affect subjective cont...
متن کاملبکارگیری بازپخت شبیهسازی شده در مدل آنتروپی توزیع سفر (مطالعه موردی)
Trip distribution is a very important step in transportation modeling context. Many decent researches have been dedicated to the importance of the models for this third step of transportation modeling. Entropy maximization model is one of thermodynamic models and is implemented in modeling various scientific Phenomenons. As the name implies, entropy maximization model tries to find the maximu...
متن کامل