Searcharxiv⌕ Search

arXiv subjects

Wei You

Publications and source records attributed to Wei You.

At least 19 recordsLinked to original sources

Routing Information and Stationary Limits in Many-Server Load Balancing

We study how routing information determines stationary congestion in many-server systems with Poisson arrivals and homogeneous exponential servers. We consider policies that prioritize idle servers and select a queue stochastically no longer than a uniformly sampled queue. In nondegenerate slowdown, where spare capacity is fixed, we identify population laws from the fraction of queues with waiting jobs at each population level. We establish these laws for one-job priority, join-idle-queue, and idle-first sampling. One-job priority attains the join-the-shortest-queue population law and mean delays; further queue information can improve limiting delays in convex order without changing their means. In the super-Halfin-Whitt and Halfin-Whitt regimes, every such policy has the same stationary limits. Our estimates bound idleness-weighted occupancy tails in terms of ordinary tails, uniformly over queue-length thresholds and policies. They also yield process convergence and limit interchange for initial laws uniformly dominated by stationarity, with convergent scaled initial states.

math.PR↗

Exponential Ergodicity and Invariant Distribution of a Degenerate Reflected SDE with Stable Noise

We study a two-dimensional degenerate stochastic differential equation with oblique reflection and spectrally positive strictly stable noise of index in $(1,2)$, motivated by join-the-shortest-queue systems with heavy-tailed interarrival times. A polynomial-exponential Lyapunov function and fixed-time minorization establish positive Harris recurrence and exponential ergodicity in weighted total variation. We construct the invariant law from a stable path and prove its absolute continuity. Regulator identities describe stationary dependence and recover the joint Laplace transform from the queue marginal. Idleness inherits the classical stable Ornstein-Uhlenbeck tail; the queue has a sharp exponential tail with a polynomial prefactor whose power is half the stable index and a positive constant represented through regeneration. Conditional on small idleness, idleness divided by the conditioning threshold and the queue converge to independent beta and size-biased limits. Under large-queue conditioning, normalized idleness and queue excess converge to independent Mittag-Leffler and exponential limits.

math.PR↗

Recall-Oriented Precise Binary-to-Source Function Matching

Binary-to-source function matching supports software composition analysis by identifying reused third-party code, but existing embedding-based approaches restrict subsequent refinement to initially retrieved candidates. When the correct source function is absent from this set, selecting or filtering the available candidates cannot recover the match. Inlining further complicates the retrieval by combining multiple source functions into one binary function. In this paper, we propose BScout to improve matching precision and uncover additional matches. BScout uses the positional information of existing matches to supplement candidates for unresolved binary functions, extending the search beyond the initial candidate set, and adopts composition-aware training to address the inlined composition matching. Large language models are adopted to select and review matches, while positional information also helps filter inconsistent results. Experiments show that BScout is effective in binary-to-source function matching. BScout achieves overall higher precision, recall and F1 scores than BinaryAI and SBridge with acceptable analysis costs. Particularly, on large stripped binaries, BScout outperforms the competitors with a precision increment of 32% and approximately 2.9 times the recall.

cs.SE↗

VSpector: Specification-Driven Bug Detection for RISC-V CPUs

Detecting RTL design bugs in open-source RISC-V CPU implementations is critical for ensuring system reliability. Traditional detection approaches inherently rely on predefined artifacts. In this paper, we leverage the official,natural-language RISC-V specifications as an effective information source for bug detection. We present VSpector, a specification-driven bug detection pipeline that directly checks whether CPU register-transfer level (RTL) implementations adhere to official specification rules, without requiring specialized construction of reference models, formal properties, or custom bug patterns. To resolve the key technical trade-off between broad context scope and model reasoning accuracy when using Large Language Models (LLMs), VSpector employs a stepwise context refinement scheme across a four-stage pipeline: rule extraction, implementation localization, candidate identification, and sequential violation auditing. We evaluate VSpector on two industrial-strength RISC-V CPUs, CVA6 and XiangShan. Out of 217 reported candidates, manual inspection confirmed 148 true violations, representing a 68.2% precision. These violations correspond to 73 distinct bugs, including 42 previously unknown bugs. In our comparative experiments, DiveFuzz, a state-of-the-art CPU fuzzer, detected none of these new bugs during 24-hour runs per CPU. All 42 new bugs have been reported upstream, with developers already fixing 19 and confirming an additional 11 (30 in total), demonstrating that specification-driven auditing is a practical and complementary strategy for CPU bug detection.

cs.SE↗

SMTrap: Cost-Effective DoS Attacks Against Large Reasoning Models via SMT Conflict Guidance

Existing LRM-DoS methods rely heavily on model feedback to synthesize attack queries, requiring either repeated queries to the target model or training a dedicated attack model. These expensive operations severely weaken attack leverage. In this paper, we propose \emph{search amplification}, a novel, model-feedback-free LRM-DoS paradigm. It employs the conflict count derived from an Satisfiability Modulo Theories (SMT) solver as a low-cost external signal to guide the synthesis of inference-heavy Constraint Satisfaction Problem (CSP) instances. Our key observation is that LRMs depend on trial-and-backtracking search when solving CSPs, where higher SMT conflict counts on a given CSP instance positively correlate with more extensive LRM backtracking search and substantially longer output trajectories. Building on this finding, we propose \textsc{SMTrap}, a lightweight, CPU-only framework. Guided by SMT conflict counts, \textsc{SMTrap} generates inference-heavy CSP queries without model queries, attack-model training, or GPU computation. Evaluations across seven frontier models demonstrate the state-of-the-art LRM-DoS capability of \textsc{SMTrap}, producing DoS effects multiple times stronger than existing baselines. To mitigate the threat of \textsc{SMTrap}, we demonstrate a tool-based mitigation that significantly cuts token usage.

cs.CL↗

Nonlinear Optical Quantum Communication with a Two-Dimensional Perovskite Light Source

Two-dimensional organic-inorganic hybrid perovskite (2D-OIHP) quantum wells are emerging as promising light sources for quantum communication technologies, owing to their ability to generate polarization-encoded optical signals. In this work, we explore how nonlinear optical phenomena can be exploited for quantum information applications, demonstrating the versatility that arises from resonant coupling among excited states. By tracking changes in the ellipticities of signal photons on femtosecond timescales in four-wave-mixing experiments, we first establish a method for information encoding based on exciton spin dynamics and biexciton correlations. Using single-photon detection, we then implement a proof-of-principle quantum communication protocol by mapping these polarization states onto binary sequences. While the polarizations of weak coherent pulses are typically manipulated with optical elements in traditional quantum key distribution approaches, the intrinsic electronic structure and spin relaxation processes within the 2D-OIHP system determine the characteristics of the signal photons in our method. As a demonstration, an ASCII message consisting of 56 bits is transmitted through the polarization states of photons emitted by 2D-OIHP quantum wells. These results show that the information transmission efficiency depends strongly on contributions from biexciton states, highlighting the potential of spin-dependent nonlinear optical processes for quantum communication.

quant-ph↗

Poincaré Sphere Representation of Spin-Driven Polarization Encoding in Two-Dimensional Perovskite Light Sources

Nonlinear optical light sources enable the generation of photons with polarization states that are intrinsically determined by underlying material dynamics, rather than imposed through external modulation. Here, we investigate the fundamental quantum communication performance achievable using four-wave-mixing signal fields emitted by a representative two-dimensional perovskite system. The experimentally reconstructed signal field is represented by Stokes-vector trajectories on the Poincaré sphere to establish a practical framework for visualizing spin-driven polarization encoding. An empirical nonlinear response model further connects the properties of the signal field to microscopic exciton and biexciton electronic structure, revealing that interference between resonantly enhanced optical transitions governs the accessible polarization states. The model additionally predicts that modest stabilization of the lowest-energy biexciton could substantially improve the polarization-encoding performance and provide a route toward materials optimization. More broadly, these results motivate closer integration of nonlinear spectroscopy, semiconductor materials, and quantum information science in the development of novel light sources for quantum communication.

quant-ph↗

Robust Queueing for Single-Server Queues with Abandonment

Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean stationary virtual waiting time in the $GI/GI/1+GI$ model. Our starting point is an exact reverse-time representation of the workload in terms of the net-input process, defined as the work brought by customers who eventually enter service minus cumulative service capacity. RQ approximates this random process by its mean plus a robustness parameter times its standard deviation. Abandonment makes both moments endogenous because the probability that a customer enters service depends on the waiting time observed upon arrival. We resolve this dependence by imposing self-consistency through a deterministic trial approximation to the mean stationary virtual waiting time. For the drift, the Poisson compensator identity is exact under Poisson arrivals; under renewal arrivals, the resulting mean Palm correction is controlled on the relevant heavy-traffic optimizer scales. For the variance, we develop a deterministic-time-change surrogate and a refined finite-system surrogate. The refined surrogate interpolates between two proved variance limits using a scale-dependent variance-reduction factor derived from a heavy-traffic diffusion limit. Both constructions reduce to one-dimensional fixed-point equations that can be solved by bisection using the arrival index of dispersion for counts, the service-time squared coefficient of variation, and the patience distribution. We establish heavy-traffic limits for the $GI/GI/1+GI$ model and for both RQ fixed points, which calibrate the robustness parameter and provide theoretical support for the variance-reduction function. Numerical experiments show that the refined approximation is accurate over a broad parameter range.

math.PR↗

Quantitative Analysis of Exciton Composition and Dynamics in Y6 Films for Single-Component Solar Cells

Non-fullerene acceptors such as Y6 have enabled high-efficiency organic photovoltaic devices and motivated the development of single-component architectures; however, the microscopic mechanisms governing exciton transport and charge dissociation remain under active investigation. In particular, the interplay between Frenkel-charge-transfer excitations and their coupling to environmental fluctuations complicates the description of light absorption and subsequent exciton dynamics. Here, ultrafast transient absorption spectroscopy is used to probe exciton quenching dynamics in Y6 films interfaced with hole-transport layers. To interpret these measurements, we develop an analytical model based on hybrid Frenkel-charge-transfer states that enables direct extraction of intermolecular electronic couplings, charge-transfer character, and system-bath interaction strengths from experimental data. The analysis reveals a substantial charge-transfer admixture of 20-40% in the exciton states and identifies a transport regime characterized by delocalization-mediated exciton motion rather than purely diffusive hopping. Consistent with this interpretation, the corresponding quenching dynamics occur on a ~1 ps timescale within ~4 nm of the interface, suggesting a short-range injection mechanism facilitated by exciton delocalization. In addition to providing physical parameters for Y6, these results establish a quantitative framework that connects spectroscopic observables to microscopic transport mechanisms and can be generalized to other non-fullerene acceptors.

physics.chem-ph↗

Ranking-and-Selection with Multiple Correct Answers and Non-Answerable Estimates

We study fixed-precision ranking-and-selection in structured settings where the answer may be non-unique and where noisy estimates may temporarily admit no valid answer at all. This phenomenon arises naturally in problems such as multi-fidelity ranking-and-selection and identifying a Condorcet winner from pairwise comparisons. To address this, we propose a unified framework based on answer-wise acceptance sets, restricted generalized likelihood ratio stopping, and an answer-pitfall decomposition that yields a max-max-min characteristic value and a common sampling principle. We introduce ENDS, a general procedure that combines estimation, nomination, pitfall detection, and cost-aware information-directed selection. We instantiate ENDS for various problems by deriving explicit formulas. Extensive numerical experiments show that this unified recipe performs well across a broad range of pure-exploration problems and offers a practical framework and proof-of-concept algorithmic recipe.

cs.LG↗

Factor-Aware Mixture-of-Experts with Pretrained Encoder for Combinatorial Generalization

The integration of pretrained encoders with diffusion policies has become a dominant paradigm for visual robotic manipulation. However, it still struggles to generalize across complex environments with varying factors such as lighting and surface textures. To address this, we propose FAME, a framework that integrates a factor-aware mixture-of-experts (MoE) with a pretrained encoder to enhance generalization to environmental variations. FAME follows a three-stage training process: (1) policy warmup, where a diffusion policy is trained on standard-environment data with a frozen encoder; (2) factor-specific adapter training, where lightweight adapters inserted between the frozen encoder and the temporarily frozen policy are trained on customized datasets, each targeting a distinct environmental variation; and (3) joint fine-tuning, where a central router and the warmed policy are trained on mixed data to handle multiple factors jointly. FAME is ``factor-aware'' because the central router softly weights frozen factor-specific adapters as a dense MoE, enabling combinatorial generalization across multiple factors. Evaluations on the Meta-World benchmark show that FAME outperforms diffusion policy baselines by 34%. We further validate FAME in a real-world pick-and-place task using a compact model trained on newly collected data, where FAME achieves a 35% improvement in generalization under real-world variations.

cs.RO↗

Feature Slice Matching for Precise Bug Detection

Measuring the function similarity to detect bugs is effective, but the statements unrelated to the bugs can impede the performance due to the noise interference. Suppressing the noise interference in existing works does not manage the tough job, i.e., eliminating the noise in the targets. In this paper, we propose MATUS to mitigate the target noise for precise bug detection based on similarity measurement. Feature slices are extracted from both the buggy query and the targets to represent the semantic feature of (potential) bug logics. In particular, MATUS guides the target slicing with the prior knowledge from the buggy code, in an end-to-end way to pinpoint the slicing criterion in the targets. All feature slices are embedded and compared based on the vector similarity. Buggy candidates are audited to confirm unknown bugs in the targets. Experiments show that MATUS holds advantages in bug detection for real-world projects with acceptable efficiency. In total, MATUS has spotted 31 unknown bugs in the Linux kernel. All of them have been confirmed by the kernel developers, and 11 have been assigned CVEs.

cs.SE↗

Pure Exploration via Frank-Wolfe Self-Play

We study pure exploration in structured stochastic multi-armed bandits, aiming to efficiently identify the correct hypothesis from a finite set of alternatives. For a broad class of tasks, asymptotic analyses reduce to a maximin optimization that admits a two-player zero-sum game interpretation between an experimenter and a skeptic: the experimenter allocates measurements to rule out alternatives while the skeptic proposes alternatives. We reformulate the game by allowing the skeptic to adopt a mixed strategy, yielding a concave-convex saddle-point problem. This viewpoint leads to Frank-Wolfe Self-Play (FWSP): a projection-free, regularization-free, tuning-free method whose one-hot updates on both sides match the bandit sampling paradigm. However, structural constraints introduce sharp pathologies that complicate algorithm design and analysis: our linear-bandit case study exhibits nonunique optima, optimal designs with zero mass on the best arm, bilinear objectives, and nonsmoothness at the boundary. We address these challenges via a differential-inclusion argument, proving convergence of the game value for best-arm identification in linear bandits. Our analysis proceeds through a continuous-time limit: a differential inclusion with a Lyapunov function that decays exponentially, implying a vanishing duality gap and convergence to the optimal value. Although Lyapunov analysis requires differentiability of the objective, which is not guaranteed on the boundary, we show that along continuous trajectories the algorithm steers away from pathological nonsmooth points and achieves uniform global convergence to the optimal game value. We then embed the discrete-time updates into a perturbed flow and show that the discrete game value also converges. Building on FWSP, we further propose a learning algorithm based on posterior sampling. Numerical experiments demonstrate a vanishing duality gap.

cs.LG↗

Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models

We study contextual dynamic pricing, where a decision maker posts personalized prices based on observable contexts and receives binary purchase feedback indicating whether the customer's valuation exceeds the price. Each valuation is modeled as an unknown latent function of the context, corrupted by independent and identically distributed market noise from an unknown distribution. Relying only on Lipschitz continuity of the noise distribution and bounded valuations, we propose a minimax-optimal algorithm. To accommodate the unknown distribution, our method discretizes the relevant noise range to form a finite set of candidate prices, then applies layered data partitioning to obtain confidence bounds substantially tighter than those derived via the elliptical-potential lemma. A key advantage is that estimation bias in the valuation function cancels when comparing upper confidence bounds, eliminating the need to know the Lipschitz constant. The framework extends beyond linear models to general function classes through offline regression oracles. Our regret analysis depends solely on the oracle's estimation error, typically governed by the statistical complexity of the class. These techniques yield a regret upper bound matching the minimax lower bound up to logarithmic factors. Furthermore, we refine these guarantees under additional structures -- e.g., linear valuation models, second-order smoothness, sparsity, and known noise distribution or observable valuations -- and compare our bounds and assumptions with prior dynamic-pricing methods. Finally, numerical experiments corroborate the theory and show clear improvements over benchmark methods.

cs.LG↗

Efficient Transfer Learning via Causal Bounds

Transfer learning seeks to accelerate sequential decision-making by leveraging offline data from related agents. However, data from heterogeneous sources that differ in observed features, distributions, or unobserved confounders often render causal effects non-identifiable and bias naive estimators. We address this by forming ambiguity sets of structural causal models defined via integral constraints on their joint densities. Optimizing any causal effect over these sets leads to generally non-convex programs whose solutions tightly bound the range of possible effects under heterogeneity or confounding. To solve these programs efficiently, we develop a hit-and-run sampler that explores the entire ambiguity set and, when paired with a local optimization oracle, produces causal bound estimates that converge almost surely to the true limits. We further accommodate estimation error by relaxing the ambiguity set and exploit the Lipschitz continuity of causal effects to establish precise error propagation guarantees. These causal bounds are then embedded into bandit algorithms via arm elimination and truncated UCB indices, yielding optimal gap-dependent and minimax regret bounds. To handle estimation error, we also develop a safe algorithm for incorporating noisy causal bounds. In the contextual-bandit setting with function approximation, our method uses causal bounds to prune both the function class and the per-context action set, achieving matching upper and lower regret bounds with only logarithmic dependence on function-class complexity. Our analysis precisely characterizes when and how causal side-information accelerates online learning, and experiments on synthetic benchmarks confirm substantial regret reductions in data-scarce or confounded regimes.

cs.LG↗

Dual-Directed Algorithm Design for Efficient Pure Exploration

While experimental design often focuses on selecting the single best alternative from a finite set (e.g., in ranking and selection or best-arm identification), many pure-exploration problems pursue richer goals. Given a specific goal, adaptive experimentation aims to achieve it by strategically allocating sampling effort, with the underlying sample complexity characterized by a maximin optimization problem. By introducing dual variables, we derive necessary and sufficient conditions for an optimal allocation, yielding a unified algorithm design principle that extends the top-two approach beyond best-arm identification. This principle gives rise to Information-Directed Selection, a hyperparameter-free rule that dynamically evaluates and chooses among candidates based on their current informational value. We prove that, when combined with Information-Directed Selection, top-two Thompson sampling attains asymptotic optimality for Gaussian best-arm identification, resolving a notable open question in the pure-exploration literature. Furthermore, our framework produces asymptotically optimal algorithms for pure-exploration thresholding bandits and $\varepsilon$-best-arm identification (i.e., ranking and selection with probability-of-good-selection guarantees), and more generally establishes a recipe for adapting Thompson sampling across a broad class of pure-exploration problems. Extensive numerical experiments highlight the efficiency of our proposed algorithms compared to existing methods.

stat.ML↗

Stochastic Compositional Optimization with Compositional Constraints

Stochastic compositional optimization (SCO) has attracted considerable attention because of its broad applicability to important real-world problems. However, existing works on SCO assume that the projection within a solution update is simple, which fails to hold for problem instances where the constraints are in the form of expectations, such as empirical conditional value-at-risk constraints. We study a novel model that incorporates single-level expected value and two-level compositional constraints into the current SCO framework. Our model can be applied widely to data-driven optimization and risk management, including risk-averse optimization and high-moment portfolio selection, and can handle multiple constraints. We further propose a class of primal-dual algorithms that generates sequences converging to the optimal solution at the rate of $\cO(\frac{1}{\sqrt{N}})$under both single-level expected value and two-level compositional constraints, where $N$ is the iteration counter, establishing the benchmarks in expected value constrained SCO.

math.OC↗

Fight Fire with Fire: Combating Adversarial Patch Attacks using Pattern-randomized Defensive Patches

Object detection has found extensive applications in various tasks, but it is also susceptible to adversarial patch attacks. The ideal defense should be effective, efficient, easy to deploy, and capable of withstanding adaptive attacks. In this paper, we adopt a counterattack strategy to propose a novel and general methodology for defending adversarial attacks. Two types of defensive patches, canary and woodpecker, are specially-crafted and injected into the model input to proactively probe or counteract potential adversarial patches. In this manner, adversarial patch attacks can be effectively detected by simply analyzing the model output, without the need to alter the target model. Moreover, we employ randomized canary and woodpecker injection patterns to defend against defense-aware attacks. The effectiveness and practicality of the proposed method are demonstrated through comprehensive experiments. The results illustrate that canary and woodpecker achieve high performance, even when confronted with unknown attack methods, while incurring limited time overhead. Furthermore, our method also exhibits sufficient robustness against defense-aware attacks, as evidenced by adaptive attack experiments.

cs.CV↗