arXiv Machine Learning
Continuous Optimization for p-adic Models
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 4
Simplified Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients
arXiv:2209. 03282v5 Announce Type: replace-cross Abstract: Accelerating the convergence of second-order optimization, particularly Newton-type methods, remains a pivotal challenge in algorithmic research.
arXiv AI
Jul 29
CIFNet: An Analytic Neural Learning Framework for Efficient and Calibrated Class-Incremental Learning
arXiv:2509. 11285v2 Announce Type: replace-cross Abstract: Class-Incremental Learning (CIL) in deep neural networks is conventionally framed as an iterative gradient-based optimization problem, incurring high computational cost, hyperparameter sensitivity, and risk of catastrophic forgetting.
arXiv AI
Jun 9
Internalizing Geometric Law: Learning from Solver Residuals for Precision-Critical Generation
arXiv:2606. 09278v1 Announce Type: cross Abstract: Large Language Models frequently hallucinate in precision-critical domains such as technical diagramming and mechanical design, where outputs must satisfy strict geometric constraints.
arXiv AI
Sep 10
Mathematical Programming in Machine Learning and Artificial Intelligence: A Unified Taxonomy of Models and Applications
The paper presents a unified taxonomy that classifies machine‑learning and artificial‑intelligence applications according to mathematical programming paradigms such as linear, quadratic, mixed‑integer, conic, bilevel, and others. It standardizes notation, identifies key inputs, decision variables, and principal formulations for each application, and discusses structural properties, solution strategies, and limitations. The authors compare tractability, relaxation quality, decomposition, approximation guarantees, and scalability across paradigms, emphasizing that mathematical programming serves as a disciplined interface between predictions and constrained decisions rather than a universal modeling claim.
arXiv Statistics ML
Aug 25
Q-Learning with Stable Infinite-Dimensional Linear Function Approximation
arXiv:2608.22636v1 Announce Type: cross Abstract: Q-learning with linear function approximation can be unstable because an arbitrary approximation architecture need not preserve the Bellman contracti...
arXiv Machine Learning
Jun 2
Multigrade Neural Network Approximation
arXiv:2601. 16884v3 Announce Type: replace Abstract: We study multigrade deep learning (MGDL) as a principled framework for structured error refinement in deep neural networks.