Search arXiv⌕ Search

arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 613 records · Page 34Linked to original sources

The day-ahead scenario generation method for new energy based on an improved conditional generative diffusion model

In the context of the rising share of new energy generation, accurately generating new energy output scenarios is crucial for day-ahead power system scheduling. Deep learning-based scenario generation methods can address this need, but their black-box nature raises concerns about interpretability. To tackle this issue, this paper introduces a method for day-ahead new energy scenario generation based on an improved conditional generative diffusion model. This method is built on the theoretical framework of Markov chains and variational inference. It first transforms historical data into pure noise through a diffusion process, then uses conditional information to guide the denoising process, ultimately generating scenarios that satisfy the conditional distribution. Additionally, the noise table is improved to a cosine form, enhancing the quality of the generated scenarios. When applied to actual wind and solar output data, the results demonstrate that this method effectively generates new energy output scenarios with good adaptability.

cs.LG↗

GENET: Unleashing the Power of Side Information for Recommendation via Hypergraph Pre-training

Recommendation with side information has drawn significant research interest due to its potential to mitigate user feedback sparsity. However, existing models struggle with generalization across diverse domains and types of side information. In particular, three challenges have not been addressed, and they are (1) the diverse formats of side information, including text sequences. (2) The diverse semantics of side information that describes items and users from multi-level in a context different from recommendation systems. (3) The diverse correlations in side information to measure similarity over multiple objects beyond pairwise relations. In this paper, we introduce GENET (Generalized hypErgraph pretraiNing on sidE informaTion), which pre-trains user and item representations on feedback-irrelevant side information and fine-tunes the representations on user feedback data. GENET leverages pre-training as a means to prevent side information from overshadowing critical ID features and feedback signals. It employs a hypergraph framework to accommodate various types of diverse side information. During pre-training, GENET integrates tasks for hyperlink prediction and self-supervised contrast to capture fine-grained semantics at both local and global levels. Additionally, it introduces a unique strategy to enhance pre-training robustness by perturbing positive samples while maintaining high-order relations. Extensive experiments demonstrate that GENET exhibits strong generalization capabilities, outperforming the SOTA method by up to 38% in TOP-N recommendation and Sequential recommendation tasks on various datasets with different side information.

cs.IR↗

A General Optimization Framework for Tackling Distance Constraints in Movable Antenna-Aided Systems

The recently emerged movable antenna (MA) shows great promise in leveraging spatial degrees of freedom to enhance the performance of wireless systems. However, resource allocation in MA-aided systems faces challenges due to the nonconvex and coupled constraints on antenna positions. This paper systematically reveals the challenges posed by the minimum antenna separation distance constraints. Furthermore, we propose a penalty optimization framework for resource allocation under such new constraints for MA-aided systems. Specifically, the proposed framework separates the non-convex and coupled antenna distance constraints from the movable region constraints by introducing auxiliary variables. Subsequently, the resulting problem is efficiently solved by alternating optimization, where the optimization of the original variables resembles that in conventional resource allocation problem while the optimization with respect to the auxiliary variables is achieved in closedform solutions. To illustrate the effectiveness of the proposed framework, we present three case studies: capacity maximization, latency minimization, and regularized zero-forcing precoding. Simulation results demonstrate that the proposed optimization framework consistently outperforms state-of-the-art schemes.

eess.SP↗

Human-aligned Safe Reinforcement Learning for Highway On-Ramp Merging in Dense Traffic

Most reinforcement learning (RL) approaches for the decision-making of autonomous driving consider safety as a reward instead of a cost, which makes it hard to balance the tradeoff between safety and other objectives. Human risk preference has also rarely been incorporated, and the trained policy might be either conservative or aggressive for users. To this end, this study proposes a human-aligned safe RL approach for autonomous merging, in which the high-level decision problem is formulated as a constrained Markov decision process (CMDP) that incorporates users' risk preference into the safety constraints, followed by a model predictive control (MPC)-based low-level control. The safety level of RL policy can be adjusted by computing cost limits of CMDP's constraints based on risk preferences and traffic density using a fuzzy control method. To filter out unsafe or invalid actions, we design an action shielding mechanism that pre-executes RL actions using an MPC method and performs collision checks with surrounding agents. We also provide theoretical proof to validate the effectiveness of the shielding mechanism in enhancing RL's safety and sample efficiency. Simulation experiments in multiple levels of traffic densities show that our method can significantly reduce safety violations without sacrificing traffic efficiency. Furthermore, due to the use of risk preference-aware constraints in CMDP and action shielding, we can not only adjust the safety level of the final policy but also reduce safety violations during the training stage, proving a promising solution for online learning in real-world environments.

cs.RO↗

GSA-Forecaster: Forecasting Graph-Based Time-Dependent Data with Graph Sequence Attention

Forecasting graph-based, time-dependent data has broad practical applications but presents challenges. Effective models must capture both spatial and temporal dependencies in the data, while also incorporating auxiliary information to enhance prediction accuracy. In this paper, we identify limitations in current state-of-the-art models regarding temporal dependency handling. To overcome this, we introduce GSA-Forecaster, a new deep learning model designed for forecasting in graph-based, time-dependent contexts. GSA-Forecaster utilizes graph sequence attention, a new attention mechanism proposed in this paper, to effectively manage temporal dependencies. GSA-Forecaster integrates the data's graph structure directly into its architecture, addressing spatial dependencies. Additionally, it incorporates auxiliary information to refine its predictions further. We validate its performance using real-world graph-based, time-dependent datasets, where it demonstrates superior effectiveness compared to existing state-of-the-art models.

cs.LG↗

FBChain: A Blockchain-based Federated Learning Model with Efficiency and Secure Communication

Privacy and security in the parameter transmission process of federated learning are currently among the most prominent concerns. However, there are two thorny problems caused by unprotected communication methods: "parameter-leakage" and "inefficient-communication". This article proposes Blockchain-based Federated Learning (FBChain) model for federated learning parameter communication to overcome the above two problems. First, we utilize the immutability of blockchain to store the global model and hash value of local model parameters in case of tampering during the communication process, protect data privacy by encrypting parameters, and verify data consistency by comparing the hash values of local parameters, thus addressing the "parameter-leakage" problem. Second, the Proof of Weighted Link Speed (PoWLS) consensus algorithm comprehensively selects nodes with the higher weighted link speed to aggregate global model and package blocks, thereby solving the "inefficient-communication" problem. Experimental results demonstrate the effectiveness of our proposed FBChain model and its ability to improve model communication efficiency in federated learning.

cs.CR↗

How cancer emerges: Data-driven universal insights into tumorigenesis via hallmark networks

Cancer is a complex disease driven by dynamic regulatory shifts that cannot be fully captured by individual molecular profiling. We employ a data-driven approach to construct a coarse-grained dynamic network model based on hallmark interactions, integrating stochastic differential equations with gene regulatory network data to explore key macroscopic dynamic changes in tumorigenesis. Our analysis reveals that network topology undergoes significant reconfiguration before hallmark expression shifts, serving as an early indicator of malignancy. A pan-cancer examination across $15$ cancer types uncovers universal patterns, where Tissue Invasion and Metastasis exhibits the most significant difference between normal and cancer states, while the differences in Reprogramming Energy Metabolism are the least pronounced, consistent with the characteristic features of tumor biology. These findings reinforce the systemic nature of cancer evolution, highlighting the potential of network-based systems biology methods for understanding critical transitions in tumorigenesis.

q-bio.QM↗

Breaking Down Power Barriers in On-Device Streaming ASR: Insights and Solutions

Power consumption plays a crucial role in on-device streaming speech recognition, significantly influencing the user experience. This study explores how the configuration of weight parameters in speech recognition models affects their overall energy efficiency. We found that the influence of these parameters on power consumption varies depending on factors such as invocation frequency and memory allocation. Leveraging these insights, we propose design principles that enhance on-device speech recognition models by reducing power consumption with minimal impact on accuracy. Our approach, which adjusts model components based on their specific energy sensitivities, achieves up to 47% lower energy usage while preserving comparable model accuracy and improving real-time performance compared to leading methods.

cs.SD↗

Resolving Rydberg-Electron Recapture Dynamics via Laser-driven Frustrated Tunneling Ionization

By employing two-color counter-rotating circularly polarized laser fields, we investigate the dynamics of electron recapture into Rydberg states under strong, ultrashort laser pulses, probed via coherent extreme-ultraviolet free-induction decay (XFID). Our study reveals significant distinctions between XFID and above-threshold high-order harmonic generation in terms of their ellipticity dependence on the driving-laser waveforms, yield variations with the laser-intensity ratios, and sensitivity to the driving-laser ellipticity. All these differences arise from the fundamentally distinct electron trajectories underlying the two processes. More importantly, our findings provide compelling evidence that Rydberg-electron recapture predominantly occurs at the end of the driving laser field, offering the first direct experimental confirmation of this long-proposed mechanism.

physics.optics↗

Scalable, universal and conformal direct electrodes microprinting for high-performance van der Waals-integrated two-dimensional electronics and flexible applications

Two-dimensional (2D) materials with extraordinary electrical properties, hold promising for large-scale, flexible electronics. However, their device performance could be hindered due to the excessive defects introduced via traditional electrode integration processes. Transfer printing techniques have been developed for van der Waals contacts integration, while existing techniques encounter limitations in achieving conformal electrode transfer and compatibility with flexible devices. Here we introduce a highly conformal microprinting technique utilizing polypropylene carbonate (PPC)/Polyvinyl alcohol (PVA) copolymer, which enables successful transfer of wafer-scale, micropatterned electrodes onto diverse substrates, including those with complex geometries. This technique, implemented with 2D transition metal dichalcogenides (TMDCs), yields 2D field-effect transistors with near-ideal ohmic contacts, and a record-high carrier mobility up to 334 cm2 V-1 s-1 for a WSe2 device. Furthermore, we fabricated transistor arrays on MoS2 thin film, which show uniform device performance. We also present the flexible MoS2 transistors that not only achieve a high electron mobility of up to 111 cm2 V-1 s-1 but also exhibit outstanding mechanical robustness. Our findings represent a significant leap forward in the fabrication of flexible 2D electronics, paving the way for numerous emerging technologies.

physics.app-ph↗

Graph Augmentation for Cross Graph Domain Generalization

Cross-graph node classification, utilizing the abundant labeled nodes from one graph to help classify unlabeled nodes in another graph, can be viewed as a domain generalization problem of graph neural networks (GNNs) due to the structure shift commonly appearing among various graphs. Nevertheless, current endeavors for cross-graph node classification mainly focus on model training. Data augmentation approaches, a simple and easy-to-implement domain generalization technique, remain under-explored. In this paper, we develop a new graph structure augmentation for the crossgraph domain generalization problem. Specifically, low-weight edgedropping is applied to remove potential noise edges that may hinder the generalization ability of GNNs, stimulating the GNNs to capture the essential invariant information underlying different structures. Meanwhile, clustering-based edge-adding is proposed to generate invariant structures based on the node features from the same distribution. Consequently, with these augmentation techniques, the GNNs can maintain the domain invariant structure information that can improve the generalization ability. The experiments on out-ofdistribution citation network datasets verify our method achieves state-of-the-art performance among conventional augmentations.

cs.LG↗

Step-Video-T2V Technical Report: The Practice, Challenges, and Future of Video Foundation Model

We present Step-Video-T2V, a state-of-the-art text-to-video pre-trained model with 30B parameters and the ability to generate videos up to 204 frames in length. A deep compression Variational Autoencoder, Video-VAE, is designed for video generation tasks, achieving 16x16 spatial and 8x temporal compression ratios, while maintaining exceptional video reconstruction quality. User prompts are encoded using two bilingual text encoders to handle both English and Chinese. A DiT with 3D full attention is trained using Flow Matching and is employed to denoise input noise into latent frames. A video-based DPO approach, Video-DPO, is applied to reduce artifacts and improve the visual quality of the generated videos. We also detail our training strategies and share key observations and insights. Step-Video-T2V's performance is evaluated on a novel video generation benchmark, Step-Video-T2V-Eval, demonstrating its state-of-the-art text-to-video quality when compared with both open-source and commercial engines. Additionally, we discuss the limitations of current diffusion-based model paradigm and outline future directions for video foundation models. We make both Step-Video-T2V and Step-Video-T2V-Eval available at https://github.com/stepfun-ai/Step-Video-T2V. The online version can be accessed from https://yuewen.cn/videos as well. Our goal is to accelerate the innovation of video foundation models and empower video content creators.

cs.CV↗

Blockchain innovation in promoting employment

Blockchain technology, though conceptualized in the early 1990s, only gained practical relevance with Bitcoin's launch in 2009. Recent advancements have demonstrated its transformative potential, particularly in the digital art and global payment sectors. Non-fungible tokens (NFTs) have redefined digital ownership, while financial institutions use blockchain to enhance cross-border transactions, reducing costs and settlement times. Using the Diamond-Mortensen-Pissarides (DMP) model, this paper examines blockchain's impact on labor markets by improving job-matching efficiency, thereby reducing unemployment. However, high research costs and competition with incumbent technologies hinder early-stage blockchain adoption. We extend the DMP model to analyze the role of government intervention through tax and wage policies in mitigating these barriers. Our findings suggest that lowering firm tax rates can accelerate blockchain innovation, enhance labor market efficiency, and promote employment growth, highlighting the critical balance between technological progress and economic policy in fostering blockchain-driven economic transformation.

econ.GN↗

TableLLM: Enabling Tabular Data Manipulation by LLMs in Real Office Usage Scenarios

We introduce TableLLM, a robust large language model (LLM) with 8 billion parameters, purpose-built for proficiently handling tabular data manipulation tasks, whether they are embedded within documents or spreadsheets, catering to real-world office scenarios. We propose a distant supervision method for training, which comprises a reasoning process extension strategy, aiding in training LLMs to understand reasoning patterns more effectively as well as a cross-way validation strategy, ensuring the quality of the automatically generated data. To evaluate the performance of TableLLM, we have crafted benchmarks tailored to address both document and spreadsheet formats as well as constructed a well-organized evaluation pipeline capable of handling both scenarios. Thorough evaluations underscore the advantages of TableLLM when compared to various existing general-purpose and tabular data-focused LLMs. We have publicly released the model checkpoint, source code, benchmarks, and a web application for user interaction. Our codes and data are publicly available at https://github.com/TableLLM/TableLLM.

cs.CL↗

Unveiling the Power of Complex-Valued Transformers in Wireless Communications

Utilizing complex-valued neural networks (CVNNs) in wireless communication tasks has received growing attention for their ability to provide natural and effective representation of complex-valued signals and data. However, existing studies typically employ complex-valued versions of simple neural network architectures. Not only they merely scratch the surface of the extensive range of modern deep learning techniques, theoretical understanding of the superior performance of CVNNs is missing. To this end, this paper aims to fill both the theoretical and practice gap of employing CVNNs in wireless communications. In particular, we provide a comprehensive description on the various operations in CVNNs and theoretically prove that the CVNN requires fewer layers than the real-valued counterpart to achieve a given approximation error of a continuous function. Furthermore, to advance CVNNs in the field of wireless communications, this paper focuses on the transformer model, which represents a more sophisticated deep learning architecture and has been shown to have excellent performance in wireless communications but only in its real-valued form. In this aspect, we propose a fundamental paradigm of complex-valued transformers for wireless communications. Leveraging this structure, we develop customized complex-valued transformers for three representative applications in wireless communications: channel estimation, user activity detection, and precoding design. These applications utilize transformers with varying levels of sophistication and span a variety of tasks, ranging from regression to classification, supervised to unsupervised learning, and specific module design to end-to-end design. Experimental results demonstrate the superior performance of the complex-valued transformers for the above three applications compared to other traditional real-valued neural network-based methods.

eess.SP↗

EventZoom: A Progressive Approach to Event-Based Data Augmentation for Enhanced Neuromorphic Vision

Dynamic Vision Sensors (DVS) capture event data with high temporal resolution and low power consumption, presenting a more efficient solution for visual processing in dynamic and real-time scenarios compared to conventional video capture methods. Event data augmentation serve as an essential method for overcoming the limitation of scale and diversity in event datasets. Our comparative experiments demonstrate that the two factors, spatial integrity and temporal continuity, can significantly affect the capacity of event data augmentation, which are guarantee for maintaining the sparsity and high dynamic range characteristics unique to event data. However, existing augmentation methods often neglect the preservation of spatial integrity and temporal continuity. To address this, we developed a novel event data augmentation strategy EventZoom, which employs a temporal progressive strategy, embedding transformed samples into the original samples through progressive scaling and shifting. The scaling process avoids the spatial information loss associated with cropping, while the progressive strategy prevents interruptions or abrupt changes in temporal information. We validated EventZoom across various supervised learning frameworks. The experimental results show that EventZoom consistently outperforms existing event data augmentation methods with SOTA performance. For the first time, we have concurrently employed Semi-supervised and Unsupervised learning to verify feasibility on event augmentation algorithms, demonstrating the applicability and effectiveness of EventZoom as a powerful event-based data augmentation tool in handling real-world scenes with high dynamics and variability environments.

cs.CV↗

DeepThink: Aligning Language Models with Domain-Specific User Intents

Supervised fine-tuning with synthesized instructions has been a common practice for adapting LLMs to domain-specific QA tasks. However, the synthesized instructions deviate from real user questions and expected answers. This study proposes a novel framework called DeepThink to generate high-quality instructions. DeepThink first generates a few seed questions to mimic actual user questions, simulates conversations to uncover the hidden user needs, and refines the answer by conversational contexts and the retrieved documents for more comprehensive answers. Experiments demonstrate that DeepThink achieves an average performance improvement of 7.92% compared to a GPT-4-turbo+RAG-based assistant on the real user test set in the advertising domain across dimensions such as relevance, completeness, clarity, accuracy, and actionability.

cs.CL↗

Blockchain-based Ecommerce It's an Evolution NOT a Revolution-Experimental Evidence from Users' Perspective

Proponents of blockchains believe that this technology will revolutionize e-commerce. To evaluate this belief, we invite several groups of students to transact on a decentralized peer-to-peer marketplace built on the platform provided by Origin Protocol Inc., and then we conduct a survey about their experience of usage. Based on our survey results, we find that 33% of respondents play tricks on others, which implies that this undesirable result may hinder the widespread adoption of blockchain technologies. We also attempt to propose a conceptual mechanism to mitigate fraudulent behaviors. In the event of disputation, a trusted authority is entitled to the right to downgrade the fraudulent side's credit record, which is stored by a permissioned blockchain accessed only by the authority. Such a punishment can effectively decrease agents' incentives to sell counterfeits and leave fake ratings. In sum, we must distinguish what we proposed blockchains will do and what blockchains can do before enabling this technology in e-commerce.

econ.GN↗