scientific article; zbMATH DE number 7049726

zbMath1483.62123arXiv1611.06686MaRDI QIDQ4633014

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

Publication date: 2 May 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SLOPE is adaptive to unknown sparsity and asymptotically minimax
• Faster least squares approximation
• On almost linearity of low dimensional projections from high dimensional data
• A general method for comparing probability assessors
• Dimension reduction for nonelliptically distributed predictors
• Slicing regression: A link-free regression method
• Stein's method and the zero bias transformation with application to simple random sampling
• Introductory lectures on convex optimization. A basic course.
• Sub-sampled Newton methods
• Regression analysis under link violation
• Direct estimation of the index coefficient in a single-index model
• \(L^1\) bounds in normal approximation
• Newton-Stein Method: An optimization method for GLMs via Stein's Lemma
• Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
• The Generalized Lasso With Non-Linear Observations
• A fast randomized algorithm for overdetermined linear least-squares regression
• Normal Approximation by Stein’s Method
• Sliced Inverse Regression for Dimension Reduction
• Solution of Sparse Indefinite Systems of Linear Equations
• 10.1162/153244303321897690
• The LASSO Risk for Gaussian Matrices
• Sparse single-index model
• 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
• Methods of conjugate gradients for solving linear systems