Exploring the non-convexity in machine learning using quantum-inspired optimization

概要

arXiv:2605.07947v1 Announce Type: cross Abstract: The escalating complexity of modern machine learning necessitates solving challenging non-convex optimization problems, particularly in high-dimensional regimes and scenarios contaminated by gross outliers. Traditional approaches, relying on convex …