Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #51 to #100.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Gradient descent with non-convex constraints: local concavity determines convergence: Label: en
  2. Conditional expectation estimation through attributable components: Label: en
  3. Isometric sketching of any set via the Restricted Isometry Property: Label: en
  4. A spectral assignment approach for the graph isomorphism problem: Label: en
  5. Structured sampling and fast reconstruction of smooth graph signals: Label: en
  6. New approach to Bayesian high-dimensional linear regression: Label: en
  7. MC2: a two-phase algorithm for leveraged matrix completion: Label: en
  8. A convex program for mixed linear regression with a recovery guarantee for well-separated data: Label: en
  9. Iterative reconstruction of rank-one matrices in noise: Label: en
  10. Gaussian approximation of general non-parametric posterior distributions: Label: en
  11. Sketching for large-scale learning of mixture models: Label: en
  12. Universality laws for randomized dimension reduction, with applications: Label: en
  13. Fast, robust and non-convex subspace recovery: Label: en
  14. Weighted mining of massive collections of P-values by convex optimization: Label: en
  15. Algorithms for learning sparse additive models with interactions in high dimensions*: Label: en
  16. When is non-trivial estimation possible for graphons and stochastic block models?‡: Label: en
  17. Demixing sines and spikes: Robust spectral super-resolution in the presence of outliers: Label: en
  18. One-bit compressive sensing of dictionary-sparse signals: Label: en
  19. Quantized minimax estimation over Sobolev ellipsoids: Label: en
  20. Superresolution without separation: Label: en
  21. Non-asymptotic analysis of tangent space perturbation: Label: en
  22. Erratum to: Super-resolution of near-colliding point sources: Label: en
  23. Low-rank matrix completion and denoising under Poisson noise: Label: en
  24. Robust and resource efficient identification of shallow neural networks by fewest samples: Label: en
  25. Overlap matrix concentration in optimal Bayesian inference: Label: en
  26. Tight recovery guarantees for orthogonal matching pursuit under Gaussian noise: Label: en
  27. Super-resolution of near-colliding point sources: Label: en
  28. Oracle inequalities for square root analysis estimators with application to total variation penalties: Label: en
  29. The limits of distribution-free conditional predictive inference: Label: en
  30. Sensitivity of ℓ1 minimization to parameter choice: Label: en
  31. Composite optimization for robust rank one bilinear sensing: Label: en
  32. Strong uniform consistency with rates for kernel density estimators with general kernels on manifolds: Label: en
  33. Generalized score matching for general domains: Label: en
  34. Conditional and Relevant Common Information: Label: en
  35. Denoising modulo samples: k-NN regression and tightness of SDP relaxation: Label: en
  36. Robust estimation via generalized quasi-gradients: Label: en
  37. Uncertainty principle for communication compression in distributed and federated learning and the search for an optimal compressor: Label: en
  38. Super-resolution multi-reference alignment: Label: en
  39. Stronger convergence results for deep residual networks: network width scales linearly with training data size: Label: en
  40. A model of double descent for high-dimensional binary linear classification: Label: en
  41. How many modes can a mixture of Gaussians with uniformly bounded means have?: Label: en
  42. Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines: Label: en
  43. Recovery analysis of damped spectrally sparse signals and its relation to MUSIC: Label: en
  44. Learning deep linear neural networks: Riemannian gradient flows and convergence to global minimizers: Label: en
  45. Compressive learning with privacy guarantees: Label: en
  46. Compressed Sensing with 1D Total Variation: Breaking Sample Complexity Barriers via Non-Uniform Recovery: Label: en
  47. A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality: Label: en
  48. Distributed information-theoretic clustering: Label: en
  49. Secure multiparty computations in floating-point arithmetic: Label: en
  50. High-temperature structure detection in ferromagnets: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)