Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: One-Bit ExpanderSketch for One-Bit Compressed Sensing   Is it possible to obliviously construct a set of hyperplanes H such that you
can approximate a unit vector x when you are given the side on which the vector
lies with respect to every h in H? In the sparse recovery literature, where x
is approximately k-sparse, this problem is called one-bit compressed sensing
and has received a fair amount of attention the last decade. In this paper we
obtain the first scheme that achieves almost optimal measurements and sublinear
decoding time for one-bit compressed sensing in the non-uniform case. For a
large range of parameters, we improve the state of the art in both the number
of measurements and the decoding time.

18
The categories of this paper are: econ
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
37
The categories of this paper are: supr-con
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics