arXiv subjects

Rui Sun

Publications and source records attributed to Rui Sun.

At least 55 records · Page 3Linked to original sources

arXiv2026

The Inflation of Resetting Workers

The standard wage Phillips curve aggregates away from which workers reset wages when. I show this aggregation omits a first-order term: the covariance between workers' cost-push exposure and their reset frequency. I introduce two sufficient statistics and embed them in a multi-country HANK model calibrated to six euro-area economies. The omitted term generates 7 percent more cumulative core inflation in the baseline and 10--26 percent more when monetary policy is delayed. Two economies with identical openness can differ by 6.6 percentage-point-quarters solely from within-country composition. Targeted essentials subsidies reduce welfare loss by 32 percent relative to aggressive tightening. Out of sample, the model correctly predicts the persistence ranking across the UK, the US, and Japan.

econ.GN↗

arXiv2026

Risk Capacity and Optimal Monetary Policy

We characterize optimal monetary policy when policy endogenously moves risk premia through redistribution across agents who differ in their willingness to bear risk. The analytical core is Marginal Risk Capacity, the covariance of monetary policy exposures with marginal propensities to take risk. This sufficient statistic governs this channel as MPCs govern the consumption channel. MRC enters the Ramsey criterion as a risk premium wedge that breaks divine coincidence, vanishes if and only if macroprudential tools are available, and generates a new inflation bias under discretion. Solving the Ramsey problem globally reveals a risk capacity trap where transmission collapses, and optimal policy preemptively prevents it.

econ.TH↗

arXiv2026

Marine Heatwaves in the Arabian Sea: Drivers and Impacts on Atmospheric Circulation and Extreme Precipitation

Marine heatwaves (MHWs) threaten marine ecosystems and significantly impact weather patterns. In the Arabian Sea, summer MHWs are of particular concern due to their potential impacts on the Indian summer monsoon, a lifeline for nearly a billion people. However, the drivers of these MHWs and their influence on atmospheric circulation and monsoon rainfall remain poorly understood. Using satellite observations, reanalysis datasets, and numerical model experiments, we investigate the key drivers of MHW events and assess their impacts. When SST warming trends are retained, the eastern and northern Arabian Sea emerge as MHW hotspots, showing rapid increases during 1982-2023, largely due to anthropogenic warming. On detrending the SSTs to remove the influence of anthropogenic warming on individual MHWs, we find that most MHWs are short-lived (lasting <= 20 days) and are initiated by enhanced surface shortwave radiation and reduced latent heat loss associated with the suppressed convection phase of the Boreal Summer Intraseasonal Oscillations (BSISOs). Interannual SST anomalies, including ENSO and Indian Ocean Dipole (IOD), further modulate the year-to-year MHW variability. Conversely, the warm SSTs during MHWs exert strong atmospheric feedbacks. MHWs in the eastern Arabian Sea drive cyclonic winds, intensify moisture convergence and increase the risk of extreme precipitation along the southwest coast of India. In the northern Arabian Sea, MHW-induced cyclones trigger intense rainfall over northwestern India and Pakistan, contributing to extreme events like the 2022 Pakistan floods. These findings improve our capacity to predict Arabian Sea MHWs and assess their risks, offering significant socio-economic and ecological benefits.

physics.ao-ph↗

arXiv2026

Coupled Ferroelectricity and Phonon Chirality

The ability to control chirality and chiral phonons offers a route to manipulate the direction of spin and angular-momentum transport. In materials with rigid structural chirality, such as quartz, phonon chirality is fixed by the handedness and cannot be switched. By contrast, ferroelectric materials host a spontaneous polarization that can be reversibly switched by an external electric field. When chirality is coupled to this ferroelectric polarization, it enables electrical switching of crystal chirality and the associated phonon angular momentum, which is compatible with solid-state spintronic architectures, enabling control over chirality-dependent quantum states.1 Here, we report the experimental demonstration of the coupling between ferroelectricity and phonon chirality in the molecular ferroelectric triglycine sulfate. By electrically switching the crystal chirality, we achieve reversible and device-compatible control of phonon chirality, as revealed by in situ time-resolved magneto-optical Kerr effect measurements. The Kerr rotation reverses with electric-field switching, while phonon chirality vanishes in the paraelectric phase and is tunable in the racemic ferroelectric state. Furthermore, density functional theory calculations and circularly polarized Raman spectroscopy further corroborate the opposite circular phonon motions. These results establish an electrically addressable coupling pathway linking ferroelectricity, structural chirality, chiral phonons, and spin, opening a route toward chiral-phonon-enabled spin and phonon control technologies based on ferroelectric materials.

cond-mat.mtrl-sci↗

arXiv2026

A Disguise-and-Squeeze PIR Scheme for the MDS-TPIR Setting and Beyond

We consider the problem of private information retrieval (PIR) from MDS coded databases with colluding servers, i.e., MDS-TPIR. In the MDS-TPIR setting, $M$ files are stored across $N$ servers, where each file is stored independently using an $(N,K)$-MDS code. A user wants to retrieve one file without disclosing the index of the desired file to any set of up to $T$ colluding servers. The general problem in studying PIR schemes is to maximize the PIR rate, defined as the ratio of the size of the desired file to the size of the total download. Freij-Hollanti et al. proposed a conjecture of the MDS-TPIR capacity (the maximum achievable PIR rate), which was later disproved by Sun and Jafar by a counterexample with $(M,N,T,K)=(2,4,2,2)$. In this paper, we propose a new MDS-TPIR scheme based on a disguise-and-squeeze approach. The features of our scheme include the following. Our scheme generalizes the Sun-Jafar counterexample to $(M,N,T,K)=(2,N,2,K)$ with $N\geq K+2$ for an arbitrary $(N,K)$-MDS coded system, providing more counterexamples to the conjecture by Freij-Hollanti et al. For $(M,N,T,K)=(2,N,2,K)$ and a GRS (generalized Reed-Solomon codes) coded system, our scheme has rate $\frac{N^2-N}{N^2+KN-2K}$, beating the state-of-the-art results. We further show that this rate achieves the linear MDS-TPIR capacity when $K=2$. Our scheme features a significantly smaller field size for implementation and the adaptiveness to generalized PIR models such as multi-file MDS-TPIR and MDS-PIR against cyclically adjacent colluding servers. Lastly, we provide an $ε$-error MDS-TPIR scheme for $T\geq 3$ based on the disguise-and-squeeze framework.

cs.IT↗

arXiv2026

Modulating Surface Acoustic Wave Generation through Superconductivity

Surface acoustic waves (SAWs), with their five orders-of-magnitude slower propagation velocity, allow for considerably shorter wavelengths at the same frequency compared to electromagnetic waves. The short wavelengths allow for device miniaturization and on-chip integration. The generic design of these devices involve piezoelectric substrates with comblike arrays of Al or Au electrodes known as interdigitated transducers deposited on the surface. However, Al and Au both have shortcomings at the cryogenic temperatures required for quantum applications, namely the formation of two-level systems and the lack of superconductivity perpetuating Ohmic losses, respectively. In this work, SAWs are generated in the high-MHz to low-GHz range using niobium nitride (NbN) interdigitated transducers (IDTs) and Bragg reflectors. We demonstrate the fabrication of acoustic devices through photolithography and reactive ion etching (RIE). The sharp transition between superconducting and normal states and the corresponding change in SAW transmission allows for fine control of the 'on' (superconducting) and 'off' (normal) states of NbN, with a Δ_T = K separating the transmission minimum and maximum. We demonstrate a 16x difference in transmission between the 'on' and 'off' states of the device. The SAW transmission behavior mirrors the change in resistance of NbN at its Tc. These findings open up new possibilities for the integration of NbN SAW resonators into existing quantum architectures based on NbN and a method for adjusting transmission properties independent of applied voltage.

cond-mat.mes-hall↗

arXiv2026

Adaptive Augmentation-Aware Latent Learning for Robust LiDAR Semantic Segmentation

Adverse weather conditions significantly degrade the performance of LiDAR point cloud semantic segmentation networks by introducing large distribution shifts. Existing augmentation-based methods attempt to enhance robustness by simulating weather interference during training. However, they struggle to fully exploit the potential of augmentations due to the trade-off between minor and aggressive augmentations. To address this, we propose A3Point, an adaptive augmentation-aware latent learning framework that effectively utilizes a diverse range of augmentations while mitigating the semantic shift, which refers to the change in the semantic meaning caused by augmentations. A3Point consists of two key components: semantic confusion prior (SCP) latent learning, which captures the model's inherent semantic confusion information, and semantic shift region (SSR) localization, which decouples semantic confusion and semantic shift, enabling adaptive optimization strategies for different disturbance levels. Extensive experiments on multiple standard generalized LiDAR segmentation benchmarks under adverse weather demonstrate the effectiveness of our method, setting new state-of-the-art results.

cs.CV↗

arXiv2026

LLM4AD: A Platform for Algorithm Design with Large Language Model

We introduce LLM4AD, a unified Python platform for algorithm design (AD) with large language models (LLMs). LLM4AD is a generic framework with modularized blocks for search methods, algorithm design tasks, and LLM interface. The platform integrates numerous key methods and supports a wide range of algorithm design tasks across various domains including optimization, machine learning, and scientific discovery. We have also designed a unified evaluation sandbox to ensure a secure and robust assessment of algorithms. Additionally, we have compiled a comprehensive suite of support resources, including tutorials, examples, a user manual, online resources, and a dedicated graphical user interface (GUI) to enhance the usage of LLM4AD. We believe this platform will serve as a valuable tool for fostering future development in the merging research direction of LLM-assisted algorithm design.

cs.AI↗

arXiv2026

How Do Latent Reasoning Methods Perform Under Weak and Strong Supervision?

Latent reasoning has been recently proposed as a reasoning paradigm and performs multi-step reasoning through generating steps in the latent space instead of the textual space. This paradigm enables reasoning beyond discrete language tokens by performing multi-step computation in continuous latent spaces. Although there have been numerous studies focusing on improving the performance of latent reasoning, its internal mechanisms remain not fully investigated. In this work, we conduct a comprehensive analysis of latent reasoning methods to better understand the role and behavior of latent representation in the process. We identify two key issues across latent reasoning methods with different levels of supervision. First, we observe pervasive shortcut behavior, where they achieve high accuracy without relying on latent reasoning. Second, we examine the hypothesis that latent reasoning supports BFS-like exploration in latent space, and find that while latent representations can encode multiple possibilities, the reasoning process does not faithfully implement structured search, but instead exhibits implicit pruning and compression. Finally, our findings reveal a trade-off associated with supervision strength: stronger supervision mitigates shortcut behavior but restricts the ability of latent representations to maintain diverse hypotheses, whereas weaker supervision allows richer latent representations at the cost of increased shortcut behavior.

cs.AI↗

arXiv2026

SoK: Blockchain-Based Decentralized AI (DeAI)

Centralization enhances the efficiency of Artificial Intelligence (AI) but also introduces critical challenges, including single points of failure, inherent biases, data privacy risks, and scalability limitations. To address these issues, blockchain-based Decentralized Artificial Intelligence (DeAI) has emerged as a promising paradigm that leverages decentralization and transparency to improve the trustworthiness of AI systems. Despite rapid adoption in industry, the academic community lacks a systematic analysis of DeAI's technical foundations, opportunities, and challenges. This work presents the first Systematization of Knowledge (SoK) on DeAI, offering a formal definition, a taxonomy of existing solutions based on the AI lifecycle, and an in-depth investigation of the roles of blockchain in enabling secure and incentive-compatible collaboration. We further review security risks across the DeAI lifecycle and empirically evaluate representative mitigation techniques. Finally, we highlight open research challenges and future directions for advancing blockchain-based DeAI.

cs.LG↗

arXiv2026

Pruning as a Cooperative Game: Surrogate-Assisted Layer Contribution Estimation for Large Language Models

While large language models (LLMs) demonstrate impressive performance across various tasks, their deployment in real-world scenarios is still constrained by high computational demands. Layer-wise pruning, a commonly employed strategy to mitigate inference costs, can partially address this challenge. However, existing approaches generally depend on static heuristic rules and fail to account for the interdependencies among layers, thereby limiting the effectiveness of the pruning process. To this end, this paper proposes a game-theoretic framework that formulates layer pruning as a cooperative game in which each layer acts as a player and model performance serves as the utility. As computing exact Shapley values is computationally infeasible for large language models (LLMs), we propose using a lightweight surrogate network to estimate layer-wise marginal contributions. This network can predict LLM performance for arbitrary layer combinations at a low computational cost. Additionally, we employ stratified Monte Carlo mask sampling to further reduce the cost of Sharpley value estimation. This approach captures inter-layer dependencies and dynamically identifies critical layers for pruning. Extensive experiments demonstrate the consistent superiority of our method in terms of perplexity and zero-shot accuracy, achieving more efficient and effective layer-wise pruning for large language models.

cs.CL↗

arXiv2026

Advancing Opinion Dynamics Modeling with Neural Diffusion-Convection-Reaction Equation

Advanced opinion dynamics modeling is vital for deciphering social behavior, emphasizing its role in mitigating polarization and securing cyberspace. To synergize mechanistic interpretability with data-driven flexibility, recent studies have explored the integration of Physics-Informed Neural Networks (PINNs) for opinion modeling. Despite this promise, existing methods are tailored to incomplete priors, lacking a comprehensive physical system to integrate dynamics from local, global, and endogenous levels. Moreover, penalty-based constraints adopted in existing methods struggle to deeply encode physical priors, leading to optimization pathologies and discrepancy between latent representations and physical transparency. To this end, we offer a physical view to interpret opinion dynamics via Diffusion-Convection-Reaction (DCR) system inspired by interacting particle theory. Building upon the Neural ODEs, we define the neural opinion dynamics to coordinate neural networks with physical priors, and further present the OPINN, a physics-informed neural framework for opinion dynamics modeling. Evaluated on real-world and synthetic datasets, OPINN achieves state-of-the-art performance in opinion evolution forecasting, offering a promising paradigm for the nexus of cyber, physical, and social systems.

cs.AI↗

arXiv2026

Disco: Densely-overlapping Cell Instance Segmentation via Adjacency-aware Collaborative Coloring

Accurate cell instance segmentation is foundational for digital pathology analysis. Existing methods based on contour detection and distance mapping still face significant challenges in processing complex and dense cellular regions. Graph coloring-based methods provide a new paradigm for this task, yet the effectiveness of this paradigm in real-world scenarios with dense overlaps and complex topologies has not been verified. Addressing this issue, we release a large-scale dataset GBC-FS 2025, which contains highly complex and dense sub-cellular nuclear arrangements. We conduct the first systematic analysis of the chromatic properties of cell adjacency graphs across four diverse datasets and reveal an important discovery: most real-world cell graphs are non-bipartite, with a high prevalence of odd-length cycles (predominantly triangles). This makes simple 2-coloring theory insufficient for handling complex tissues, while higher-chromaticity models would cause representational redundancy and optimization difficulties. Building on this observation of complex real-world contexts, we propose Disco (Densely-overlapping Cell Instance Segmentation via Adjacency-aware COllaborative Coloring), an adjacency-aware framework based on the "divide and conquer" principle. It uniquely combines a data-driven topological labeling strategy with a constrained deep learning system to resolve complex adjacency conflicts. First, "Explicit Marking" strategy transforms the topological challenge into a learnable classification task by recursively decomposing the cell graph and isolating a "conflict set." Second, "Implicit Disambiguation" mechanism resolves ambiguities in conflict regions by enforcing feature dissimilarity between different instances, enabling the model to learn separable feature representations.

cs.CV↗

arXiv2026

MSPCaps: A Multi-Scale Patchify Capsule Network with Cross-Agreement Routing for Visual Recognition

Capsule Network (CapsNet) has demonstrated significant potential in visual recognition by capturing spatial relationships and part-whole hierarchies for learning equivariant feature representations. However, existing CapsNet and variants often rely on a single high-level feature map, overlooking the rich complementary information from multi-scale features. Furthermore, conventional feature fusion strategies (e.g., addition and concatenation) struggle to reconcile multi-scale feature discrepancies, leading to suboptimal classification performance. To address these limitations, we propose the Multi-Scale Patchify Capsule Network (MSPCaps), a novel architecture that integrates multi-scale feature learning and efficient capsule routing. Specifically, MSPCaps consists of three key components: a Multi-Scale ResNet Backbone (MSRB), a Patchify Capsule Layer (PatchifyCaps), and Cross-Agreement Routing (CAR) blocks. First, the MSRB extracts diverse multi-scale feature representations from input images, preserving both fine-grained details and global contextual information. Second, the PatchifyCaps partitions these multi-scale features into primary capsules using a uniform patch size, equipping the model with the ability to learn from diverse receptive fields. Finally, the CAR block adaptively routes the multi-scale capsules by identifying cross-scale prediction pairs with maximum agreement. Unlike the simple concatenation of multiple self-routing blocks, CAR ensures that only the most coherent capsules contribute to the final voting. Our proposed MSPCaps achieves remarkable scalability and superior robustness, consistently surpassing multiple baseline methods in terms of classification accuracy, with configurations ranging from a highly efficient Tiny model (344.3K parameters) to a powerful Large model (10.9M parameters), highlighting its potential in advancing feature representation learning.

cs.CV↗

arXiv2026

AgentsEval: Clinically Faithful Evaluation of Medical Imaging Reports via Multi-Agent Reasoning

Evaluating the clinical correctness and reasoning fidelity of automatically generated medical imaging reports remains a critical yet unresolved challenge. Existing evaluation methods often fail to capture the structured diagnostic logic that underlies radiological interpretation, resulting in unreliable judgments and limited clinical relevance. We introduce AgentsEval, a multi-agent stream reasoning framework that emulates the collaborative diagnostic workflow of radiologists. By dividing the evaluation process into interpretable steps including criteria definition, evidence extraction, alignment, and consistency scoring, AgentsEval provides explicit reasoning traces and structured clinical feedback. We also construct a multi-domain perturbation-based benchmark covering five medical report datasets with diverse imaging modalities and controlled semantic variations. Experimental results demonstrate that AgentsEval delivers clinically aligned, semantically faithful, and interpretable evaluations that remain robust under paraphrastic, semantic, and stylistic perturbations. This framework represents a step toward transparent and clinically grounded assessment of medical report generation systems, fostering trustworthy integration of large language models into clinical practice.

cs.AI↗

arXiv2026

A Control Theoretic Approach to Decentralized AI Economy Stabilization via Dynamic Buyback-and-Burn Mechanisms

The democratization of artificial intelligence through decentralized networks represents a paradigm shift in computational provisioning, yet the long-term viability of these ecosystems is critically endangered by the extreme volatility of their native economic layers. Current tokenomic models, which predominantly rely on static or threshold-based buyback heuristics, are ill-equipped to handle complex system dynamics and often function pro-cyclically, exacerbating instability during market downturns. To bridge this gap, we propose the Dynamic-Control Buyback Mechanism (DCBM), a formalized control-theoretic framework that utilizes a Proportional-Integral-Derivative (PID) controller with strict solvency constraints to regulate the token economy as a dynamical system. Extensive agent-based simulations utilizing Jump-Diffusion processes demonstrate that DCBM fundamentally outperforms static baselines, reducing token price volatility by approximately 66% and lowering operator churn from 19.5% to 8.1% in high-volatility regimes. These findings establish that converting tokenomics from static rules into continuous, structurally constrained control loops is a necessary condition for secure and sustainable decentralized intelligence networks.

cs.GT↗

arXiv2026

Towards Robust Pseudo-Label Learning in Semantic Segmentation: An Encoding Perspective

Pseudo-label learning is widely used in semantic segmentation, particularly in label-scarce scenarios such as unsupervised domain adaptation (UDA) and semisupervised learning (SSL). Despite its success, this paradigm can generate erroneous pseudo-labels, which are further amplified during training due to utilization of one-hot encoding. To address this issue, we propose ECOCSeg, a novel perspective for segmentation models that utilizes error-correcting output codes (ECOC) to create a fine-grained encoding for each class. ECOCSeg offers several advantages. First, an ECOC-based classifier is introduced, enabling model to disentangle classes into attributes and handle partial inaccurate bits, improving stability and generalization in pseudo-label learning. Second, a bit-level label denoising mechanism is developed to generate higher-quality pseudo-labels, providing adequate and robust supervision for unlabeled images. ECOCSeg can be easily integrated with existing methods and consistently demonstrates significant improvements on multiple UDA and SSL benchmarks across different segmentation architectures. Code is available at https://github.com/Woof6/ECOCSeg.

cs.CV↗

arXiv2026

Trade-R1: Bridging Verifiable Rewards to Stochastic Environments via Process-Level Reasoning Verification

Reinforcement Learning (RL) has enabled Large Language Models (LLMs) to achieve remarkable reasoning in domains like mathematics and coding, where verifiable rewards provide clear signals. However, extending this paradigm to financial decision is challenged by the market's stochastic nature: rewards are verifiable but inherently noisy, causing standard RL to degenerate into reward hacking. To address this, we propose Trade-R1, a model training framework that bridges verifiable rewards to stochastic environments via process-level reasoning verification. Our key innovation is a verification method that transforms the problem of evaluating reasoning over lengthy financial documents into a structured Retrieval-Augmented Generation (RAG) task. We construct a triangular consistency metric, assessing pairwise alignment between retrieved evidence, reasoning chains, and decisions to serve as a validity filter for noisy market returns. We explore two reward integration strategies: Fixed-effect Semantic Reward (FSR) for stable alignment signals, and Dynamic-effect Semantic Reward (DSR) for coupled magnitude optimization. Experiments on different country asset selection demonstrate that our paradigm reduces reward hacking, with DSR achieving superior cross-market generalization while maintaining the highest reasoning consistency.

cs.AI↗