◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Cong Fang

32 papers hereh-index 191.8k citations50 works total

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

author position
  • first author8
  • middle author18

Across the 26 of 32 papers where every author was matched, so the position is known.

fields
  • math.OC18
  • cs.LG10
  • cs.AI1
  • cs.CV1
  • math.NA1
  • stat.ML1
same name
  • Cong Fang — 17 papers, h 4
  • Cong Fang — 5 papers, h 3
  • Cong Fang — 4 papers, h 6
  • Cong Fang — 3 papers, h 2
  • Cong Fang — 3 papers, h 3
  • Cong Fang — 3 papers

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
20172026
most citedSPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator

243 citations · 392 across the 23 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

cs.LG2019★ 3 cited

Convex Formulation of Overparameterized Deep Neural Networks

Cong Fang, Yihong Gu, Weizhong Zhang +1

Analysis of over-parameterized neural networks has drawn significant attention in recentyears. It was shown that such systems behave like convex systems under various restrictedset…

cs.LG2019★ 11 cited

Over Parameterized Two-level Neural Networks Can Learn Near Optimal Feature Representations

Cong Fang, Hanze Dong, Tong Zhang

Recently, over-parameterized neural networks have been extensively analyzed in the literature. However, the previous studies cannot satisfactorily explain why fully trained neural…

math.OC2019★ 7 cited

A Stochastic Trust Region Method for Non-convex Minimization

Zebang Shen, Pan Zhou, Cong Fang +1

We target the problem of finding a local minimum in non-convex finite-sum minimization. Towards this goal, we first prove that the trust region method with inexact gradient and Hes…

math.OC2019★ 18 cited

Sharp Analysis for Nonconvex SGD Escaping from Saddle Points

Cong Fang, Zhouchen Lin, Tong Zhang

In this paper, we give a sharp analysis for Stochastic Gradient Descent (SGD) and prove that SGD is able to efficiently escape from saddle points and find an (ε,O(ε0.5))-appr…

◍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.