Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data

DOI10.1137/19M1277102zbMath1485.60014arXiv1907.09698OpenAlexW3111520617MaRDI QIDQ5037559

Jesús A. De Loera, Thomas A. Hogan

Publication date: 1 March 2022

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09698

zbMATH Keywords

maximum likelihood estimationcombinatorial convexitylogistic regressionTverberg's theoremgeneralized linear modelsgeometric probabilityTukey medianhigh-dimensional logistic regressioncenterpointscomputational geometry in statisticsdepth of data pointseparability of data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Geometric probability and stochastic geometry (60D05) Generalized linear models (logistic models) (62J12) General nonlinear regression (62J02) Pattern recognition, speech recognition (68T10)

Related Items

A Model for Birdwatching and other Chronological Sampling Activities, Support vector machines and Radon's theorem, Algorithms for Radon partitions with tolerance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalisation of Tverberg's theorem
• Approximate centerpoints with proofs
• The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression
• The stochastic geometry of unconstrained one-bit data compression
• On the existence of maximum likelihood estimates in logistic regression models
• A Problem in Geometric Probability.
• Robust Tverberg and Colourful Carathéodory Results via Random Choice
• Tverberg’s theorem is 50 years old: A survey
• Living on the edge: phase transitions in convex programs with random data
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• A Generalization of Radon's Theorem
• Origin-embracing distributions or a continuous analogue of the upper bound theorem
• Enumeration of Seven-Argument Threshold Functions
• On Sets Projectively Equivalent to the Vertices of a Convex Polytope
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Approximating Tverberg points in linear time for any fixed dimension