arXiv subjects

Yuan Gao

Publications and source records attributed to Yuan Gao.

At least 271 records · Page 15Linked to original sources

arXiv2025

Take Caution in Using LLMs as Human Surrogates: Scylla Ex Machina

Recent studies suggest large language models (LLMs) can exhibit human-like reasoning, aligning with human behavior in economic experiments, surveys, and political discourse. This has led many to propose that LLMs can be used as surrogates or simulations for humans in social science research. However, LLMs differ fundamentally from humans, relying on probabilistic patterns, absent the embodied experiences or survival objectives that shape human cognition. We assess the reasoning depth of LLMs using the 11-20 money request game. Nearly all advanced approaches fail to replicate human behavior distributions across many models. Causes of failure are diverse and unpredictable, relating to input language, roles, and safeguarding. These results advise caution when using LLMs to study human behavior or as surrogates or simulations.

econ.GN↗

arXiv2025

Valley2: Exploring Multimodal Models with Scalable Vision-Language Design

Recently, vision-language models have made remarkable progress, demonstrating outstanding capabilities in various tasks such as image captioning and video understanding. We introduce Valley2, a novel multimodal large language model designed to enhance performance across all domains and extend the boundaries of practical applications in e-commerce and short video scenarios. Notably, Valley2 achieves state-of-the-art (SOTA) performance on e-commerce benchmarks, surpassing open-source models of similar size by a large margin (79.66 vs. 72.76). Additionally, Valley2 ranks second on the OpenCompass leaderboard among models with fewer than 10B parameters, with an impressive average score of 67.4. The code and model weights are open-sourced at https://github.com/bytedance/Valley.

cs.CV↗

arXiv2025

Reach Measurement, Optimization and Frequency Capping In Targeted Online Advertising Under k-Anonymity

The growth in the use of online advertising to foster brand awareness over recent years is largely attributable to the ubiquity of social media. One pivotal technology contributing to the success of online brand advertising is frequency capping, a mechanism that enables marketers to control the number of times an ad is shown to a specific user. However, the very foundation of this technology is being scrutinized as the industry gravitates towards advertising solutions that prioritize user privacy. This paper delves into the issue of reach measurement and optimization within the context of $k$-anonymity, a privacy-preserving model gaining traction across major online advertising platforms. We outline how to report reach within this new privacy landscape and demonstrate how probabilistic discounting, a probabilistic adaptation of traditional frequency capping, can be employed to optimize campaign performance. Experiments are performed to assess the trade-off between user privacy and the efficacy of online brand advertising. Notably, we discern a significant dip in performance as long as privacy is introduced, yet this comes with a limited additional cost for advertising platforms to offer their users more privacy.

cs.GT↗

arXiv2024

Improved Forecasts of Global Extreme Marine Heatwaves Through a Physics-guided Data-driven Approach

The unusually warm sea surface temperature events known as marine heatwaves (MHWs) have a profound impact on marine ecosystems. Accurate prediction of extreme MHWs has significant scientific and financial worth. However, existing methods still have certain limitations, especially in the most extreme MHWs. In this study, to address these issues, based on the physical nature of MHWs, we created a novel deep learning neural network that is capable of accurate 10-day MHW forecasting. Our framework significantly improves the forecast ability of extreme MHWs through two specially designed modules inspired by numerical models: a coupler and a probabilistic data argumentation. The coupler simulates the driving effect of atmosphere on MHWs while the probabilistic data argumentation approaches significantly boost the forecast ability of extreme MHWs based on the idea of ensemble forecast. Compared with traditional numerical prediction, our framework has significantly higher accuracy and requires fewer computational resources. What's more, explainable AI methods show that wind forcing is the primary driver of MHW evolution and reveal its relation with air-sea heat exchange. Overall, our model provides a framework for understanding MHWs' driving processes and operational forecasts in the future.

physics.ao-ph↗

arXiv2024

Owl-1: Omni World Model for Consistent Long Video Generation

Video generation models (VGMs) have received extensive attention recently and serve as promising candidates for general-purpose large vision models. While they can only generate short videos each time, existing methods achieve long video generation by iteratively calling the VGMs, using the last-frame output as the condition for the next-round generation. However, the last frame only contains short-term fine-grained information about the scene, resulting in inconsistency in the long horizon. To address this, we propose an Omni World modeL (Owl-1) to produce long-term coherent and comprehensive conditions for consistent long video generation. As videos are observations of the underlying evolving world, we propose to model the long-term developments in a latent space and use VGMs to film them into videos. Specifically, we represent the world with a latent state variable which can be decoded into explicit video observations. These observations serve as a basis for anticipating temporal dynamics which in turn update the state variable. The interaction between evolving dynamics and persistent state enhances the diversity and consistency of the long videos. Extensive experiments show that Owl-1 achieves comparable performance with SOTA methods on VBench-I2V and VBench-Long, validating its ability to generate high-quality video observations. Code: https://github.com/huang-yh/Owl.

cs.CV↗

arXiv2024

Production potential of hidden-strange molecular pentaquarks through the $π^-p\rightarrow K^{*}Σ$ process

In this study, applying the effective Lagrangian approach, we investigate the reaction $π^-p\rightarrow K^{*}Σ$ to explore the production of the hidden-strange molecular pentaquarks $P_{s\bar{s}}$. Specifically, we analyze two scenarios, where the $J^P$ quantum numbers of $P_{s\bar{s}}$ are $3/2^-$ and $1/2^-$. Our results show that the contribution from $s$-channel $P_{s\bar{s}}$ exchange dominates the total cross section, surpassing those from $t$-channel $K^{(*)}$ exchange and $u$-channel $Σ$ exchange. Additionally, we present predictions for the differential cross section of the $π^-p\rightarrow K^{*}Σ$ process. Finally, we extend the 2-to-2 scattering process to the 2-to-3 Dalitz process and provide theoretical predictions for this scenario. Our findings suggest that the cross section for the $π^-p \rightarrow K^{*}Σ\rightarrow K^+π^-Σ^0$ process can reach several tens of $μb$ near the threshold, making it highly favorable for experimental measurement. However, the current scarcity of experimental data for the $π^-p\rightarrow K^{*}Σ$ reaction at threshold energy limits our ability to determine the properties of the hidden-strange molecular pentaquarks $P_{s\bar{s}}$ and related physical quantities. Therefore, additional experimental measurements of the $π^-p \rightarrow K^{*}Σ$ reaction at threshold are strongly encouraged, and correlation studies could be pursued at facilities such as J-PARC, AMBER, and upcoming HIKE and HIAF meson beam experiments.

hep-ph↗

arXiv2024

LINKs: Large Language Model Integrated Management for 6G Empowered Digital Twin NetworKs

In the rapidly evolving landscape of digital twins (DT) and 6G networks, the integration of large language models (LLMs) presents a novel approach to network management. This paper explores the application of LLMs in managing 6G-empowered DT networks, with a focus on optimizing data retrieval and communication efficiency in smart city scenarios. The proposed framework leverages LLMs for intelligent DT problem analysis and radio resource management (RRM) in fully autonomous way without any manual intervention. Our proposed framework -- LINKs, builds up a lazy loading strategy which can minimize transmission delay by selectively retrieving the relevant data. Based on the data retrieval plan, LLMs transform the retrieval task into an numerical optimization problem and utilizing solvers to build an optimal RRM, ensuring efficient communication across the network. Simulation results demonstrate the performance improvements in data planning and network management, highlighting the potential of LLMs to enhance the integration of DT and 6G technologies.

cs.NI↗

arXiv2024

Non-convex Stochastic Composite Optimization with Polyak Momentum

The stochastic proximal gradient method is a powerful generalization of the widely used stochastic gradient descent (SGD) method and has found numerous applications in Machine Learning. However, it is notoriously known that this method fails to converge in non-convex settings where the stochastic noise is significant (i.e. when only small or bounded batch sizes are used). In this paper, we focus on the stochastic proximal gradient method with Polyak momentum. We prove this method attains an optimal convergence rate for non-convex composite optimization problems, regardless of batch size. Additionally, we rigorously analyze the variance reduction effect of the Polyak momentum in the composite optimization setting and we show the method also converges when the proximal step can only be solved inexactly. Finally, we provide numerical experiments to validate our theoretical results.

math.OC↗

arXiv2024

Double Magnon-Roton Excitations in the Triangular-Lattice Spin Supersolid

Supersolid is an exotic quantum state of matter that spontaneously hosts the features of both solid and superfluid, which breaks the translation and U(1) gauge symmetries. Here we study the spin dynamics in the triangular-lattice compound Na$_2$BaCo(PO$_4$)$_2$, which is revealed in [Xiang et al., Nature 625, 270-275 (2024)] as a quantum magnetic analog of supersolid. We simulate the easy-axis Heisenberg model with tensor network approach and uncover unique dynamic traits. These features are manifested in two branches of excitations that can be associated with the spin solidity and superfluidity, respectively. One branch contains the U(1) Goldstone and roton modes, while the other comprises pseudo-Goldstone and roton modes. The gapless Goldstone modes of the in-plane superfluid order are confirmed by our inelastic neutron scattering measurements. Together with the evident out-of-plane solid order indicated by the magnetic Bragg peaks, our findings provide spectroscopic evidence for spin supersolidity in this easy-axis antiferromagnet. Akin to the role of phonon-roton modes -- Landau elementary excitations -- in shaping the helium superfluid thermodynamics, the intriguing double magnon-roton dispersion here determines the low-temperature thermodynamics of spin supersolid down to sub-Kelvin regime, explaining the recently observed giant magnetocaloric effect in Na$_2$BaCo(PO$_4$)$_2$.

cond-mat.str-el↗

arXiv2024

Successive magnetic transitions in the spin-5/2 easy-axis triangular-lattice antiferromagnet Na$_2$BaMn(PO$_4$)$_2$: A neutron diffraction study

Motivated by the recent observations of various exotic quantum states in the equilateral triangular-lattice phosphates Na$_2$BaCo(PO$_4$)$_2$ with $J\rm_{eff}$ = 1/2 and Na$_2$BaNi(PO$_4$)$_2$ with $S$ = 1, the magnetic properties of spin-5/2 antiferromagnet Na$_2$BaMn(PO$_4$)$_2$, their classical counterpart, are comprehensively investigated experimentally. DC magnetization and specific heat measurements on polycrystalline samples indicate two successive magnetic transitions at $T\rm_{N1}$ $\approx$ 1.13 K and $T\rm_{N2}$ $\approx$ 1.28 K, respectively. Zero-field neutron powder diffraction measurement at 67 mK reveals a Y-like spin configuration as its ground-state magnetic structure, with both the $ab$-plane and $c$-axis components of the Mn$^{2+}$ moments long-range ordered. The incommensurate magnetic propagation vector $k$ shows a dramatic change for the intermediate phase between $T\rm_{N1}$ and $T\rm_{N2}$, in which the spin state is speculated to change into a collinear structure with only the $c$-axis moments ordered, as stabilized by thermal fluctuations. The successive magnetic transitions observed in Na$_2$BaMn(PO$_4$)$_2$ are in line with the expectation for a triangle-lattice antiferromagnet with an easy-axis magnetic anisotropy.

cond-mat.str-el↗

arXiv2024

Towards Faster Decentralized Stochastic Optimization with Communication Compression

Communication efficiency has garnered significant attention as it is considered the main bottleneck for large-scale decentralized Machine Learning applications in distributed and federated settings. In this regime, clients are restricted to transmitting small amounts of quantized information to their neighbors over a communication graph. Numerous endeavors have been made to address this challenging problem by developing algorithms with compressed communication for decentralized non-convex optimization problems. Despite considerable efforts, the current results suffer from various issues such as non-scalability with the number of clients, requirements for large batches, or bounded gradient assumption. In this paper, we introduce MoTEF, a novel approach that integrates communication compression with Momentum Tracking and Error Feedback. Our analysis demonstrates that MoTEF achieves most of the desired properties, and significantly outperforms existing methods under arbitrary data heterogeneity. We provide numerical experiments to validate our theoretical findings and confirm the practical superiority of MoTEF.

cs.LG↗

arXiv2024

Advancing Efficient Brain Tumor Multi-Class Classification -- New Insights from the Vision Mamba Model in Transfer Learning

Early and accurate diagnosis of brain tumors is crucial for improving patient survival rates. However, the detection and classification of brain tumors are challenging due to their diverse types and complex morphological characteristics. This study investigates the application of pre-trained models for brain tumor classification, with a particular focus on deploying the Mamba model. We fine-tuned several mainstream transfer learning models and applied them to the multi-class classification of brain tumors. By comparing these models to those trained from scratch, we demonstrated the significant advantages of transfer learning, especially in the medical imaging field, where annotated data is often limited. Notably, we introduced the Vision Mamba (Vim), a novel network architecture, and applied it for the first time in brain tumor classification, achieving exceptional classification accuracy. Experimental results indicate that the Vim model achieved 100% classification accuracy on an independent test set, emphasizing its potential for tumor classification tasks. These findings underscore the effectiveness of transfer learning in brain tumor classification and reveal that, compared to existing state-of-the-art models, the Vim model is lightweight, efficient, and highly accurate, offering a new perspective for clinical applications. Furthermore, the framework proposed in this study for brain tumor classification, based on transfer learning and the Vision Mamba model, is broadly applicable to other medical imaging classification problems.

cs.CV↗

arXiv2024

Patient-Specific CBCT Synthesis for Real-time Tumor Tracking in Surface-guided Radiotherapy

We present a new imaging system to support real-time tumor tracking for surface-guided radiotherapy (SGRT). SGRT uses optical surface imaging (OSI) to acquire real-time surface topography images of the patient on the treatment couch. However, OSI cannot visualize internal anatomy. This study proposes an Advanced Surface Imaging (A-SI) framework to address this issue. In the proposed A-SI framework, a high-speed surface imaging camera consistently captures surface images during radiation delivery, and a CBCT imager captures single-angle X-ray projections at low frequency. The A-SI then utilizes a generative model to generate real-time volumetric images with full anatomy, referred to as Optical Surface-Derived cone beam computed tomography (OSD-CBCT), based on the real-time high-frequent surface images and the low-frequency collected single-angle X-ray projections. The generated OSD-CBCT can provide accurate tumor motion for precise radiation delivery. The A-SI framework uses a patient-specific generative model: physics-integrated consistency-refinement denoising diffusion probabilistic model (PC-DDPM). This model leverages patient-specific anatomical structures and respiratory motion patterns derived from four-dimensional CT (4DCT) during treatment planning. It then employs a geometric transformation module (GTM) to extract volumetric anatomy information from the single-angle X-ray projection. A simulation study with 22 lung cancer patients evaluated the A-SI framework supported by PC-DDPM. The results showed that the framework produced real-time OSD-CBCT with high reconstruction fidelity and precise tumor localization. This study demonstrates the potential of A-SI to enable real-time tumor tracking with minimal imaging dose, advancing SGRT for motion-associated cancers and interventional procedures.

physics.med-ph↗

arXiv2024

Intensity Field Decomposition for Tissue-Guided Neural Tomography

Cone-beam computed tomography (CBCT) typically requires hundreds of X-ray projections, which raises concerns about radiation exposure. While sparse-view reconstruction reduces the exposure by using fewer projections, it struggles to achieve satisfactory image quality. To address this challenge, this article introduces a novel sparse-view CBCT reconstruction method, which empowers the neural field with human tissue regularization. Our approach, termed tissue-guided neural tomography (TNT), is motivated by the distinct intensity differences between bone and soft tissue in CBCT. Intuitively, separating these components may aid the learning process of the neural field. More precisely, TNT comprises a heterogeneous quadruple network and the corresponding training strategy. The network represents the intensity field as a combination of soft and hard tissue components, along with their respective textures. We train the network with guidance from estimated tissue projections, enabling efficient learning of the desired patterns for the network heads. Extensive experiments demonstrate that the proposed method significantly improves the sparse-view CBCT reconstruction with a limited number of projections ranging from 10 to 60. Our method achieves comparable reconstruction quality with fewer projections and faster convergence compared to state-of-the-art neural rendering based methods.

eess.IV↗

arXiv2024

LinFormer: A Linear-based Lightweight Transformer Architecture For Time-Aware MIMO Channel Prediction

The emergence of 6th generation (6G) mobile networks brings new challenges in supporting high-mobility communications, particularly in addressing the issue of channel aging. While existing channel prediction methods offer improved accuracy at the expense of increased computational complexity, limiting their practical application in mobile networks. To address these challenges, we present LinFormer, an innovative channel prediction framework based on a scalable, all-linear, encoder-only Transformer model. Our approach, inspired by natural language processing (NLP) models such as BERT, adapts an encoder-only architecture specifically for channel prediction tasks. We propose replacing the computationally intensive attention mechanism commonly used in Transformers with a time-aware multi-layer perceptron (TMLP), significantly reducing computational demands. The inherent time awareness of TMLP module makes it particularly suitable for channel prediction tasks. We enhance LinFormer's training process by employing a weighted mean squared error loss (WMSELoss) function and data augmentation techniques, leveraging larger, readily available communication datasets. Our approach achieves a substantial reduction in computational complexity while maintaining high prediction accuracy, making it more suitable for deployment in cost-effective base stations (BS). Comprehensive experiments using both simulated and measured data demonstrate that LinFormer outperforms existing methods across various mobility scenarios, offering a promising solution for future wireless communication systems.

cs.LG↗

arXiv2024

VideoTetris: Towards Compositional Text-to-Video Generation

Diffusion models have demonstrated great success in text-to-video (T2V) generation. However, existing methods may face challenges when handling complex (long) video generation scenarios that involve multiple objects or dynamic changes in object numbers. To address these limitations, we propose VideoTetris, a novel framework that enables compositional T2V generation. Specifically, we propose spatio-temporal compositional diffusion to precisely follow complex textual semantics by manipulating and composing the attention maps of denoising networks spatially and temporally. Moreover, we propose an enhanced video data preprocessing to enhance the training data regarding motion dynamics and prompt understanding, equipped with a new reference frame attention mechanism to improve the consistency of auto-regressive video generation. Extensive experiments demonstrate that our VideoTetris achieves impressive qualitative and quantitative results in compositional T2V generation. Code is available at: https://github.com/YangLing0818/VideoTetris

cs.CV↗

arXiv2024

Penalized Sparse Covariance Regression with High Dimensional Covariates

Covariance regression offers an effective way to model the large covariance matrix with the auxiliary similarity matrices. In this work, we propose a sparse covariance regression (SCR) approach to handle the potentially high-dimensional predictors (i.e., similarity matrices). Specifically, we use the penalization method to identify the informative predictors and estimate their associated coefficients simultaneously. We first investigate the Lasso estimator and subsequently consider the folded concave penalized estimation methods (e.g., SCAD and MCP). However, the theoretical analysis of the existing penalization methods is primarily based on i.i.d. data, which is not directly applicable to our scenario. To address this difficulty, we establish the non-asymptotic error bounds by exploiting the spectral properties of the covariance matrix and similarity matrices. Then, we derive the estimation error bound for the Lasso estimator and establish the desirable oracle property of the folded concave penalized estimator. Extensive simulation studies are conducted to corroborate our theoretical results. We also illustrate the usefulness of the proposed method by applying it to a Chinese stock market dataset.

stat.ME↗

arXiv2024

Enabling On-Chip High-Frequency Adaptive Linear Optimal Control via Linearized Gaussian Process

Unpredictable and complex aerodynamic effects pose significant challenges to achieving precise flight control, such as the downwash effect from upper vehicles to lower ones. Conventional methods often struggle to accurately model these interactions, leading to controllers that require large safety margins between vehicles. Moreover, the controller on real drones usually requires high-frequency and has limited on-chip computation, making the adaptive control design more difficult to implement. To address these challenges, we incorporate Gaussian process (GP) to model the adaptive external aerodynamics with linear model predictive control. The GP is linearized to enable real-time high-frequency solutions. Moreover, to handle the error caused by linearization, we integrate end-to-end Bayesian optimization during sample collection stages to improve the control performance. Experimental results on both simulations and real quadrotors show that we can achieve real-time solvable computation speed with acceptable tracking errors.

cs.RO↗