arXiv subjects

Yufei Feng

Publications and source records attributed to Yufei Feng.

At least 19 recordsLinked to original sources

arXiv2026

FilterLoss: A Transfer Learning Approach for Communication Scene Recognition

Communication scene recognition has been widely applied in practice, but using deep learning to address this problem faces challenges such as insufficient data and imbalanced data distribution. To address this, we designed a weighted loss function structure, named FilterLoss, which assigns different loss function weights to different sample points. This allows the deep learning model to focus primarily on high-value samples while appropriately accounting for noisy, boundary-level data points. Additionally, we developed a matching weight filtering algorithm that evaluates the quality of sample points in the input dataset and assigns different weight values to samples based on their quality. By applying this method, when using transfer learning on a highly imbalanced new dataset, the accuracy of the transferred model was restored to 92.34% of the original model's performance. Our experiments also revealed that using this loss function structure allowed the model to maintain good stability despite insufficient and imbalanced data.

econ.EM↗

arXiv2025

Handover Configurations in Operational 5G Networks: Diversity, Evolution, and Impact on Performance

Mobility management in cellular networks, especially the handover (HO) process, plays a key role in providing seamless and ubiquitous Internet access. The wide-scale deployment of 5G and the resulting co-existence of 4G/5G in the past six years have significantly changed the landscape of all mobile network operators and made the HO process much more complex than before. While several recent works have studied the impact of HOs on user experience, why and how HOs occur and how HO configurations affect performance in 5G operational networks remains largely unknown. Through four cross-country driving trips across the US spread out over a 27-month period, we conduct an in-depth measurement study of HO configurations across all three major US operators. Our study reveals (a) new types of HOs and new HO events used by operators to handle these new types of HOs, (b) overly aggressive HO configurations that result in unnecessarily high signaling overhead, (c) large diversity in HO configuration parameter values, which also differ across operators, but significantly lower diversity in 5G compared to LTE, and (d) sub-optimal HO configurations/decisions leading to poor pre- or post-HO performance. Our findings have many implications for mobile operators, as they keep fine-tuning their 5G HO configurations.

cs.NI↗

arXiv2025

OneTrans: Unified Feature Interaction and Sequence Modeling with One Transformer in Industrial Recommender

In recommendation systems, scaling up feature-interaction modules (e.g., Wukong, RankMixer) or user-behavior sequence modules (e.g., LONGER) has achieved notable success. However, these efforts typically proceed on separate tracks, which not only hinders bidirectional information exchange but also prevents unified optimization and scaling. In this paper, we propose OneTrans, a unified Transformer backbone that simultaneously performs user-behavior sequence modeling and feature interaction. OneTrans employs a unified tokenizer to convert both sequential and non-sequential attributes into a single token sequence. The stacked OneTrans blocks share parameters across similar sequential tokens while assigning token-specific parameters to non-sequential tokens. Through causal attention and cross-request KV caching, OneTrans enables precomputation and caching of intermediate representations, significantly reducing computational costs during both training and inference. Experimental results on industrial-scale datasets demonstrate that OneTrans scales efficiently with increasing parameters, consistently outperforms strong baselines, and yields a 5.68% lift in per-user GMV in online A/B tests.

cs.IR↗

arXiv2025

TTS-1 Technical Report

We introduce Inworld TTS-1, a set of two Transformer-based autoregressive text-to-speech (TTS) models. Our largest model, TTS-1-Max, has 8.8B parameters and is designed for utmost quality and expressiveness in demanding applications. TTS-1 is our most efficient model, with 1.6B parameters, built for real-time speech synthesis and on-device use cases. By scaling train-time compute and applying a sequential process of pre-training, fine-tuning, and RL-alignment of the speech-language model (SpeechLM) component, both models achieve state-of-the-art performance on a variety of benchmarks, demonstrating exceptional quality relying purely on in-context learning of the speaker's voice. Inworld TTS-1 and TTS-1-Max can generate high-resolution 48 kHz speech with low latency, and support 11 languages with fine-grained emotional control and non-verbal vocalizations through audio markups. We additionally open-source our training and modeling code under an MIT license.

cs.CL↗

arXiv2025

The Detectability of Coronal Mass Ejections in the Low Corona Using Multi-slit Extreme-ultraviolet Spectroscopy

The spectra of coronal mass ejections (CMEs) in the low corona play a crucial role in understanding their origins and physical mechanism, and enhancing space weather forecasting. However, capturing these spectra faces significant challenges. This paper introduces a scheme of a multi-slit spectrometer design with five slits, acquiring the global spectra of the solar corona simultaneously with a focus on the spectra of CMEs in the low corona. The chosen wavelength range of the spectrometer (170-180 {\AA}) includes four extreme ultraviolet emission lines (Fe x 174.53 {\AA}, Fe ix 171.07 {\AA}, Fe x 175.26 {\AA}, Fe x 177.24 {\AA}), which provides information of plasma velocity, density and temperature. Utilizing a numerical simulation of the global corona for both the on-disk and the off-limb scenarios, we focus on resolving the ambiguity associated with various Doppler velocity components of CMEs, particularly for a fast CME in the low corona. A new application of our decomposition technique is adopted, enabling the successful identification of multiple discrete CME velocity components. Our findings demonstrate a strong correlation between the synthetic model spectra and the inverted results, indicating the robustness of our decomposition method and its significant potential for global monitoring of the solar corona, including CMEs.

astro-ph.SR↗

arXiv2024

Graph Disentangle Causal Model: Enhancing Causal Inference in Networked Observational Data

Estimating individual treatment effects (ITE) from observational data is a critical task across various domains. However, many existing works on ITE estimation overlook the influence of hidden confounders, which remain unobserved at the individual unit level. To address this limitation, researchers have utilized graph neural networks to aggregate neighbors' features to capture the hidden confounders and mitigate confounding bias by minimizing the discrepancy of confounder representations between the treated and control groups. Despite the success of these approaches, practical scenarios often treat all features as confounders and involve substantial differences in feature distributions between the treated and control groups. Confusing the adjustment and confounder and enforcing strict balance on the confounder representations could potentially undermine the effectiveness of outcome prediction. To mitigate this issue, we propose a novel framework called the \textit{Graph Disentangle Causal model} (GDC) to conduct ITE estimation in the network setting. GDC utilizes a causal disentangle module to separate unit features into adjustment and confounder representations. Then we design a graph aggregation module consisting of three distinct graph aggregators to obtain adjustment, confounder, and counterfactual confounder representations. Finally, a causal constraint module is employed to enforce the disentangled representations as true causal factors. The effectiveness of our proposed method is demonstrated by conducting comprehensive experiments on two networked datasets.

cs.LG↗

arXiv2024

Optical optimization of a multi-slit extreme ultraviolet spectrograph for global solar corona diagnostics

The spatial-temporal evolution of coronal plasma parameters of the solar outer atmosphere at global scales, derived from solar full-disk imaging spectroscopic observation in the extreme-ultraviolet band, is critical for understanding and forecasting solar eruptions. We propose a multi-slits extreme ultraviolet imaging spectrograph for global coronal diagnostics with high cadence and present the preliminary instrument designs for the wavelength range from 18.3 to 19.8 nm. The instrument takes a comprehensive approach to obtain global coronal spatial and spectral information, improve the detected cadence and avoid overlapping. We first describe the relationship between optical properties and structural parameters, especially the relationship between the overlapping and the number of slits, and give a general multi-slits extreme-ultraviolet imaging spectrograph design process. Themultilayer structure is optimized to enhance the effective areas in the observation band. Five distantly-separated slits are set to divide the entire solar field of view, which increase the cadence for raster scanning the solar disk by 5 times relative to a single slit. The spectral resolving power of the optical system with an aperture diameter of 150 mm are optimized to be greater than 1461. The spatial resolution along the slits direction and the scanning direction are about 4.4''and 6.86'', respectively. The Al/Mo/B4C multilayer structure is optimized and the peak effective area is about 1.60 cm2 at 19.3 nm with a full width at half maximum of about 1.3 nm. The cadence to finish full-disk raster scan is about 5 minutes. Finally, the instrument performance is evaluated by an end-to-end calculation of the system photon budget and a simulation of the observational image and spectra. Our investigation shows that this approach is promising for global coronal plasma diagnostics.

astro-ph.SR↗

arXiv2024

Global Coronal Plasma Diagnostics Based on Multi-slit EUV Spectroscopy

Full-disk spectroscopic observations of the solar corona are highly desired to forecast solar eruptions and their impact on planets and to uncover the origin of solar wind. In this paper, we introduce a new multi-slit design (5 slits) to obtain extreme ultraviolet (EUV) spectra simultaneously. The selected spectrometer wavelength range (184-197 \r{A}) contains several bright EUV lines that can be used for spectral diagnostics. The multi-slit approach offers an unprecedented way to efficiently obtain the global spectral data but the ambiguity from different slits should be resolved. Using a numerical simulation of the global corona, we primarily concentrate on the optimization of the disambiguation process, with the objective of extracting decomposed spectral information of six primary lines. This subsequently facilitates a comprehensive series of plasma diagnostics, including density (Fe XII 195.12/186.89 \r{A}), Doppler velocity (Fe XII 193.51 \r{A}), line width (Fe XII 193.51 \r{A}) and temperature diagnostics (Fe VIII 185.21 \r{A}, Fe X 184.54 \r{A}, Fe XI 188.22 \r{A}, Fe XII 193.51 \r{A}). We find a good agreement between the forward modeling parameters and the inverted results at the initial eruption stage of a coronal mass ejection, indicating the robustness of the decomposition method and its immense potential for global monitoring of the solar corona.

astro-ph.SR↗

arXiv2022

JECC: Commonsense Reasoning Tasks Derived from Interactive Fictions

Commonsense reasoning simulates the human ability to make presumptions about our physical world, and it is an essential cornerstone in building general AI systems. We propose a new commonsense reasoning dataset based on human's Interactive Fiction (IF) gameplay walkthroughs as human players demonstrate plentiful and diverse commonsense reasoning. The new dataset provides a natural mixture of various reasoning types and requires multi-hop reasoning. Moreover, the IF game-based construction procedure requires much less human interventions than previous ones. Different from existing benchmarks, our dataset focuses on the assessment of functional commonsense knowledge rules rather than factual knowledge. Hence, in order to achieve higher performance on our tasks, models need to effectively utilize such functional knowledge to infer the outcomes of actions, rather than relying solely on memorizing facts. Experiments show that the introduced dataset is challenging to previous machine reading models as well as the new large language models with a significant 20% performance gap compared to human experts.

cs.CL↗

arXiv2022

Neuro-symbolic Natural Logic with Introspective Revision for Natural Language Inference

We introduce a neuro-symbolic natural logic framework based on reinforcement learning with introspective revision. The model samples and rewards specific reasoning paths through policy gradient, in which the introspective revision algorithm modifies intermediate symbolic reasoning steps to discover reward-earning operations as well as leverages external knowledge to alleviate spurious reasoning and training inefficiency. The framework is supported by properly designed local relation models to avoid input entangling, which helps ensure the interpretability of the proof paths. The proposed model has built-in interpretability and shows superior capability in monotonicity inference, systematic generalization, and interpretability, compared to previous models on the existing datasets.

cs.CL↗

arXiv2021

Program Enhanced Fact Verification with Verbalization and Graph Attention Network

Performing fact verification based on structured data is important for many real-life applications and is a challenging research problem, particularly when it involves both symbolic operations and informal inference based on language understanding. In this paper, we present a Program-enhanced Verbalization and Graph Attention Network (ProgVGAT) to integrate programs and execution into textual inference models. Specifically, a verbalization with program execution model is proposed to accumulate evidences that are embedded in operations over the tables. Built on that, we construct the graph attention verification networks, which are designed to fuse different sources of evidences from verbalized program execution, program structures, and the original statements and tables, to make the final verification decision. To support the above framework, we propose a program selection module optimized with a new training strategy based on margin loss, to produce more accurate programs, which is shown to be effective in enhancing the final verification results. Experimental results show that the proposed framework achieves the new state-of-the-art performance, a 74.4% accuracy, on the benchmark dataset TABFACT.

cs.AI↗

arXiv2021

GRN: Generative Rerank Network for Context-wise Recommendation

Reranking is attracting incremental attention in the recommender systems, which rearranges the input ranking list into the final rank-ing list to better meet user demands. Most existing methods greedily rerank candidates through the rating scores from point-wise or list-wise models. Despite effectiveness, neglecting the mutual influence between each item and its contexts in the final ranking list often makes the greedy strategy based reranking methods sub-optimal. In this work, we propose a new context-wise reranking framework named Generative Rerank Network (GRN). Specifically, we first design the evaluator, which applies Bi-LSTM and self-attention mechanism to model the contextual information in the labeled final ranking list and predict the interaction probability of each item more precisely. Afterwards, we elaborate on the generator, equipped with GRU, attention mechanism and pointer network to select the item from the input ranking list step by step. Finally, we apply cross-entropy loss to train the evaluator and, subsequently, policy gradient to optimize the generator under the guidance of the evaluator. Empirical results show that GRN consistently and significantly outperforms state-of-the-art point-wise and list-wise methods. Moreover, GRN has achieved a performance improvement of 5.2% on PV and 6.1% on IPV metric after the successful deployment in one popular recommendation scenario of Taobao application.

cs.IR↗

arXiv2021

Complementary Evidence Identification in Open-Domain Question Answering

This paper proposes a new problem of complementary evidence identification for open-domain question answering (QA). The problem aims to efficiently find a small set of passages that covers full evidence from multiple aspects as to answer a complex question. To this end, we proposes a method that learns vector representations of passages and models the sufficiency and diversity within the selected set, in addition to the relevance between the question and passages. Our experiments demonstrate that our method considers the dependence within the supporting evidence and significantly improves the accuracy of complementary evidence selection in QA domain.

cs.CL↗

arXiv2021

Revisit Recommender System in the Permutation Prospective

Recommender systems (RS) work effective at alleviating information overload and matching user interests in various web-scale applications. Most RS retrieve the user's favorite candidates and then rank them by the rating scores in the greedy manner. In the permutation prospective, however, current RS come to reveal the following two limitations: 1) They neglect addressing the permutation-variant influence within the recommended results; 2) Permutation consideration extends the latent solution space exponentially, and current RS lack the ability to evaluate the permutations. Both drive RS away from the permutation-optimal recommended results and better user experience. To approximate the permutation-optimal recommended results effectively and efficiently, we propose a novel permutation-wise framework PRS in the re-ranking stage of RS, which consists of Permutation-Matching (PMatch) and Permutation-Ranking (PRank) stages successively. Specifically, the PMatch stage is designed to obtain the candidate list set, where we propose the FPSA algorithm to generate multiple candidate lists via the permutation-wise and goal-oriented beam search algorithm. Afterwards, for the candidate list set, the PRank stage provides a unified permutation-wise ranking criterion named LR metric, which is calculated by the rating scores of elaborately designed permutation-wise model DPWN. Finally, the list with the highest LR score is recommended to the user. Empirical results show that PRS consistently and significantly outperforms state-of-the-art methods. Moreover, PRS has achieved a performance improvement of 11.0% on PV metric and 8.7% on IPV metric after the successful deployment in one popular recommendation scenario of Taobao application.

cs.IR↗

arXiv2020

Learning to Retrieve Entity-Aware Knowledge and Generate Responses with Copy Mechanism for Task-Oriented Dialogue Systems

Task-oriented conversational modeling with unstructured knowledge access, as track 1 of the 9th Dialogue System Technology Challenges (DSTC 9), requests to build a system to generate response given dialogue history and knowledge access. This challenge can be separated into three subtasks, (1) knowledge-seeking turn detection, (2) knowledge selection, and (3) knowledge-grounded response generation. We use pre-trained language models, ELECTRA and RoBERTa, as our base encoder for different subtasks. For subtask 1 and 2, the coarse-grained information like domain and entity are used to enhance knowledge usage. For subtask 3, we use a latent variable to encode dialog history and selected knowledge better and generate responses combined with copy mechanism. Meanwhile, some useful post-processing strategies are performed on the model's final output to make further knowledge usage in the generation task. As shown in released evaluation results, our proposed system ranks second under objective metrics and ranks fourth under human metrics.

cs.CL↗

arXiv2020

Exploring End-to-End Differentiable Natural Logic Modeling

We explore end-to-end trained differentiable models that integrate natural logic with neural networks, aiming to keep the backbone of natural language reasoning based on the natural logic formalism while introducing subsymbolic vector representations and neural components. The proposed model adapts module networks to model natural logic operations, which is enhanced with a memory component to model contextual information. Experiments show that the proposed framework can effectively model monotonicity-based reasoning, compared to the baseline neural network models without built-in inductive bias for monotonicity-based reasoning. Our proposed model shows to be robust when transferred from upward to downward inference. We perform further analyses on the performance of the proposed model on aggregation, showing the effectiveness of the proposed subcomponents on helping achieve better intermediate aggregation performance.

cs.CL↗

arXiv2020

Deriving Commonsense Inference Tasks from Interactive Fictions

Commonsense reasoning simulates the human ability to make presumptions about our physical world, and it is an indispensable cornerstone in building general AI systems. We propose a new commonsense reasoning dataset based on human's interactive fiction game playings as human players demonstrate plentiful and diverse commonsense reasoning. The new dataset mitigates several limitations of the prior art. Experiments show that our task is solvable to human experts with sufficient commonsense knowledge but poses challenges to existing machine reading models, with a big performance gap of more than 30%.

cs.AI↗

arXiv2020

EdgeRec: Recommender System on Edge in Mobile Taobao

Recommender system (RS) has become a crucial module in most web-scale applications. Recently, most RSs are in the waterfall form based on the cloud-to-edge framework, where recommended results are transmitted to edge (e.g., user mobile) by computing in advance in the cloud server. Despite effectiveness, network bandwidth and latency between cloud server and edge may cause the delay for system feedback and user perception. Hence, real-time computing on edge could help capture user preferences more preciously and thus make more satisfactory recommendations. Our work, to our best knowledge, is the first attempt to design and implement the novel Recommender System on Edge (EdgeRec), which achieves Real-time User Perception and Real-time System Feedback. Moreover, we propose Heterogeneous User Behavior Sequence Modeling and Context-aware Reranking with Behavior Attention Networks to capture user's diverse interests and adjust recommendation results accordingly. Experimental results on both the offline evaluation and online performance in Taobao home-page feeds demonstrate the effectiveness of EdgeRec.

cs.IR↗