{"title":"计数响应的高维回归","authors":"Or Zilberman, Felix Abramovich","doi":"arxiv-2409.08821","DOIUrl":null,"url":null,"abstract":"We consider high-dimensional regression with a count response modeled by\nPoisson or negative binomial generalized linear model (GLM). We propose a\npenalized maximum likelihood estimator with a properly chosen complexity\npenalty and establish its adaptive minimaxity across models of various\nsparsity. To make the procedure computationally feasible for high-dimensional\ndata we consider its LASSO and SLOPE convex surrogates. Their performance is\nillustrated through simulated and real-data examples.","PeriodicalId":501379,"journal":{"name":"arXiv - STAT - Statistics Theory","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"High-dimensional regression with a count response\",\"authors\":\"Or Zilberman, Felix Abramovich\",\"doi\":\"arxiv-2409.08821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider high-dimensional regression with a count response modeled by\\nPoisson or negative binomial generalized linear model (GLM). We propose a\\npenalized maximum likelihood estimator with a properly chosen complexity\\npenalty and establish its adaptive minimaxity across models of various\\nsparsity. To make the procedure computationally feasible for high-dimensional\\ndata we consider its LASSO and SLOPE convex surrogates. Their performance is\\nillustrated through simulated and real-data examples.\",\"PeriodicalId\":501379,\"journal\":{\"name\":\"arXiv - STAT - Statistics Theory\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Statistics Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.08821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Statistics Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.08821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider high-dimensional regression with a count response modeled by
Poisson or negative binomial generalized linear model (GLM). We propose a
penalized maximum likelihood estimator with a properly chosen complexity
penalty and establish its adaptive minimaxity across models of various
sparsity. To make the procedure computationally feasible for high-dimensional
data we consider its LASSO and SLOPE convex surrogates. Their performance is
illustrated through simulated and real-data examples.