Scalable approximations for generalized linear problems

zbMATH Open1483.62123arXiv1611.06686MaRDI QIDQ4633014FDOQ4633014

Lee H. Dicker, Mohsen Bayati, Murat A. Erdogdu

Publication date: 2 May 2019

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

Recommendations

• Newton-Stein method: an optimization method for GLMs via Stein's lemma
• Optimal subsampling algorithms for big data regressions
• Scalable estimation strategies based on stochastic approximations: classical results and new insights
• Distributed block-diagonal approximation methods for regularized empirical risk minimization
• Large-scale machine learning with stochastic gradient descent

zbMATH Keywords

stochastic optimizationsubsamplingdimension reduction in optimizationgeneralized linear problems

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Generalized linear models (logistic models) (62J12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sliced Inverse Regression for Dimension Reduction
• Title not available (Why is that?)
• On almost linearity of low dimensional projections from high dimensional data
• Slicing regression: A link-free regression method
• Introductory lectures on convex optimization. A basic course.
• Title not available (Why is that?)
• A Family of Variable-Metric Methods Derived by Variational Means
• The Convergence of a Class of Double-rank Minimization Algorithms
• A new approach to variable metric algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Dimension reduction for nonelliptically distributed predictors
• Regression analysis under link violation
• Probabilistic graphical models.
• Methods of conjugate gradients for solving linear systems
• Stein's method and the zero bias transformation with application to simple random sampling
• Direct estimation of the index coefficient in a single-index model
• Normal Approximation by Stein’s Method
• Faster least squares approximation
• The Generalized Lasso With Non-Linear Observations
• 10.1162/153244303321897690
• Solution of Sparse Indefinite Systems of Linear Equations
• Title not available (Why is that?)
• SLOPE is adaptive to unknown sparsity and asymptotically minimax
• The LASSO Risk for Gaussian Matrices
• Composite binary losses
• A general method for comparing probability assessors
• \(L^1\) bounds in normal approximation
• A fast randomized algorithm for overdetermined linear least-squares regression
• Sparse single-index model
• Sub-sampled Newton methods
• Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
• Newton-Stein Method: An optimization method for GLMs via Stein's Lemma
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Scalable approximations for generalized linear problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633014)