CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
SQ Lower Bounds for Learning Mixtures of Linear Classifiers
Authors
Ilias Diakonikolas
Daniel M. Kane
Yuxin Sun
Publication date
18 October 2023
Publisher
View
on
arXiv
Abstract
We study the problem of learning mixtures of linear classifiers under Gaussian covariates. Given sample access to a mixture of
r
r
r
distributions on
R
n
\mathbb{R}^n
R
n
of the form
(
x
,
y
β
)
(\mathbf{x},y_{\ell})
(
x
,
y
β
β
)
,
β
β
[
r
]
\ell\in [r]
β
β
[
r
]
, where
x
βΌ
N
(
0
,
I
n
)
\mathbf{x}\sim\mathcal{N}(0,\mathbf{I}_n)
x
βΌ
N
(
0
,
I
n
β
)
and
y
β
=
s
i
g
n
(
β¨
v
β
,
x
β©
)
y_\ell=\mathrm{sign}(\langle\mathbf{v}_\ell,\mathbf{x}\rangle)
y
β
β
=
sign
(β¨
v
β
β
,
x
β©)
for an unknown unit vector
v
β
\mathbf{v}_\ell
v
β
β
, the goal is to learn the underlying distribution in total variation distance. Our main result is a Statistical Query (SQ) lower bound suggesting that known algorithms for this problem are essentially best possible, even for the special case of uniform mixtures. In particular, we show that the complexity of any SQ algorithm for the problem is
n
p
o
l
y
(
1
/
Ξ
)
log
β‘
(
r
)
n^{\mathrm{poly}(1/\Delta) \log(r)}
n
poly
(
1/Ξ
)
l
o
g
(
r
)
, where
Ξ
\Delta
Ξ
is a lower bound on the pairwise
β
2
\ell_2
β
2
β
-separation between the
v
β
\mathbf{v}_\ell
v
β
β
's. The key technical ingredient underlying our result is a new construction of spherical designs that may be of independent interest.Comment: To appear in NeurIPS 202
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:2310.11876
Last time updated on 06/01/2024