Searcharxiv⌕ Search

arXiv subjects

Keisuke Hara

Publications and source records attributed to Keisuke Hara.

10 recordsLinked to original sources

Conditional stopping guarantees for a folded parametrization of reduced Stokes vectors

Stopping decisions made in parametrization coordinates need not certify physically accurate estimates. We establish conditional stopping guarantees for a folded parametrization of reduced Stokes vectors, including partial linear polarization. For strongly convex physical objectives on the bounded-intensity inner sheet, normalized first derivatives and one radial lower-curvature test give an explicit objective-gap bound with sharp tolerance orders $\varepsilon^{4/3}+ν^2$. The guarantee requires neither prior localization near an optimum nor a positive-semidefinite head Hessian. Its information basis is an exact recovery identity: one signed radial curvature restores the physical-gradient component lost at the fully linearly polarized fold, without stationarity or knowledge of the physical Hessian. For a nominal quadratic model, an outward-rounded implementation certifies a gap of at most $10^{-6}$ for 8,861 of 9,284 stored endpoints; it rejects all 295 historical false successes and 128 accurate endpoints. The full 128-fractional-bit pass takes 7.32 seconds and includes 52 scalar curvature evaluations. Controlled fits and released observations distinguish stopping certification from local fold diagnosis and subsequent coordinate repair. Twenty shared-network fits contain no saved near-fold negative-curvature candidates, and direct physical solvers are cheaper on the tested quadratics.

physics.optics↗

Exact Fusion of Softmax Attention Heads Can Require Exponentially Many Atoms

Fusing independently normalized attention heads can increase the number of explicit key-value entries, or atoms, needed to preserve their output. We prove a sharp separation for $W_d(q)=\sum_{j=1}^dσ(q_j)$: its $d$ two-atom heads use $2d$ head-atom terms, whereas its minimum single-head representation has exactly $2^d$ atoms, even with arbitrary fixed replacement keys, scalar values, and positive masses. The same lower bound holds for every fixed uniform error below $1/2$ on $\mathbb R^d$, and the threshold is sharp. The proof uses exposed-key normal cones; exact equality on any nonempty open query domain inherits the bound. The resulting atom bound for a fixed head count is tight when that count divides $d$. A normalized family retains its exponential exact minimum while approaching a constant on fixed-radius query balls. For pretrained-model caches, a classical affine-rank bound and a certified instance exclude exact vector preservation at a specified atom count. Learned-cache comparisons on two disjoint banks of 64 contexts show budget-dependent reversals and calibration effects.

cs.LG↗

From Candidate Admission to Task-Level Return: Auditing LLM-Generated Code under Execution Contracts

Admission rules retain generated programs, whereas selection policies return one candidate per task. We audit how these decisions interact with execution contracts in two separately frozen, disjoint HumanEvalPlus cohorts, each comprising 32 tasks, four samples per task per profile and two served profiles. Under the inline execution contract, a structural-and-self-test screen admits 4-9 expanded-suite nonpasses per 80-107 admissions and excludes 14-43 suite passes per 128 planned attempts. A restricted module-supply condition adds 20 and 14 passing admissions for one profile in the respective cohorts, plus one follow-up nonpass, and reduces the excluded suite passes to 14-23. All fixed first-admitted outcomes and abstentions remain unchanged. In the original pool, the added passes enter already all-passing admitted pools; in the follow-up, four of 24 common sample orders lose one passed task. Selected-subset diagnostics separately address registration-sensitive completion and reference-relative assertion disagreement, accounting for input domains and comparator tolerances. In these high-pass pools, candidate retention and task-level return diverge and are reported separately. Results are conditional on the saved pools, contracts and pinned suites; downstream training effects are unmeasured.

cs.SE↗

LLM Judges Have Dark Current: Stratified Null and Utility Tests for LLM Judge Reliability

Passing an exact-clone null gate does not entail passing a matched target-selection utility gate. We call a non-tie preference between exact duplicates dark current. On 102 prespecified fresh RewardBench 2 rows, all four configuration--criterion cells report 0/102 clone preferences. Both neutral utility arms pass, but strict utility lower bounds of .539 and .745 miss the .75 working threshold. Conversely, re-evaluation of the same rows on two additional configurations yields a neutral gpt-oss utility pass with 2/102 clone preferences, leaving low-null behavior uncertified. A separately frozen 485-row extension passes both aggregate working gates under both criteria on one local raw-text configuration, yet strict Precise Instruction Following (Precise IF) alignment is 58/154 (.377). Thus matched null and utility results can diverge, and aggregate passage can coexist with weak subset alignment. Interpretation is conditional on the declared configurations, fixed source mixtures, source-label targets, and study-specific working models. The bounds are marginal, the subset rate is descriptive, and non-certification does not prove a defect.

cs.CL↗

Light-induced spin-polarized desorption of Rb atoms from Co surfaces

The spin polarization of Rb atoms undergoing light-induced desorption from a spin-polarized Co (110) surface was investigated. Desorption induced by pulsed UV-light irradiation was driven by a non-thermal mechanism and the spins of the desorbed Rb atoms were polarized. This implies spin transfer between the surface and the adsorbate during desorption.

physics.atom-ph↗

Aharanov-Bohm Type Arbitrage and Homological Obstructions in Financial Markets

We introduce a simplicial and categorical formulation of Aharonov--Bohm (AB) type arbitrage in filtered market systems. Given a filtration modeled as a contravariant functor $F : \mathcal T^{op} \to \mathbf{Prob},$ we consider the associated conditional expectation transport functor $\mathcal E \circ F : \mathcal T^{op} \to \mathbf{Ban},$ and the canonical distortion $dF(i) := (\mathcal E \circ F)(i)(1),$ which measures the failure of constant functions to be preserved under non-measure-preserving transitions. Motivated by the multiplicative transport structure of $dF$, we introduce a simplicial distortion operator defined recursively on the nerve $N_\bullet(\mathcal T)$ of the time category. This construction describes recursively accumulated transported distortions along composable chains of morphisms and leads naturally to a notion of holonomy along loops. We interpret non-trivial holonomy as a global observable invisible at the level of individual transitions, analogous to the Aharonov--Bohm effect in physics. This yields a notion of AB arbitrage, in which arbitrage opportunities arise from global loop effects rather than local price discrepancies. We further introduce simplicial admissibility conditions ensuring that recursively accumulated distortions remain integrable, and show how non-trivial holonomy can be translated into base-time observable self-financing trading strategies through executable loop dynamics. This establishes a connection between categorical holonomy structures and economically realizable arbitrage. The framework developed here suggests a global and homological perspective on arbitrage theory, in which market inconsistencies are encoded by recursively accumulated simplicial distortions and their holonomy along loops in the underlying time category.

q-fin.MF↗

Femtosecond concerted rotation of molecules on a 2D material interface

Interfaces between molecules and 2D materials exhibit energy-driven functionalities, wherein charge transfer directs molecular motion. Unlike equilibrium systems, where molecular assemblies settle into static configurations, continuous energy input can drive transient, collective molecular rearrangements. Here, we reveal ultrafast spectroscopic fingerprints of a collective rotational response of molecules on a 2D material following photoexcitation. Our results suggest that photoinduced charge transfer reshapes the interfacial energy potential, giving rise to macroscopic, unidirectional molecular rotation and the formation of a homochiral molecular arrangement. Using a multiplexed ultrafast photoemission spectroscopy approach, we simultaneously track, electronic states, atomic positions, and orbital wavefunctions with femtosecond and sub-ångström resolution. Multimodal valence and core electron emission analysis disentangles the intertwined electronic-structural dynamics of the molecule and the 2D material, revealing the dynamic modulation of charge distribution and intermolecular forces that drive collective molecular motion. Our findings open a pathway for designing energy-driven molecular systems with tunable interfacial dynamics, with potential applications in chiral engineering and active matter systems.

cond-mat.mtrl-sci↗

A two-step model and the algorithm for recalling in recommender systems

When a user finds an interesting recommendation in a recommender system, the user may want to recall related items recommended in the past to reconsider or to enjoy them again. If the system can pick up such "recalled" items at each user's request, it must deepen the user experience. We propose a model and the algorithm for such personalized "recalling" in conventional recommender systems, which is an application of neural networks for associative memory. In our model, the "recalled" items can reflect each user's personality beyond naive similarities between items.

cs.IR↗

Fractional order Taylor's series and the neo-classical inequality

We prove the neo-classical inequality with the optimal constant, which was conjectured by T. J. Lyons [Rev. Mat. Iberoamericana 14 (1998) 215-310]. For the proof, we introduce the fractional order Taylor's series with residual terms. Their application to a particular function provides an identity that deduces the optimal neo-classical inequality.

math.CA↗