Under independence and tail conditions on random symmetric matrices, the DNN relaxation of the standard quadratic program is exact with probability tending to 1, the optimizer is unique and rank one, and recoverable in O(n^2) time.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
In-context symbolic regression methods improve robustness of symbolic formula recovery from KANs, cutting median OFAT test MSE by up to 99.8 percent across hyperparameter sweeps.
citing papers explorer
-
Exactness of the DNN Relaxation for Random Standard Quadratic Programs
Under independence and tail conditions on random symmetric matrices, the DNN relaxation of the standard quadratic program is exact with probability tending to 1, the optimizer is unique and rank one, and recoverable in O(n^2) time.
-
In-Context Symbolic Regression for Robustness-Improved Kolmogorov-Arnold Networks
In-context symbolic regression methods improve robustness of symbolic formula recovery from KANs, cutting median OFAT test MSE by up to 99.8 percent across hyperparameter sweeps.