Simple Classification using Binary Data
From MaRDI portal
Publication:4614095
zbMath1407.68410arXiv1707.01945MaRDI QIDQ4614095
Deanna Needell, Rayan Saab, Tina Woolf
Publication date: 30 January 2019
Full work available at URL: https://arxiv.org/abs/1707.01945
Related Items (2)
Classification Scheme for Binary Data with Extensions ⋮ On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- AlexNet
- A simple proof of the restricted isometry property for random matrices
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Fast binary embeddings with Gaussian circulant matrices: improved bounds
- Dimension reduction by random hyperplane tessellations
- One-Bit Compressed Sensing by Linear Programming
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Extensions of Lipschitz mappings into a Hilbert space
- Support Vector Machines
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Reed Muller Sensing Matrices and the LASSO
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Deep Neural Networks with Random Gaussian Weights: A Universal Classification Strategy?
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Simple Classification using Binary Data
