arXiv subjects

Jiaze Ma

Publications and source records attributed to Jiaze Ma.

11 recordsLinked to original sources

arXiv2026

Battery-Swapping Station Operation Under Forecast Uncertainty: A Scenario-Based Stochastic MPC Framework

Battery-swapping stations (BSSs) can shorten electric-vehicle energy replenishment while using centrally managed battery inventories as flexible grid-connected storage. Realizing both benefits requires the station to schedule charging, grid discharge, and swapping service before future customer demand and electricity prices are known. This paper develops a forecast-aware rolling-horizon operating framework for this problem. A lightweight DLinear model predicts 24-hour price and demand trajectories, Stein variational gradient descent quantifies their uncertainty through representative scenarios, and a two-stage stochastic model predictive controller converts those scenarios into station decisions. The controller accounts for service shortfall, terminal readiness, a protected service buffer, and electrochemical degradation without assuming perfect future information. The application contribution is an implementable controller that coordinates the station's mobility-service and energy-storage roles. The methodological contribution is a modular forecast-to-control interface that separates the operational value of mean-forecast accuracy from that of uncertainty representation. In a 120-day closed-loop evaluation, DLinear-SVGD SMPC achieves the lowest cost among the implementable controllers. Relative to deterministic DLinear MPC, it reduces final cost by 1.2\% and service-shortfall hours by 80.7\%, with 99.10\% of the evaluated hours free of shortfall.

math.OC↗

arXiv2026

Grid-Interactive Operation of Solar-Integrated Data Centers for Coordinated Local and System-Level Decarbonization

The exponential growth of AI is accelerating the deployment of data centers (DCs), placing unprecedented strain on power infrastructures. In response, major IT corporations are increasingly adopting on-site solar generation to reduce grid dependence and meet sustainability targets. However, the true impacts of this strategy remain ambiguous. While DCs are flexible assets capable of temporal load-shifting, anchoring them to self-generated power may inadvertently constrain their grid responsiveness. To evaluate these trade-offs, we propose a receding-horizon optimization (RHO) framework coordinating job scheduling, grid interactions, and on-site solar generation for a stand-alone DC. Our findings reveal a critical paradox: although solar integration increases energy self-sufficiency and reduces overall DC emissions, it inherently limits the facility's capacity to absorb low-cost, low-carbon electricity from the grid. This implies a fundamental tension between individual corporate sustainability goals and system-wide grid decarbonization.

math.OC↗

arXiv2026

Recasting AI Data Centers as Engines for Carbon Removal

AI data centers (AIDCs) are rapidly increasing electricity demand and associated CO2 emissions, yet they also generate continuous low-grade waste heat. Here, we assess whether this heat can be upgraded by heat pumps to drive direct air capture (DAC) and reduce the climate impact of AI infrastructure. We develop a thermodynamically integrated DAC-AIDC system and conduct a region-resolved assessment across the United States, accounting for AIDC capacity, server composition, local climate, electricity prices, and grid carbon intensity. We find that AIDC waste heat can substantially improve net CO2 removal and lower the levelized cost of capture. In carbon-intensive regions, integration can flip DAC from net-positive to net-negative. Under a 2030 scenario with more GPU-intensive AIDCs and cleaner grids, several states achieve removal ratios above 1, indicating that integrated systems can offset their own operational emissions and deliver additional carbon removal.

math.OC↗

arXiv2026

Less is More: Towards Simple Graph Contrastive Learning

Graph Contrastive Learning (GCL) has shown strong promise for unsupervised graph representation learning, yet its effectiveness on heterophilic graphs, where connected nodes often belong to different classes, remains limited. Most existing methods rely on complex augmentation schemes, intricate encoders, or negative sampling, which raises the question of whether such complexity is truly necessary in this challenging setting. In this work, we revisit the foundations of supervised and unsupervised learning on graphs and uncover a simple yet effective principle for GCL: mitigating node feature noise by aggregating it with structural features derived from the graph topology. This observation suggests that the original node features and the graph structure naturally provide two complementary views for contrastive learning. Building on this insight, we propose an embarrassingly simple GCL model that uses a GCN encoder to capture structural features and an MLP encoder to isolate node feature noise. Our design requires neither data augmentation nor negative sampling, yet achieves state-of-the-art results on heterophilic benchmarks with minimal computational and memory overhead, while also offering advantages in homophilic graphs in terms of complexity, scalability, and robustness. We provide theoretical justification for our approach and validate its effectiveness through extensive experiments, including robustness evaluations against both black-box and white-box adversarial attacks.

cs.LG↗

arXiv2026

Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks

Graph contrastive learning (GCL) learns node and graph representations by contrasting multiple views of the same graph. Existing methods typically rely on fixed, handcrafted views-usually a local and a global perspective, which limits their ability to capture multi-scale structural patterns. We present an augmentation-free, multi-view GCL framework grounded in fractional-order continuous dynamics. By varying the fractional derivative order $α\in (0,1]$, our encoders produce a continuous spectrum of views: small $α$ yields localized features, while large $α$ induces broader, global aggregation. We treat $α$ as a learnable parameter so the model can adapt diffusion scales to the data and automatically discover informative views. This principled approach generates diverse, complementary representations without manual augmentations. Extensive experiments on standard benchmarks demonstrate that our method produces more robust and expressive embeddings and outperforms state-of-the-art GCL baselines.

cs.LG↗

arXiv2025

Degradation-Aware Model Predictive Control for Battery Swapping Stations under Energy Arbitrage

Battery swapping stations (BSS) offer a fast and scalable alternative to conventional electric vehicle (EV) charging, gaining growing policy support worldwide. However, existing BSS control strategies typically rely on heuristics or low-fidelity degradation models, limiting profitability and service level. This paper proposes BSS-MPC: a real-time, degradation-aware Model Predictive Control (MPC) framework for BSS operations to trade off economic incentives from energy market arbitrage and long-term battery degradation effects. BSS-MPC integrates a high-fidelity, physics informed battery aging model that accurately predicts the degradation level and the remaining capacity of battery packs. The resulting multiscale optimization-jointly considering energy arbitrage, swapping logistics, and battery health-is formulated as a mixed-integer optimal control problem and solved with tailored algorithms. Simulation results show that BSS-MPC outperforms rule-based and low-fidelity baselines, achieving lower energy cost, reduced capacity fade, and strict satisfaction of EV swapping demands.

math.OC↗

arXiv2025

Exploiting Electrolyzer Flexibility via Multiscale Model Predictive Control Cross Heterogeneous Energy Markets

Green hydrogen production via electrolysis is crucial for decarbonization but faces significant economic hurdles primarily due to the high cost of the electricity. However, current electrolyzer-based hydrogen production processes predominantly rely on the single-scale Day-Ahead Market (DAM) for electricity procurement, failing to fully exploit the economic benefits offered by multi-scale electricity market that integrates both the DAM and the Real-Time Market (RTM), thereby eliminating the opportunity to reduce the overall cost. To mitigate this technical gap, this research investigates a dynamic operational strategy enabling electrolyzers to strategically navigate between the DAM and RTM to minimize net operation costs. Using a rolling horizon optimization framework to coordinate bidding and operation, we demonstrate a strategy where electrolyzers secure primary energy via exclusive DAM purchases, then actively engage the RTM to buy supplemental energy cheaply or, critically, sell procured DAM energy back at a profit during high RTM price periods. Our analysis reveals that this coordinated multi-scale electricity market participation strategy can dramatically reduce net electricity expenditures, achieving near-zero or even negative effective electricity costs for green hydrogen production under realistic market scenarios, effectively meaning the operation can profit from its electricity market interactions. By transforming electrolyzers from simple price-takers into active participants capable of arbitrage between market timescales, this approach unlocks a financially compelling pathway for green hydrogen, accelerating its deployment while simultaneously enhancing power grid flexibility.

math.OC↗

arXiv2025

A Survey of Reinforcement Learning for Large Reasoning Models

In this paper, we survey recent advances in Reinforcement Learning (RL) for reasoning with Large Language Models (LLMs). RL has achieved remarkable success in advancing the frontier of LLM capabilities, particularly in addressing complex logical tasks such as mathematics and coding. As a result, RL has emerged as a foundational methodology for transforming LLMs into LRMs. With the rapid progress of the field, further scaling of RL for LRMs now faces foundational challenges not only in computational resources but also in algorithm design, training data, and infrastructure. To this end, it is timely to revisit the development of this domain, reassess its trajectory, and explore strategies to enhance the scalability of RL toward Artificial SuperIntelligence (ASI). In particular, we examine research applying RL to LLMs and LRMs for reasoning abilities, especially since the release of DeepSeek-R1, including foundational components, core problems, training resources, and downstream applications, to identify future opportunities and directions for this rapidly evolving area. We hope this review will promote future research on RL for broader reasoning models. Github: https://github.com/TsinghuaC3I/Awesome-RL-for-LRMs

cs.CL↗

arXiv2025

Relaxing Probabilistic Latent Variable Models' Specification via Infinite-Horizon Optimal Control

In this paper, we address the issue of model specification in probabilistic latent variable models (PLVMs) using an infinite-horizon optimal control approach. Traditional PLVMs rely on joint distributions to model complex data, but introducing latent variables results in an ill-posed parameter learning problem. To address this issue, regularization terms are typically introduced, leading to the development of the expectation-maximization (EM) algorithm, where the latent variable distribution is restricted to a predefined normalized distribution family to facilitate the expectation step. To overcome this limitation, we propose representing the latent variable distribution as a finite set of instances perturbed via an ordinary differential equation with a control policy. This approach ensures that the instances asymptotically converge to the true latent variable distribution as time approaches infinity. By doing so, we reformulate the distribution inference problem as an optimal control policy determination problem, relaxing the model specification to an infinite-horizon path space. Building on this formulation, we derive the corresponding optimal control policy using the Pontryagin's maximum principle and provide a closed-form expression for its implementation using the reproducing kernel Hilbert space. After that, we develop a novel, convergence-guaranteed EM algorithm for PLVMs based on this infinite-horizon-optimal-control-based inference strategy. Finally, extensive experiments are conducted to validate the effectiveness and superiority of the proposed approach.

eess.SY↗

arXiv2024

Graph-Based Optimization for Technology Pathway Analysis: A Case Study in Decarbonization of University Campuses

Industrial sectors such as urban centers, chemical companies, manufacturing facilities, and microgrids are actively exploring strategies to help reduce their carbon footprint. For instance, university campuses are complex urban districts (involving collections of buildings and utility systems) that are seeking to reduce carbon footprints that originate from diverse activities (e.g., transportation operations and production of heating, cooling, and power utilities). This work presents an optimization framework to identify technology pathways that enable decarbonization of complex industrial sectors. The framework uses a graph abstraction that compactly captures interdependencies between diverse products and technologies as well as diverse externalities (e.g., market, policy, and carbon prices). Duality analysis reveals that the formulation can be interpreted as an economy, market, or value chain that uses technologies to generate economic value (wealth) by transforming basic products into higher value products. This interpretation also reveals that the formulation identifies pathways that maximize the profit of stakeholders, helps reveal the inherent value (prices) of intermediate products, and helps analyze the impact of externalities and technology specifications on product values. Our developments are illustrated via a case study involving a prototypical university campus that seeks to identify pathways that reduce its carbon footprint (e.g., via electrification and deployment of hydrogen technologies). We use the framework to determine carbon tax values, technology specifications, and investment budgets that activate different technology pathways and that achieve different levels of decarbonization.

math.OC↗

arXiv2021

Solution of Large-Scale Supply Chain Models using Graph Sampling & Coarsening

We present a graph sampling and coarsening scheme (gSC) for computing lower and upper bounds for large-scale supply chain models. An edge sampling scheme is used to build a low-complexity problem that is used to finding an approximate (but feasible) solution for the original model and to compute a lower bound (for a maximization problem). This scheme is similar in spirit to the so-called sample average approximation scheme, which is widely used for the solution of stochastic programs. A graph coarsening (aggregation) scheme is used to compute an upper bound and to estimate the optimality gap of the approximate solution. The coarsening scheme uses node sampling to select a small set of support nodes that are used to guide node/edge aggregation and we show that the coarsened model provides a relaxation of the original model and a valid upper bound. We provide numerical evidence that gSC can yield significant improvements in solution time and memory usage over state-of-the-art solvers. Specifically, we study a supply chain design model (a mixed-integer linear program) that contains over 38 million variables and show that gSC finds a solution with an optimality gap of <0.5% in less than 22 minutes.

math.OC↗