Searcharxiv⌕ Search

arXiv subjects

Sen Yang

Publications and source records attributed to Sen Yang.

At least 73 records · Page 4Linked to original sources

Enhancement of quantum coherence in solid-state qubits via interface engineering

Shallow nitrogen-vacancy (NV) centers in diamond are promising quantum sensors but suffer from noise-induced short coherence times due to bulk and surface impurities. We present interfacial engineering via oxygen termination and graphene patching, extending shallow NV coherence to over 1 ms, approaching the T1 limit. Raman spectroscopy and density-functional theory reveal surface termination-driven graphene charge transfer reduces spin noise by pairing surface electrons, supported by double electron-electron resonance spectroscopy showing fewer unpaired spins. Enhanced sensitivity enables detection of single weakly coupled 13C nuclear spins and external 11B spins from a hexagonal boron nitride (h-BN) layer, achieving nanoscale nuclear magnetic resonance. A protective h-BN top layer stabilizes the platform, ensuring robustness against harsh treatments and compatibility with target materials. This integrated approach advances practical quantum sensing by combining extended coherence, improved sensitivity, and device durability.

cond-mat.mes-hall↗

Penetration of surface effects on structural relaxation and particle hops in glassy films

A free surface induces enhanced dynamics in glass formers. We study the dynamical enhancement of glassy films with a distinguishable-particle lattice model of glass free of elastic effects. We demonstrate that the thickness of the surface mobile layer depends on temperature differently under different definitions, although all are based on local structure relaxation rate. The rate can be fitted to a double exponential form with an exponential-of-power-law tail. Our approach and results exclude elasticity as the unique mechanism for the tail. Layer-resolved particle hopping rate, potentially a key measure for activated hopping, is also studied but it exhibits much shallower surface effects.

cond-mat.soft↗

Learning Universal User Representations Leveraging Cross-domain User Intent at Snapchat

The development of powerful user representations is a key factor in the success of recommender systems (RecSys). Online platforms employ a range of RecSys techniques to personalize user experience across diverse in-app surfaces. User representations are often learned individually through user's historical interactions within each surface and user representations across different surfaces can be shared post-hoc as auxiliary features or additional retrieval sources. While effective, such schemes cannot directly encode collaborative filtering signals across different surfaces, hindering its capacity to discover complex relationships between user behaviors and preferences across the whole platform. To bridge this gap at Snapchat, we seek to conduct universal user modeling (UUM) across different in-app surfaces, learning general-purpose user representations which encode behaviors across surfaces. Instead of replacing domain-specific representations, UUM representations capture cross-domain trends, enriching existing representations with complementary information. This work discusses our efforts in developing initial UUM versions, practical challenges, technical choices and modeling and research directions with promising offline performance. Following successful A/B testing, UUM representations have been launched in production, powering multiple use cases and demonstrating their value. UUM embedding has been incorporated into (i) Long-form Video embedding-based retrieval, leading to 2.78% increase in Long-form Video Open Rate, (ii) Long-form Video L2 ranking, with 19.2% increase in Long-form Video View Time sum, (iii) Lens L2 ranking, leading to 1.76% increase in Lens play time, and (iv) Notification L2 ranking, with 0.87% increase in Notification Open Rate.

cs.IR↗

UniPTMs: The First Unified Multi-type PTM Site Prediction Model via Master-Slave Architecture-Based Multi-Stage Fusion Strategy and Hierarchical Contrastive Loss

As a core mechanism of epigenetic regulation in eukaryotes, protein post-translational modifications (PTMs) require precise prediction to decipher dynamic life activity networks. To address the limitations of existing deep learning models in cross-modal feature fusion, domain generalization, and architectural optimization, this study proposes UniPTMs: the first unified framework for multi-type PTM prediction. The framework innovatively establishes a "Master-Slave" dual-path collaborative architecture: The master path dynamically integrates high-dimensional representations of protein sequences, structures, and evolutionary information through a Bidirectional Gated Cross-Attention (BGCA) module, while the slave path optimizes feature discrepancies and recalibration between structural and traditional features using a Low-Dimensional Fusion Network (LDFN). Complemented by a Multi-scale Adaptive convolutional Pyramid (MACP) for capturing local feature patterns and a Bidirectional Hierarchical Gated Fusion Network (BHGFN) enabling multi-level feature integration across paths, the framework employs a Hierarchical Dynamic Weighting Fusion (HDWF) mechanism to intelligently aggregate multimodal features. Enhanced by a novel Hierarchical Contrastive loss function for feature consistency optimization, UniPTMs demonstrates significant performance improvements (3.2%-11.4% MCC and 4.2%-14.3% AP increases) over state-of-the-art models across five modification types and transcends the Single-Type Prediction Paradigm. To strike a balance between model complexity and performance, we have also developed a lightweight variant named UniPTMs-mini.

cs.LG↗

LoGU: Long-form Generation with Uncertainty Expressions

While Large Language Models (LLMs) demonstrate impressive capabilities, they still struggle with generating factually incorrect content (i.e., hallucinations). A promising approach to mitigate this issue is enabling models to express uncertainty when unsure. Previous research on uncertainty modeling has primarily focused on short-form QA, but realworld applications often require much longer responses. In this work, we introduce the task of Long-form Generation with Uncertainty(LoGU). We identify two key challenges: Uncertainty Suppression, where models hesitate to express uncertainty, and Uncertainty Misalignment, where models convey uncertainty inaccurately. To tackle these challenges, we propose a refinement-based data collection framework and a two-stage training pipeline. Our framework adopts a divide-and-conquer strategy, refining uncertainty based on atomic claims. The collected data are then used in training through supervised fine-tuning (SFT) and direct preference optimization (DPO) to enhance uncertainty expression. Extensive experiments on three long-form instruction following datasets show that our method significantly improves accuracy, reduces hallucinations, and maintains the comprehensiveness of responses.

cs.CL↗

Revisiting Self-attention for Cross-domain Sequential Recommendation

Sequential recommendation is a popular paradigm in modern recommender systems. In particular, one challenging problem in this space is cross-domain sequential recommendation (CDSR), which aims to predict future behaviors given user interactions across multiple domains. Existing CDSR frameworks are mostly built on the self-attention transformer and seek to improve by explicitly injecting additional domain-specific components (e.g. domain-aware module blocks). While these additional components help, we argue they overlook the core self-attention module already present in the transformer, a naturally powerful tool to learn correlations among behaviors. In this work, we aim to improve the CDSR performance for simple models from a novel perspective of enhancing the self-attention. Specifically, we introduce a Pareto-optimal self-attention and formulate the cross-domain learning as a multi-objective problem, where we optimize the recommendation task while dynamically minimizing the cross-domain attention scores. Our approach automates knowledge transfer in CDSR (dubbed as AutoCDSR) -- it not only mitigates negative transfer but also encourages complementary knowledge exchange among auxiliary domains. Based on the idea, we further introduce AutoCDSR+, a more performant variant with slight additional cost. Our proposal is easy to implement and works as a plug-and-play module that can be incorporated into existing transformer-based recommenders. Besides flexibility, it is practical to deploy because it brings little extra computational overheads without heavy hyper-parameter tuning. AutoCDSR on average improves Recall@10 for SASRec and Bert4Rec by 9.8% and 16.0% and NDCG@10 by 12.0% and 16.7%, respectively. Code is available at https://github.com/snap-research/AutoCDSR.

cs.IR↗

Trans-Zero: Self-Play Incentivizes Large Language Models for Multilingual Translation Without Parallel Data

The rise of Large Language Models (LLMs) has reshaped machine translation (MT), but multilingual MT still relies heavily on parallel data for supervised fine-tuning (SFT), facing challenges like data scarcity for low-resource languages and catastrophic forgetting. To address these issues, we propose TRANS-ZERO, a self-play framework that leverages only monolingual data and the intrinsic multilingual knowledge of LLM. TRANS-ZERO combines Genetic Monte-Carlo Tree Search (G-MCTS) with preference optimization, achieving strong translation performance that rivals supervised methods. Experiments demonstrate that this approach not only matches the performance of models trained on large-scale parallel data but also excels in non-English translation directions. Further analysis reveals that G-MCTS itself significantly enhances translation quality by exploring semantically consistent candidates through iterative translations, providing a robust foundation for the framework's succuss.

cs.CL↗

Supermassive Black Holes with High Accretion Rates in Active Galactic Nuclei. XII. Reverberation Mapping Results for 15 PG Quasars from a Long-Duration High-Cadence Campaign

We present the first results from long-term high-cadence spectroscopic monitoring of 15 PG quasars with relatively strong Fe II emission as a part of a broader reverberation mapping campaign performed with the Calar Alto Observatory 2.2m telescope. The $V$-band, 5100 Å continuum, and H$β$ broad emission line light curves were measured for a set of quasars for between dozens to more than a hundred epochs from May 2017 to July 2020. Accurate time lags between the variations of the H$β$ broad line fluxes and the optical continuum strength are obtained for all 15 quasars, ranging from $17.0_{-3.2}^{+2.5}$ to $95.9_{-23.9}^{+7.1}$ days in the rest frame. The virial masses of the central supermassive black holes are derived for all 15 quasars, ranging between $0.50_{-0.19}^{+0.18}$ and $19.17_{-2.73}^{+2.98}$ in units of $10^7 M_\odot$. For 11 of the objects in our sample, this is the first reverberation analysis published. Of the rest, two objects have been the subject of previous reverberation studies, but we determine time lags for these that are only half as long as found in the earlier investigations, which had only been able to sample much more sparsely. The remaining two objects have previously been monitored with high sampling rates. Our results here are consistent with the earlier findings in the sense that the time lag and the line width vary inversely consistent with virialization.

astro-ph.GA↗

Supermassive Black Holes with High Accretion Rates in Active Galactic Nuclei. XIV. Long-Duration High-Cadence Reverberation Mapping Results for 11 PG Quasars

We report the results of a long-duration high-cadence reverberation mapping campaign of a second batch of 11 PG quasars using the 2.2m telescope at the Calar Alto Observatory. This follows a similar earlier study of another sample of 15 objects reported by Hu et al. (2021). Among the 11 PG quasars, 8 objects have the H$β$ time lags measured for the first time, while the other 3 objects were observed in previous campaigns, but only had highly uncertain H$β$-lag measurements. Long-term light curves are presented of photometric $V$-band, spectroscopic 5100 Å continuum, and the H$β$ emission line, lasting for $\sim$3--6 years with a cadence of $\sim$6--14 days. Accurate H$β$ time lags ranging from $\sim$20 to 150 days in the rest frame are obtained. The estimated virial masses of the central supermassive black holes range from $\sim$(3--300)$\times10^7 M_\odot$. Combining these results with those reported in Hu et al. (2021), we now have 26 PG quasars, with representative properties, having reliable H$β$ time-lag measurements from our long-duration high-cadence campaign. A tentative fit to the relation between the H$β$ time lag and the continuum luminosity for these 26 objects gives a slope of 0.53.

astro-ph.GA↗

Decentralization of Ethereum's Builder Market

Blockchains protect an ecosystem worth more than $500bn with strong security properties derived from the principle of decentralization. Is today's blockchain decentralized? In this paper, we empirically studied one of the least decentralized parts of Ethereum, its builder market. The builder market was introduced to fairly distribute Maximal Extractable Value (MEV) among validators and avoid validator centralization. As of the time of writing, two builders produced more than 85% of blocks in Ethereum, creating a concerning centralization factor. However, a common belief is that such centralization "is okay," arguing that builder centralization will not lead to validator centralization. In this empirical study, we quantify the significant proposer losses within the centralized builder market and challenge the belief that this is acceptable. The significant proposer losses, if left uncontrolled, could undermine the goal of PBS. Moreover, MEV mitigation solutions slated for adoption are affected too because they rely on the builder market as an "MEV oracle," which is made inaccurate by centralization. Our investigation reveals the incentive issue within the current MEV supply chain and its implications for builder centralization and proposer losses. Finally, we analyze why the proposed mitigation cannot work and highlight two properties essential for effective solutions.

cs.CR↗

Parameter-Efficient Fine-Tuning in Large Models: A Survey of Methodologies

The large models, as predicted by scaling raw forecasts, have made groundbreaking progress in many fields, particularly in natural language generation tasks, where they have approached or even surpassed human levels. However, the unprecedented scale of their parameters brings significant computational and storage costs. These large models require substantial computational resources and GPU memory to operate. When adapting large models to specific downstream tasks, their massive parameter scale poses a significant challenge in fine-tuning on hardware platforms with limited computational power and GPU memory. To address this issue, Parameter-Efficient Fine-Tuning (PEFT) offers a practical solution by efficiently adjusting the parameters of large pre-trained models to suit various downstream tasks. Specifically, PEFT adjusts the parameters of pre-trained large models to adapt to specific tasks or domains, minimizing the introduction of additional parameters and the computational resources required. This review mainly introduces the preliminary knowledge of PEFT, the core ideas and principles of various PEFT algorithms, the applications of PEFT, and potential future research directions. By reading this review, we believe that interested parties can quickly grasp the PEFT methodology, thereby accelerating its development and innovation.

cs.CL↗

Constraining polymerized black holes with quasi-circular extreme mass-ratio inspirals

In this paper, we focus on the gravitational waves emitted by a stellar-mass object in a quasi-circular inspiral orbit around a central supermassive polymerized black hole in loop quantum gravity. Treating the stellar-mass object as a massive test particle, we derive its equations of motion and the corresponding radial effective potential. We find that the peak of the radial effective potential decreases with the quantum parameter $\hat{k}$. We also examine the impact of quantum corrections on the properties of stable circular orbits around the polymerized black hole. We model the smaller object's trajectory as an adiabatic evolution along stable circular orbits using a semi-relativistic approach. In this method, the motion of the object is described by relativistic geodesics, and changes in the object's energy and orbital angular momentum due to gravitational radiation are calculated using the mass quadrupole formula. The corresponding gravitational waveforms are generated using the numerical kludge method, revealing that quantum corrections cause phase advances in the gravitational waveforms. We further analyze the potential constraints on the quantum parameter $\hat{k}$ from future space-based gravitational wave observations, concluding that these observations will likely impose stronger constraints on $\hat{k}$ than those obtained from black hole shadow measurements.

gr-qc↗

Gravitational waveforms from periodic orbits around a quantum-corrected black hole

Extreme mass-ratio inspirals are crucial sources for future space-based gravitational wave detections. Gravitational waveforms emitted by extreme mass-ratio inspirals are closely related to the orbital dynamics of small celestial objects, which vary with the underlying spacetime geometry. Despite the tremendous success of general relativity, there are unsolved issues such as singularities in both black holes and cosmology. Loop quantum gravity, a theory addressing these singularity problems, offers a framework for regular black holes. In this paper, we focus on periodic orbits of a small celestial object around a supermassive quantum-corrected black hole in loop quantum gravity and compute the corresponding gravitational waveforms. We view the small celestial object as a massive test particle and obtain its four-velocity and effective potential. We explore the effects of quantum corrections on marginally bound orbits, innermost stable circular orbits, and other periodic orbits. Using the numerical kludge scheme, we further explore the gravitational waveforms of the small celestial object along different periodic orbits. The waveforms exhibit distinct zoom and whirl phases in a complete orbital period, closely tied to the quantum parameter $\hat α$. We also perform a spectral analysis of the gravitational waves from these periodic orbits and assess their detectability. With the steady progress of space-based gravitational wave detection programs, our findings will contribute to utilizing extreme mass-ratio inspirals to test and understand the properties of quantum-corrected black holes.

gr-qc↗

Large Language Models for Blockchain Security: A Systematic Literature Review

Large Language Models (LLMs) have emerged as powerful tools across various domains within cyber security. Notably, recent studies are increasingly exploring LLMs applied to the context of blockchain security (BS). However, there remains a gap in a comprehensive understanding regarding the full scope of applications, impacts, and potential constraints of LLMs on blockchain security. To fill this gap, we undertake a literature review focusing on the studies that apply LLMs in blockchain security (LLM4BS). Our study aims to comprehensively analyze and understand existing research, and elucidate how LLMs contribute to enhancing the security of blockchain systems. Through a thorough examination of existing literature, we delve into the integration of LLMs into various aspects of blockchain security. We explore the mechanisms through which LLMs can bolster blockchain security, including their applications in smart contract auditing, transaction anomaly detection, vulnerability repair, program analysis of smart contracts, and serving as participants in the cryptocurrency community. Furthermore, we assess the challenges and limitations associated with leveraging LLMs for enhancing blockchain security, considering factors such as scalability, privacy concerns, and ethical concerns. Our thorough review sheds light on the opportunities and potential risks of tasks on LLM4BS, providing valuable insights for researchers, practitioners, and policymakers alike.

cs.CR↗

Multi-LLM Collaborative Search for Complex Problem Solving

Large language models (LLMs) often struggle with complex reasoning tasks due to their limitations in addressing the vast reasoning space and inherent ambiguities of natural language. We propose the Mixture-of-Search-Agents (MoSA) paradigm, a novel approach leveraging the collective expertise of multiple LLMs to enhance search-based reasoning. MoSA integrates diverse reasoning pathways by combining independent exploration with iterative refinement among LLMs, mitigating the limitations of single-model approaches. Using Monte Carlo Tree Search (MCTS) as a backbone, MoSA enables multiple agents to propose and aggregate reasoning steps, resulting in improved accuracy. Our comprehensive evaluation across four reasoning benchmarks demonstrates MoSA's consistent performance improvements over single-agent and other multi-agent baselines, particularly in complex mathematical and commonsense reasoning tasks.

cs.AI↗

Neuro-Symbolic Integration Brings Causal and Reliable Reasoning Proofs

Two lines of approaches are adopted for complex reasoning with LLMs. One line of work prompts LLMs with various reasoning structures, while the structural outputs can be naturally regarded as intermediate reasoning steps. Another line of work adopt LLM-free declarative solvers to do the reasoning task, rendering higher reasoning accuracy but lacking interpretability due to the black-box nature of the solvers. Aiming to resolve the trade-off between answer accuracy and interpretability, we present a simple extension to the latter line of work. Specifically, we showcase that the intermediate search logs generated by Prolog interpreters can be accessed and interpreted into human-readable reasoning proofs. As long as LLMs correctly translate problem descriptions into Prolog representations, the corresponding reasoning proofs are ensured to be causal and reliable. On two logical reasoning and one arithmetic reasoning datasets, our framework obtains significant improvements in terms of both answer accuracy and reasoning proof accuracy. Our code is released at https://github.com/DAMO-NLP-SG/CaRing

cs.AI↗

From Drafts to Answers: Unlocking LLM Potential via Aggregation Fine-Tuning

Scaling data and model size has been proven effective for boosting the performance of large language models. In addition to training-time scaling, recent studies have revealed that increasing test-time computational resources can further improve performance. In this work, we introduce Aggregation Fine-Tuning (AFT), a supervised finetuning paradigm where the model learns to synthesize multiple draft responses, referred to as proposals, into a single, refined answer, termed aggregation. At inference time, a propose-and-aggregate strategy further boosts performance by iteratively generating proposals and aggregating them. Empirical evaluations on benchmark datasets show that AFT-trained models substantially outperform standard SFT. Notably, an AFT model, fine-tuned from Llama3.1-8B-Base with only 64k data, achieves a 41.3% LC win rate on AlpacaEval 2, surpassing significantly larger LLMs such as Llama3.1-405B-Instruct and GPT4. By combining sequential refinement and parallel sampling, the propose-and-aggregate framework scales inference-time computation in a flexible manner. Overall, These findings position AFT as a promising approach to unlocking additional capabilities of LLMs without resorting to increasing data volume or model size.

cs.CL↗

Keep It Accurate and Robust: An Enhanced Nuclei Analysis Framework

Accurate segmentation and classification of nuclei in histology images is critical but challenging due to nuclei heterogeneity, staining variations, and tissue complexity. Existing methods often struggle with limited dataset variability, with patches extracted from similar whole slide images (WSI), making models prone to falling into local optima. Here we propose a new framework to address this limitation and enable robust nuclear analysis. Our method leverages dual-level ensemble modeling to overcome issues stemming from limited dataset variation. Intra-ensembling applies diverse transformations to individual samples, while inter-ensembling combines networks of different scales. We also introduce enhancements to the HoVer-Net architecture, including updated encoders, nested dense decoding and model regularization strategy. We achieve state-of-the-art results on public benchmarks, including 1st place for nuclear composition prediction and 3rd place for segmentation/classification in the 2022 Colon Nuclei Identification and Counting (CoNIC) Challenge. This success validates our approach for accurate histological nuclei analysis. Extensive experiments and ablation studies provide insights into optimal network design choices and training techniques. In conclusion, this work proposes an improved framework advancing the state-of-the-art in nuclei analysis. We release our code and models (https://github.com/WinnieLaugh/CONIC_Pathology_AI) to serve as a toolkit for the community.

eess.IV↗