Searcharxiv⌕ Search

arXiv subjects

Siwei Chen

Publications and source records attributed to Siwei Chen.

At least 19 recordsLinked to original sources

Truthful compromise and insurance on a sphere

Can public choice without transfers insure conflicting interests when action intensity is fixed? We require truthful reporting for every increasing-concave evaluation of alignment with private ideals. On a sphere, efficiency at profiles with at most three ideal directions forces fixed-weight random dictatorship; weaker tests suffice in two and three dimensions. From four dimensions, binary efficiency permits committees to insure members by placing outcome risk orthogonally to their reports. We identify restrictions shared by all mechanisms with these incentives and binary efficiency: binary winning probabilities determine mean outcomes at every profile and individual alignment distributions at planar three-camp profiles. When these probabilities depend only on camp size, complete insurance at balanced equilateral disagreement requires dimension proportional to population. In contrast, committees reduce each participant's welfare loss relative to certain zero alignment to any prescribed positive fraction of the equal-weight random-dictatorship loss in a population-independent dimension.

econ.TH↗

Individual incentives and uniform gains under symmetric constraints

We study the division of a fixed total under symmetric joint constraints when agents have continuous, strictly single-peaked preferences over their own shares. Each agent reports a complete preference, including comparisons across the two sides of her peak. For any finite population and any nonempty closed convex permutation-invariant feasible set, we characterize the uniform-gains rule by efficiency, symmetry, individual strategy-proofness, and own-coordinate peak-onlyness. The last condition requires that a change of preference leaving an agent's peak fixed also leave her own share fixed; it places no direct restriction on others' shares. The characterization separates uniqueness from continuity and yields a continuous characterization with individual incentives for compact feasible sets that are polyhedral or relatively full-dimensional and strictly convex. We then show that, for every population of two through six agents and every nonempty compact convex permutation-invariant feasible set, efficiency, symmetry, and individual strategy-proofness alone characterize uniform gains. The proof recovers allocations from the shares attainable by unilateral reports, feasible transfers, and endpoint reports. A common induction applies at each population, with additional starting configurations for five and six agents.

econ.TH↗

When an effort-maximizing team architecture is unstable

Organizations choose team structures to intensify competition, yet their members may prefer to reorganize. We ask whether an architecture that maximizes aggregate effort can remain stable when contestants may form a replacement team from incumbent rosters. When a coalition draws from identical teams and reproduces their type, its members and the designer rank the reorganization in opposite directions: the coalition gains precisely when total effort falls. A strict effort optimum can therefore supply its own blocking certificate, while a stable optimum can survive only on a plateau where every reachable reorganization of this kind leaves effort unchanged. In a linear benchmark, we characterize stability against every feasible one-team reorganization and global effort maximization over every feasible partition. Except under pair capacity, the two regions do not overlap; with pair capacity, they meet only at one boundary. The ordering persists in a matched quadratic benchmark with strictly convex effort cost, and broader one-step deviation rights cannot restore overlap. Among standardized full-cap designs, the unique stable-effort optimum uses the largest feasible roster and sets incentive concentration at its blocking boundary.

econ.TH↗

Differential Fault Analysis of Lilliput under Random-Location Nibble Faults

Lilliput is a lightweight block cipher based on a Type-2 Extended Generalized Feistel Network (EGFN). Although it has been studied under conventional cryptanalytic techniques, its resistance to fault attacks remains largely unexplored. We present a theoretical differential fault analysis of Lilliput under a random-location nibble fault model. A nonzero nibble fault is injected at the input to round 27, with the injection location uniformly distributed among the 16 state branches and unknown to the adversary. We analyze fault propagation through the EGFN and derive ciphertext-difference conditions to identify the faulty branch. A DDT-weighted calculation yields an overall branch-identification accuracy of approximately 99.9980% under independent uniform sampling of plaintexts, nonzero fault values, and fault locations; simulations of 2^20 random faults give 99.9983%. After identifying the faulty branch, we classify propagation patterns using the injected difference and the intermediate S-box output difference. We then derive DDT-based constraints on last-round and penultimate-round subkeys and intersect candidate sets from multiple faulty ciphertexts. In 2^15 simulation trials, key-recovery success rates exceed 90%, 95%, and 99% with 32, 36, and 46 faulty ciphertexts, respectively. These simulation-based results are not claims of physical fault-injection performance but offer insight into practical fault analysis of Lilliput.

cs.CR↗

Boundary Layers and Initial-Boundary Corner Asymptotics for the 2D Navier-Stokes Equations with Vanishing Vertical Viscosity

Motivated by anisotropic viscosity in geophysical fluid dynamics, where vertical momentum diffusion is often much weaker than horizontal diffusion and may be negligible in the interior yet remains essential near a solid wall, we study the vanishing vertical viscosity limit for the two-dimensional incompressible Navier--Stokes equations in the upper half-plane, with horizontal viscosity fixed at one and vertical viscosity \(\varepsilon^2\). For arbitrary divergence-free \(H^4\) no-slip initial data, with no time-differentiated compatibility conditions required, we construct the limiting horizontally viscous flow and the boundary-layer profiles on every prescribed finite interval \([0,T]\). The leading-order corrected approximation has \(O(\varepsilon)\) error in \(L^\infty\), and the full finite-order expansion reduces this error to \(O(\varepsilon^{3/2})\), uniformly down to \(t=0\). We further describe the development of the layer from data that vanish initially at the wall. At the initial--boundary corner, we determine the first two self-similar coefficients and characterize matching through exact profile tails, thereby separating the fixed-time scale \(\varepsilon\) from the short-time scale \(\varepsilon\sqrt t\). When the initial wall acceleration is nonzero, both the leading correction rate and the first normalized corner remainder are sharp. Finally, continuity estimates for fixed data yield joint small-time and small-viscosity limits for the exact solution, as well as finite-\(L^p\) asymptotics.

math.AP↗

From Position Risks to Block Survival: Faster Generation for Diffusion Language Models

Diffusion language models (DLMs) can accelerate generation by predicting multiple tokens in parallel, but there is a mismatch between how these tokens are predicted and how they ultimately contribute to generation. Parallel predictions can hardly condition on the tokens selected earlier within the same block, even though their validity depends on this realized prefix. Under the popular proposal-verification decoding, this mismatch makes errors highly asymmetric: an early rejection prevents all subsequent proposals from contributing decoding progress. We introduce BRISK-DLM, a framework that addresses both mismatches by optimizing proposal learning and selection for verified progress. BRISK-DLM trains on self-generated sequences, using risk-reward weighting to dynamically prioritize positions by their impact on verified progress and decoding cost. During inference, a lightweight prefix-conditioned corrector reranks existing candidates using previously selected tokens and preferences distilled from the model's own verifier. The corrector reuses the backbone's parallel representations and requires no additional backbone evaluation, while fused execution keeps its overhead small. BRISK-DLM improves end-to-end throughput by up to 37.4% while preserving task quality, establishing a new quality-throughput frontier for DLM generation.

cs.CL↗

COEVO: Co-Evolving Context and Parameters for Recursive Self-Improvement

Recursive self-improvement (RSI) seeks to move large language models beyond static training pipelines toward systems that can participate in improving their own future behavior. Existing approaches largely follow two directions: updating model parameters through online learning, or improving the external context through search, reflection, and prompt optimization. Although both mechanisms can support continued improvement, they are typically studied independently. This separation overlooks an important interaction: the context shapes the experience from which a model learns, while an evolving model may interpret and utilize the same context differently over time. We therefore formulate RSI as a problem of parameter--context co-evolution, where model parameters and the learning context adapt within a shared feedback loop. We introduce COEVO, a framework that updates model parameters from on-policy experience while adapting contextual guidance according to the state of the evolving policy. Policy entropy and prompt-conditioned attention are used as complementary signals to guide this adaptation. Experiments show that COEVO consistently improves task performance over fixed-context reinforcement learning and produces policies that are more robust to changes in system prompts. More broadly, our results suggest that external context should be viewed not merely as a fixed interface to a large language model, but as an adaptive component of recursive self-improvement.

cs.AI↗

Achieving 5-angstrom-resolution diffraction contrast with an uncorrected electron probe and nanosized defect characterizations

Atomic-resolution micrographs remain limited in application due to small field of view and low numbers of recorded defects. Defect imaging with reliable statistics in transmission electron microscopy (TEM) relies heavily on diffraction contrast. However, with 200-300 kV electrons, low-curvature Ewald sphere limits diffraction resolution at ~5 nm. Here, we imaged defects with a forbidden condition in TEM and improved the resolution in diffraction contrast from 5 to 0.5 nm. The superiority of our equal-s method is demonstrated by the discovery of a novel phase and dislocation loop structure in steels, which have not been previously reported experimentally or theoretically. Our equal-s can largely replace the classical two-beam condition for defect study.

cond-mat.mtrl-sci↗

Strategy-proof choice on strictly convex frontiers

A collective rule must often choose a public outcome on a constrained boundary. We characterize truthful choice with diagonal unanimity on the entire boundary of any compact full-dimensional strictly convex body in finite dimension at least two. On the full domain of linear support preferences, ordinary individual strategy-proofness and diagonal unanimity force the rule to select one fixed participant's preferred point at every profile. The population is any fixed finite nonempty set. No Pareto condition, boundary smoothness, or continuity or measurability of the rule is assumed. If interior outcomes are allowed instead, two or more participants can use positive fixed weighted averages of preferred points for truthful non-dictatorial compromise on the same type domain. The proof derives regularity from the two agents' incentive inequalities, transports a common support-measure bound across reports, and makes every convexified attainable menu a Minkowski summand of the feasible body. Boundary generation then forces fixed control. The result extends the spherical public-good location question and identifies the role of boundary-valued choice in eliminating truthful compromise.

econ.TH↗

Multi-mode fiber enabled multi-wavelength optical trapping and dynamic manipulation

Optical fiber tweezers offer distinct advantages for long-distance manipulation, compact integration, and minimally invasive operation in biological environments. However, most optical fiber tweezers rely on single-mode fibers (SMFs), which are constrained by limited optical mode diversity and reduced control flexibility. Although multi-mode fibers (MMFs) support a wider spectrum of propagation modes, their inherent mixed guided modes with low coherence become a long-standing limitation for the design of focused trapping configurations. To address these limitations, we propose and experimentally validate a fully MMF-based optical tweezer system integrated with a micro-lens structure fabricated on the fiber facet, enabling stable optical trapping across multiple wavelengths and dynamic manipulation of trapped cells. Employing 532 nm continuous-wave and 800 nm femtosecond lasers, we demonstrate that both light sources can generate tightly focused optical spots through the micro-lens with a high numerical aperture (NA>0.7), achieving robust trapping and axial dynamic manipulation of cells. Compared with conventional SMF-based tweezers, this approach leverages the broadband and multi-mode properties of MMFs, allows for wavelength-flexible and dynamically adjustable trapping of cells, and paves the way for lab-on-fiber biophotonic platforms with potential applications such as interventional manipulation, cell sorting, and cellular fluorescence analysis.

physics.optics↗

QLPO: Quadrant-weighted Sampling for Length-aware Policy Optimization

Recent large reasoning models often develop long chain-of-thought responses during reinforcement learning (RL), resulting in high inference latency and deployment cost. Existing methods for response length control typically rely on explicit length penalties or additional control modules, which require careful tuning and may compromise reasoning quality. We propose Quadrant-weighted Sampling for Length-aware Policy Optimization (QLPO), a simple resampling-based variant of GRPO that introduces implicit length control without modifying the reward function. QLPO first over-generates candidate responses and then resamples the training group by preserving the empirical correct/incorrect ratio while favoring short correct responses and long incorrect responses. This reshapes the training distribution and implicitly encourages shorter model outputs. Across models ranging from 1.5B to 32B parameters, including both base models and strong reasoning models, QLPO consistently improves the accuracy-length trade-off. It reduces response length by 30% to 70% while preserving reasoning performance. These results suggest that structured resampling provides an effective and robust approach to efficient reasoning.

cs.AI↗

Quantum Sampling Architecture for Protein Structure Reconstruction on Utility-Scale Hardware

Predicting the structure of short peptides in protein binding pockets remains difficult because this regime requires physics-based conformational search, yet existing methods do not provide a practical way to carry out that search on current hardware. We present QSAD, a quantum-classical framework that reformulates peptide structure prediction as amino-acid-level Hamiltonian sampling and replaces iterative optimization with non-iterative Hamiltonian evolution. Executed entirely on IBM Heron R2 across 101 binding-pocket peptides (5-18 residues), QSAD improves prediction accuracy by 27-71% over all evaluated AI and quantum baselines while maintaining the lowest variance across tested lengths. QSAD also tolerates noise levels 3-5x beyond typical hardware error rates, where iterative methods fail, and reduces mean quantum execution time by 27x relative to VQE. The sampled ensemble further supports approximate reconstruction of protein energy landscapes. These results establish coarse-grained quantum sampling as a practical computational path for structure prediction in regimes where data-driven methods lack sufficient signal.

cs.ET↗

DARTS: Distribution-Aware Active Rollout Trajectory Shaping for Accelerating LLM Reinforcement Learning

Reinforcement Learning (RL) has become pivotal for improving model capabilities yet suffers from rollout efficiency bottlenecks due to the long-tail response length distribution. While existing works mitigate the impact of long tails via prompt-level tail scheduling, we focus on the root source of inefficiency: the distribution itself. Specifically, we characterize the long-tail distribution at a finer granularity, identifying intra-prompt long tails, and revealing that they frequently consist of ineffective verbosity. To address this, we propose a novel paradigm of active distribution shaping to shape the rollout distribution towards conciseness and certainty, thereby fundamentally resolving tail-induced overheads. We achieve this through a distribution-aware trajectory sampling mechanism, which selects trajectories from a redundant exploration space for each prompt, and an adaptive redundancy allocation scheme to maximize both shaping effectiveness and system efficiency. Experiments demonstrate significant acceleration over state-of-the-art systems by up to 1.77x without compromising model performance.

cs.LG↗

Conditionally Whitened Generative Models for Probabilistic Time Series Forecasting

Probabilistic forecasting of multivariate time series is challenging due to non-stationarity, inter-variable dependencies, and distribution shifts. While recent diffusion and flow matching models have shown promise, they often ignore informative priors such as conditional means and covariances. In this work, we propose Conditionally Whitened Generative Models (CW-Gen), a framework that incorporates prior information through conditional whitening. Theoretically, we establish sufficient conditions under which replacing the traditional terminal distribution of diffusion models, namely the standard multivariate normal, with a multivariate normal distribution parameterized by estimators of the conditional mean and covariance improves sample quality. Guided by this analysis, we design a novel Joint Mean-Covariance Estimator (JMCE) that simultaneously learns the conditional mean and sliding-window covariance. Building on JMCE, we introduce Conditionally Whitened Diffusion Models (CW-Diff) and extend them to Conditionally Whitened Flow Matching (CW-Flow). Experiments on five real-world datasets with six state-of-the-art generative models demonstrate that CW-Gen consistently enhances predictive performance, capturing non-stationary dynamics and inter-variable correlations more effectively than prior-free approaches. Empirical results further demonstrate that CW-Gen can effectively mitigate the effects of distribution shift.

stat.ML↗

DISPROTBENCH: Uncovering the Functional Limits of Protein Structure Prediction Models in Intrinsically Disordered Regions

Intrinsically disordered regions (IDRs) play central roles in cellular function, yet remain poorly evaluated by existing protein structure prediction benchmarks. Current evaluations largely focus on well-folded domains, overlooking three fundamental challenges in realistic biological settings: the structural complexity of proteins, the resulting low availability of reliable ground truth, and prediction uncertainty that can propagate into high-risk downstream failures, such as in drug discovery, protein-protein interaction modeling, and functional annotation. We present DisProtBench, an IDR-centric benchmark that explicitly incorporates prediction uncertainty into the evaluation of protein structure prediction models (PSPMs). To address structural complexity and ground-truth scarcity, we curate and unify a large-scale, multi-modal dataset spanning disease-relevant IDRs, GPCR-ligand interactions, and multimeric protein complexes. To assess predictive uncertainty, we introduce Functional Uncertainty Sensitivity (FUS), a novel prediction uncertainty-stratified metric that quantifies downstream task performance under prediction uncertainty. Using this benchmark, we conduct a systematic evaluation of state-of-the-art PSPMs and reveal clear, task-dependent failure modes. Protein-protein interaction prediction degrades sharply in IDRs, while structure-based drug discovery remains comparatively robust. These effects are largely invisible to standard global accuracy metrics, which overestimate functional reliability under prediction uncertainty. We have open-sourced our benchmark and the codebase at https://github.com/Susan571/DisProtBench.

q-bio.BM↗

Purified Two-Relaxation-Time Lattice Boltzmann Method: Removing Ghost Modes from TRT for Enhanced Stability

The two-relaxation-time (TRT) lattice Boltzmann model is widely adopted for its simplicity and tunable boundary accuracy. However, its collision operator relaxes the full symmetric non-equilibrium component, implicitly retaining non-hydrodynamic ghost modes that degrade stability at high Reynolds numbers. In this work, we establish a rigorous connection between ghost-mode filtering and regularization within the TRT framework. By decomposing the discrete velocity space into hydrodynamic and non-hydrodynamic subspaces, we prove that the TRT-regularized lattice Boltzmann (TRT-RLB) model is mathematically equivalent to the standard TRT model with ghost modes explicitly removed. This equivalence holds exactly for D2Q9 and D3Q19 lattices, where the symmetric and antisymmetric subspaces are completely spanned by the physically relevant Hermite modes and identifiable ghost modes. Based on this finding, we propose the Purified TRT (P-TRT) model, which achieves regularization-level stability through simple algebraic ghost-mode subtraction rather than expensive tensor projections. For D2Q9, the non-equilibrium collision cost is reduced from 180 to 52 floating-point operations per node, a 71% reduction. Linear stability analysis in moment space further reveals that the P-TRT operator annihilates the ghost eigenvalue, proving its spectral radius is bounded above by that of standard TRT and that stability is governed exclusively by hydrodynamic modes. Benchmarks including the double shear layer at Re up to 10^7, Taylor--Green vortex decay, force-driven Poiseuille flow, and creeping flow past a square cylinder confirm that P-TRT preserves the stability, second-order accuracy, and zero-slip boundary properties of TRT-RLB while retaining the simplicity of the TRT family.

physics.flu-dyn↗

Cryptanalysis of Gleeok-128

Gleeok is a family of low latency keyed pseudorandom functions (PRFs) consisting of three parallel SPN based permutations whose outputs are XORed to form the final value. Both Gleeok-128 and Gleeok-256 use a 256 bit key, with block sizes of 128 and 256 bits, respectively. Owing to its multi branch structure, evaluating security margins and mounting effective key recovery attacks present nontrivial challenges. This paper provides the first comprehensive third party cryptanalysis of Gleeok-128. We introduce a two stage MILP based framework for constructing branch wise and full cipher differential linear (DL) distinguishers, together with an integral based key recovery framework tailored to multi branch designs. Our DL analysis yields 7, 7, 8, and 4 round distinguishers for Branch 1, Branch 2, Branch 3, and Gleeok-128, respectively, with squared correlations approximately 2 to the power minus 88.12, 2 to the power minus 88.12, 2 to the power minus 38.73, and 2 to the power minus 49.04, outperforming those in the design document except for the full PRF case. By tightening algebraic degree bounds, we further derive 9, 9, and 7 round integral distinguishers for the three branches and a 7 round distinguisher for the full PRF, extending the designers results by 3, 3, and 2 rounds and by 2 rounds, respectively. These integral properties enable 7 round and 8 round key recovery attacks in the non full codebook and full codebook settings. In addition, we identify a flaw in the original linear security evaluation of Branch 3, showing that it can be distinguished over all 12 rounds with data complexity about 2 to the power 48. We also propose optimized linear layer parameters that significantly improve linear resistance without sacrificing diffusion. Our results advance the understanding of Gleeok-128 and provide general methods for analyzing multi branch symmetric designs.

cs.CR↗

Enhancing Deep Learning-Based Rotational-XOR Attacks on Lightweight Block Ciphers Simon32/64 and Simeck32/64

At CRYPTO 2019, Gohr pioneered neural cryptanalysis by introducing differential-based neural distinguishers to attack Speck32/64, establishing a novel paradigm combining deep learning with differential cryptanalysis.Since then, constructing neural distinguishers has become a significant approach to achieving the deep learning-based cryptanalysis for block ciphers.This paper advances rotational-XOR (RX) attacks through neural networks, focusing on optimizing distinguishers and presenting key-recovery attacks for the lightweight block ciphers Simon32/64 and Simeck32/64.In particular, we first construct the fundamental data formats specially designed for training RX-neural distinguishers by refining the existing data formats for differential-neural distinguishers. Based on these data formats, we systematically identify optimal RX-differences with Hamming weights 1 and 2 that develop high-accuracy RX-neural distinguishers. Then, through innovative application of the bit sensitivity test, we achieve significant compression of data format without sacrificing the distinguisher accuracy. This optimization enables us to add more multi-ciphertext pairs into the data formats, further strengthening the performance of RX-neural distinguishers. As an application, we obtain 14- and 17-round RX-neural distinguishers for Simon32/64 and Simeck32/64, which improves the previous ones by 3 and 2 rounds, respectively.In addition, we propose two novel techniques, key bit sensitivity test and the joint wrong key response, to tackle the challenge of applying Bayesian's key-recovery strategy to the target cipher that adopts nonlinear key schedule in the related-key setting without considering of weak-key space. By this, we can straightforwardly mount a 17-round key-recovery attack on Simeck32/64 based on the improved 16-round RX-nerual distinguisher. To the best of our knowledge, the presented RX-neural......

cs.CR↗