Jose Rodriguez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jose Rodriguez has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Maurizio Ruggiu
University of Cagliari
2 shared publications - Anton Leykin
School of Mathematics Georgia Tech Atlanta GA
1 shared publication - Bernd Sturmfels
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication - Daniel J. Bates
Colorado State University
1 shared publication - Elizabeth Gross
Department of Mathematics North Carolina State University Raleigh NC
1 shared publication - Elizabeth Gross
Department of Mathematics North Carolina State University Raleigh NC
1 shared publication
Latest Publications
- Open Access
Maximum Likelihood for Dual Varieties
Maximum likelihood estimation (MLE) is a fundamental computational problem in statistics. In this paper, MLE for statistical models with discrete data is studied from an algebraic statistics viewpoint. A reformulation of the MLE problem in terms of dual varieties and conormal varieties will be given. With this description, the dual likelihood equations and the dual MLE problem are defined. We show that solving the dual MLE problem yields solutions to the MLE problem, so we can solve the MLE problem without ever determining the defining equations of the model.
Open AccessMaximum Likelihood for Dual Varieties
Maximum likelihood estimation (MLE) is a fundamental computational problem in statistics. In this paper, MLE for statistical models with discrete data is studied from an algebraic statistics viewpoint. A reformulation of the MLE problem in terms of dual varieties and conormal varieties will be given. With this description, the dual likelihood equations and the dual MLE problem are defined. We show that solving the dual MLE problem yields solutions to the MLE problem, so we can solve the MLE problem without ever determining the defining equations of the model.
- Open Access
Maximum likelihood geometry in the presence of data zeros
Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations when the data contain zeros and are no longer generic. Focusing on sampling and model zeros, we show that, in these cases, the solutions to the likelihood equations are contained in a previously studied variety, the likelihood correspondence. The number of these solutions give a lower bound on the ML degree, and the problem of finding critical points to the likelihood function can be partitioned into smaller and computationally easier problems involving sampling and model zeros. We use this technique to compute a lower bound on the ML degree for $2 \times 2 \times 2 \times 2$ tensors of border rank $\leq 2$ and $3 \times n$ tables of rank $\leq 2$ for $n=11, 12, 13, 14$, the first four values of $n$ for which the ML degree was previously unknown.Open AccessMaximum likelihood geometry in the presence of data zeros
Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations when the data contain zeros and are no longer generic. Focusing on sampling and model zeros, we show that, in these cases, the solutions to the likelihood equations are contained in a previously studied variety, the likelihood correspondence. The number of these solutions give a lower bound on the ML degree, and the problem of finding critical points to the likelihood function can be partitioned into smaller and computationally easier problems involving sampling and model zeros. We use this technique to compute a lower bound on the ML degree for $2 \times 2 \times 2 \times 2$ tensors of border rank $\leq 2$ and $3 \times n$ tables of rank $\leq 2$ for $n=11, 12, 13, 14$, the first four values of $n$ for which the ML degree was previously unknown. - Open Access
Combinatorial Excess Intersection
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical algebraic geometry.
Open AccessCombinatorial Excess Intersection
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical algebraic geometry.
- Open Access
Bertini for Macaulay2
Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes implementations of a variety of algorithms based on polynomial homotopy continuation. The Macaulay2 package Bertini.m2 provides an interface to Bertini, making it possible to access the core run modes of Bertini in Macaulay2. With these run modes, users can find approximate solutions to zero-dimensional systems and positive-dimensional systems, test numerically whether a point lies on a variety, sample numerically from a variety, and perform parameter homotopy runs.
Open AccessBertini for Macaulay2
Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes implementations of a variety of algorithms based on polynomial homotopy continuation. The Macaulay2 package Bertini.m2 provides an interface to Bertini, making it possible to access the core run modes of Bertini in Macaulay2. With these run modes, users can find approximate solutions to zero-dimensional systems and positive-dimensional systems, test numerically whether a point lies on a variety, sample numerically from a variety, and perform parameter homotopy runs.
- 3 July 2013
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2014 (20) , 5648-5666
Maximum Likelihood Duality for Determinantal Varieties
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection between critical points of the likelihood function on the complex variety of matrices of rank r and critical points on the complex variety of matrices of co-rank r−1. In this paper, we prove that conjecture for rectangular matrices and for symmetric matrices, as well as a variant for skew-symmetric matrices.
- 3 July 2013
- Published by Oxford University Press (OUP) in International Mathematics Research Notices
- Vol. 2014 (20) , 5648-5666
Maximum Likelihood Duality for Determinantal Varieties
In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection between critical points of the likelihood function on the complex variety of matrices of rank r and critical points on the complex variety of matrices of co-rank r−1. In this paper, we prove that conjecture for rectangular matrices and for symmetric matrices, as well as a variant for skew-symmetric matrices.
- Open Access
Maximum Likelihood for Matrices with Rank Constraints
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this problem on manifolds of matrices with bounded rank. These represent mixtures of distributions of two independent discrete random variables. We determine the maximum likelihood degree for a range of determinantal varieties, and we apply numerical algebraic geometry to compute all critical points of their likelihood functions. This led to the discovery of maximum likelihood duality between matrices of complementary ranks, a result proved subsequently by Draisma and Rodriguez.
Open AccessMaximum Likelihood for Matrices with Rank Constraints
Maximum likelihood estimation is a fundamental optimization problem in statistics. We study this problem on manifolds of matrices with bounded rank. These represent mixtures of distributions of two independent discrete random variables. We determine the maximum likelihood degree for a range of determinantal varieties, and we apply numerical algebraic geometry to compute all critical points of their likelihood functions. This led to the discovery of maximum likelihood duality between matrices of complementary ranks, a result proved subsequently by Draisma and Rodriguez.
- Open Access
Analytical Solution of the Forward Displacement Problem for Spherical Parallel Manipulators
In this paper, an analytical method that solves the forward displacement problem of several common spherical parallel manipulators (SPMs) is presented. The method uses the the quaternion algebra to restate the problem as a system of four quadrics in four variables and uses an algebraic geometry result by Dixon from 1908 to solve. In addition, a case study is presented for a specific SPM.
Open AccessAnalytical Solution of the Forward Displacement Problem for Spherical Parallel Manipulators
In this paper, an analytical method that solves the forward displacement problem of several common spherical parallel manipulators (SPMs) is presented. The method uses the the quaternion algebra to restate the problem as a system of four quadrics in four variables and uses an algebraic geometry result by Dixon from 1908 to solve. In addition, a case study is presented for a specific SPM.