跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 03:57 — 2026-11-22 03:57(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
新论文 · v1arXiv:2611.25822

Limits of local curvature for constructing search subspaces in segmentation models

Maxim Bolshim, Alexander Kugaevskikh

原文摘要

We examine how well subspaces constructed from local curvature represent the change in the gradient update field after a finite step in semantic segmentation models. The local response is the action of the curvature operator on the actual input displacement. In a study of 50 images and two models, we measure the ratio of the loss increase attained in a fixed subspace to that attained in the full space. This ratio decreases as the search radius increases. On ten images from the same sample, we compare the one-dimensional subspace spanned by the initial gradient with two rank-16 subspaces for both models. The two equal-rank subspaces are assessed at the same initial states, using the same actual steps and measured vectors. Adding generalised Gauss-Newton directions to the initial gradient reduces the mean relative error in representing the field change from 0.922 to 0.874 for the first model and from 0.819 to 0.763 for the second. At the same rank, including the response direction for the initial gradient nearly eliminates the error in representing the local response. The mean error in representing the field change does not decrease. A decomposition with fixed pixel weights shows that the finite-step remainder is comparable in norm to the field change and makes the largest diagonal contribution to the squared projection error of the field after the step. Evaluation of a search subspace should measure how accurately it represents the field change and the local response.

cs.CV · cs.LG

版本更新 · v3arXiv:2611.01335

Profile-aware assessment of block-diagonal Hessian approximations in neural networks

Maxim Bolshim, Alexander Kugaevskikh

原文摘要

Evaluating block-diagonal curvature models in neural networks involves two questions: how much curvature they omit, and what a specific correction changes at a finite step. We measure the squared off-block fraction of the parameter Hessian against references for group sizes and the observed within-group curvature profile. In CIFAR-100 ResNet-18 and a skip-free counterpart, similar initial discarded fractions accompany different profiles. At saved trained ResNet-18 weights, changing from stage to layer groups moves estimated off-block mass from below to above the profile reference. An approximate assessment of probe uncertainty conditional on fixed weights and inputs resolves this crossing; some skip-free comparisons remain unresolved. Separately, in nine saved ResNet-50/Stanford Cars states from three training seeds, we compare candidates formed from off-group Hessian action, the remaining model residual and their combination. For each state, we construct two full-Hessian-informed maps on separate geometry draws. Within each draw, all three inputs share one map. At unit scale off-group input alone raises evaluated minibatch loss relative to the base preconditioner candidate in 17 of 18 state/draw comparisons, yet the combined candidate has lower loss than the remainder-only candidate in nine of those cases; preferences vary with scale and correction-norm matching. The profiles help assess block models and alternative groupings, while same-state candidate comparisons test a particular correction without equating structural mass with training gain.

cs.LG

版本更新 · v2arXiv:2604.11639

Inter-Layer Hessian Analysis of Neural Networks with DAG Architectures

Maxim Bolshim, Alexander Kugaevskikh

原文摘要

Automatic differentiation computes loss Hessians, while interpreting inter-layer interactions requires an explicit choice of graph-indexed blocks. This paper presents an analytical formalism that decomposes the full Hessian into blocks indexed by the DAG of an architecture. The standard decomposition $H = H^{GN} + H^T$ separates the Gauss-Newton component (positive semidefinite for a convex output loss) from the tensor component (residual curvature). If every node map is locally affine in its parent activations, the tensor component of the input Hessian vanishes on each smooth cell ($H^{T}_{v,w}=0$, $H^f_{v,w}=H^{GN}_{v,w}$); ReLU activations alone do not suffice. The full parametric Hessian contains residual terms that do not reduce to the GGN. Building on this decomposition, we use diagnostic metrics (inter-layer resonance $\mathcal{R}$, geometric coupling $\mathcal{C}$, stable rank $\mathcal{D}$, GN-Gap) with stochastic HVP-based estimates whose cost depends on graph evaluation and the number of probes. The theoretical analysis gives conditional bounds on curvature decay and residual-chain transport; empirical examples span fully connected MLPs (Exp. 1-5) and convolutional architectures (ResNet-18, ${\sim}11$M parameters, Exp. 6). When the architecture reduces to a single node, all definitions collapse to the standard Hessian $\nabla^2_θ\mathcal{L}(θ)\in\mathbb{R}^{p\times p}$. Archival correction. The original general novelty claims are no longer maintained: general DAG-Hessian calculus has prior precedents. This is a corrected archival version.

cs.LG