User Aryeh

40 votes

What kind of answer does TCS want to the question "Why do neural networks work so well?"

answered Sep 27, 2016 at 19:46

23 votes

Accepted

Correcting a conference paper error in the journal version

answered Apr 24, 2017 at 15:40

20 votes

Automata learning without counterexamples

answered Oct 24, 2018 at 13:23

19 votes

Reviewing a paper and found a better solution

answered Jul 11, 2021 at 19:19

16 votes

Importance of irrational numbers in computer science

answered Jan 21, 2017 at 20:04

13 votes

Accepted

Is it a bad idea to critique someone's paper in my first publication?

answered Sep 22, 2018 at 19:59

12 votes

Is it beneficial to regularly read papers outside your field?

answered Aug 21, 2018 at 0:34

12 votes

Languages that we cannot (dis)prove to be Context-Free

answered Apr 5, 2019 at 12:26

12 votes

How to acknowledge answers of TCS in the paper?

answered Jul 8, 2021 at 8:46

12 votes

Why can machine learning not recognize prime numbers?

answered Jan 11, 2013 at 7:36

11 votes

Functions that are Not Efficiently Computable but Learnable

answered Oct 9, 2017 at 10:25

10 votes

Accepted

How to efficiently read the theoretical computer science research papers?

answered Oct 22, 2019 at 19:24

10 votes

Accepted

Difficulty of "learning" rare instances

answered Aug 7, 2018 at 17:59

8 votes

Single author papers against my advisor's will?

answered Apr 12, 2019 at 6:53

8 votes

Accepted

What was the significance of Leslie Valiant's, "A Theory of the Learnable?"

answered Apr 24, 2019 at 22:35

8 votes

Accepted

Number of minimal DFAs of size at most $m$?

answered Feb 22, 2017 at 9:56

8 votes

Counting occurences of 'a' in a book faster than O(n)?

answered Dec 16, 2014 at 14:02

6 votes

Accepted

Complexity lower bound for regular languages

answered Aug 24, 2011 at 14:41

6 votes

Agnostic PAC sampling lower bound

answered Jan 8, 2013 at 20:19

6 votes

Generalization bounds for multiclass learning when the output is vector space?

answered Feb 29, 2016 at 9:49

6 votes

Accepted

Rademacher complexity and lowerbounds in learning theory

answered Jul 27, 2017 at 4:49

6 votes

Proper PAC learning VC dimension bounds

answered Feb 10, 2018 at 18:46

6 votes

Accepted

Statistical Distance Growth Given K Independent Copies

answered Mar 3, 2019 at 11:39

6 votes

Accepted

What's the intuition behind Rademacher complexity?

answered Nov 18, 2020 at 13:56

6 votes

Accepted

Can we efficiently convert from NFA to smallest equivalent DFA?

answered Mar 22, 2021 at 22:07

5 votes

Accepted

Is there an equivalent to VC-dimension for density estimation as opposed to classification?

answered Oct 18, 2020 at 21:37

5 votes

Full names of C. K. Chow and C. N. Liu

answered Nov 21, 2021 at 11:27

5 votes

What are some good resources for strengthening my theoretical foundation for machine learning?

answered Sep 23, 2019 at 18:51

5 votes

Accepted

Understanding the No Free Lunch Theorem

answered Nov 22, 2017 at 13:48

5 votes

Textbook/resources for a beginning researcher in (Machine) Learning Theory

answered Jul 12, 2017 at 14:40

Stack Exchange Network

150 Answers

What kind of answer does TCS want to the question "Why do neural networks work so well?"

Correcting a conference paper error in the journal version

Automata learning without counterexamples

Reviewing a paper and found a better solution

Importance of irrational numbers in computer science

Is it a bad idea to critique someone's paper in my first publication?

Is it beneficial to regularly read papers outside your field?

Languages that we cannot (dis)prove to be Context-Free

How to acknowledge answers of TCS in the paper?

Why can machine learning not recognize prime numbers?

Functions that are Not Efficiently Computable but Learnable

How to efficiently read the theoretical computer science research papers?

Difficulty of "learning" rare instances

Single author papers against my advisor's will?

What was the significance of Leslie Valiant's, "A Theory of the Learnable?"

Number of minimal DFAs of size at most $m$?

Counting occurences of 'a' in a book faster than O(n)?

Complexity lower bound for regular languages

Agnostic PAC sampling lower bound

Generalization bounds for multiclass learning when the output is vector space?

Rademacher complexity and lowerbounds in learning theory

Proper PAC learning VC dimension bounds

Statistical Distance Growth Given K Independent Copies

What's the intuition behind Rademacher complexity?

Can we efficiently convert from NFA to smallest equivalent DFA?

Is there an equivalent to VC-dimension for density estimation as opposed to classification?

Full names of C. K. Chow and C. N. Liu

What are some good resources for strengthening my theoretical foundation for machine learning?

Understanding the No Free Lunch Theorem

Textbook/resources for a beginning researcher in (Machine) Learning Theory