scientific article; zbMATH DE number 6982967
From MaRDI portal
Publication:4558543
zbMath1448.68381MaRDI QIDQ4558543
Jiyan Yang, Yinlam Chow, Christopher Re, Michael W. Mahoney
Publication date: 22 November 2018
Full work available at URL: http://jmlr.csail.mit.edu/papers/v18/17-044.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Randomized algorithms (68W20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Stochastic Quasi-Newton Method for Large-Scale Optimization
- Faster least squares approximation
- Pegasos: primal estimated sub-gradient solver for SVM
- Sentence, proposition and identity
- A randomized Kaczmarz algorithm with exponential convergence
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
- Condition numbers and equilibration of matrices
- On the density of families of sets
- Atomic Decomposition by Basis Pursuit
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- The Fast Cauchy Transform and Faster Robust Linear Regression
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- Quantile Regression for Large-Scale Applications
- Uniform Sampling for Matrix Approximation
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Low-Rank Approximation and Regression in Input Sparsity Time
- Sampling Algorithms and Coresets for $\ell_p$ Regression
- Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
- Weighted SGD for ℓp Regression with Randomized Preconditioning
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- A unified framework for approximating and clustering data
- Subspace embeddings for the L 1 -norm with applications
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
This page was built for publication:
