
research note
Train Often, Deploy Selectively: Forward-Gated Model Replacement in Crypto Markets
This paper addresses the operational challenge in production forecasting systems of deciding when to replace a maintained incumbent model with a newly.

research note
This paper addresses the operational challenge in production forecasting systems of deciding when to replace a maintained incumbent model with a newly.

research note
The paper addresses a key limitation in multimodal on-policy distillation (OPD) for visual language models: the teacher's next-token corrections are.

research note
This paper addresses a fundamental limitation in standard masked language model (MLM) fine-tuning applied to genomic sequences, particularly ancient DNA.

research note
ViewMind3D addresses the challenge of 3D question answering (3D-QA) in indoor scenes without relying on costly 3D-specific training or fine-tuning.

research note
Verified Image Grounding (VIG) addresses the crucial challenge of reliably integrating authentic visual evidence—retrieved real-world images—into.

research note
VizPilot addresses the challenge of onboarding novice users to complex SVG-based composite visualizations, which integrate multiple coordinated views and.

research note
This paper identifies and thoroughly investigates a surprising failure mode in large language models (LLMs) called Salience Bias, where models overly.

research note
X-NavDP addresses the challenge of improving navigation diffusion policies pretrained via imitation from oracle expert demonstrations limited to a single.

research note
This paper presents ZAPs, a novel reward attribution framework designed specifically for decentralized finance (DeFi) ecosystems where incentive programs.

research note
This paper addresses the challenge of aerodynamic design in turbomachinery, focusing on centrifugal compressors with complex 3D blade geometries and.

research note
This paper tackles the problem of Sybil attacker detection in the Ethereum blockchain, where attackers control multiple pseudonymous wallets to exploit.

research note
This paper investigates a broad class of multi-agent arrangement problems where agents, possessing ordinal preference rankings over each other, must be.