Simple classification using binary data

MaRDI QIDQ4614095zbMATH OpenFDO

Authors D. Needell, Rayan Saab, Tina Woolf

Publication date 30 January 2019

Full work available at URL https://arxiv.org/abs/1707.01945, http://jmlr.csail.mit.edu/papers/v19/17-383.html

zbMATH Keywords

binary measurementsclassificationone-bit representations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms (68W40)

Abstract: Binary, or one-bit, representations of data arise naturally in many applications, and are appealing in both hardware implementations and algorithm design. In this work, we study the problem of data classification from binary data and propose a framework with low computation and resource costs. We illustrate the utility of the proposed approach through stylized and realistic numerical experiments, and provide a theoretical analysis for a simple case. We hope that our framework and analysis will serve as a foundation for studying similar types of approaches.

Recommendations

• Classification scheme for binary data with extensions
• A classification method based on generalized eigenvalue problems
• Classification of run-length encoded binary data
• A unified view on clustering binary data
• Formation of similarity-reflecting binary vectors with random binary projections

Cites work

• A simple proof of the restricted isometry property for random matrices
• AlexNet
• An elementary proof of a theorem of Johnson and Lindenstrauss
• An introduction to support vector machines and other kernel-based learning methods.
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• Compressed sensing
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Deep Neural Networks with Random Gaussian Weights: A Universal Classification Strategy?
• Dimension reduction by random hyperplane tessellations
• Extensions of Lipschitz mappings into a Hilbert space
• Fast binary embeddings with Gaussian circulant matrices: improved bounds
• scientific article; zbMATH DE number 6982943 (Why is no real title available?)
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• On binary embedding using circulant matrices
• One-bit compressed sensing by linear programming
• Reed-Muller sensing matrices and the LASSO (invited paper)
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Stable signal recovery from incomplete and inaccurate measurements
• Support Vector Machines
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements

Cited in

(4)

• Stretchy binary classification
• Classification scheme for binary data with extensions
• On the atomic decomposition of coorbit spaces with non-integrable kernel
• Classification of run-length encoded binary data

Describes a project that uses

Uses Software

• AlexNet
• MNIST
• BinaryConnect
• BinaryNet
• XNOR-Net
• ImageNet

This page was built for publication: Simple classification using binary data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614095)