arXiv (All)
open access
Continuous Optimization for p-adic Models
We present the first method for native, continuous gradient descent for machine learning models with $p$-adic parameters. Existing native optimizers are discrete, mostly combinatorial searches, as the $p$-adic numbers $\mathbb{Q}_p$ are totally disconnected, with standard losses that are flat away f
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
- EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control#1014703
- Optimal Learning Rate Schedules under Functional Scaling Laws: Power Decay and Warmup-Stable-Decay#1109783
- Adaptive Partitioning and Learning for Stochastic Control of Diffusion Processes#925877
- CAGE-NAS: Certified Functional Descent for Efficient Model Growth#1156108
- RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search#329175
Record · ID 1061140
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