SearcharxivSearch

arXiv subjects

Yongxiang Zhao

Publications and source records attributed to Yongxiang Zhao.

6 recordsLinked to original sources

What if Tomorrow is the World Cup Final? Counterfactual Time Series Forecasting with Textual Conditions

Time series forecasting has become increasingly critical in real-world scenarios, where future sequences are influenced not only by historical patterns but also by forthcoming events. In this context, forecasting must dynamically adapt to complex and stochastic future conditions, which introduces fundamental challenges in both forecasting and evaluation. Traditional methods typically rely on historical data or factual future conditions, while overlooking counterfactual scenarios. Furthermore, many existing approaches are restricted to simple structured conditions, limiting their ability to generalize to the real-world complexities. To address these gaps, we introduce the task of counterfactual time series forecasting with textual conditions, enabling more flexible and condition-aware forecasting. We propose a comprehensive evaluation framework that encompasses both factual and counterfactual settings, even in the absence of ground truth time series. Additionally, we present a novel text-attribution mechanism that distinguishes mutable from immutable factors, thereby improving forecast accuracy under sophisticated and stochastic textual conditions. The project page is at https://seqml.github.io/TADiff/

cs.LG

Optimal Short Video Ordering and Transmission Scheduling for Reducing Video Delivery Cost in Peer-to-Peer CDNs

The explosive growth of short video platforms has generated a massive surge in global traffic, imposing heavy financial burdens on content providers. While Peer-to-Peer Content Delivery Networks (PCDNs) offer a cost-effective alternative by leveraging resource-constrained edge nodes, the limited storage and concurrent service capacities of these peers struggle to absorb the intense temporal demand spikes characteristic of short video consumption. In this paper, we propose to minimize transmission costs by exploiting a novel degree of freedom, the inherent flexibility of server-driven playback sequences. We formulate the Optimal Video Ordering and Transmission Scheduling (OVOTS) problem as an Integer Linear Program to jointly optimize personalized video ordering and transmission scheduling. By strategically permuting playlists, our approach proactively smooths temporal traffic peaks, maximizing the offloading of requests to low-cost peer nodes. To solve the OVOTS problem, we provide a rigorous theoretical reduction of the OVOTS problem to an auxiliary Minimum Cost Maximum Flow (MCMF) formulation. Leveraging König's Edge Coloring Theorem, we prove the strict equivalence of these formulations and develop the Minimum-cost Maximum-flow with Edge Coloring (MMEC) algorithm, a globally optimal, polynomial-time solution. Extensive simulations demonstrate that MMEC significantly outperforms baseline strategies, achieving cost reductions of up to 67% compared to random scheduling and 36% compared to a simulated annealing approach. Our results establish playback sequence flexibility as a robust and highly effective paradigm for cost optimization in PCDN architectures.

cs.NI

Dissecting and Mitigating Diffusion Bias via Mechanistic Interpretability

Diffusion models have demonstrated impressive capabilities in synthesizing diverse content. However, despite their high-quality outputs, these models often perpetuate social biases, including those related to gender and race. These biases can potentially contribute to harmful real-world consequences, reinforcing stereotypes and exacerbating inequalities in various social contexts. While existing research on diffusion bias mitigation has predominantly focused on guiding content generation, it often neglects the intrinsic mechanisms within diffusion models that causally drive biased outputs. In this paper, we investigate the internal processes of diffusion models, identifying specific decision-making mechanisms, termed bias features, embedded within the model architecture. By directly manipulating these features, our method precisely isolates and adjusts the elements responsible for bias generation, permitting granular control over the bias levels in the generated content. Through experiments on both unconditional and conditional diffusion models across various social bias attributes, we demonstrate our method's efficacy in managing generation distribution while preserving image quality. We also dissect the discovered model mechanism, revealing different intrinsic features controlling fine-grained aspects of generation, boosting further research on mechanistic interpretability of diffusion models.

cs.CV

Startup Delay Aware Short Video Ordering: Problem, Model, and A Reinforcement Learning based Algorithm

Short video applications have attracted billions of users on the Internet and can satisfy diverse users' fragmented spare time with content-rich and duration-short videos. To achieve fast playback at user side, existing short video systems typically enforce burst transmission of initial segment of each video when being requested for improved quality of user experiences. However, such a way of burst transmissions can cause unexpected large startup delays at user side. This is because users may frequently switch videos when sequentially watching a list of short videos recommended by the server side, which can cause excessive burst transmissions of initial segments of different short videos and thus quickly deplete the network transmission capacity. In this paper, we adopt token bucket to characterize the video transmission path between video server and each user, and accordingly study how to effectively reduce the startup delay of short videos by effectively arranging the viewing order of a video list at the server side. We formulate the optimal video ordering problem for minimizing the maximum video startup delay as a combinatorial optimization problem and prove its NP-hardness. We accordingly propose a Partially Shared Actor Critic reinforcement learning algorithm (PSAC) to learn optimized video ordering strategy. Numerical results based on a real dataset provided by a large-scale short video service provider demonstrate that the proposed PSAC algorithm can significantly reduce the video startup delay compared to baseline algorithms.

cs.MM

End-to-End Asynchronous Traffic Scheduling in Converged 5G and Time-Sensitive Networks

As required by Industry 4.0, companies will move towards flexible and individual manufacturing. To succeed in this transition, convergence of 5G and time-sensitive networks (TSN) is the most promising technology and has thus attracted considerable interest from industry and standardization groups. However, the delay and jitter of end-to-end (e2e) transmission will get exacerbated if the transmission opportunities are missed in TSN due to the 5G transmission jitter and the clock skew between the two network systems. To mitigate this phenomenon, we propose a novel asynchronous access mechanism (AAM) that isolates the jitter only in the 5G system and ensures zero transmission jitter in TSN. We then exploit AAM to develop an e2e asynchronous traffic scheduling model for coordinated allocation of resources for 5G and TSN to provide e2e transmission delay guarantees for time-critical flows. The results of our extensive simulation of AAM on OMNET++ corroborate the superior performance of AAM and the scheduling model.

cs.NI

Research on Cross-platform Measurement method of online Advertising

There are a large number of competing ADXs on the Internet. It is the primary demand to identify and compare the advertising performance of ADX. Traditional method relies on training artificial online personas to represent behavioral traits. Then it uncovers existing correlation between users each exhibiting a certain behavioral trait and the display ads shown to them. This approach only measures and evaluates the performance of a single ADX. Due to without common measurement basis, this method does not able to apply to the comparative study of the performance of multiple ADXs. Therefore, in this tech report, a synchronous cross-platform measurement method is proposed and implemented. This method can realize the comparison of the performance of different ADXs, and help advertisers select the appropriate ADX.

cs.CY