Neighborliness of randomly projected simplices in high dimensions
From MaRDI portal
Recommendations
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- scientific article; zbMATH DE number 516161
Cites work
- Non-linear angle-sum relations for polyhedral cones and polytopes
- On the geometrical moments of skew-regular simplices in hyperspherical space, with some applications in geometry and mathematical statistics
- Random projections of regular polytopes
- Random projections of regular simplices
- Regular simplices and Gaussian samples
- Sparse nonnegative solution of underdetermined linear equations by linear programming
Cited in
(66)- Random projections of smooth manifolds
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Gaussian polytopes: a cumulant-based approach
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- A Rice method proof of the null-space property over the Grassmannian
- Recovery of signals under the condition on RIC and ROC via prior support information
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Overcoming the limitations of phase transition by higher order analysis of regularization techniques
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- A simple and feasible method for a class of large-scale \(l^1\)-problems
- Random Gale diagrams and neighborly polytopes in high dimensions
- The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning
- Lah distribution: Stirling numbers, records on compositions, and convex hulls of high-dimensional random walks
- Analysis of sparse recovery algorithms via the replica method
- Convex cones spanned by regular polytopes
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- A numerical exploration of compressed sampling recovery
- Discussion of: Treelets -- an adaptive multi-scale basis for sparse unordered data
- Universality in polytope phase transitions and message passing algorithms
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- The remarkable simplicity of very high dimensional data: application of model-based clustering
- The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
- Compressive Sensing
- A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization
- Theory and applications of compressed sensing
- Performance comparisons of greedy algorithms in compressed sensing.
- Phase transitions in semidefinite relaxations
- Breaking the coherence barrier: a new theory for compressed sensing
- Linearized Bregman iterations for compressed sensing
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Sharp MSE bounds for proximal denoising
- Statistical mechanics of complex neural systems and high dimensional data
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Recovering structured signals in noise: least-squares meets compressed sensing
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Sharp recovery bounds for convex demixing, with applications
- scientific article; zbMATH DE number 516161 (Why is no real title available?)
- On tight bounds for the Lasso
- Guarantees of total variation minimization for signal recovery
- The restricted isometry property for random block diagonal matrices
- System identification in the presence of outliers and random noises: a compressed sensing approach
- An \(\ell_q\)- seminorm variational model for impulse noise reduction
- Face numbers of high-dimensional Poisson zero cells
- A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- The phase transition of matrix recovery from Gaussian measurements matches the minimax MSE of matrix denoising
- Sparse recovery from extreme eigenvalues deviation inequalities
- Thinking ultrametrically, thinking p-adically
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms
- Random cones in high dimensions. I: Donoho-Tanner and Cover-Efron cones.
- Consistent parameter estimation for Lasso and approximate message passing
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- r-Lah distribution: properties, limit theorems and an application to compressed sensing
- The Lasso with general Gaussian designs with applications to hypothesis testing
- Angle sums of random polytopes
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Null space conditions and thresholds for rank minimization
- Universality of approximate message passing algorithms and tensor networks
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Correlation adjusted debiased Lasso: debiasing the Lasso with inaccurate covariate model
- Surprising geometrical properties of high-dimension low-sample size data with devastating consequences for data analysis
- Random sampling of sparse trigonometric polynomials
This page was built for publication: Neighborliness of randomly projected simplices in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385847)
