Pages that link to "Item:Q2939794"
From MaRDI portal
The following pages link to Computational Advertising: Techniques for Targeting Relevant Ads (Q2939794):
Displaying 50 items.
- Matrix sketching for supervised classification with imbalanced classes (Q832649) (← links)
- On principal components regression, random projections, and column subsampling (Q1616329) (← links)
- Gaussian random projections for Euclidean membership problems (Q1634768) (← links)
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations (Q1640558) (← links)
- Increasing the accuracy of solving discrete ill-posed problems by the random projection method (Q1711397) (← links)
- Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
- An improvement of the parameterized frequent directions algorithm (Q1741237) (← links)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms (Q1986965) (← links)
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation (Q2027783) (← links)
- Multiplicative perturbation bounds for multivariate multiple linear regression in Schatten \(p\)-norms (Q2029823) (← links)
- Robust high-dimensional factor models with applications to statistical machine learning (Q2038305) (← links)
- Reduced-order modeling of deep neural networks (Q2038490) (← links)
- An efficient randomized algorithm for computing the approximate Tucker decomposition (Q2049079) (← links)
- Randomized signal processing with continuous frames (Q2066256) (← links)
- On the theory of dynamic graph regression problem (Q2091389) (← links)
- Manifold reconstruction and denoising from scattered data in high dimension (Q2095140) (← links)
- Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
- Private aggregation from fewer anonymous messages (Q2119033) (← links)
- Pass-efficient methods for compression of high-dimensional turbulent flow data (Q2123807) (← links)
- Spectral estimation from simulations via sketching (Q2133499) (← links)
- Functional principal subspace sampling for large scale functional data analysis (Q2137809) (← links)
- Community detection with a subsampled semidefinite program (Q2143169) (← links)
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format (Q2159450) (← links)
- Randomized quaternion QLP decomposition for low-rank approximation (Q2162234) (← links)
- An efficient algorithm for computing the approximate t-URV and its applications (Q2162323) (← links)
- Nested aggregation of experts using inducing points for approximated Gaussian process regression (Q2163216) (← links)
- Fast spectral analysis for approximate nearest neighbor search (Q2163259) (← links)
- A sketched finite element method for elliptic models (Q2180458) (← links)
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument (Q2185843) (← links)
- Adaptive iterative Hessian sketch via \(A\)-optimal subsampling (Q2195850) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Sampling-based dimension reduction for subspace approximation with outliers (Q2222095) (← links)
- Randomized algorithms for the low multilinear rank approximations of tensors (Q2226319) (← links)
- A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems (Q2245100) (← links)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
- Randomized linear algebra for model reduction. I. Galerkin methods and error estimation (Q2305558) (← links)
- Single-pass randomized algorithms for LU decomposition (Q2306297) (← links)
- A consistency theorem for randomized singular value decomposition (Q2307419) (← links)
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks (Q2329831) (← links)
- Numerically safe Gaussian elimination with no pivoting (Q2359570) (← links)
- Far-field compression for fast kernel summation methods in high dimensions (Q2397164) (← links)
- Random projections of linear and semidefinite problems with linear inequalities (Q2689146) (← links)
- Tikhonov Regularization and Randomized GSVD (Q2813331) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Low-Rank Matrix Approximations Do Not Need a Singular Value Gap (Q3119542) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
