DiscoverDCP: A Data-Driven Approach for Construction of Disciplined Convex Programs via Symbolic Regression

Sveinung Myhre
12/3/2025
cs.LGcs.AIeess.SY

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We propose DiscoverDCP, a data-driven framework that integrates symbolic regression with the rule sets of Disciplined Convex Programming (DCP) to perform system identification. By enforcing that all discovered candidate model expressions adhere to DCP composition rules, we ensure that the output expressions are globally convex by construction, circumventing the computationally intractable process of post-hoc convexity verification. This approach allows for the discovery of convex surrogates that exhibit more relaxed and accurate functional forms than traditional fixed-parameter convex expressions (e.g., quadratic functions). The proposed method produces interpretable, verifiable, and flexible convex models suitable for safety-critical control and optimization tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{myhre2025discoverdcp,
  title  = {DiscoverDCP: A Data-Driven Approach for Construction of Disciplined Convex Programs via Symbolic Regression},
  author = {Sveinung Myhre},
  year   = {2025},
  eprint = {2512.15721},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.15721v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.15721.svg)](https://codeofpaper.com/paper/2512.15721)

Discussion