Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Sparse Representation Classification via Screening for Graphs (1906.01601v1)

Published 4 Jun 2019 in cs.LG and stat.ML

Abstract: The sparse representation classifier (SRC) is shown to work well for image recognition problems that satisfy a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC under regularity conditions, and prove its classification consistency for random graphs drawn from stochastic blockmodels. The results are demonstrated via simulations and real data experiments, where the new algorithm achieves comparable numerical performance but significantly faster.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Cencheng Shen (34 papers)
  2. Li Chen (590 papers)
  3. Yuexiao Dong (12 papers)
  4. Carey Priebe (15 papers)

Summary

We haven't generated a summary for this paper yet.