On the Complexity of Logistic Regression Models

DOI10.1162/neco_a_01207zbMath1435.62286arXiv1903.00386OpenAlexW2919163648WikidataQ91508536 ScholiaQ91508536MaRDI QIDQ5214359

Yasser Roudi, Nicola Bulso, Matteo Marsili

Publication date: 7 February 2020

Published in: Neural Computation (Search for Journal in Brave)

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

zbMATH Keywords

complexitylogistic regression

Mathematics Subject Classification ID

Generalized linear models (logistic models) (62J12) Foundations and philosophical topics in statistics (62A01) Statistical aspects of information-theoretic topics (62B10)

Related Items (1)

Analysis of overfitting in the regularized Cox model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Estimating the dimension of a model
• Statistical Inference, Occam's Razor, and Statistical Mechanics on the Space of Probability Distributions
• Belief propagation and replicas for inference and learning in a kinetic Ising model with hidden spins
• Sparse model selection in the highly under-sampled regime
• On Bayesian Analysis of Generalized Linear Models Using Jeffreys's Prior
• The Selection of Prior Distributions by Formal Rules
• Counting probability distributions: Differential geometry and model selection
• Fisher information and stochastic complexity
• Properties and Implementation of Jeffreys’s Prior in Binomial Regression Models
• An invariant form for the prior probability in estimation problems
• The elements of statistical learning. Data mining, inference, and prediction
• A new look at the statistical model identification

This page was built for publication: On the Complexity of Logistic Regression Models