An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models
نویسندگان
چکیده
A lgebra has always played an important role in statistics, a classical example being linear algebra. There are also many other instances of applying algebraic tools in statistics e.g., [1,2]. But, treating statistical models as algebraic objects, and thereby using tools from computational commutative algebra and algebraic geometry in the analysis of statistical models is very recent and has led to the still evolving field of algebraic statistics.
منابع مشابه
Unifying Non-Maximum Likelihood Learning Objectives with Minimum KL Contraction
When used to learn high dimensional parametric probabilistic models, the classical maximum likelihood (ML) learning often suffers from computational intractability, which motivates the active developments of non-ML learning methods. Yet, because of their divergent motivations and forms, the objective functions of many non-ML learning methods are seemingly unrelated, and there lacks a unified fr...
متن کاملApproximate Implicitization of Parametric Curves Using Cubic Algebraic Splines
This paper presents an algorithm to solve the approximate implicitization of planar parametric curves using cubic algebraic splines. It applies piecewise cubic algebraic curves to give a global G2 continuity approximation to planar parametric curves. Approximation error on approximate implicitization of rational curves is given. Several examples are provided to prove that the proposed method is...
متن کاملChange of Ordering for Regular Chains in Positive Dimension
We discuss changing the variable ordering for a regular chain in positive dimension. This quite general question has applications going from implicitization problems to the symbolic resolution of some systems of differential algebraic equations. We propose a modular method, reducing the problem to dimension zero and using Newton-Hensel lifting techniques. The problems raised by the choice of th...
متن کاملPolynomial Constraints in Causal Bayesian Networks
We use the implicitization procedure to generate polynomial equality constraints on the set of distributions induced by local interventions on variables governed by a causal Bayesian network with hidden variables. We show how we may reduce the complexity of the implicitization problem and make the problem tractable in certain causal Bayesian networks. We also show some preliminary results on th...
متن کاملBerkeley Electronic Theses and Dissertations Title Minimum
Minimum Probability Flow Learning: A New Method For Fitting Probabilistic Models by Peter Brian Battaglino Doctor of Philosophy in Physics University of California, Berkeley Professor Michael Deweese, Chair Fitting probabilistic models to data is often difficult, due to the general intractability of the partition function and its derivatives. In this dissertation we propose a new parameter esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010