The following pages link to Rachel Ward (Q245509):
Displaying 50 items.
- Computing the confidence levels for a root-mean-square test of goodness-of-fit (Q115929) (← links)
- (Q310868) (redirect page) (← links)
- A unified framework for linear dimensionality reduction in L1 (Q310869) (← links)
- (Q420754) (redirect page) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- (Q485131) (redirect page) (← links)
- Two-subspace projection method for coherent overdetermined systems (Q485132) (← links)
- (Q589503) (redirect page) (← links)
- Lower bounds for the error decay incurred by coarse quantization schemes (Q654451) (← links)
- Iterative thresholding meets free-discontinuity problems (Q707746) (← links)
- Subfunctionalization: How often does it occur? How long does it take? (Q851415) (← links)
- An arithmetic-geometric mean inequality for products of three matrices (Q896834) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Interpolation via weighted \(\ell_{1}\) minimization (Q905907) (← links)
- Improved bounds for sparse recovery from subsampled random convolutions (Q1634177) (← links)
- Greedy variance estimation for the LASSO (Q2019914) (← links)
- Bias of homotopic gradient descent for the hinge loss (Q2045131) (← links)
- Matrix concentration for products (Q2098235) (← links)
- Generalization bounds for sparse random feature expansions (Q2105118) (← links)
- The Hanson-Wright inequality for random tensors (Q2164658) (← links)
- Recovery guarantees for polynomial coefficients from weakly dependent data with outliers (Q2209293) (← links)
- A near-stationary subspace for ridge approximation (Q2310068) (← links)
- Concentration inequalities for random matrix products (Q2310409) (← links)
- The local convexity of solving systems of quadratic equations (Q2410810) (← links)
- Some deficiencies of \(\chi^2\) and classical exact tests of significance (Q2450937) (← links)
- Side effects of learning from low-dimensional data embedded in a Euclidean space (Q2687305) (← links)
- Completing Any Low-rank Matrix, Provably (Q2788394) (← links)
- A Symbol-Based Algorithm for Decoding Bar Codes (Q2873188) (← links)
- Stable Image Reconstruction Using Total Variation Minimization (Q2873228) (← links)
- One-Bit Compressive Sensing With Norm Estimation (Q2976862) (← links)
- Relax, No Need to Round (Q2989030) (← links)
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property (Q3097486) (← links)
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization (Q3225244) (← links)
- Compressive Sensing with Redundant Dictionaries and Structured Measurements (Q3455237) (← links)
- On Robustness Properties of Beta Encoders and Golden Ratio Encoders (Q3604814) (← links)
- Extracting Sparse High-Dimensional Dynamics from Limited Data (Q4561658) (← links)
- Stable and Robust Sampling Strategies for Compressive Imaging (Q4591952) (← links)
- Clustering subgaussian mixtures by semidefinite programming (Q4603713) (← links)
- Batched Stochastic Gradient Descent with Weighted Sampling (Q4609808) (← links)
- The Sample Complexity of Weighted<?Pub _newline ?>Sparse Approximation (Q4619617) (← links)
- (Q4638108) (← links)
- Weighted Eigenfunction Estimates with Applications to Compressed Sensing (Q4907551) (← links)
- Quiet sigma delta quantization, and global convergence for a class of asymmetric piecewise-affine maps (Q4930121) (← links)
- Compressed Sensing With Cross Validation (Q4974111) (← links)
- Faster Johnson–Lindenstrauss transforms via Kronecker products (Q5033281) (← links)
- Overparameterization and Generalization Error: Weighted Trigonometric Interpolation (Q5088865) (← links)
- Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples (Q5137942) (← links)
- (Q5149016) (← links)
- MC2: a two-phase algorithm for leveraged matrix completion (Q5242856) (← links)
- Root-Exponential Accuracy for Coarse Quantization of Finite Frame Expansions (Q5272124) (← links)
