Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox
Picture for Yaniv Plan

Yaniv Plan
Alert button

A coherence parameter characterizing generative compressed sensing with Fourier measurements


Jul 19, 2022
Aaron Berk, Simone Brugiapaglia, Babhru Joshi, Yaniv Plan, Matthew Scott, Özgür Yilmaz

Add code
Alert button

Figure 1 for A coherence parameter characterizing generative compressed sensing with Fourier measurements
Figure 2 for A coherence parameter characterizing generative compressed sensing with Fourier measurements
Figure 3 for A coherence parameter characterizing generative compressed sensing with Fourier measurements

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Beyond Independent Measurements: General Compressed Sensing with GNN Application


Oct 30, 2021
Alireza Naderi, Yaniv Plan

Add code
Alert button


   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications


Jan 28, 2020
Halyun Jeong, Xiaowei Li, Yaniv Plan, Özgür Yılmaz

Add code
Alert button


   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Tight Analyses for Non-Smooth Stochastic Gradient Descent


Dec 13, 2018
Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan, Sikander Randhawa

Add code
Alert button


   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Settling the Sample Complexity for Learning Mixtures of Gaussians


Feb 16, 2018
Hassan Ashtiani, Shai Ben-David, Nick Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan

Add code
Alert button

Figure 1 for Settling the Sample Complexity for Learning Mixtures of Gaussians
* 38 pages 
   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Near-optimal sample complexity for convex tensor completion


Nov 14, 2017
Navid Ghadermarzy, Yaniv Plan, Özgür Yılmaz

Add code
Alert button

Figure 1 for Near-optimal sample complexity for convex tensor completion
Figure 2 for Near-optimal sample complexity for convex tensor completion
Figure 3 for Near-optimal sample complexity for convex tensor completion
Figure 4 for Near-optimal sample complexity for convex tensor completion

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Average-case Hardness of RIP Certification


May 31, 2016
Tengyao Wang, Quentin Berthet, Yaniv Plan

Add code
Alert button

Figure 1 for Average-case Hardness of RIP Certification

   Access Paper or Ask Questions
  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email