Skip to main content
Search

Waseda University

6 related articles

Subscribe to updates
  1. arXiv

    Hyperbolic dimensionality reduction drops variational bounds: RHFF-LVM's closed-form random features reach 84.3 tree-distance correlation on a synthetic tree

    Hyperbolic space suits hierarchical embeddings, but earlier hyperbolic Gaussian-process latent variable models had to approximate every kernel entry numerically and optimize auxiliary variables jointly, which became impractical at scale. RHFF-LVM instead approximates hyperbolic kernels with explicit finite-dimensional random features derived from the Helgason–Fourier transform, modeling observations as feature projections of the latents and removing numerical quadrature, variational bounds and inducing points. On a synthetic binary tree, its embedded distances reach a Spearman correlation of 84.3 with true path lengths, versus 74.9 for the Euclidean counterpart RFF-LVM and 82.4 for the strongest hyperbolic baseline, Poincaré Map.

  2. arXiv

    Agents inflate confidence when it buys compute: audited pivot scoring prices the allocation, cutting cutoff crossings

    In multi-agent systems, confidence often decides who receives scarce downstream computation and decision weight, which gives agents an incentive to overstate it. The Audited Pivot Scoring Mechanism (APSM) offsets platform-controlled allocation benefits in the transfer, verifies outcomes through inverse-propensity-weighted sparse audits, charges the Clarke pivot externality, and adds a strictly proper score, making truthful reporting the unique expected-utility best response. Calculator-free experiments show agents inflate confidence under Top-K incentives; with an agent-local utility interface, APSM yields lower Brier loss and fewer cutoff crossings than Compensated Proper Scoring (CPS), while CPS achieves a higher exact allocation match.

  3. Close one lane and the real-time demand calibration gets sharper: 63% lower density error than LimEKF on grid day 10

    A real-time OD demand calibration framework couples a data-driven demand-prediction network with a black-box microscopic traffic simulator in both directions, using an analytically tractable metamodel to carry gradients back so network parameters and demand estimates update together at each time step. In a 3×3 grid network, after link B1C1 closed at hour 4 on day 10, density MSE was 21.6 [veh/km]2 versus 57.9 [veh/km]2 for LimEKF, a 63% reduction; on the Tokyo expressway corridor during the 2021 Games travel-demand-management day, the online-updated version reached 0.66 [veh/km]2 against 1.15 [veh/km]2 for LimEKF.

  4. arXiv

    DINEs represent physical systems as differential-algebraic equations with Dirac-structure algebraic constraints, jointly identifying component interconnections and learning component characteristics so subsystems can be isolated or composed without retraining

    The work proposes Dirac-interconnected neural elements (DINEs), a neural network model that represents a physical system as a differential-algebraic equation (DAE) whose algebraic constraints are given by a Dirac structure in kernel representation, thereby simultaneously identifying from data the interconnection among components as a Dirac structure and learning the characteristics of the components as neural networks, which keeps learned subsystems in unreduced form so they can be isolated or composed into a new system without retraining, and which can handle partially observable systems.

  5. arXiv

    BrainSTR models dynamic brain networks with spatio-temporal contrastive learning, validated on ASD, BD, and MDD with critical phases and subnetworks consistent with prior neuroimaging findings

    The work proposes BrainSTR, a spatio-temporal contrastive learning framework that learns state-consistent phase boundaries via a data-driven Adaptive Phase Partition module, identifies diagnostically critical phases with attention, and extracts disease-related connectivity within each phase using an Incremental Graph Structure Generator regularized by binarization, temporal smoothness, and sparsity; a spatio-temporal supervised contrastive learning approach then leverages diagnosis-relevant spatio-temporal patterns to refine the similarity metric between samples and build a well-structured semantic space. Experiments on ASD, BD, and MDD validate its effectiveness, and the discovered critical phases and subnetworks provide interpretable evidence consistent with prior neuroimaging findings.

  6. SurgDepth: Test-Time Adaptation of Depth Foundation Models for Surgical Scene Understanding

    The work proposes SurgDepth, a test-time adaptation framework that adapts natural-image-pretrained depth foundation models to surgical endoscopy without any labeled surgical data, combining two self-supervised signals (stereo photometric consistency and flip equivariance, the latter requiring only single images) with selective decoder adaptation and two tuning-free reliability mechanisms (progress-aware anchor regularization and a structural-trust safeguard for poorly-illuminated sequences); the authors report AbsRel reductions of up to 63% with stereo pairs and 42% without, improvement in four of five cross-domain evaluation settings, generalization across seven foundation models, and the lowest AbsRel (0.

You’re all caught up