Reproduce “Handling Hard Affine SDP Shape Constraints in RKHSs” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Pierre-Cyril Aubin-Frankowski, Zoltan Szabo
The authors develop a kernel method for enforcing derivative-based shape constraints across a covered continuous domain. It uses finitely many anchor points and a kernel-derived margin bounding between-point variation, producing a finite convex optimization with a whole-domain guarantee under stated assumptions. The cavern example stays within bounds; robotic-arm tests show lower sampled errors and violations than discretization, but longer runtime.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.