Computational Advertising: Techniques for Targeting Relevant Ads
From MaRDI portal
Publication:2939794
DOI10.1561/0400000060zbMath1316.65046arXiv1411.4357OpenAlexW3112410551MaRDI QIDQ2939794
Publication date: 22 January 2015
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.4357
monographsketchingalgorithmrandom matrixleast squares regressionlow rank approximationgraph sparsificationabsolute deviation regression
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)
Related Items (only showing first 100 items - show all)
Numerically safe Gaussian elimination with no pivoting ⋮ Sketching and Embedding are Equivalent for Norms ⋮ On principal components regression, random projections, and column subsampling ⋮ Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Low-Rank Tucker Approximation of a Tensor from Streaming Data ⋮ Matrix sketching for supervised classification with imbalanced classes ⋮ Spectral estimation from simulations via sketching ⋮ Functional principal subspace sampling for large scale functional data analysis ⋮ Gaussian random projections for Euclidean membership problems ⋮ Randomized Local Model Order Reduction ⋮ Community detection with a subsampled semidefinite program ⋮ Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Semi-Infinite Linear Regression and Its Applications ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Randomized quaternion QLP decomposition for low-rank approximation ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ Nested aggregation of experts using inducing points for approximated Gaussian process regression ⋮ Fast spectral analysis for approximate nearest neighbor search ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Unnamed Item ⋮ Convexification with Bounded Gap for Randomly Projected Quadratic Optimization ⋮ Sharper Bounds for Regularized Data Fitting ⋮ A sketched finite element method for elliptic models ⋮ Sketched Newton--Raphson ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition ⋮ Faster Kernel Ridge Regression Using Sketching and Preconditioning ⋮ Randomized algorithms in numerical linear algebra ⋮ Trading Beams for Bandwidth: Imaging with Randomized Beamforming ⋮ Unnamed Item ⋮ Max-Plus Algebraic Statistical Leverage Scores ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Adaptive iterative Hessian sketch via \(A\)-optimal subsampling ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Random projections of linear and semidefinite problems with linear inequalities ⋮ Hardness Results for Structured Linear Systems ⋮ Optimal CUR Matrix Decompositions ⋮ Newton-type methods for non-convex optimization under inexact Hessian information ⋮ Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces ⋮ Increasing the accuracy of solving discrete ill-posed problems by the random projection method ⋮ Dimensionality reduction of SDPs through sketching ⋮ Parameterized low-rank binary matrix approximation ⋮ An investigation of Newton-Sketch and subsampled Newton methods ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Structured Random Sketching for PDE Inverse Problems ⋮ High Probability Frequency Moment Sketches ⋮ Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing ⋮ An improvement of the parameterized frequent directions algorithm ⋮ A Practical Randomized CP Tensor Decomposition ⋮ On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms ⋮ A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems ⋮ Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices ⋮ Unnamed Item ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation ⋮ Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms ⋮ Stochastic sub-sampled Newton method with variance reduction ⋮ Robust high-dimensional factor models with applications to statistical machine learning ⋮ Reduced-order modeling of deep neural networks ⋮ Randomized Dynamic Mode Decomposition ⋮ A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ Tikhonov Regularization and Randomized GSVD ⋮ On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation ⋮ Randomized linear algebra for model reduction. I. Galerkin methods and error estimation ⋮ Single-pass randomized algorithms for LU decomposition ⋮ A consistency theorem for randomized singular value decomposition ⋮ Compressed and Penalized Linear Regression ⋮ Querying a Matrix Through Matrix-Vector Products. ⋮ Optimality of linear sketching under modular updates ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ Randomized signal processing with continuous frames ⋮ Randomized Sketching Algorithms for Low-Memory Dynamic Optimization ⋮ On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models ⋮ Numerical algorithms for high-performance computational science ⋮ An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems ⋮ Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks ⋮ Low-Rank Matrix Approximations Do Not Need a Singular Value Gap ⋮ On the theory of dynamic graph regression problem ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Manifold reconstruction and denoising from scattered data in high dimension ⋮ Tight Bounds for the Subspace Sketch Problem with Applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Single-pass randomized QLP decomposition for low-rank approximation ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching ⋮ Matrix Rigidity and the Ill-Posedness of Robust PCA and Matrix Completion ⋮ Accurate Low-Rank Approximations Via a Few Iterations of Alternating Least Squares ⋮ Fast approximate computations with Cauchy matrices and polynomials ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching ⋮ Private aggregation from fewer anonymous messages
This page was built for publication: Computational Advertising: Techniques for Targeting Relevant Ads
