Searcharxiv⌕ Search

arXiv subjects

Ying Yuan

Publications and source records attributed to Ying Yuan.

At least 19 recordsLinked to original sources

Mixed-Size Placement Initialization via Stiefel-Manifold Sequential Subspace Optimization

Mixed-size global placement simultaneously optimizes the locations of large macros and millions of standard cells in modern very-large-scale integration (VLSI) physical design. State-of-the-art analytical placers achieve strong scalability, but their nonlinear objectives and density handling make them sensitive to the initial placement. This paper presents a geometry-driven framework that formulates placement initialization as a Quadratically Constrained Quadratic Program (QCQP) with first-order centroid and second-order spreading constraints. Explicit mixed-size spreading targets are derived from the die geometry and object sizes, to obtain stable constraint values even under extreme size variation. A utilization-aware rescaling of the constraint matrix prevents pathological spreading when fixed objects occupy significant die area. The QCQP is then transformed into a Stiefel-manifold optimization through metric equalization and centering projection, making the underlying geometric structure explicit. The resulting Stiefel-constrained quadratic objective admits efficient large-scale optimization via a Riemannian sequential subspace method (SSM). An angle-sorted cycle sparsification for multi-pin nets periodically keeps the Laplacian approximation sparse yet geometry-consistent. As a drop-in initializer for existing analytical placers, our method yields improvements in weighted half-perimeter wirelength (wHPWL): 13.8% average under RePlAce on the four TILOS benchmarks supported by its flow, 3.5% under DREAMPlace on all 20 benchmarks, and 4.8% under AutoDMP on 19 benchmarks with converged baselines. Post-route evaluation shows that these pre-route improvements carry through to routed designs: routed wirelength decreases by 1.1 to 2.3% on all three benchmarks. Standard-cell area and power also decrease on all three. Design-rule-check (DRC) violations decrease on two of the three.

cs.AR↗

Probability of Success under Population Shift for Phase III Trial Planning

Probability of success (PoS) is widely used to inform go/no-go decisions for phase III trials based on phase II evidence. Conventional PoS calculations, however, implicitly assume that baseline covariate distributions are identical across phases. When covariate shift exists between phase II and phase III populations, unadjusted PoS may be biased and lead to miscalibrated decision-making. We propose a Bayesian framework for PoS evaluation that explicitly accounts for covariate shift between phase II and III population prior to phase III initiation. The method adopts a transportability perspective, adjusting phase II evidence to reflect an anticipated phase III target population using available target covariate information. The framework accommodates both individual-level and aggregate-level phase III covariate data. Simulation studies demonstrate that, compared with the conventional approach, the proposed method improves PoS accuracy and decision calibration when covariate shift is present, while maintaining comparable performance when populations are aligned. We illustrate the proposed methodology using clinical trial data from systemic lupus erythematosus.

stat.ME↗

TrialDesignBench: Benchmarking Language Models for Phase-I Trial Design Against Clinical Knowledge

AI is used in much of the clinical trial pipeline. However, selecting the statistical design of a trial, a crucial step that determines how drug doses are tested on humans and evaluated, has seen almost no AI progress. LLMs appear to be a natural fit given their strengths in biomedical knowledge and statistical reasoning. Nevertheless, there is currently no appropriate way to evaluate such abilities because recent regulatory and methodological shifts, most notably FDA's Project Optimus, have redefined what constitutes a reasonable design and rendered many previous designs obsolete. To lay the groundwork for AI-assisted trial design, we introduce TrialDesignBench, a benchmark of 617 Phase-I/I-II oncology dose-finding trials, each paired with an expert-validated reference design that is consistent with the latest FDA regulatory initiatives. This reference standard is produced through a formalization of the expert design process. We evaluate five frontier LLMs, none of which matches the reference standard. Our ablation experiments trace this performance gap to two main causes, inference of latent, unrecorded design determinants from trial sources (supplying them raises class-wise balanced accuracy by 0.22) and structured decision-tree reasoning (+0.24). TrialDesignBench offers a reproducible, contemporary-standard objective for evaluating and enhancing AI-assisted trial design.

cs.AI↗

From Grasps to Dexterity: Large-Scale Grasp Pretraining for Dexterous Manipulation

Large-scale dexterous grasp datasets encode rich priors over hand-object interaction, but their use has largely been confined to grasp generation and pick-and-place manipulation. We study whether such data can instead support functional dexterity in articulated tool use, where a robot must acquire a tool, maintain contact, and operate its functional moving parts. We adapt a hierarchical imitation learning framework that combines high-level hand sub-goal prediction with a low-level goal-conditioned controller. We construct a 355k-trajectory grasp-pretraining dataset from large-scale dexterous grasp annotations and use it to pretrain the low-level controller. The controller is then fine-tuned on downstream task demonstrations. To evaluate this setting, we introduce DexCraft, a simulation benchmark with six articulated tool-use tasks requiring coordinated finger motion. Across simulation and real-world experiments, our approach outperforms end-to-end diffusion policy baselines and hierarchical policies trained from scratch. In the real world, it improves full-task success by 33.3 percentage points over DP3. These results show that grasp datasets can serve not only as resources for grasp synthesis, but also as scalable pretraining data for contact-rich dexterous manipulation. Videos are shown on https://yingyuan0414.github.io/grasp2dexterity/ .

cs.RO↗

Force-Modulated Dexterity: Unified Compliance for Contact-Rich Manipulation

Teleoperation is widely used to collect high-quality demonstrations for robot learning. Dexterous manipulation, however, requires coordinated control of motion and contact forces. Operators can specify motion, but struggle to reproduce the subtle force adjustments of human manipulation without feeling the robot's contacts. We introduce Force-Modulated Dexterity (FOMO-Dex), a unified compliance formulation for contact-rich manipulation. FOMO-Dex expresses nominal actions in coordinates defined by task geometry and contact structure. It applies force-driven motion corrections along selected directions while leaving the remaining command components unchanged. Across card picking, paper cutting, screwdriving, and nut-and-bolt assembly, FOMO-Dex reduces excessive contact forces compared with stiff control. A user study shows that operators collect more successful demonstration data per hour after brief practice. For policy learning, imitating the corrected actions improves card-picking success over imitating raw operator commands. Policies trained on FOMO-Dex demonstrations also achieve more rotation in nut-and-bolt manipulation and screwdriving than those trained on demonstrations collected with the stiff controller. Videos are shown on https://yingyuan0414.github.io/fomo-dex/ .

cs.RO↗

Adaptively Combining Randomized and External Control Data Using a Mixture Prior in the Presence of Heterogeneity

When resources are limited in a randomized trial, a common strategy is to augment data from the control arm with external controls. We propose a hybrid group sequential Bayesian design that uses this approach to compare time-to-event distributions. The design allows between-treatment effects to differ between patient subgroups, and adaptively combines subgroups that have similar hazard functions. The aim is to reduce the control arm sample size without compromising the validity of comparative inferences due to systematic trial-versus-external data differences. The model borrows external control data dynamically by using a self-adapting mixture prior, which is a weighted average of a non-informative prior and an informative prior constructed from the external controls. The amount of borrowing is proportional to the agreement between the randomized and external controls. At each interim analysis, the design compares the treatments in each subgroup, and if inferiority or superiority is concluded stops accrual for that subgroup. Simulations show that the proposed design outperforms other methods for incorporating external control data in a randomized trial, and improves efficiency.

stat.ME↗

RAISE: Diagnosing Acquisition Collapse in Costly LLM Signals

Large language models (LLMs) are increasingly used as costly, on-demand components in real systems, but calling them indiscriminately can waste substantial compute, latency, and serving budget. The key deployment question is therefore not only whether an LLM helps on average, but when it is worth calling. We identify a common failure mode, which we call acquisition collapse: an LLM signal can appear useful in aggregate or post hoc, yet still provide too little before-call information to support reliable selective use. We introduce RAISE (Reward-SNR Actionability in Signal Evaluation), a pre-routing diagnostic framework for testing whether available evidence supports selective use before committing to a routing strategy. We instantiate RAISE with Structured Hypothesis Embeddings (SHE), a frozen-LLM intent signal for recommendation using one LLM call per user, and evaluate it through controlled, retrospective, and fresh-cohort studies and a prospective offline pilot whose audit decisions are frozen before independent outcomes are revealed. Across these settings, predictable incremental benefit, not average lift alone, distinguishes settings with recoverable selective value; deployment additionally depends on cost and operational constraints. Seemingly strong oracle or subgroup gains can disappear under independent evaluation. More broadly, RAISE reframes costly inference as an information-acquisition problem: before paying for an expensive model, tool, sensor, or measurement, first test whether its value is predictable at decision time. This principle motivates cost-aware acquisition in settings ranging from agent tool use and stronger-model consultation to robotic sensing and clinical decision pipelines.

cs.LG↗

A staggered seamless dose-optimization design for co-developing monotherapy and combination therapy

Contemporary oncology drug development increasingly requires efficient dose-optimization strategies that evaluate monotherapy (Mono) and combination therapy (Combo) while balancing activity, efficacy, and tolerability. We propose a staggered seamless phase I/II design for settings in which a novel agent is evaluated alone and in combination with an established therapy. In phase I, Mono dose finding begins first, and Combo subtrials can be opened adaptively once a prespecified combination-initiation signal based on early clinical or biological information is observed. Dose assignment uses a model-assisted rule based on toxicity and early activity, with backfilling at tolerable and potentially promising regimens. At the end of phase I, two candidate regimens are selected from the evaluated Mono and Combo regimens using an efficacy-toxicity utility based on accumulated toxicity and treatment-response data. Phase II seamlessly carries forward patients treated at the selected regimens, enrolls additional patients as needed, and applies Bayesian futility and efficacy stopping boundaries to identify a final recommended optimal biological dose (OBD). Simulation studies showed that the proposed design shortened phase I trial duration relative to the comparator designs while maintaining competitive OBD-selection performance and acceptable safety. The seamless phase II component further reduced the need for additional enrollment and supported efficient final OBD selection.

stat.ME↗

A Utility Score Framework for Dose Optimization Studies with Binary Efficacy-Safety Endpoints: Sample Size Determination and Bias Characterization

The FDA's Project Optimus initiative emphasizes patient-centered dose selection in oncology that balances efficacy and safety. We develop a framework for randomized dose optimization studies that uses clinically interpretable utility scores to integrate binary efficacy and safety endpoints and select the optimal dose for a follow-on confirmatory trial. The framework provides: (i) a systematic method for eliciting utility scores that reflect clinical priorities; (ii) closed-form sample size formulas to achieve prespecified Probabilities of Correct Selection (PCS) under clinically relevant scenarios; and (iii) analytical expressions characterizing the propagation of selection-induced bias to confirmatory trials, including time-to-event endpoints correlated with the selection endpoint. Extensive simulations (10^6 replications per scenario) confirm that the sample size methods achieve target PCS and that the bias and Type I error formulas closely match empirical estimates. An R package DoseOptDesign and an interactive Shiny application are publicly available.

stat.AP↗

Learn from What We HAVE: History-Aware VErifier that Reasons about Past Interactions Online

We introduce a novel History-Aware VErifier (HAVE) to disambiguate uncertain scenarios online by leveraging past interactions. Robots frequently encounter visually ambiguous objects whose manipulation outcomes remain uncertain until physically interacted with. While generative models alone could theoretically adapt to such ambiguity, in practice they obtain suboptimal performance in ambiguous cases, even when conditioned on action history. To address this, we propose explicitly decoupling action generation from verification: we use an unconditional diffusion-based generator to propose multiple candidate actions and employ our history-aware verifier to select the most promising action by reasoning about past interactions. Through theoretical analysis, we demonstrate that employing a verifier significantly improves expected action quality. Empirical evaluations and analysis across multiple simulated and real-world environments including articulated objects, multi-modal doors, and uneven object pick-up confirm the effectiveness of our method and improvements over baselines. Our project website is available at: https://liy1shu.github.io/HAVE_CoRL25/

cs.RO↗

GHOST: Hierarchical Sub-Goal Policies for Generalizing Robot Manipulation

We present GHOST, a framework for learning visuomotor manipulation policies that generalize beyond the training distribution. GHOST factorizes control into (i) a high-level policy that predicts the next sub-goal as a distribution over 3D end-effector poses from multi-view RGB-D observations, and (ii) a low-level goal-conditioned controller that executes embodiment-specific actions. To condition image-based policies on 3D goals, we introduce a simple spatial interface that projects predicted goals into the image plane and represents them as end-effector heatmaps. Across a suite of manipulation tasks, this hierarchical factorization consistently improves performance and robustness compared to a flat Diffusion Policy. Further, we show that this hierarchical interface also makes it easy to incorporate human demonstrations without relying on (noisy) action retargeting. As sub-goals are largely embodiment-agnostic, we train the high-level policy on human video to specify how learned skills should be applied and composed, while keeping the low-level policy trained purely on robot data. This hierarchy enables adaptation to novel objects and task variations using a small number of human demonstrations.

cs.RO↗

Probing scalar-neutrino and scalar-dark-matter interactions with PandaX-4T

Scalar-mediated interactions may exist among neutrinos, dark matter particles, or between the two. Double $β$-decay experiments provide a powerful tool to probe such exotic interactions. Using $^{136}$Xe double $β$-decay data from PandaX-4T, we perform the first direct spectral search in the energy range of 20 to 2800~keV, setting the most stringent limits to date on scalar-mediated neutrino self-interactions for mediator masses below 2~MeV$/c^2$. These results place significant constraints on models invoking such interactions to alleviate the Hubble Tension. Assuming the same scalar also mediates dark matter self-interactions, constraints on the dark matter-scalar interactions can be placed in conjunction with cosmological constraints.

hep-ex↗

Transverse Momentum Distribution of kaons, pions, and (anti-)protons production in U+U collisions at $\sqrt{s_{NN}}$ = 193 GeV using the UrQMD Model

In this study, we investigate the transverse momentum spectra of $K ^{\pm }$, $π^{\pm }$ and $p(\bar{p})$ in mid-rapidity ($\left | y \right | < 0.1$) for nine centrality classes ranging from $0\%$ to $80\%$ in $^{238} U$+$^{238} U$ collisions at $\sqrt{s_{NN}}$=193 GeV. The simulations are performed using the Ultra-relativistic Quantum Molecular Dynamics (UrQMD) model, specifically employing both the cascade mode and the soft momentum-dependent equation of state (SM-EoS) mode. Additionally, we extract other observables from the $p_{T}$ spectrum, including the average transverse momentum ($\left \langle p_{T} \right \rangle$), the particle yield ($dN/dy$) and particle-type ratios, presenting them as a function of collision centrality. We find that the collision dynamics are significantly sensitive to the prolate deformation of the uranium nuclei, which influences the initial geometry and subsequent particle production. We find that the U+U collision dynamics are highly sensitive to the deformation of the uranium nucleus. Consequently, the cascade mode is more appropriate for describing the low-$p_{T}$ region ($p_{T} < 1.2 GeV/c$), while the SM-EoS mode better captures the trends in the high-$p_{T}$ region ($p_{T} > 1.2 GeV/c$). Furthermore, at RHIC energies, our results indicate that pair production is the dominant mechanism for particle creation in the mid-rapidity region. This conclusion is corroborated by the particle-to-antiparticle production ratio, which approaches unity-indicating a high degree of matter-antimatter symmetry in the observed collision events.

hep-ph↗

Externally Controlled Trials: A Review of Design and Borrowing Through a Causal Lens

Externally controlled trials (ECTs) are increasingly used when randomized controls are infeasible, unethical, or insufficient, including applications in rare diseases, oncology, pediatrics, and post-approval effectiveness research. Although methodological work has expanded rapidly across causal inference, Bayesian dynamic borrowing, and hybrid trial designs, the literature remains fragmented. We adopt a six-step scientific roadmap to organize modern ECT methodology in two primary settings: (i) single-arm trials that evaluate efficacy through comparison with external controls, and (ii) hybrid controlled trials that augment the internal control arm with external controls drawn from real-world data or historical studies. The roadmap clarifies causal estimands, identifiability assumptions, and how statistical parameters arise from identification, and shows how modeling and borrowing strategies trade off efficiency and robustness, especially under covariate shift and outcome drift. Within this framework, we synthesize and evaluate recent Bayesian and frequentist developments, compare their strengths, limitations, operating characteristics, and available software, and emphasize the role of sensitivity analysis. By re-framing ECT methodology through a causal lens, this work establishes a coherent foundation for integrating external data into regulatory and clinical decision-making and highlights core challenges and opportunities for future research.

stat.ME↗

I can't recognize (yet): Delayed Rendering to Defeat Visual Phishing Detectors

Phishing webpages are continuously polluting the Web. Plenty of countermeasures have been proposed and the most advanced techniques leverage machine-learning methods that infer whether a webpage is benign or not by inspecting its visual representation. Yet, despite the demonstrated effectiveness of such detection methods, this class of defenses is, by design, susceptible to a kind of subtle-but-cheap timing-based attacks which -- worryingly, and perhaps surprisingly -- have never been investigated so far. Such an oversight questions the overall reliability of these defenses in the wild. First, we show that timing-based evasion attacks have not been accounted for by prior work on visual phishing websites detectors. Then, we elucidate the intrinsic vulnerability of these detectors: they can be bypassed by delaying the rendering of webpage elements. Practically, these detectors must compute the visual similarity between a target webpage and a known legitimate one. This requires taking a "snapshot" of the target webpage before the similarity computation. Attackers can deliberately delay the rendering of key elements, such as the logo, so that these elements appear fully only after the snapshot has been taken. This simple tactic misleads the visual-similarity module, leading the system to incorrectly classify the phishing page as benign. We empirically show that state-of-the-art detectors can be completely defeated (detection rate dropping from 100% to 0%) by employing easy-to-apply problem-space techniques such as curtain effects. We also carry out a user study, evaluating the effectiveness of these attacks against real humans, and find that end users are unable to reliably identify our "perturbations" (p<.05). Finally, we propose mitigations, including a browser-extension that, without making any call to remote services, warns users that they may have landed on a phishing webpage.

cs.CR↗

Precise $^{136}$Xe Double Beta Decay Measurement in PandaX-4T with Implications on the Nuclear Matrix Elements and Majorons

The continuous spectrum of double beta decay ($ββ$) provides a sensitive probe to test the predictions of the standard model and to search for signatures of new physics beyond it. We present a comprehensive analysis of the $^{136}$Xe $ββ$ spectrum utilizing $39.1 \pm 0.7~\textrm{kg}\cdot\textrm{yr}$ of $^{136}$Xe exposure from the PandaX-4T experiment. The analysis yields the most precise measurement to date of the $^{136}$Xe two-neutrino double beta decay ($2νββ$) half-life, $(2.14 \pm 0.05) \times 10^{21}$ years, the uncertainty of which is reduced by a factor of 2 compared to our previous result. We measure the parameter $ξ_{31}^{2ν}$, defined as the ratio between the subleading and leading components of the $^{136}$Xe $2νββ$ nuclear matrix element, to be $0.59^{+0.41}_{-0.38}$, which is consistent with theoretical predictions. We also search for Majoron-emitting modes of $^{136}$Xe $ββ$, establishing the most stringent limit for the spectral index $n=7$.

nucl-ex↗

On the Calibration of Bayesian Success Criteria and Operating Characteristics for Clinical Trials

Recently, the U.S. Food and Drug Administration (FDA) released draft guidance \citep{FDA2026} signaling a paradigm shift that facilitates the use of Bayesian methodology as the primary analysis and decision framework for drug approval. The cornerstone and fundamental challenge of this framework is the specification and calibration of Bayesian success criteria to control decision errors, ensuring reliable clinical and regulatory outcomes. In this work, we systematically investigate various Bayesian decision-error metrics, their theoretical interrelationships, and their alignment with conventional Frequentist counterparts. This investigation provides critical theoretical insights and practical guidance on calibrating Bayesian success criteria and operating characteristics to ensure robust decision-making and the integrity of public health decisions. We illustrate this framework using a clinical trial evaluating revascularization strategies for cardiogenic shock. A Shiny application will be available at www.trialdesign.org to assist sponsors and regulators in evaluating calibration strategies consistent with recent regulatory perspectives.

stat.ME↗

DualMap: Enabling Both Cache Affinity and Load Balancing for Distributed LLM Serving

In LLM serving, reusing the KV cache of prompts across requests is critical for reducing TTFT and serving costs. Cache-affinity scheduling, which co-locates requests with the same prompt prefix to maximize KV cache reuse, often conflicts with load-balancing scheduling that distributes requests evenly across compute instances. Existing schedulers fail to reconcile this trade-off as they operate within a single mapping space, typically applying cache-affinity routing to a subset of requests and load-balanced routing to the rest, without a unified solution to achieve both goals. To address this limitation, we propose DualMap, a dual-mapping scheduling strategy for distributed LLM serving that achieves both cache affinity and load balancing. Its key idea is to map each request to two candidate instances via two independent hash functions based on the request prompt, then intelligently select the better candidate based on current system states. This design increases the likelihood that requests with shared prefixes are co-located, while evenly dispersing distinct prefixes across the cluster via ``the power of two choices''. To make DualMap robust under dynamic and skewed real-world workloads, we incorporate three techniques: 1) SLO-aware request routing, which prioritizes cache affinity but switches to load-aware scheduling when TTFT exceeds the SLO, enhancing load balance without sacrificing cache reuse; 2) hotspot-aware rebalancing, which dynamically migrates requests from overloaded to underloaded instances, mitigating hotspots and rebalancing the system; 3) lightweight dual-hash-ring scaling, which leverages a dual-hash-ring mapping to support fast and low-overhead instance scaling without costly global remapping. Experiments on real-world workloads show that DualMap improves effective request capacity by up to 2.25$\times$ under the same TTFT SLO constraints compared with SOTA work.

cs.DC↗