-
Notifications
You must be signed in to change notification settings - Fork 0
/
literature.bib
241 lines (220 loc) · 7.61 KB
/
literature.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
@misc{Guingona,
author = {Vincent Guingona},
title = {NIP Theories and Computational Learning Theory},
year = 2013,
howpublished = "\url{https://tigerweb.towson.edu/vguingona/NIPTCLT.pdf}",
}
@misc{Chernikov,
author = {Artem Chernikov},
title = {Topics in combinatorics},
year = 2016,
howpublished = "\url{https://www.math.ucla.edu/~chernikov/teaching/Combinatorics285N/CombinatoricsNotes.pdf}",
}
@misc{Chernikov2,
author = {Artem Chernikov},
title = {LECTURE NOTES ON STABILITY THEORY},
year = 2015,
howpublished = "\url{https://www.math.ucla.edu/~chernikov/teaching/StabilityTheory285D/StabilityNotes.pdf}",
}
@article{blumer1989learnability,
title={Learnability and the Vapnik-Chervonenkis dimension},
author={Blumer, Anselm and Ehrenfeucht, Andrzej and Haussler, David and Warmuth, Manfred K},
journal={Journal of the ACM (JACM)},
volume={36},
number={4},
pages={929--965},
year={1989},
publisher={ACM New York, NY, USA}
}
@article{goldberg1993bounding,
title={Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers},
author={Goldberg, Paul and Jerrum, Mark},
booktitle={Machine Learning},
pages={131–-148},
year={1995}
}
@book{surveysCombinatorics,
title = {Surveys in Combinatorics 1987: Invited Papers for the Eleventh British Combinatorial Conference},
author = {C. Whitehead},
publisher = {Cambridge University Press},
isbn = {0521348056; 9780521348058},
year = {1987},
series = {London Mathematical Society Lecture Notes Series, 123},
}
@book{ShalevShwartz2014,
title = {Understanding Machine Learning: From Theory to Algorithms},
ISBN = {9781107298019},
url = {http://dx.doi.org/10.1017/CBO9781107298019},
DOI = {10.1017/cbo9781107298019},
publisher = {Cambridge University Press},
author = {Shalev-Shwartz, Shai and Ben-David, Shai},
year = {2014},
month = may
}
@book{Shelah1990,
title = {Classification Theory and the number of non-isomorphic models},
publisher = {North-Holland, 1978. Revised edition},
author = {Shelah, Saharon},
year = {1990},
}
@book{vidyasagar2013learning,
title={Learning and generalisation: with applications to neural networks},
author={Vidyasagar, Mathukumalli},
year={2013},
publisher={Springer Science \& Business Media}
}
@article {Laskowski1992,
AUTHOR = {Laskowski, Michael C.},
TITLE = {Vapnik-{C}hervonenkis classes of definable sets},
JOURNAL = {J. London Math. Soc. (2)},
FJOURNAL = {Journal of the London Mathematical Society. Second Series},
VOLUME = {45},
YEAR = {1992},
NUMBER = {2},
PAGES = {377--384},
MRCLASS = {03C45 (03E15 60A10 60F05)},
MRNUMBER = {1171563},
}
@article {Pillay1986,
AUTHOR = {Pillay, Anand and Steinhorn, Charles},
TITLE = {Definable sets in ordered structures. {I}},
JOURNAL = {Trans. Amer. Math. Soc.},
FJOURNAL = {Transactions of the American Mathematical Society},
VOLUME = {295},
YEAR = {1986},
NUMBER = {2},
PAGES = {565--592},
ISSN = {0002-9947},
MRCLASS = {03C45 (03C40 03C50 06F99)},
MRNUMBER = {833697},
MRREVIEWER = {A. M. W. Glass},
DOI = {10.2307/2000052},
URL = {https://doi.org/10.2307/2000052},
}
@article {Shelah1971,
AUTHOR = {Shelah, Saharon},
TITLE = {Stability, the f.c.p., and superstability; model theoretic
properties of formulas in first order theory},
JOURNAL = {Ann. Math. Logic},
FJOURNAL = {Annals of Mathematical Logic},
VOLUME = {3},
YEAR = {1971},
NUMBER = {3},
PAGES = {271--362},
ISSN = {0003-4843},
MRCLASS = {02H05},
MRNUMBER = {317926},
MRREVIEWER = {A. H. Lachlan},
DOI = {10.1016/0003-4843(71)90015-5},
URL = {https://doi.org/10.1016/0003-4843(71)90015-5},
}
@article{chase2019model,
title={Model theory and machine learning},
author={Chase, Hunter and Freitag, James},
journal={Bulletin of Symbolic Logic},
volume={25},
number={3},
pages={319--332},
year={2019},
publisher={Cambridge University Press}
}
@book{Anthony1999,
title = {Neural Network Learning: Theoretical Foundations},
ISBN = {9780511624216},
url = {http://dx.doi.org/10.1017/CBO9780511624216},
DOI = {10.1017/cbo9780511624216},
publisher = {Cambridge University Press},
author = {Anthony, Martin and Bartlett, Peter L.},
year = {1999},
month = nov
}
@misc{malliaris2023unstableformulatheoremrevisited,
title={The unstable formula theorem revisited via algorithms},
author={Maryanthe Malliaris and Shay Moran},
year={2023},
eprint={2212.05050},
archivePrefix={arXiv},
primaryClass={math.LO},
url={https://arxiv.org/abs/2212.05050},
}
@inproceedings{Alon2019,
series = {STOC ’19},
title = {Private PAC learning implies finite Littlestone dimension},
url = {http://dx.doi.org/10.1145/3313276.3316312},
DOI = {10.1145/3313276.3316312},
booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
publisher = {ACM},
author = {Alon, Noga and Livni, Roi and Malliaris, Maryanthe and Moran, Shay},
year = {2019},
month = jun,
collection = {STOC ’19}
}
@inproceedings{Manurangsi,
doi = {10.4230/LIPICS.ITCS.2023.85},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.85},
author = {Manurangsi, Pasin},
keywords = {VC Dimension, Littlestone’s Dimension, Maximum Biclique, Hardness of Approximation, Fine-Grained Complexity, Theory of computation → Problems, reductions and completeness},
language = {en},
title = {Improved Inapproximability of VC Dimension and Littlestone’s Dimension via (Unbalanced) Biclique},
publisher = {Schloss Dagstuhl – Leibniz-Zentrum f\"{u}r Informatik},
year = {2023},
copyright = {Creative Commons Attribution 4.0 International license}
}
@article {Bhaskar2021,
AUTHOR = {Bhaskar, Siddharth},
TITLE = {Thicket density},
JOURNAL = {J. Symb. Log.},
FJOURNAL = {The Journal of Symbolic Logic},
VOLUME = {86},
YEAR = {2021},
NUMBER = {1},
PAGES = {110--127},
MRCLASS = {03C45},
MRNUMBER = {4282700},
MRREVIEWER = {Alexandre Ivanov},
}
@book{Wasserman2004,
title = {All of Statistics: A Concise Course in Statistical Inference},
ISBN = {9780387217369},
ISSN = {2197-4136},
url = {http://dx.doi.org/10.1007/978-0-387-21736-9},
DOI = {10.1007/978-0-387-21736-9},
journal = {Springer Texts in Statistics},
publisher = {Springer New York},
author = {Wasserman, Larry},
year = {2004}
}
@article{littlestone1988learning,
title={Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm},
author={Littlestone, Nick},
journal={Machine learning},
volume={2},
pages={285--318},
year={1988},
publisher={Springer}
}
@book {hodges,
AUTHOR = {Hodges, Wilfrid},
TITLE = {A shorter model theory},
PUBLISHER = {Cambridge University Press, Cambridge},
YEAR = {1997},
MRCLASS = {03Cxx (03-01)},
MRNUMBER = {1462612},
MRREVIEWER = {J. M. Plotkin},
}
@book {vanDenDries,
AUTHOR = {van den Dries, Lou},
TITLE = {Tame topology and o-minimal structures},
SERIES = {London Mathematical Society Lecture Note Series},
VOLUME = {248},
PUBLISHER = {Cambridge University Press, Cambridge},
YEAR = {1998},
PAGES = {x+180},
ISBN = {0-521-59838-9},
MRCLASS = {03-02 (03C50 03C60 14P10 52-02 54-02 55-02 57-02)},
MRNUMBER = {1633348},
MRREVIEWER = {O. V. Belegradek},
DOI = {10.1017/CBO9780511525919},
URL = {https://doi.org/10.1017/CBO9780511525919},
}