Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchMachine learning

analiza aiqbench

This paper delivers a rigorous, bounded negative result for a specific scalar-based implementation of domain-specific curvature in domain generalization, showing no statistically significant advantage over standard Empirical Risk Minimization across four benchmark datasets. The study clarifies that while the concept of leveraging geometric curvature is theoretically appealing, this particular Euclidean rescaling approach does not outperform baseline methods and fails to refute genuine hyperbolic representation learning claims.
Surse care acoperăarXiv, terrytao.wordpress.com
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

A Controlled Evaluation of Curvature Inspired Scalar Feature Scaling for Domain Generalization

arXiv3 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2610.18227v1 Announce Type: cross Abstract: Domain-specific curvature is an appealing idea for domain generalization (DG), but curvature learning can denote substantially different computations. This paper evaluates one deliberately narrow implementation: the code calls it HyperDG, but it rescales Euclidean encoder features during training by learned positive scalars and uses an ordinary linear classifier on unscaled Euclidean features at inference. It does not implement a Lorentz or Poincar\'e representation, geodesic prediction, or a Sharpness-Aware Minimization inner loop. We audit the executed objective and evaluate six conditions on PACS, VLCS, Office Home, and TerraIncognita. The completed design contains 384 runs: six conditions, four held-out targets, and four run seeds per dataset. Checkpoints are selected using only the three source-validation environments. Inference first averages paired seed differences within each held-out target; targets, rather than 16 seed-by-target observations, are the per-dataset clusters. The full implementation's equal-dataset macro point estimate is 1.61 percentage points below native DomainBed ERM (95% clustered CI [-3.17, -0.04]). All four dataset point estimates favor ERM, but an exact four-dataset sign-flip test gives p = .125 and Holm-adjusted p = .250; we therefore claim no adjusted evidence of a difference. The cleaner domain-specificity contrast, separate learned source scales without their variance penalty versus one shared learned source scale, is -0.13 pp (95% CI [-0.53, 0.27]). Its 90% CI lies within a revision-stage $\pm 1$ pp smallest effect of practical interest (TOST p = .003), supporting equivalence only for the source-selected suite macro, not every dataset, target, or final-step endpoint. The study thus supplies a bounded negative result for this scalar training package; it does not test or refute genuine hyperbolic representation learning.

Abstract:Domain-specific curvature is an appealing idea for domain generalization (DG), but curvature learning can denote substantially different computations. This paper evaluates one deliberately narrow implementation: the code calls it HyperDG, but it rescales Euclidean encoder features during training by learned positive scalars and uses an ordinary linear classifier on unscaled Euclidean features at inference. It does not implement a Lorentz or Poincaré representation, geodesic prediction, or a Sharpness-Aware Minimization inner loop. We audit the executed objective and evaluate six conditions on PACS, VLCS, Office Home, and TerraIncognita. The completed design contains 384 runs: six conditions, four held-out targets, and four run seeds per dataset. Checkpoints are selected using only the three source-validation environments. Inference first averages paired seed differences within each held-out target; targets, rather than 16 seed-by-target observations, are the per-dataset clusters. The full implementation's equal-dataset macro point estimate is 1.61 percentage points below native DomainBed ERM (95% clustered CI [-3.17, -0.04]). All four dataset point estimates favor ERM, but an exact four-dataset sign-flip test gives p = .125 and Holm-adjusted p = .250; we therefore claim no adjusted evidence of a difference. The cleaner domain-specificity contrast, separate learned source scales without their variance penalty versus one shared learned source scale, is -0.13 pp (95% CI [-0.53, 0.27]). Its 90% CI lies within a revision-stage $\pm 1$ pp smallest effect of practical interest (TOST p = .003), supporting equivalence only for the source-selected suite macro, not every dataset, target, or final-step endpoint. The study thus supplies a bounded negative result for this scalar training package; it does not test or refute genuine hyperbolic representation learning.

Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV)

I.2.6; C.1.4; D.1.3; I.5.1; H.3.4; I.2.10; I.4.0; I.4.1; I.4.2; I.4.6; I.4.7; I.4.8; I.4.9; I.4.10; I.5.1; I.5.2; I.5.4; J.2; I.2.11; I.2.10

arXiv:2610.18227 [cs.LG]

(or arXiv:2610.18227v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.18227 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 389 cuvinte

Subiecte conexe