arXiv (All)
open access
Self-Supervised Combinatorial Optimization with Constraints via Frank-Wolfe
Self-supervised learning for combinatorial optimization has emerged as a promising paradigm for solving discrete optimization problems with neural networks, but a central challenge remains: handling hard combinatorial constraints within continuous, gradient-based training. Continuously extending com
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Task-Aware Hybrid QUBO Optimization for Structured Neural Network Pruning#1036921
- Fast Multi-objective RNA Optimization with Autoregressive Reinforcement Learning#381665
- DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding Spaces#179168
- Gauge-Equivariant Graph Neural Networks for Lattice Gauge Theories#124039
- A sequential regularized piecewise affine algorithm for nonconvex nonsmooth multicomposite optimization in RNN training#1012515
Record · ID 1061362
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive