Pages that link to "Item:Q2989476"
From MaRDI portal
The following pages link to Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach (Q2989476):
Displayed 50 items.
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness (Q722765) (← links)
- Noisy 1-bit compressive sensing: models and algorithms (Q900771) (← links)
- Sigma delta quantization with harmonic frames and partial Fourier ensembles (Q1634829) (← links)
- Linear regression with sparsely permuted data (Q1711600) (← links)
- Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 (Q1731982) (← links)
- Fast binary embeddings with Gaussian circulant matrices: improved bounds (Q1991343) (← links)
- The landscape of empirical risk for nonconvex losses (Q1991675) (← links)
- The recovery of ridge functions on the hypercube suffers from the curse of dimensionality (Q1996887) (← links)
- Estimation from nonlinear observations via convex programming with application to bilinear regression (Q2002578) (← links)
- On recovery guarantees for one-bit compressed sensing on manifolds (Q2022611) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing (Q2039597) (← links)
- Double fused Lasso regularized regression with both matrix and vector valued predictors (Q2044365) (← links)
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Classification of COVID19 Patients using robust logistic regression (Q2096398) (← links)
- AdaBoost and robust one-bit compressed sensing (Q2102435) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
- Covariance estimation under one-bit quantization (Q2112828) (← links)
- A one-bit, comparison-based gradient estimator (Q2155805) (← links)
- Phase retrieval by binary questions: which complementary subspace is closer? (Q2165571) (← links)
- Convergence guarantee for the sparse monotone single index model (Q2168091) (← links)
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces (Q2175016) (← links)
- Generalized high-dimensional trace regression via nuclear norm regularization (Q2323374) (← links)
- Least squares estimation in the monotone single index model (Q2325372) (← links)
- Hypothesis testing for high-dimensional sparse binary regression (Q2338930) (← links)
- One-bit compressed sensing with non-Gaussian measurements (Q2437341) (← links)
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed? (Q2659754) (← links)
- Estimation in High Dimensions: A Geometric Perspective (Q2799917) (← links)
- Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares (Q3174766) (← links)
- An Introduction to Compressed Sensing (Q3296174) (← links)
- Quantized Compressed Sensing: A Survey (Q3296175) (← links)
- Classification Scheme for Binary Data with Extensions (Q3296178) (← links)
- Quantization and Compressive Sensing (Q3460834) (← links)
- Fast and Reliable Parameter Estimation from Nonlinear Observations (Q4588858) (← links)
- Sparse recovery from saturated measurements (Q4603704) (← links)
- Representation and coding of signal geometry (Q4603712) (← links)
- Time for dithering: fast and quantized random embeddings via the restricted isometry property (Q4603715) (← links)
- High-dimensional estimation with geometric constraints: Table 1. (Q4603716) (← links)
- Flavors of Compressive Sensing (Q4609797) (← links)
- Simple Classification using Binary Data (Q4614095) (← links)
- (Q4633018) (← links)
- Global and Simultaneous Hypothesis Testing for High-Dimensional Logistic Regression Models (Q4999175) (← links)
- One-bit compressed sensing via <i> <b>ℓ</b> </i> <sub> <i>p</i> </sub>(<b>0</b> <b><</b> <i>p</i> <b><</b> <b>1</b>)-minimization method (Q5000599) (← links)
- Structure from Randomness in Halfspace Learning with the Zero-One Loss (Q5139592) (← links)
- (Q5148995) (← links)
- (Q5159402) (← links)
- Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces (Q5230191) (← links)
- On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel (Q5230193) (← links)
