Searcharxiv⌕ Search

arXiv subjects

Yiting Wang

Publications and source records attributed to Yiting Wang.

At least 19 recordsLinked to original sources

Project Progress Desk: Know Where All Your Claude Code and Codex Projects Stand at a Glance

Agentic coding tools such as Codex and Claude Code let developers work on many projects in parallel, but keeping track of them still means switching between chats, terminal sessions and providers. We present Project Progress Desk, a local desktop interface that brings overall progress, blockers and pending decisions into one view. Users can see which projects need attention and what remains, and compare earlier approaches before choosing how to continue. Agents report each result in a short receipt; the Desk checks it against the project's checklist and moves the bar, showing earlier estimates in a lighter shade. We describe daily use across 36 projects, including a choice between two implementations based on their recorded outcomes. At the demo, attendees will explore 30 simulated projects, trace completed work to overall progress, and watch a coding agent's new result update the overview.

cs.HC↗

Where to Generate Touch: Do Image Latents Preserve Material Recognition?

Generated touch could extend robot learning beyond recorded contacts. A tactile generator needs a latent space, and we choose one by testing whether a material classifier trained on real GelSight presses still works on encode-decode reconstructions from pretrained image models. On ObjectFolder Real, the classifier loses 6.5 to 9.7 points on reconstructions from three 16x discrete tokenizers and 0.3 points on those from the Stable Diffusion VAE (SD-VAE). The 16x tokenizers again lose far more on Touch and Go and on DIGIT object recognition (YCB-Slide). Retraining the classifier on reconstructions, with no new labels, narrows the discrete gap. SD-VAE reconstructions also keep object identity, with 76.7% object-matching accuracy against 78.9% for real touch and 67.0% for MAGVIT-v2. We therefore select SD-VAE latents and show a photo-to-touch generator trained in them. Code will be released upon acceptance.

cs.CV↗

Causal Learning with Invalid Instruments for High-dimensional Imaging Responses

Large-scale neuroimaging studies provide high-dimensional imaging phenotypes for understanding brain-related diseases and their causal relations with biological risk factors. While instrumental variable (IV) methods can address unmeasured confounding in such observational data, existing IV methods face significant limitations when applied to high-dimensional imaging data, particularly in handling large-scale data and leveraging the intrinsic spatial structure of images. To address these challenges, we propose High-dimensional Functional-imaging Instrumental Variable Estimation (Hi-FIVE), a novel framework for estimating spatially varying causal effects when a majority of the candidate instruments may be locally invalid. We first establish identifiability conditions under which the spatial continuity of the causal effect surface propagates identification from regions where valid instruments form a plurality into regions where they do not, provided that invalid-IV effects switch on non-smoothly. Motivated by this result, Hi-FIVE combines penalized multivariate splines over triangulations for the causal surface and region-wise penalties for spatially localized invalid-IV effects, under an anchor constraint that keeps at least one relevant instrument valid on every simplex. A distributed algorithm parallelizes the computation over simplices for two- and three-dimensional images. We study the asymptotic properties of Hi-FIVE, establish consistency and pointwise asymptotic normality, and construct bootstrap-calibrated simultaneous confidence regions whose finite-sample coverage is evaluated through simulations. Hi-FIVE is illustrated with an analysis of the effect of phosphorylated tau on FDG-PET imaging in the Alzheimer's Disease Neuroimaging Initiative, interpreted under the stated IV assumptions.

stat.ME↗

Quadratic-size Random Permutations are Universal

A permutation is $n$-universal if it contains every permutation of length $n$ as a pattern. We prove that a uniformly random permutation of length $32n^2$ is $n$-universal with probability at least $1-\exp(-n/25)$ for all sufficiently large $n$. This removes a $\log\log n$ factor from an earlier result of He and Kwan~\cite{He-Kwan} and resolves an open problem of Alon~\cite{Alon2016}. The proof was found by GPT-6 Pro.

math.CO↗

A Population Synthesis Model for Odd Radio Circles Produced by Shock-Bubble Interactions

Odd Radio Circles (ORCs) are edge-brightened rings of diffuse radio emission of roughly arcminute size whose physical origin remains debated. One proposed mechanism is vortex formation through Shock-Bubble interaction (SBI), in which a merger or accretion shock re-energizes a fossil radio lobe into an edge-brightened ring. We test whether this mechanism can reproduce the observed ORC abundance using a Monte Carlo population-synthesis model that combines the galaxy stellar mass function, the radio-AGN incidence relation, dark-matter halo merger histories, and the inflation and buoyant survival of AGN-inflated bubbles, with synthetic radio fluxes and ring geometries drawn from a grid of magnetohydrodynamic SBI simulations. Applying survey-specific selection to the ASKAP-EMU Pilot Survey (944 MHz) and the LOFAR Two-metre Sky Survey (LoTSS; 144 MHz), we predict $2.7^{+3.9}_{-1.6}$ detectable ORCs in the EMU Pilot, matching the three found there, and $268^{+331}_{-148}$ in LoTSS, of which $7.5^{+9.5}_{-4.2}$ have a counterpart at 1.4 GHz. The predicted hosts are mostly central galaxies in group-scale halos. The predicted rings are physically smaller and lie at lower redshifts than the galaxies identified as hosts of the known ORCs, suggesting that SBI produces mainly the nearby part of the ORC population, or that some ORCs are associated with the wrong host. The population synthesis model also predicts a large population of low surface brightness steep-spectrum ORCs in the LoTSS band, implying a large hidden population and predicting that deeper low-frequency surveys should uncover many more ORCs than are currently known. These results indicate that shock-bubble interactions can account for at least part of the observed incidence of ORCs.

astro-ph.GA↗

TrustAgent-RFF: Agentic Diagnostic Planning for Reliable RF Fingerprinting under Domain Shift

Radio frequency fingerprinting (RFF) models can achieve accuracy under source domain conditions but become unreliable when the receiver, distance, collection day, or environment changes. Incorrect predictions in unseen domains may receive high softmax confidence, making confidence thresholding insufficient for trustworthy deployment. We propose TrustAgent-RFF, a prediction level reliability framework for RFF that operates with a frozen in-phase and quadrature (I/Q) classifier without target domain labels. For each device prediction, the framework acquires radio frequency evidence: counterfactual stability, prototype consistency, acquisition domain similarity, and signal quality. A source calibrated trust estimator combines these diagnostics with classifier confidence, prediction margin, and evidence availability indicators. Source derived lower tail penalties and cross module interactions reduce trust when diagnostic signals indicate weak support. A large language model (LLM) based planner adaptively selects the next diagnostic action based on evidence, trust state, action costs, and remaining budget. A deterministic source calibrated decision layer updates the prediction state as Accept, Reject, or Defer. Experiments across five RFF datasets and classifier backbones reveal an average source to target accuracy drop of 38.7% and show that many incorrect target domain predictions remain highly confident.

cs.LG↗

AURORA-KITTI: Any-Weather Depth Completion and Denoising

Robust depth completion is fundamental to real-world 3D scene understanding, yet existing RGB--LiDAR fusion methods degrade significantly under adverse weather, where both camera images and LiDAR measurements suffer from weather-induced corruption. In this paper, we introduce AURORA-KITTI, the first large-scale, physics-consistent synthetic RGB-LiDAR benchmark for any-weather depth completion and denoising. We further formulate Depth Completion and Denoising~(DCD) as a unified task that reconstructs clean dense metric depth from weather-corrupted RGB images and sparse LiDAR inputs while suppressing weather-induced noise. AURORA-KITTI contains over 82K weather-consistent RGB--LiDAR pairs with metric depth supervision, spanning diverse weather types, three severity levels, day/night scenes, paired clean references, lens occlusion conditions, and textual descriptions.Moreover, we provide DDCD as a strong and efficient distillation-based reference baseline. DDCD is trained on AURORA-KITTI using a frozen teacher applied to paired clean RGB images only during training; at inference, it uses weather-corrupted RGB and sparse LiDAR. Experiments on AURORA-KITTI and the real-world DENSE benchmark show that existing depth completion and foundation depth models remain vulnerable under severe weather, while DDCD improves over weather-aware retraining. Controlled experiments further show that physics-consistent adverse-weather data is the dominant driver of robustness, with clean-prior distillation providing complementary gains. Comparisons with off-the-shelf zero-shot methods use different training protocols; same-data retraining and component ablations separately quantify the contributions of weather-aware data and DDCD. Github: https://github.com/Warwick-Jocelyn/AURORA-KITTI.

cs.CV↗

HeteroVDiff: Pipelining Video Diffusion across Mobile NPU and GPU with Shared Weights

Video generation is moving from the cloud to phones for privacy and offline use, and applications often ask for several clips at a time, so on-device video generation is a throughput problem before it is a latency problem. Contemporary mobile SoCs carry both a GPU and a neural processing unit (NPU) on shared DRAM, yet existing on-device video diffusion systems run the denoiser on one engine while the other sits idle or only decodes the finished latent afterwards. Heterogeneous designs built for mobile LLMs do not carry over: they synchronise the two engines at every operator and partition weight tensors between them instead of sharing one stored copy. We first measure the platform limits that decide what can run on this class of SoC: how large one buffer may be, whether both runtimes can map the same buffer, and how much activation memory the NPU toolchain lets one graph hold. Guided by these measurements, we store the base weights once in INT8 in the layout the NPU reads natively; the GPU consumes the same bytes directly as integer dot-product operands, so neither runtime rearranges weights on load. We then flatten the denoising trajectory into its full sequence of block executions and cut it once at a block boundary, so the GPU runs the prefix and the NPU the suffix. The cut is placed from measured rather than modelled rates, including the decoder that only the NPU can run, and taken while both engines run together because each engine's speed changes when the other is active. We present HeteroVDiff, which serves a multi-expert video diffusion model across the NPU and GPU with 48% less weight memory than giving each engine its own copy. Generating videos back to back on a Galaxy S25 with decoding inside the pipeline, HeteroVDiff sustains 1.35x the stream throughput of NPU-only execution, and on VBench-2.0 it matches FP32 in the total score over all 18 dimensions.

cs.DC↗

Optimal Bounds on Spanning Tree Embeddings

We prove that the number of labelled embeddings of any $n$-vertex tree $T$ into an $n$-vertex graph $G$ of maximum degree $d$ satisfies $$ \mathrm{inj}(T,G) \leq (d/e)^n \exp(o_d(1) n). $$ The bound is sharp up to determining $o_d(1)$, even for paths, and the dependence of the error $\exp(o_d(1)n)$ on $d$ is necessary. As an immediate corollary, we obtain an optimal anticoncentration bound for the isomorphism class of a uniformly random spanning tree in a connected $d$-regular graph, answering a conjecture of H. Lee. The proof combines Brégman's inequality with entropy methods.

math.CO↗

IB-Flow: Information Bottleneck-Guided CFG Distillation for Few-Step Text-to-Image Generation

While large-scale text-to-image generative models have achieved unprecedented visual performance, their inherent reliance on multi-step iterative solvers incurs severe inference latency. Few-step distillation targeting the Classifier-Free Guidance (CFG) trajectory has emerged as the prevalent dual-dimensional compression paradigm. However, existing frameworks remain subjugated by a coarse-grained blind injection paradigm that perpetually enforces a globally static guidance strength while indiscriminately sampling the supervisor timestep. This state-agnostic design completely disregards the intrinsic nature of image generation as a dynamic evolutionary process characterized by progressive entropy reduction, which not only restricts the performance boundary of few-step compression but also precipitates severe CFG over-conditioning artifacts. To transcend these limitations, we re-examine the distillation procedure through the theoretical lens of Information Theory, formally modeling it as a dynamic mutual information game constrained by the Information Bottleneck (IB) principle. Specifically, we dismantle traditional blind assumptions via a dual-track adaptive framework. To determine the injection target, we propose an instance-aware selection mechanism that transmutes the intractable KL divergence constraint into a zero-overhead closed-form solution predicated on the local vector field norm. To regulate the injection strength, we introduce an entropy-aware schedule that dynamically decays alongside the SNR, applying maximal thrust for initial structural anchoring before smoothly reverting to the natural manifold to refine micro-details. Extensive empirical evaluations corroborate that our framework fundamentally eradicates over-conditioning artifacts, shattering the performance ceiling to achieve SOTA generative fidelity under extremely stringent 2-step configurations.

cs.CV↗

A Linear Instability and Damping in the Acoustic Dispersion Relation of Fluids Subject to Inverse Compton Drag

Radiation drag from inverse-Compton scattering of an external radiation field changes the acoustic dispersion relation of a relativistic fluid. We derive the linear dispersion relation and show that, depending on the electron distribution and fluid sound speed, radiation drag either damps both modes or damps one while driving the other unstable. The unstable growth is robust at short wavelengths but slow and overdamped at long wavelengths, where the linear analysis is limited by the background acceleration. The resulting growth and damping rates are of order the bulk radiative acceleration rate, so whenever radiation drag is important for the background flow, its effects on fluid perturbations are also important. A purely damped region exists for a wide range of parameters. Radiation drag also makes acoustic waves dispersive: The phase speed deviates from the ordinary sound speed at longer wavelengths, and approaches the sound speed at short wavelengths. We validate the derived rates using special-relativistic hydrodynamic simulations. We apply the derived relation to astrophysical jets such as gamma-ray bursts, blazars in the broad-line region of the host active galactic nucleus, and quasar jets traveling through the CMB and galactic radiation field. We find that the derived instability, damping and dispersion may be relevant across a range of relativistic outflow conditions.

astro-ph.HE↗

ReNFT: Repairing Mode Collapse in Reward Post-Training via Internal Probability-Mass Recalibration

Reward post-training of diffusion generators inevitably concentrates probability mass on a few reward-favored modes, a mode collapse that erases within-prompt diversity. Existing methods for mitigating collapse rely on external signals or interfaces, augmenting the reward with perceptual objectives, adjusting reference regularization, or modifying the text encoder, but none repairs an adapter that has already collapsed while preserving the acquired reward. We observe that online post-training primarily reallocates probability mass over capabilities inherited from pretraining rather than learning new visual content. Collapse is therefore suppression, not deletion, and can be reversed from within the generator. We propose ReNFT, which repairs a high-reward, low-diversity adapter through internal probability-mass recalibration. Unconditional probes first prioritize "anti-hub" prompts where the prompt-independent bias is easiest to expose. Two policy-dominated mixed routes then generate matched counterfactual proposals from the same prompt and initial noise, one probing the frozen base direction for suppressed alternatives and the other exposing the post-trained unconditional tendency. Reward ranking with an adaptive flipping guard assigns pull and push roles, and a joint-and-paired NFT update realizes the repair. On PickScore and GenEval, ReNFT retains 98.9% and 99.0% of NFT's reward while improving DreamSim-Div by 58.8% and 55.0%, respectively, offering a complementary alternative to external interventions.

cs.LG↗

Non-Resonant Impulsively Stimulated Raman Scattering by a Terahertz Field: a Case Study of 1T-TaS2

Time-domain ultrafast and nonlinear terahertz spectroscopy techniques are recently applied to many condensed matter systems for investigating their collective excitations. In centrosymmetric systems, these collective modes are typically Raman-active and therefore do not couple directly to the terahertz electric field. The mechanism by which light-matter interaction realizes in these studies has not been explicitly discussed in detail. In this work, we perform terahertz pump - optical probe and terahertz third harmonic generation investigations on 1T-TaS2, a material exhibiting a rich charge-density-wave (CDW) phase diagram including the commensurate, nearly-commensurate and incommensurate CDW phases. The transition between these distinct states leaves a clear signature on the dynamical Raman response. We investigate how the Raman-active phonons couple to a broadband monocycle terahertz field as well as a narrowband multicycle terahertz field. Our results indicate that a modified impulsively stimulated Raman scattering mechanism involving two-photon absorption, also known as non-resonant Raman scattering, underlies the coherent excitation and observation of the lattice modes. These results are relevant for future spectroscopy investigation and coherent control of collective modes using low-energy terahertz field as well as cavity electrodynamical dressing of solids.

cond-mat.str-el↗

Advantage-level Aggregation Reinforcement Learning for X-point Target Magnetic Configuration Control in an EXL-50U Experiment-Calibrated Simulation Environment

Managing divertor heat loads is a central challenge for compact, high-power tokamaks. To increase local flux expansion and decouple the dissipation volume from the core, EHL-2 adopts the X-point target (XPT) divertor. This requires the secondary X-point to remain on the divertor leg; displacement degrades the topology and exhaust geometry. Current experiments, including EXL-50U discharges, rely on precomputed feedforward waveforms with PID loops on global quantities. Lacking dedicated closed-loop feedback for the secondary null, XPT operation is repeatable but not routine. We formulate XPT feedback as a multi-objective reinforcement learning (RL) control problem in a free-boundary environment calibrated to EXL-50U discharge #13906. To address strong coupling among plasma current, shape, and null constraints - where reward scalarisation collapses objective-specific temporal credit - we develop Advantage Aggregation (AdvA). AdvA preserves objective-wise temporal credit before worst-objective-aware nonlinear scalarisation and introduces a residual correction to policy updates. AdvA-PPO is evaluated against Reward-PPO and a feedforward-plus-PID baseline under nominal operation, measurement uncertainties, and unseen initial equilibria. On a 500 ms rollout, AdvA-PPO raises the mean worst-channel score from 0.23 to 0.81 over Reward-PPO, reducing X-point flux RMSE by ~20x. Under combined measurement uncertainties, it is the only learned controller completing the horizon while retaining a usable XPT shape. Multi-initialization fine-tuning enables a single AdvA-PPO policy to complete full-horizon operation across divertor and limiter initial equilibria. These results provide a simulation-based foundation for future real-time XPT validation on EXL-50U.

physics.plasm-ph↗

SLAI T-Rex: Full-Parameter Post-training of the DeepSeek-V4 Family on Ascend SuperPOD

Full-parameter post-training of trillion-parameter-scale MoE models introduces substantial system-level challenges for large-scale distributed training, including severe memory pressure, non-overlapped communication overhead, and inefficient kernel execution. While most large-scale LLM training systems are built around GPU-based clusters, this report presents an end-to-end optimization practice on the Ascend NPU SuperPOD. Using the DeepSeek-V4 model family as the target workload, we develop a hierarchical optimization framework spanning model-level parallelism, computation-communication orchestration, and low-level kernel execution. The resulting system achieves 34.22% Model FLOPs Utilization (MFU) with a 2.93x improvement over the open-source baseline recipe while maintaining training stability. Building on this optimized infrastructure, we further establish a CPT and SFT workflow for complex Operations Research (OR) tasks. We refer to the integrated framework as SLAI T-Rex. Using DeepSeek-V4-Flash, we develop OR-oriented CPT and SFT data pipelines that combine collected domain resources with solver-verified synthetic optimization documents. The resulting dataset contains 10K high-quality SFT samples spanning four task categories and three problem representations. The specialized model achieves the highest average zero-shot Pass@1 score among the evaluated models, reaching 71.81% and outperforming GPT-5.4-Mini and the base DeepSeek-V4-Flash model by 3.98 and 11.27 percentage points, respectively. Overall, this work demonstrates a full-stack pathway from efficient trillion-parameter model post-training on Ascend infra to domain-specialized Flash models for solver-grounded mathematical modeling, advancing frontier-model systems for complex reasoning.

cs.CL↗

TacGen: Touch Is a Necessary Dimension of Physical-World Representation -- Addressing Tactile Data Scarcity with Scalable Vision-to-Touch Alignment and Generation

Touch resolves the physical-property ambiguity left by vision: exploratory contact recovers shape, texture, compliance, and material, and visuo-haptic object representations converge in ventral visual cortex. We ask whether representation learning can reproduce this grounding. TacGen mitigates the tactile-data scarcity bottleneck by combining pre-specified V+T contrastive alignment with a latent-space residual-MLP V->T generator that synthesizes tactile latents from RGB for tactile-data scaling. With matched DINOv2 backbones, splits, and probes, V+T improves matched V-only on mass (Delta R^2=+0.570), density (Delta acc=+0.067), hardness (+0.117), and uncertainty-banded force labels (Delta R^2=+0.281); all CIs exclude zero. The same representation lifts matched-capacity TACTO manipulation 0.246->0.979 while V-only capacity scaling accounts for only 4.5% of the gap, preserving 95.5%. The generator reaches cross-seed +0.589, with real tactile +0.585 inside the seed interval; the architecture comparison shows a 13pp downstream gap between reconstruction quality and representation utility. Across five-seed SSVTP/TVL reproductions, YCB-Sight transfer, three-backbone checks, permutation/random-feature controls, hash-verified manifests, and measured-force validation checks, the evidence supports the claim that touch supplies a necessary physical evidence channel for representations of contact-dependent properties.

cs.RO↗

Field-induced topological Hall effect and butterfly-shaped magnetoresistance in the centrosymmetric antiferromagnet EuAuAs

The coupling between magnetic and electronic degrees of freedom gives rise to a variety of intriguing transport phenomena. Among them, the topological Hall effect, originating from the real-space Berry phase associated with nontrivial magnetic textures, has attracted considerable attention. Here, we systematically investigate the magnetic and transport properties of antiferromagnet EuAuAs. Magnetic characterizations reveal antiferromagnetic transition at 5.7 K and 6.3 K for $H \parallel ab$ and $H \parallel c$, accompanied by metamagnetic transition and small hysteresis for $H \parallel ab$. Electrical transport measurements reveal a pronounced topological Hall effct in the antiferromagnetic state with $H \parallel ab$ and $I \parallel c$, which may be attributed to finite scalar spin chirality. Furthermore, the magnetoresistance exhibits butterfly-shaped hysteresis and strong angular dependence, which are likely associated with spin-dependent electron scattering, magnetic-domain evolution, and domain-wall pinning. Our results suggest that field-induced spin textures play an important role in the magnetotransport properties and provide insights into the interplay between magnetic textures and electronic transport in centrosymmetric antiferromagnets.

cond-mat.mtrl-sci↗

AUTOGATE: Automated Clock Gating via Toggling-Aware LLM-based RTL Rewriting

Fine-grain clock gating (FGCG) is among the most effective techniques for reducing dynamic power, yet current FGCG optimization flows remain largely manual. Recent LLM-based RTL optimization approaches remain limited by two key drawbacks: (1) the inability to process long waveform traces spanning millions of cycles, and (2) the difficulty of scaling optimization to large hierarchical codebases while preserving correctness. In this work, we present AUTOGATE, the first agentic framework for industry-grade RTL power optimization, enabling workload-aware clock-gating optimization across large hierarchical codebases. AUTOGATE introduces a Machine Learning (ML)-LLM co-design that bridges waveform-level analysis and RTL rewriting. Specifically, we design an ML-based clustering algorithm that distills raw toggling traces into compact, structured representations that guide LLM-based RTL rewriting. This enables accurate identification and application of clock-gating opportunities without requiring LLMs to directly process raw waveform data. To enhance scalability, AUTOGATE employs a hierarchical multi-agent architecture that decomposes large designs into independently optimizable modules, enabling coordinated optimization across deep design hierarchies. We evaluate AUTOGATE on a diverse set of designs ranging from small RTL designs to large industrial-grade codebases. Experimental results show that AUTOGATE consistently reduces dynamic power relative to baselines. Across the small-design suite, AUTOGATE reduces dynamic power by 49.31% on average. On industry-scale designs, it achieves 19.34% and 7.96% dynamic power reductions on NVDLA and BlackParrot, respectively, and up to 6.86% on highly optimized proprietary production designs.

cs.AR↗