Network profile

gradstudent

Reputation

1,431

Top tag

cc.complexity-theory

2,000 Rep.

Edit questions and answers

Yearling

0/1

0 posts edited

0 helpful flags

14 votes cast

10	When is the duality gap of semidefinite programming (SDP) zero?
7	About assumptions needed to get convergence of stochastic gradient methods on non-convex objectives
7	What are the hardness results known for CSP over $\mathbb{F}_q$?
6	Are there generalizations for Chow's theorem?
6	Looking for an easy/pedantic exposition of Renegar's famous result on polynomial optimization

View more →

+30	Examples of learning via exactly integrable gradient flows
+10	Is there a gap between weak learning and PAC-learning?
+8	What is an example of a hard learning problem in the noisily realizable setting?
+10	About learning a single Gaussian in total-variation distance

View more →

This user has not answered any questions

View more →

This user has no bookmarked questions.

MathOverflow	1,898 rep	7 silver badges22 bronze badges
Theoretical Computer Science	1,431 rep	5 silver badges12 bronze badges
Computer Science	493 rep	2 silver badges8 bronze badges
Mathematics	337 rep	2 silver badges11 bronze badges
Cross Validated	251 rep	2 silver badges9 bronze badges