Searcharxiv⌕ Search

arXiv subjects

Yang Shen

Publications and source records attributed to Yang Shen.

At least 37 records · Page 2Linked to original sources

SeekRBP: Leveraging Sequence-Structure Integration with Reinforcement Learning for Receptor-Binding Protein Identification

Motivation: Receptor-binding proteins (RBPs) initiate viral infection and determine host specificity, serving as key targets for phage engineering and therapy. However, the identification of RBPs is complicated by their extreme sequence divergence, which often renders traditional homology-based alignment methods ineffective. While machine learning offers a promising alternative, such approaches struggle with severe class imbalance and the difficulty of selecting informative negative samples from heterogeneous tail proteins. Existing methods often fail to balance learning from these ``hard negatives'' while maintaining generalization. Results: We present SeekRBP, a sequence--structure framework that models negative sampling as a sequential decision-making problem. By employing a multi-armed bandit strategy, SeekRBP dynamically prioritizes informative non-RBP sequences based on real-time training feedback, complemented by a multimodal fusion of protein language and structural embeddings. Benchmarking demonstrates that SeekRBP consistently outperforms static sampling strategies. Furthermore, a case study on Vibrio phages validates that SeekRBP effectively identifies RBPs to improve host prediction, highlighting its potential for large-scale annotation and synthetic biology applications.

q-bio.GN↗

Recency/Frequency Adaptive KV Caching for Large Language Model Serving

Key-value (KV) caching is a powerful technique for accelerating large language model inference and generation. Inference workloads are large and diverse, which makes them difficult to cache effectively. Existing cache management strategies adopt the least-recently-used policy for evicting cache blocks. However, LRU leads to multiple unrelated workloads flushing each other's caches. To address this, we integrate adaptive caching that dynamically allocates cache space between recently and frequently occurring KV blocks. Evaluations show that it improves the KV cache hit rate by up to 10.8% and reduces time to first token by up to 12.6% over naive vLLM on synthetic document question answering workloads, and 2.1% and 2.0% respectively on real-world conversation workloads. The method generalizes well to batch inference and demonstrates clear interpretability while effectively accommodating diverse workloads.

cs.DC↗

STC: Reversible Digit-Context Decomposition for BWT-Family Text Compression

Burrows-Wheeler-transform-based compressors rely on local context regularity, but structured text also contains dates, counters, identifiers, coordinates, and other digit runs whose values vary differently from their surrounding tokens. STC is presented as a new algorithm found by the authors through the self-evolving AI system zeelin. It is a practical BWT-family compressor that separates this source of variation before the component BWT stage. It replaces digit runs in the main stream with an unambiguous placeholder and stores the removed digits in length- and context-conditioned side streams. The side streams use stable bucket ordering and compact digit packing, so the decoder can reconstruct the original run order from the normalized main stream without storing a separate permutation. The resulting components are encoded by a fixed internal BWT/M03-style component coder. On enwik9, STC produces a 157,388,188-byte archive with a 183,174-byte decoder source package, giving a local LTCB-style total of 157,571,362 bytes. A full-enwik9 same-coder ablation shows that the digit-context decomposition reduces the archive by 2,629,561 bytes relative to the no-split control. The result is locally verified by full decode and SHA-256 matching; official benchmark status requires independent maintainer-side verification.

cs.IT↗

Nearly optimal spectral gaps for random Belyi surfaces

In this paper, we show that a random hyperbolic surface in the Brooks-Makover model has a spectral gap greater than $\left(\frac{1}{4}-\frac{c}{\log n}\right)$ for some universal constant $c>0$ , confirming the nearly optimal spectral gap conjecture in this model.

math.SP↗

AutoTail-BSFGM: Class-Balance-Aware Fine-Tuning for Chinese Scholarly Text Classification

Scholarly text classification supports literature organization, subject indexing, and research intelligence, but Chinese scholarly corpora often contain imbalanced and semantically adjacent disciplinary labels. We propose AutoTail-BSFGM, a class-balance-aware fine-tuning method that combines an automatically gated tail-prior adjustment, a weak Balanced Softmax auxiliary loss, and Fast Gradient Method adversarial regularization. The method changes only the training objective and procedure; inference uses the same single base-size encoder and linear classifier as the corresponding label-smoothed baseline. We evaluate the method on two CSL-based tasks: an abstract-to-discipline task with 67 labels and a title-to-category task with 13 categories. On the primary abstract task, AutoTail-BSFGM improves validation and lockbox accuracy under both Chinese RoBERTa-WWM and MacBERT-base. With MacBERT-base, validation accuracy increases by 0.83 percentage points and lockbox accuracy by 0.49 points, with a pooled paired McNemar signal on validation (p = 0.023). On the title task, the method improves validation accuracy by 0.70 points and validation balanced accuracy by 2.64 points; lockbox accuracy is approximately neutral while lockbox balanced accuracy improves by 1.22 points. The results support a bounded contribution: AutoTail-BSFGM improves class-balance-sensitive behavior and yields consistent gains for abstract-based scholarly classification, without uniformly improving every metric on every split.

cs.CL↗

A Wafer-Scale Heterogeneous III-V-on-Silicon Nitride Quantum Photonic Platform

Heterogeneous integration of gain and strongly nonlinear materials with ultra-low-loss silicon nitride (SiN) photonics offers a route to scalable quantum circuits, but concurrent wafer-scale manufacturability, low interlayer loss, and high performance have been challenging to realize. Here we demonstrate a wafer-scale III-V-on-SiN quantum photonic platform that directly integrates III-V layers to foundry-fabricated SiN circuits. The SiN layer provides 200-300 nm thick waveguides with $<1$ dB/m loss and a mature passive photonics ecosystem, while III-V materials provide large $χ^{\left(2\right)}$ and $χ^{\left(3\right)}$ nonlinearities for parametric gain, frequency conversion and quantum light generation. Adiabatic interlayer couplers yield $<25$ mdB loss to InGaP waveguides and resonators with intrinsic quality factors exceeding $10^6$, enabling $15\times$ brighter entanglement sources and efficient nonlinear conversion on SiN. Integrated components--including low-loss beam splitters, waveguide crossers, and tunable interferometers--are complemented by III-V lasers and InP photodetectors with amplifiers achieving up to $99^{+1}_{-12}\%$ quantum efficiency and $3$ GHz bandwidth. This architecture unites ultra-efficient sources, nonlinear elements and detectors on a wafer-scale, low-loss platform, establishing a path toward large-scale, low-noise quantum photonic systems.

physics.optics↗

Learning to Perceive "Where": Spatial Pretext Tasks for Robust Self-Supervised Learning

Existing self-supervised learning (SSL) methods primarily learn object-invariant representations but often neglect the spatial structure and relationships among object parts. To address this limitation, we introduce Spatial Prediction (SP), a spatially aware pretext regression task that predicts the relative position and scale between a pair of disentangled local views from the same image. By modeling part-to-part relationships in a continuous geometric space, SP encourages representations to capture fine-grained spatial dependencies beyond invariant categorical semantics, thereby learning the compositional structure of visual scenes. SP is implemented as a decoupled plug-in and can be seamlessly integrated into diverse SSL frameworks. Extensive experiments show consistent improvements across image recognition, fine-grained classification, semantic segmentation, and depth estimation, as well as substantial gains in out-of-distribution robustness for object recognition. To evaluate spatial reasoning, we introduce (1) a position and scale prediction task on image patch pairs and (2) a jigsaw understanding task requiring patch reordering and recognition after reconstruction. Strong performance on these tasks indicates improved spatial structure and geometric awareness. Overall, explicitly modeling spatial information provides an effective inductive bias for SSL, leading to more structured representations and better generalization. Code and models will be released.

cs.CV↗

An Empirical Study of Multi-Agent Collaboration for Automated Research

As AI agents evolve, the community is rapidly shifting from single Large Language Models (LLMs) to Multi-Agent Systems (MAS) to overcome cognitive bottlenecks in automated research. However, the optimal multi-agent coordination framework for these autonomous agents remains largely unexplored. In this paper, we present a systematic empirical study investigating the comparative efficacy of distinct multi-agent structures for automated machine learning optimization. Utilizing a rigorously controlled, execution-based testbed equipped with Git worktree isolation and explicit global memory, we benchmark a single-agent baseline against two multi-agent paradigms: a subagent architecture (parallel exploration with post-hoc consolidation) and an agent team architecture (experts with pre-execution handoffs). By evaluating these systems under strictly fixed computational time budgets, our findings reveal a fundamental trade-off between operational stability and theoretical deliberation. The subagent mode functions as a highly resilient, high-throughput search engine optimal for broad, shallow optimizations under strict time constraints. Conversely, the agent team topology exhibits higher operational fragility due to multi-author code generation but achieves the deep theoretical alignment necessary for complex architectural refactoring given extended compute budgets. These empirical insights provide actionable guidelines for designing future autoresearch systems, advocating for dynamically routed architectures that adapt their collaborative structures to real-time task complexity.

cs.MA↗

Excited States from Quasiparticle Hamiltonian Based on Density Functional Theory

Recent advances in occupancy extrapolation (OE) show that potential of orbital-occupation based energy functions can describe electronic excitations. Here, the OE method in the particle-hole channel is extended to an effective quasiparticle Hamiltonian, enabling a multi-configurational description beyond single-determinant OE and $Δ$SCF. The method performs comparably to the Bethe-Salpeter equation for valence singlet and charge-transfer excitations, and better for valence triplet and Rydberg states, supporting its accuracy and broad applicability.

physics.chem-ph↗

Development of a compact cryogenic Penning trap with permanent magnets: An intermediate step toward the Shanghai Penning Trap

Penning traps, renowned for their unparalleled precision in determining fundamental properties such as mass and magnetic moments, are cornerstone instruments in modern physics. Their applications span from nuclear structure studies to stringent tests of quantum electrodynamics and CPT invariance. Although Penning traps have been demonstrated for fundamental studies, often employing superconducting magnets, their high cost and operational complexity remain challenges. In this work, we report the development of a compact cryogenic Penning trap that utilizes a permanent magnet to provide a confining magnetic field, offering a more economical and flexible alternative. We have successfully demonstrated all core functionalities of this system, including ion generation, transport, confinement, manipulation, and signal detection. This compact trap not only serves as a vital technical testbed for the development of the Shanghai Penning Trap, but also establishes a cryogenic Penning-trap experiment platform for ion trapping and cooling applications as well as envisaged spectroscopic studies applications.

physics.atom-ph↗

Atomic-scale order enables high thermal boundary conductance at $β$-Ga$_2$O$_3$/4H-SiC interfaces

Thermal boundary conductance (TBC) at dissimilar interfaces imposes a fundamental limit on electronic device performance, yet predicting and understanding heat transport across realistic, disordered boundaries remains elusive. Here, we develop a computational framework that combines machine-learned interatomic potentials with lattice dynamics to address the long-standing problem of how interfacial structure, from disordered to atomically sharp, affects thermal transport in the technologically important $β$-Ga$_2$O$_3$/4H-SiC heterostructure. By explicitly accounting for phonon wave-particle duality, we show that interfacial disorder introduces additional interfacial phonon modes that facilitate vibrational impedance matching between the two highly dissimilar crystals, yet it simultaneously disrupts interfacial phonon coherence and limits the potential heat-transport benefit. Our atomistic simulations further indicate that restoring atomic-scale order preserves coherence and yields markedly higher conductance. These insights motivate the controlled epitaxial growth of $β$-Ga$_2$O$_3$/4H-SiC heterostructures with systematically tuned interfacial order. Experimental measurements validate our predictions, achieving a record-high TBC of 231 MW m$^{-2}$ K$^{-1}$ at atomically sharp junctions. Beyond the immediate implications for $β$-Ga$_2$O$_3$-based power electronics, our results establish the preservation of interfacial phonon coherence as an effective strategy for mitigating thermal bottlenecks in mismatched systems.

cond-mat.mtrl-sci↗

TPMM: Three-component Posterior Mixture Model Enables Robust Inverton Detection in Low-Depth Metagenomes and Suggests Potential Viral Invertons

Bacterial phase variation enables reversible, locus-specific phenotypic switching, often driven by DNA inversion (invertons). To identify these events, researchers commonly rely on sequencing reads that provide orientation-specific support. Metagenomic sequencing, which captures total genetic material independent of cultivation, offers a powerful platform for the comprehensive study of invertons. However, computational inverton calling from metagenomic data is difficult at low sequencing depth: hard read-support cutoffs can miss true events, while sequence-only predictors lack read-backed interpretability and uncertainty quantification. To address this, we present TPMM, a three-component posterior mixture model for inverton calling in metagenomic data. TPMM explicitly incorporates sequencing depth to formulate inverton detection as a probabilistic mixture problem. Starting from candidates flanked by inverted repeats, the model classifies the candidates into noise, low-probability, or high-probability inversion signals using read evidence. Finally, TPMM assigns posterior probabilities as soft labels and applies cumulative Bayesian False Discovery Rate control to robustly identify true invertons. On two real gut metagenomic datasets, TPMM agrees well with PhaseFinder at high depth but recovers substantially more invertons under systematic downsampling, demonstrating superior performance in sparse-data regimes. We further examine potential reversible inversion elements in viral genomes and provide supporting analyses, suggesting a broader scope for inversion-mediated regulation.

q-bio.GN↗

Velocity Gauge for Oscillator Strength in $Δ$SCF theory

Delta self-consistent-field ($Δ$SCF) theory is widely used for electronic excitation energy calculations. However, calculating the corresponding oscillator strengths is challenging. The corresponding many-electron wavefunctions are not directly accessible. Both the ground-state and the excited-state wave functions from $Δ$SCF are described by reference Kohn-Sham (KS) single-determinant wavefunctions for the fictitious non-interacting systems. The non-orthogonality between the ground and excited Kohn-Sham determinants from two different SCF calculations leads to unphysically origin-dependent transition properties, such as transition dipole moment and length-gauge oscillator strength. Including nuclei contribution in the perturbation is theoretically rigorous, but its effectiveness is only limited to neutral systems, as we show theoretically and numerically. While several other practical approaches have been proposed to tackle the non-orthogonality problem and yield reasonable results, inevitably the determinant of the ground state or the excited state is changed, as well as the density matrix. In this work, we explore the use of the velocity gauge to compute oscillator strength within $Δ$SCF theory. We demonstrate that the velocity gauge is capable of naturally accounting for the non-orthogonality of $Δ$SCF KS wavefunctions and offering origin-independent predictions without any additional correction schemes to the KS wavefunctions. Compared to the length-gauge results obtained via symmetric orthogonalization, velocity gauge can offer comparable results. Furthermore, the adoption of spin-purified singlet excitation energy in the velocity-gauge transition dipole moment significantly enhances the overall performance of the velocity gauge for $Δ$SCF oscillator strength predictions on conjugated chromophores.

physics.chem-ph↗

Boundedness of the Images of Period Maps

We prove a conjecture of Griffiths on simultaneous normalization of all periods which asserts that the image of the lifted period map on the universal cover lies in a bounded domain in complex Euclidean space.

math.AG↗

Boundedness of the images of period maps and applications

We prove a conjecture of Griffiths on simultaneous normalization of all periods which asserts that the image of the lifted period map on the universal cover lies in a bounded domain in a complex Euclidean space. As an application we prove that the Teichmüller spaces of a large class of projective manifolds have complex affine structures.

math.AG↗

On the correlation between entanglement and the negative sign problem

In this work, we study the correlation between entanglement and the negative sign problem in quantum Monte Carlo for the simulation of low-dimensional strongly correlated quantum many body systems. Entanglement entropy characterizes the difficulty of many-body simulation with tensor network state related methods, while the average sign measures the difficulty in many-body simulation for a variety of quantum Monte Carlo methods. Although there exist cases where one type of method works better than the other, it is desirable to find the possible correlation between entanglement and average sign for general hard strongly correlated systems regarding computational complexity. We take the doped two-dimensional Hubbard model as an example and numerically calculate the doping evolution of both the entanglement in the ground state with Density Matrix Renormalization Group and the average sign in the Auxiliary Field Quantum Monte Carlo simulation at low temperature. The results show that they are indeed correlated. The entanglement entropy (average sign) shows a peak (dip) around 20% doping, indicating that it is the difficult region for both methods. The vicinity of 20% doping is also the most intriguing region in both the Hubbard model and cuprate high-Tc superconductors where competing states with close energy intertwine with each other. Recognizing the correlation between entanglement and average sign provides new insight into our understanding of the difficulty in the simulation of strongly correlated quantum many-body systems.

cond-mat.str-el↗

AesRec: A Dataset for Aesthetics-Aligned Clothing Outfit Recommendation

Clothing recommendation extends beyond merely generating personalized outfits; it serves as a crucial medium for aesthetic guidance. However, existing methods predominantly rely on user-item-outfit interaction behaviors while overlooking explicit representations of clothing aesthetics. To bridge this gap, we present the AesRec benchmark dataset featuring systematic quantitative aesthetic annotations, thereby enabling the development of aesthetics-aligned recommendation systems. Grounded in professional apparel quality standards and fashion aesthetic principles, we define a multidimensional set of indicators. At the item level, six dimensions are independently assessed: silhouette, chromaticity, materiality, craftsmanship, wearability, and item-level impression. Transitioning to the outfit level, the evaluation retains the first five core attributes while introducing stylistic synergy, visual harmony, and outfit-level impression as distinct metrics to capture the collective aesthetic impact. Given the increasing human-like proficiency of Vision-Language Models in multimodal understanding and interaction, we leverage them for large-scale aesthetic scoring. We conduct rigorous human-machine consistency validation on a fashion dataset, confirming the reliability of the generated ratings. Experimental results based on AesRec further demonstrate that integrating quantified aesthetic information into clothing recommendation models can provide aesthetic guidance for users while fulfilling their personalized requirements.

cs.IR↗