Fetching the paper…
Reading the bibliography…
We investigate a principled approach for symbolic operation completion (SOC), a minimal task for studying symbolic reasoning.
Implicit Regularization in Deep Matrix Factorization
Arora, S., Cohen, N., Hu, W., and Luo, Y. (2019) · 1905
Earlier work this paper cites.
A Theory of Truth and Semantic Representation
Kamp, H. (1981) · 1981
Earlier work this paper cites.
The Semantics of Definite and Indefinite Noun Phrases
Heim, I. R. (1982) · 1982
Earlier work this paper cites.
Tensor Product Variable Binding and the Representation of Symbolic Structures in Connectionist Systems
Smolensky, P. (1990) · 1990
Earlier work this paper cites.
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., and Boyd, S. (2001) · 2001
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S. and Monteiro, R. D. (2003) · 2003
Earlier work this paper cites.
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J., and Jaakkola, T. (2004) · 2004
Earlier work this paper cites.
Exact Matrix Completion via Convex Optimization
Candès, E. J. and Recht, B. (2009) · 2009
Cited alongside, same era.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., and Parrilo, P. A. (2010) · 2010
Cited alongside, same era.
Semantic Compositionality through Recursive Matrix-Vector Spaces
Socher, R., Huval, B., Manning, C. D., and Ng, A. Y. (2012) · 2012
Cited alongside, same era.
Zhao, Q., Zhou, G., Xie, S., Zhang, L., and Cichocki, A. (2016) · 2016
Cited alongside, same era.
Implicit Regularization in Matrix Factorization
Gunasekar, S., Woodworth, B. E., Bhojanapalli, S., Neyshabur, B., and Srebro, N. (2017) · 2017
Cited alongside, same era.
Multiplicative Interactions and Where to Find Them
Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges
Bronstein, M. M., Bruna, J., Cohen, T., and Veličković, P. (2021) · 2021
Later among the works it cites.
Towards Understanding Grokking: An Effective Theory of Representation Learning
Liu, Z., Kitouni, O., Nolte, N., Michaud, E. J., Tegmark, M., and Williams, M. (2022) · 2022
Later among the works it cites.
Progress measures for grokking via mechanistic interpretability
Nanda, N., Chan, L., Lieberum, T., Smith, J., and Steinhardt, J. (2022) · 2022
Later among the works it cites.
Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets
Power, A., Burda, Y., Edwards, H., Babuschkin, I., and Misra, V. (2022) · 2022
Later among the works it cites.
Neural Networks Learn Representation Theory: Reverse Engineering how Networks Perform Group Operations
Chughtai, B., Chan, L., and Nanda, N. (2023) · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jayakumar, S. M., Czarnecki, W. M., Menick, J., Schwarz, J., Rae, J., Osindero, S., Teh, Y. W., Harley, T., and Pascanu, R. (2020) · 2020
Cited alongside, same era.
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J. and Tao, T. (2010) · 2080
Closest in time.