◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zhao Song

52 papers hereh-index 376.5k citations76 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author5
  • middle author32
  • last author14

Across the 51 of 52 papers where every author was matched, so the position is known.

fields
  • cs.DS34
  • cs.LG11
  • cs.IT2
  • math.OC2
  • stat.ML2
  • math.PR1
same name
  • Zhao Song — 45 papers, h 19
  • Zhao Song — 24 papers, h 17
  • Zhao Song — 17 papers, h 13
  • Zhao Song — 17 papers, h 13
  • Zhao Song — 15 papers, h 9
  • Zhao Song — 12 papers, h 6

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20142023
most citedA Convergence Theory for Deep Learning via Over-Parameterization

688 citations · 1.5k across the 49 of their papers we have counts for

collaborators
Showing 2016Show all

4 papers · 1 filter

cs.DS2016★ 10 cited

Low Rank Approximation with Entrywise ℓ1​-Norm Error

Zhao Song, David P. Woodruff, Peilin Zhong

We study the ℓ1​-low rank approximation problem, where for a given n×d matrix A and approximation factor α≥1, the goal is to output a rank-k matrix $\wideha…

cs.DS2016★ 5 cited

Fourier-sparse interpolation without a frequency gap

Xue Chen, Daniel M. Kane, Eric Price +1

We consider the problem of estimating a Fourier-sparse signal from noisy samples, where the sampling is done over some interval [0,T] and the frequencies can be "off-grid". Prev…

cs.DS2016★ 1 cited

A Robust Sparse Fourier Transform in the Continuous Setting

Eric Price, Zhao Song

In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete se…

cs.DS2016★ 3 cited

The p-Center Problem in Tree Networks Revisited

Aritra Banik, Binay Bhattacharya, Sandip Das +2

We present two improved algorithms for weighted discrete p-center problem for tree networks with n vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.