arXiv (OAI Expanded)
open access
Learning to Optimize by Differentiable Programming
Solving massive-scale optimization problems requires scalable first-order methods with low per-iteration cost. This tutorial highlights a shift in optimization: using differentiable programming not only to execute algorithms but to learn how to design them. Modern frameworks such as PyTorch, TensorF
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
- Learning to Optimize by Differentiable Programming#798738
- Nora: Normalized Orthogonal Row Alignment for Scalable Matrix Optimizer#155302
- GPU-Accelerated Presolving for Linear Programming#1110560
- Unleashing the Power of Equality Saturation for Tensor Program Superoptimization#1000287
- KATOsuper: Surrogate-accelerated neural topology optimization with sensitivity-consistent Fourier neural operators#1063427
Record · ID 797324
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