Brand, C., Koutecký, M., and Ordyniak, S. Parameterized algorithms for milps with small treedepth. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 12249-12257. AAAI Press, 2021. URL https://ojs.aaai.org/index.php/AAAI/article/view/17454.
Bulatov, A. A. A dichotomy theorem for nonuniform csps. In Umans, C. (ed.), 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 319-330. IEEE Computer Society, 2017. doi: 10.1109/FOCS.2017.37. URL https://doi.org/10.1109/FOCS.2017.37.
Cohen, N., Sharir, O., and Shashua, A. On the expressive power of deep learning: A tensor analysis. In Feldman, V., Rakhlin, A., and Shamir, O. (eds.), Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016, volume 49 of JMLR Workshop and Conference Proceedings, pp. 698-728. JMLR.org, 2016. URL http://proceedings.mlrpress/v49/cohen16.html.
Courcelle, B. The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput., 85(1):12-75, 1990. doi: 10.1016/0890-5401(90)90043-H. URL https://doi.org/10.1016/0890-5401(90)90043-H.
Courcelle, B. and Engelfriet, J. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, volume 138 of Encyclopedia of mathematics and its applications. Cambridge University Press, 2012. ISBN 978-0-521-89833-1. URL http://www.cambridge.org/fr/knowledge/isbn/item5758776/?site_location=fr_FR.
Cowley, B. and Pillow, J. W. High-contrast "gaudy" images improve the training of deep neural network models of visual cortex. In Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., and Lin, H. (eds.), Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual, 2020. URL https://proceedings.neurips.cc/paper/2020/bit/610a13de080fb8df6cf972fc01ad93f-AAbstract.html.
Dahiya, Y., Fomin, F. V., Panolan, F., and Simonov, K. Fixed-parameter and approximation algorithms for PCA with outliers. In Meila, M. and Zhang, T. (eds.), Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event, volume 139 of Proceedings of Machine Learning Research, pp. 2341-2351. PMLR, 2021. URL http://proceedings.mlr.press/v139/duhiya21b.html.
Dey, S. S., Wang, G., and Xie, Y. Approximation algorithms for training one-node relu neural networks. IEEE Trans. Signal Process., 68:6696-6706, 2020. doi: 10.1109/TSP.2020.3039360. URL https://doi.org/10.1109/TSP.2020.3039360.
Diestel, R. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012. ISBN 978-3-642-14278-9.
Edelsbrunner, H., O'Rourke, J., and Seidel, R. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., 15(2):341-363, 1986. doi: 10.1137/0215024. URL https://doi.org/10.1137/0215024.
Eldan, R. and Shamir, O. The power of depth for feedforward neural networks. In Feldman, V., Rakhlin, A., and Shamir, O. (eds.), Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016, volume 49 of JMLR Workshop and Conference Proceedings, pp. 907-940. JMLR.org, 2016. URL http://proceedings.mlr.press/v49/eldan16.html.
Frank, A. and Tardos, É. An application of simultaneous diophantine approximation in combinatorial optimization. 7(1):49-65, 1987.
Froese, V. and Hertrich, C. Training neural networks is np-hard in fixed dimension. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, 2023. URL https://doi.org/10.48550/arXiv.2303.17045. to appear.