SearcharxivSearch

arXiv subjects

Hao Qiu

Publications and source records attributed to Hao Qiu.

At least 19 recordsLinked to original sources

ManGo: Manga Active Narrative Grounding Optimization

Manga visual question answering requires models to answer questions over panel-based visual narratives, where relevant evidence is distributed across ordered panels, embedded text, recurring characters, and implicit event transitions. This structure makes passive page encoding insufficient, as the model must identify which panels to inspect, what clues to retain, and when the accumulated evidence is sufficient for answering. We propose ManGo (Manga Active Narrative Grounding Optimization), an unsupervised framework for active manga visual question answering. ManGo introduces Active Narrative Sketching (ANS), which iteratively selects panels, extracts concise grounded clues, and decides when to stop, forming a compact question-directed evidence sketch before answer generation. To optimize this behavior without human-annotated answers or rationale paths, ManGo samples multiple ANS rollouts and applies group-relative training with two rewards: answer preference from listwise self-ranking and path consistency from stable ordered panel trajectories. The combined reward is optimized with group-relative policy training, encouraging the model to improve both final answers and the panel-level evidence paths that support them. Experiments on standard manga understanding benchmarks show that ManGo achieves state-of-the-art performance across different settings.

cs.CL

Two new highly scattered fast radio bursts: evidence for scatter broadening by the circumsource medium

We found two highly scattered Fast Radio Bursts (FRBs) during commissioning of the Commensal Realtime ASKAP Fast Transient COherent (CRACO) backend. FRB 240210D and FRB 240312D have scattering times of $34\pm6$ and $300\pm48$ ms, respectively, when scaled to 1 GHz. FRB 240312D originates near a spiral arm of a face-on galaxy at a redshift of only 0.05. Scintillation from a Milky Way screen constrains the distance of the scattering screen to $\sim 10$ pc from the source. FRB 240312D is therefore the first highly scattered FRB where scattering screens in the host galaxy centre, a background galaxy, or intervening structures can all be excluded, leaving only the circumsource medium. Integral field spectroscopy of the host reveals a Milky Way-like galaxy with a star-formation region at the FRB position. We find refractive scattering in a pulsar wind nebula as the most likely scattering origin. However, the explanation is not completely satisfactory as it requires a fine-tuned orientation. Hence, additional theoretical studies under different FRB progenitor models are needed. From the two FRBs, we calculate a total rate of $R_\mathrm{tot}=210^{+460}_{-180}\,\mathrm{events}\,\mathrm{sky}^{-1}\mathrm{day}^{-1}$ with durations between 55.2 ms and 1 s and above a fluence of 9 Jy ms consistent with the rate of shorter FRBs. This elevated rate suggests that the strong scattering seen in other FRBs likewise does not arise from chance-aligned sightlines, but is instead causally linked to the FRB sources.

astro-ph.HE

GigaPath-Flash and GigaTIME-Flash: Efficient Pathology Foundation Models for Whole-Slide and Tumor Microenvironment Analysis

Foundation models have emerged as a driving force in computational pathology, with the potential to transform cancer diagnosis, prognosis, and treatment selection by learning transferable representations from large-scale histopathology data. A growing landscape of pathology foundation models now spans diverse data sources, architectures, and downstream applications. However, most pretrained models operate only at the image-tile level, use restrictive licenses, and remain computationally expensive, limiting large-scale slide-level clinical and research use. Here, we introduce GigaPath-Flash and GigaTIME-Flash, efficient models for whole-slide pathology AI and spatial proteomics prediction. GigaPath-Flash combines a 22M-parameter ViT-S tile encoder with a 21M-parameter LongNet slide encoder, both pretrained on large-scale real-world histopathology data. Its compact tile encoder is distilled from the billion-parameter GigaPath (ViT-g) teacher and shared by both models. GigaPath-Flash retains 97% of GigaPath's average slide-level performance with 50x less compute. GigaTIME-Flash extends this backbone to predict the tumor immune microenvironment directly from routine H&E images. It surpasses the original CNN-based GigaTIME in prediction quality while running 6x faster and using 8x less GPU memory. Together with GigaPath and GigaTIME, these models form an open-weight, Apache-2.0-licensed family pretrained on large-scale real-world clinical data. By releasing all models and weights, we provide accessible building blocks for computational pathology, immuno-oncology, and precision health.

cs.CV

Commensal image plane transient search methods with the SKAO

This chapter outlines the key, state of the art, techniques required to conduct commensal image plane transient searches. Using significant experience and expertise from conducting transient searches with the SKA pathfinders, we have developed efficient fast imaging strategies, automated transient detection pipelines, determined careful filtering techniques to avoid artifacts, and identified the most useful triggered reprocessing tools. Using these strategies, we will be ideally placed to optimally and reliably detect transient sources from commensal image plane transient surveys. The tools and methods presented in this chapter can be used for all SKA-Mid and SKA-Low array deployments from AA* inclusive.

astro-ph.IM

Cross-validation of six dispersion measure estimation methods for FRB 20240114A

Fast Radio Bursts (FRBs) are important cosmological probes, but their applications depend critically on accurate dispersion measure (DM) determinations. We present a systematic comparison of six DM estimation methods using 2,874 bursts from FRB20240114A, the most active repeating FRB currently known, observed by FAST during a single 4.4-hr session on 2024 March 12. This large, homogeneous sample over a short timescale, during which the propagation environment is expected to be nearly static, provides an ideal benchmark for isolating algorithmic effects on DM determination. We investigate the dependence of inter-method consistency on signal-to-noise ratio (S/N), burst morphology, and radio frequency interference (RFI). Low-S/N bursts exhibit significantly larger inter-method deviations, while single-component bursts produce highly consistent DM values across methods. In contrast, complex double- and multiple-component bursts with drifting substructures lead to substantial inter-method scattering, indicating that DM discrepancies are primarily driven by algorithmic responses to burst morphology. RFI does not significantly alter the global statistical behavior of DM deviations, but it affects density-filtering methods through morphology distortion caused by frequency-channel masking. Even after imposing strict inter-method consistency constraints, FRB20240114A still exhibits notable apparent DM fluctuations spanning $\sim$528-534~pc~cm$^{-3}$ over 15,780s. For morphologically simple bursts these variations far exceed the measurement uncertainty and, on second-to-minute timescales, cannot arise from any plausible change in the line-of-sight electron column, pointing instead to a frequency-dependent emission-time structure intrinsic to the bursts that mimics dispersion.

astro-ph.HE

Long-Period Transients as a new frontier in time-domain astronomy

Long-period radio transients (LPTs) are relatively new astrophysical objects occupying the observational gap between canonical pulsars and slowly varying radio variables. They emit coherent, highly polarised radio bursts with periods from minutes to hours, often exhibiting millisecond- to minute-scale substructure, short duty cycles, and broadband emission. Their radio luminosities typically exceed what rotational energy alone can power, necessitating alternative energy sources such as magnetic field decay, magnetospheric reconnection, or binary interactions. As multiwavelength counterparts in X-ray, optical, and infrared bands provide key constraints on progenitors and emission mechanisms, observational evidence points to a diverse progenitor population including ultra-long period magnetars and magnetic white dwarf binaries. Fast imaging surveys with SKAO and its precursors are opening a new discovery space, enabling systematic detection, high-cadence monitoring, and detailed follow-up. Despite the challenges of high extinction, intermittent emission, and computational demands for discovery, the expanding LPT population provides a new laboratory for studying coherent radio emission in a range of compact-object systems, from pulsars to white dwarf binaries. This diversity allows us to test how the emission processes depend on magnetic field strength, rotation, and binary interaction.

astro-ph.HE

Near-Optimal Regret in Adversarial Kernel Bandits

We study the adversarial kernel bandit problem, in which the loss at each round is induced by an arbitrary bounded element of a reproducing kernel Hilbert space (RKHS). We propose an exponential-weights algorithm built on a regularized importance-weighted loss estimator, together with an explicit correction term that cancels the bias introduced by the regularization. Our main result bounds the regret by $\widetilde{{O}}\big(\sqrt{T\, d_*(\lambda)\,\log|{X}|}\big)$, where $d_*(\lambda)$ is a widely-adopted notion of effective dimension that captures the complexity of the kernel. Up to logarithmic factors, this matches the known rate achieved in the related stochastic kernel bandit problem. A notable application is the Mat\'ern$(\nu,d)$ kernel with smoothness parameter $\nu$ on $\mathbb{R}^d$, for which our bound specializes to $\widetilde{{O}}\big(T^{(\nu+d)/(2\nu+d)}\big)$, improving over the best-known prior rate of Chatterji et al. [2019] while simultaneously removing the rank-one adversary assumption required by their analysis. Moreover, this rate is the same as the known optimal rate for stochastic kernel bandits, and also matches a lower bound from concurrent work up to a $\log T$ factor.

cs.LG

AcademiClaw: When Students Set Challenges for AI Agents

Benchmarks within the OpenClaw ecosystem have thus far evaluated exclusively assistant-level tasks, leaving the academic-level capabilities of OpenClaw largely unexamined. We introduce AcademiClaw, a bilingual benchmark of 80 complex, long-horizon tasks sourced directly from university students' real academic workflows -- homework, research projects, competitions, and personal projects -- that they found current AI agents unable to solve effectively. Curated from 230 student-submitted candidates through rigorous expert review, the final task set spans 25+ professional domains, ranging from olympiad-level mathematics and linguistics problems to GPU-intensive reinforcement learning and full-stack system debugging, with 16 tasks requiring CUDA GPU execution. Each task executes in an isolated Docker sandbox and is scored on task completion by multi-dimensional rubrics combining six complementary techniques, with an independent five-category safety audit providing additional behavioral analysis. Experiments on six frontier models show that even the best achieves only a 55\% pass rate. Further analysis uncovers sharp capability boundaries across task domains, divergent behavioral strategies among models, and a disconnect between token consumption and output quality, providing fine-grained diagnostic signals beyond what aggregate metrics reveal. We hope that AcademiClaw and its open-sourced data and code can serve as a useful resource for the OpenClaw community, driving progress toward agents that are more capable and versatile across the full breadth of real-world academic demands. All data and code are available at https://github.com/GAIR-NLP/AcademiClaw.

cs.AI

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach

We study distributed adversarial bandits, where $N$ agents cooperate to minimize the global average loss while observing only their own local losses. We show that the minimax regret for this problem is $\tilde{\Theta}(\sqrt{(\rho^{-1/2}+K/N)T})$, where $T$ is the horizon, $K$ is the number of actions, and $\rho$ is the spectral gap of the communication matrix. Our algorithm, based on a novel black-box reduction to bandits with delayed feedback, requires agents to communicate only through gossip. It achieves an upper bound that significantly improves over the previous best bound $\tilde{O}(\rho^{-1/3}(KT)^{2/3})$ of Yi and Vojnovic (2023). We complement this result with a matching lower bound, showing that the problem's difficulty decomposes into a communication cost $\rho^{-1/4}\sqrt{T}$ and a bandit cost $\sqrt{KT/N}$. We further demonstrate the versatility of our approach by deriving first-order and best-of-both-worlds bounds in the distributed adversarial setting. Finally, we extend our framework to distributed linear bandits in $R^d$, obtaining a regret bound of $\tilde{O}(\sqrt{(\rho^{-1/2}+1/N)dT})$, achieved with only $O(d)$ communication cost per agent and per round via a volumetric spanner.

cs.LG

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory

In this paper, we study dynamic regret in unconstrained online convex optimization (OCO) with movement costs. Specifically, we generalize the standard setting by allowing the movement cost coefficients $\lambda_t$ to vary arbitrarily over time. Our main contribution is a novel algorithm that establishes the first comparator-adaptive dynamic regret bound for this setting, guaranteeing $\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t \lambda_t)})$ regret, where $P_T$ is the path length of the comparator sequence over $T$ rounds and $M$ is the maximal comparator norm. Our result recovers the optimal adaptive rates for both static and dynamic regret in OCO as the special case where $\lambda_t=0$ for all rounds. To demonstrate the versatility of our results, we consider two applications: OCO with delayed feedback and OCO with time-varying memory. We show that both problems can be translated into time-varying movement costs, establishing a novel reduction specifically for the delayed feedback setting that is of independent interest. A crucial observation is that the first-order dependence on movement costs in our regret bound plays a key role in enabling optimal comparator-adaptive dynamic regret guarantees in both settings.

cs.LG

The SJTU X-LANCE Lab System for MSR Challenge 2025

This report describes the system submitted to the music source restoration (MSR) Challenge 2025. Our approach is composed of sequential BS-RoFormers, each dealing with a single task including music source separation (MSS), denoise and dereverb. To support 8 instruments given in the task, we utilize pretrained checkpoints from MSS community and finetune the MSS model with several training schemes, including (1) mixing and cleaning of datasets; (2) random mixture of music pieces for data augmentation; (3) scale-up of audio length. Our system achieved the first rank in all three subjective and three objective evaluation metrics, including an MMSNR score of 4.4623 and an FAD score of 0.1988. We have open-sourced all the code and checkpoints at https://github.com/ModistAndrew/xlance-msr.

cs.SD

Detection of an Extremely Luminous Radio Counterpart to the Be/X-ray Binary A0538-66

We present the discovery of radio emission from the Be/X-ray binary A0538-66 with the Australian Square Kilometre Array Pathfinder (ASKAP), and results from a subsequent weekly monitoring campaign with the MeerKAT radio telescope. A0538-66, located in the Large Magellanic Cloud, hosts a neutron star with a short spin period ($P \approx 69$ ms) in a highly eccentric $\approx16.6$-day orbit. Its rare episodes of super-Eddington accretion, rapid optical and X-ray flares, and other peculiar properties make it an interesting system among high-mass X-ray binaries. Our MeerKAT data reveal that it is also one of the most radio-luminous neutron star X-ray binaries observed to date, reaching $\approx 3 \times 10^{22}~\text{erg}~\text{s}^{-1} \text{Hz}^{-1}$, with radio emission that appears to be orbitally modulated. We consider several possible mechanisms for the radio emission, and place A0538-66 in context by comparing it to similar systems.

astro-ph.HE

Selected highlights from STAR experiment

In this paper, we review recent highlights in heavy-ion collisions and proton-proton collisions at top energies from STAR experiment at the Relativistic Heavy Ion Collider (RHIC) with key contributions from Chinese groups, including the Quark-Gluon Plasma (QGP) bulk properties, electromagnetic probes, heavy flavor and jets, antimatter hyper-nucleus, nuclear structure, global polarization, and nucleon spin structure. These data serve as important ingredients in the physics of Quantum Chromodynamics (QCD).

nucl-ex

Decentralized Online Convex Optimization with Unknown Feedback Delays

Decentralized online convex optimization (D-OCO), where multiple agents within a network collaboratively learn optimal decisions in real-time, arises naturally in applications such as federated learning, sensor networks, and multi-agent control. In this paper, we study D-OCO under unknown, time-and agent-varying feedback delays. While recent work has addressed this problem (Nguyen et al., 2024), existing algorithms assume prior knowledge of the total delay over agents and still suffer from suboptimal dependence on both the delay and network parameters. To overcome these limitations, we propose a novel algorithm that achieves an improved regret bound of O N $\sqrt$ d tot + N $\sqrt$ T (1-$\sigma$2) 1/4 , where T is the total horizon, d tot denotes the average total delay across agents, N is the number of agents, and 1 -$\sigma$ 2 is the spectral gap of the network. Our approach builds upon recent advances in D-OCO (Wan et al., 2024a), but crucially incorporates an adaptive learning rate mechanism via a decentralized communication protocol. This enables each agent to estimate delays locally using a gossip-based strategy without the prior knowledge of the total delay. We further extend our framework to the strongly convex setting and derive a sharper regret bound of O N $\delta$max ln T $\alpha$ , where $\alpha$ is the strong convexity parameter and $\delta$ max is the maximum number of missing observations averaged over agents. We also show that our upper bounds for both settings are tight up to logarithmic factors. Experimental results validate the effectiveness of our approach, showing improvements over existing benchmark algorithms.

stat.ML

Huizhou Hadron Spectrometer -- a Proposed High-rate Experimental Setup at the High Intensity Heavy-ion Accelerator Facility

The High-Intensity Heavy-Ion Accelerator Facility (HIAF), currently under construction in Huizhou, Guangdong Province, China, is projected to be completed by 2025. This facility will be capable of producing proton and heavy-ion beams with energies reaching several GeV, thereby offering a versatile platform for advanced fundamental physics research. Key scientific objectives include exploring physics beyond the Standard Model through the search for novel particles and interactions, testing fundamental symmetries, investigating exotic hadronic states such as di-baryons, pentaquark states and multi-strange hypernuclei, conducting precise measurements of hadron and hypernucleus properties, and probing the phase boundary and critical point of nuclear matter. To facilitate these investigations, we propose the development of a dedicated experimental apparatus at HIAF - the Huizhou Hadron Spectrometer (HHaS). This paper presents the conceptual design of HHaS, comprising a solenoid magnet, a five-dimensional silicon pixel tracker, a Low-Gain Avalanche Detector (LGAD) for time-of-flight measurements, and a Cherenkov-scintillation dual-readout electromagnetic calorimeter. The design anticipates an unprecedented event rate of 1-100 MHz, extensive particle acceptance, a track momentum resolution at 1% level, an electromagnetic energy resolution of ~3% @ 1 GeV and multi-particle identification capabilities. Such capabilities position HHaS as a powerful instrument for advancing experimental studies in particle and nuclear physics. The successful realization of HHaS is expected to significantly bolster the development of medium- and high-energy physics research within China.

hep-ex

Distributed Multi-Agent Bandits Over Erd\H{o}s-R\'enyi Random Networks

We study the distributed multi-agent multi-armed bandit problem with heterogeneous rewards over random communication graphs. Uniquely, at each time step $t$ agents communicate over a time-varying random graph $G_t$ generated by applying the Erd\H{o}s-R\'enyi model to a fixed connected base graph $G$ (for classical Erd\H{o}s-R\'enyi graphs, $G$ is a complete graph), where each potential edge in $G$ is randomly and independently present with the link probability $p$. Notably, the resulting random graph is not necessarily connected at each time step. Each agent's arm rewards follow time-invariant distributions, and the reward distribution for the same arm may differ across agents. The goal is to minimize the cumulative expected regret relative to the global mean reward of each arm, defined as the average of that arm's mean rewards across all agents. To this end, we propose a fully distributed algorithm that integrates the arm elimination strategy with the random gossip algorithm. We theoretically show that the regret upper bound is of order $\log T$ and is highly interpretable, where $T$ is the time horizon. It includes the optimal centralized regret $O\left(\sum_{k: \Delta_k>0} \frac{\log T}{\Delta_k}\right)$ and an additional term $O\left(\frac{N^2 \log T}{p \lambda_{N-1}(Lap(G))} + \frac{KN^2 \log T}{p}\right)$ where $N$ and $K$ denote the total number of agents and arms, respectively. This term reflects the impact of $G$'s algebraic connectivity $\lambda_{N-1}(Lap(G))$ and the link probability $p$, and thus highlights a fundamental trade-off between communication efficiency and regret. As a by-product, we show a nearly optimal regret lower bound. Finally, our numerical experiments not only show the superiority of our algorithm over existing benchmarks, but also validate the theoretical regret scaling with problem complexity.

cs.LG

Demo: Healthcare Agent Orchestrator (HAO) for Patient Summarization in Molecular Tumor Boards

Molecular Tumor Boards (MTBs) are multidisciplinary forums where oncology specialists collaboratively assess complex patient cases to determine optimal treatment strategies. A central element of this process is the patient summary, typically compiled by a medical oncologist, radiation oncologist, or surgeon, or their trained medical assistant, who distills heterogeneous medical records into a concise narrative to facilitate discussion. This manual approach is often labor-intensive, subjective, and prone to omissions of critical information. To address these limitations, we introduce the Healthcare Agent Orchestrator (HAO), a Large Language Model (LLM)-driven AI agent that coordinates a multi-agent clinical workflow to generate accurate and comprehensive patient summaries for MTBs. Evaluating predicted patient summaries against ground truth presents additional challenges due to stylistic variation, ordering, synonym usage, and phrasing differences, which complicate the measurement of both succinctness and completeness. To overcome these evaluation hurdles, we propose TBFact, a ``model-as-a-judge'' framework designed to assess the comprehensiveness and succinctness of generated summaries. Using a benchmark dataset derived from de-identified tumor board discussions, we applied TBFact to evaluate our Patient History agent. Results show that the agent captured 94% of high-importance information (including partial entailments) and achieved a TBFact recall of 0.84 under strict entailment criteria. We further demonstrate that TBFact enables a data-free evaluation framework that institutions can deploy locally without sharing sensitive clinical data. Together, HAO and TBFact establish a robust foundation for delivering reliable and scalable support to MTBs.

cs.LG

Development of a simulation and analysis framework for N{\nu}DEx experiment

N$\nu$DEx aims to search for the neutrinoless double beta decay in $^{82}$Se using a high pressure $^{82}$SeF$_6$ gas time projection chamber (TPC). This paper presents a simulation and analysis framework developed specifically for the N$\nu$DEx experiment. Using density functional theory and two-temperature theory, the reduced mobilities of SeF$_5^-$ and SeF$_6^-$ ions in SeF$_6$ were calculated, yielding values of 0.444 and 0.430 $\mathrm{cm^2V^{-1}s^{-1}}$ respectively, with an estimated uncertainty within 3\%. The TPC geometry, featuring a cathode, focusing plane, and anode structure, was modeled in COMSOL to compute electric fields. Signal and background events were generated using BxDecay0 and Geant4, while Garfield++ was employed to simulate charge transport and signal induction. Three-dimensional tracks were reconstructed from drift-time differences between the two assumed ion species using a breadth-first search algorithm. To demonstrate the framework's analytical capability, topological variables were taken from reconstructed tracks and used to define selection criteria. A boosted decision tree was then implemented to benchmark the signal-background separation. This simulation framework successfully validates the complete experimental workflow, serving as a robust tool for detector design and future sensitivity studies in the N$\nu$DEx experiment.

physics.ins-det