Algebraic geometry of Poisson regression

[1] 4ti2 team. 4ti2|A software package for algebraic, geometric and combinatorial problems
on linear spaces. available at www.4ti2.de, 2007.
[2] Satoshi Aoki, Hisayuki Hara, and Akimichi Takemura. Markov bases in algebraic statistics,
volume 199. Springer Science & Business Media, 2012.
[3] Saugata Basu, Richard D Pollack, and Marie-Francoise Roy. Algorithms in real algebraic
geometry, volume 10. Springer, 2006.
[4] Yvonne M Bishop, Stephen E Fienberg, and Paul W Holland. Discrete multivariate
analysis. Springer, New York, 2007.
[5] M.M. Deza and Monique Laurent. Geometry of Cuts and Metrics. Algorithms and
Combinatorics. Springer, Berlin, 1997.
[6] Persi Diaconis and Bernd Sturmfels. Algebraic algorithms for sampling from conditional
distributions. Annals of Statistics, 26:363{397, 1998.
[7] Anna Doebler and Heinz Holling. A processing speed test based on rule-based item
generation: An analysis with the Rasch Poisson counts model. Learning and Individual
Dierences, 2015.
[8] Mathias Drton, Bernd Sturmfels, and Seth Sullivant. Lectures on Algebraic Statistics,
volume 39 of Oberwolfach Seminars. Springer, Berlin, 2009. A Birkhauser book.
REFERENCES 43
[9] Ludwig Fahrmeir and Heinz Kaufmann. Consistency and asymptotic normality of the
maximum likelihood estimator in generalized linear models. The Annals of Statistics,
pages 342{368, 1985.
[10] Ulrike Graho, Heinz Holling, and Rainer Schwabe. Optimal design for count data with
binary predictors in item response theory. In Advances in Model-Oriented Design and
Analysis, pages 117{124. Springer, 2013.
[11] Ulrike Graho, Heinz Holling, and Rainer Schwabe. Optimal design for the Rasch
Poisson counts model with multiple binary predictors. Technical report, 2014.
[12] Ulrike Graho, Heinz Holling, and Rainer Schwabe. Poisson model with three binary
predictors: When are saturated designs optimal? In Ansgar Steland, Ewaryst Rafaj lowicz,
and Krzysztof Szajowski, editors, Stochastic Models, Statistics and Their Applications,
pages 75{81. 2015.
[13] Thomas Kahle. On Boundaries of Statistical Models. PhD thesis, Leipzig University,
2010.
[14] Thomas Kahle, Eckehard Olbrich, Jurgen Jost, and Nihat Ay. Complexity measures
from interaction structures. Physical Review E, 79:026201, 2009.
[15] Volker Kaibel and Stefan Weltge. A short proof that the extension complexity of
the correlation polytope grows exponentially. Discrete & Computational Geometry,
53(2):397{401, 2013.
[16] Monique Laurent and Svatopluk Poljak. On a positive semidenite relaxation of the cut
polytope. Linear Algebra and its Applications, 223:439{461, 1995.
[17] Monique Laurent and Svatopluk Poljak. On the facial structure of the set of correlation
matrices. SIAM Journal on Matrix Analysis and Applications, 17(3):530{547, 1996.
[18] Steen L Lauritzen. Graphical models. Oxford University Press, 1996.
[19] J. Lofberg. YALMIP: A toolbox for modeling and optimization in MATLAB. In
Proceedings of the CACSD Conference, Taipei, Taiwan, 2004.
[20] Peter McCullagh and John A Nelder. Generalized linear models, volume 37. CRC press,
1989.
[21] Friedrich Pukelsheim. Optimal design of experiments, volume 50 of Classics in Applied
Mathematics. SIAM, 2006.
[22] Martin Radlo and Rainer Schwabe. Invariance and equivariance in experimental design
for nonlinear models. In Advances in Model-Oriented Design and Analysis, pages 217{224.
Springer, 2016.
REFERENCES 44
[23] Richard P. Stanley. Enumerative Combinatorics. Cambridge University Press, 2nd edition
edition, 1997.
[24] Bernd Sturmfels. Grobner Bases and Convex Polytopes, volume 8 of University Lecture
Series. American Mathematical Society, Providence, RI, 1996.
[25] Lieven Vandenberghe and Stephen Boyd. Semidenite programming. SIAM Review,
38(1):49{95, 1996.