Efficient Algorithms for Non-gaussian Single Index Models with Generative Priors

Authors

  • Junren Chen University of Hong Kong
  • Zhaoqiang Liu University of Electronic Science and Technology of China

DOI:

https://doi.org/10.1609/aaai.v38i10.29014

Keywords:

ML: Learning Theory, ML: Other Foundations of Machine Learning, ML: Structured Learning

Abstract

In this work, we focus on high-dimensional single index models with non-Gaussian sensing vectors and generative priors. More specifically, our goal is to estimate the underlying signal from i.i.d. realizations of the semi-parameterized single index model, where the underlying signal is contained in (up to a constant scaling) the range of a Lipschitz continuous generative model with bounded low-dimensional inputs, the sensing vector follows a non-Gaussian distribution, the noise is a random variable that is independent of the sensing vector, and the unknown non-linear link function is differentiable. Using the first- and second-order Stein's identity, we introduce efficient algorithms to obtain estimated vectors that achieve the near-optimal statistical rate. Experimental results on image datasets are provided to support our theory.

Published

2024-03-24

How to Cite

Chen, J., & Liu, Z. (2024). Efficient Algorithms for Non-gaussian Single Index Models with Generative Priors. Proceedings of the AAAI Conference on Artificial Intelligence, 38(10), 11346-11354. https://doi.org/10.1609/aaai.v38i10.29014

Issue

Section

AAAI Technical Track on Machine Learning I