Searcharxiv⌕ Search

arXiv subjects

Jianyi Yang

Publications and source records attributed to Jianyi Yang.

At least 19 recordsLinked to original sources

Online Allocation with Differential Privacy

We study private online allocation problems, where allocation decisions must satisfy differential privacy (DP) to protect sensitive user information while optimizing performance under limited resources. We first formalize differential privacy notions suited to different privacy requirements in online allocation and establish the fundamental performance limits of any algorithm under these definitions. Based on these insights, we propose PPOA, a privacy-preserving meta algorithm for online allocation, and establish sufficient conditions under which PPOA preserves Joint DP (JDP) or Local DP (LDP) while achieving asymptotically near-optimal performance. Building on these conditions, PPOA can be instantiated into a variety of concrete algorithms. In particular, we present the specific designs, which include PPOA-DMD that preserves JDP and LDP and PPOA-FTRL that preserves JDP. We analyze their performance under both adversarial and stochastic settings and characterize the fundamental trade-offs between DP and allocation performance. Finally, we demonstrate the superior performance of the proposed algorithms via numerical experiments on AI model routing in battery-powered edge systems.

cs.CR↗

Impact of Security Modeling Fidelity on Hyperscale Data Center Hosting Capacity Assessment

This paper assesses hyperscale data center hosting capacity in transmission grids. Hosting capacity (HC) analysis quantifies the maximum additional load a bus can accommodate without violating operational constraints. This paper defines data center HC as the maximum time-invariant active power demand at a single target bus over a 24-hour peak-day horizon, and evaluates it under four models of increasing fidelity (i.e., the extent to which the model enforces real-world operational security requirements) on the modified IEEE 24-bus system: (i) DC optimal power flow (DC-OPF) without unit commitment (UC), (ii) basic SCUC (security-constrained unit commitment) without reliability constraints, (iii) SCUC with spinning reserve, and (iv) N-SCUC with both reserve and branch-contingency security. Comparing these models quantifies the impact of unit commitment, reserve requirements, and N-1 security on bus-level HC estimates. The N-SCUC yields an average HC of 444 MW; omitting N-1 security raises this to 532 MW, a 19.8% overestimation. The DC-OPF and basic SCUC models further overestimate HC, indicating a trade-off between model complexity and estimation accuracy.

eess.SY↗

Photonic-Implemented Efficient Deep Quantum Neural Network via Virtual-Driven Hilbert Space Expansion

The growing computational demands of classical neural networks have intensified the search for energy-efficient and powerful computational alternatives. Quantum neural networks (QNNs) implemented on integrated photonic platforms offer a compelling avenue, offering exceptional computational power enhancements, with inherent programmability and scalability of integrated architectures. A critical challenge, however, is implementing the fundamental non-unitary and nonlinear activation function of QNNs within a linear quantum photonic system. Existing strategies, such as the adding ancillary qubits and measurement-based feedback or forward are constrained by high qubit resource costs, overhead devices, and poor cascadability. Here, we propose a novel deep photonic QNN with an expanded computational Hilbert space via input replication and mode expansion, which enables the realization of effective non-unitary and nonlinear activation on a linear programmable quantum photonic chip. This approach eliminates the need for physical ancillary qubits, measurement-induced qubit consumption and the measurement device burden, thereby significantly reduce resource costs. The fabricated chip integrates four high-quality entanglement sources and a programmable high-dimensional interferometric network, enabling a two-hidden-layer QNN that exhibits dimension-enhanced expressivity over the existing QNN architectures. We demonstrate its capabilities across diverse tasks, including nonlinear classification, image generation, and quantum Gibbs state preparation. This work establishes a scalable and efficient architecture toward practical quantum deep learning systems capable of tackling problems beyond the reach of classical computation.

quant-ph↗

WaterAdmin: Orchestrating Community Water Distribution Optimization via AI Agents

We study the operation of community water systems, where pumps and valves must be scheduled to reliably meet water demands while minimizing energy consumption. While existing optimization-based methods are effective under well-modeled environments, real-world community scenarios exhibit highly dynamic contexts-such as human activities, weather variations, etc-that significantly affect water demand patterns and operational targets across different zones. Traditional optimization approaches struggle to aggregate and adapt to such heterogeneous and rapidly evolving contextual information in real time. While Large Language Model (LLM) agents offer strong capabilities for understanding heterogeneous community context, they are not suitable for directly producing reliable real-time control actions. To address these challenges, we propose a bi-level AI-agent-based framework, WaterAdmin, which integrates LLM-based community context abstraction at the upper level with optimization-based operational control at the lower level. This design leverages the complementary strengths of both paradigms to enable adaptive and reliable operation. We implement WaterAdmin on the hydraulic simulation platform EPANET and demonstrate superior performance in maintaining pressure reliability and reducing energy consumption under highly dynamic community contexts.

cs.LG↗

Detecting the 3D Ising model phase transition with a ground-state-trained autoencoder

We develop a one-class, deep-learning framework to detect the phase transition and recover critical behavior of the 3D Ising model. A 3D convolutional neural network autoencoder (CAE) is trained on ground-state configurations only, without prior knowledge of the critical temperature, the Hamiltonian, or the order parameter. After training, the model is applied to Monte Carlo configurations across a wide temperature range and different lattice sizes. The mean-square reconstruction error is shown to be sensitive to the transition. Finite-size scaling of the peak location for the reconstruction error susceptibility yields the critical temperature $T_c=4.5128(58)$ and the correlation-length critical exponent $ν=0.63(27)$, consistent with results from the literature. Our results show that a one-class CAE, trained on zero-temperature configurations only, can recover nontrivial critical behavior of the 3D Ising model.

cond-mat.stat-mech↗

Distributionally Robust Optimization via Generative Ambiguity Modeling

This paper studies Distributionally Robust Optimization (DRO), a fundamental framework for enhancing the robustness and generalization of statistical learning and optimization. An effective ambiguity set for DRO must involve distributions that remain consistent to the nominal distribution while being diverse enough to account for a variety of potential scenarios. Moreover, it should lead to tractable DRO solutions. To this end, we propose generative model-based ambiguity sets that capture various adversarial distributions beyond the nominal support space while maintaining consistency with the nominal distribution. Building on this generative ambiguity modeling, we propose DRO with Generative Ambiguity Set (GAS-DRO), a tractable DRO algorithm that solves the inner maximization over the parameterized generative model space. We formally establish the stationary convergence performance of GAS-DRO. We implement GAS-DRO with a diffusion model and empirically demonstrate its superior Out-of-Distribution (OOD) generalization performance in ML tasks.

cs.LG↗

3D-Learning: Diffusion-Augmented Distributionally Robust Decision-Focused Learning

Predict-then-Optimize (PTO) pipelines are widely employed in computing and networked systems, where Machine Learning (ML) models are used to predict critical contextual information for downstream decision-making tasks such as cloud LLM serving, data center demand response, and edge workload scheduling. However, these ML predictors are often vulnerable to out-of-distribution (OOD) samples at test time, leading to significant decision performance degradation due to large prediction errors. To address the generalization challenges under OOD conditions, we present the framework of Distributionally Robust Decision-Focused Learning (DR-DFL), which trains ML models to optimize decision performance under the worst-case distribution. Instead of relying on classical Distributionally Robust Optimization (DRO) techniques, we propose Diffusion-Augmented Distributionally Robust Decision-Focused Learning (3D-Learning), which searches for the worst-case distribution within the parameterized space of a diffusion model. By leveraging the powerful distribution modeling capabilities of diffusion models, 3D-Learning identifies worst-case distributions that remain consistent with real data, achieving a favorable balance between average and worst-case scenarios. Empirical results on an LLM resource provisioning task demonstrate that 3D-Learning outperforms existing DRO and Data Augmentation methods in OOD generalization performance.

cs.LG↗

Distributionally Robust Optimization via Diffusion Ambiguity Modeling

This paper studies Distributionally Robust Optimization (DRO), a fundamental framework for enhancing the robustness and generalization of statistical learning and optimization. An effective ambiguity set for DRO must involve distributions that remain consistent with the nominal distribution while being diverse enough to account for a variety of potential scenarios. Moreover, it should lead to tractable DRO solutions. To this end, we propose a diffusion-based ambiguity set design that captures various adversarial distributions beyond the nominal support space while maintaining consistency with the nominal distribution. Building on this ambiguity modeling, we propose Diffusion-based DRO (D-DRO), a tractable DRO algorithm that solves the inner maximization over the parameterized diffusion model space. We formally establish the stationary convergence performance of D-DRO and empirically demonstrate its superior Out-of-Distribution (OOD) generalization performance in a ML prediction task.

cs.LG↗

Deep learning of phase transitions with minimal examples

Over the past several years, there have been many studies demonstrating the ability of deep neural networks to identify phase transitions in many physical systems, notably in classical statistical physics systems. One often finds that the prediction of deep learning methods trained on many ensembles below and above the critical temperature $T_{\rm c}$ behaves similarly to an order parameter, and this analogy has been successfully used to locate $T_{\rm c}$ and estimate universal critical exponents. In this work, we pay particular attention to the ability of a convolutional neural network to capture these critical parameters for the 2-$d$ Ising model when the network is trained on configurations at $T=0$ and $T=\infty$ only. We directly compare its output to the same network trained at multiple temperatures below and above $T_{\rm c}$ to gain understanding of how this extreme restriction of training data can impact a neural network's ability to classify phases. We find that the network trained on two temperatures is still able to identify $T_{\rm c}$ and $ν$, while the extraction of $γ$ becomes more challenging.

cond-mat.stat-mech↗

Illusions in Humans and AI: How Visual Perception Aligns and Diverges

By comparing biological and artificial perception through the lens of illusions, we highlight critical differences in how each system constructs visual reality. Understanding these divergences can inform the development of more robust, interpretable, and human-aligned artificial intelligence (AI) vision systems. In particular, visual illusions expose how human perception is based on contextual assumptions rather than raw sensory data. As artificial vision systems increasingly perform human-like tasks, it is important to ask: does AI experience illusions, too? Does it have unique illusions? This article explores how AI responds to classic visual illusions that involve color, size, shape, and motion. We find that some illusion-like effects can emerge in these models, either through targeted training or as by-products of pattern recognition. In contrast, we also identify illusions unique to AI, such as pixel-level sensitivity and hallucinations, that lack human counterparts. By systematically comparing human and AI responses to visual illusions, we uncover alignment gaps and AI-specific perceptual vulnerabilities invisible to human perception. These findings provide insights for future research on vision systems that preserve human-beneficial perceptual biases while avoiding distortions that undermine trust and safety.

cs.CV↗

Programmable time-frequency mode encoded quantum state generator for silicon-on-insulator platform

We propose a method for the programmable generation of time-frequency mode (TFM) encoded quantum states of light on the silicon-on-insulator (SOI) platform. The state generator consists of an N-tap finite impulse response filter and a Mach-Zehnder interferometer (MZI)-based coupled-ring resonator. Through numerical simulations, its capability of producing TFM-encoded maximally entangled states in two, three, and four dimensions is theoretically demonstrated, with fidelities of 0.950, 0.954, and 0.971, respectively.

quant-ph↗

Making AI Less "Thirsty": Uncovering and Addressing the Secret Water Footprint of AI Models

The growing carbon footprint of artificial intelligence (AI) has been undergoing public scrutiny. Nonetheless, the equally important water (withdrawal and consumption) footprint of AI has largely remained under the radar. For example, training the GPT-3 language model in Microsoft's state-of-the-art U.S. data centers can directly evaporate 700,000 liters of clean freshwater, but such information has been kept a secret. More critically, the global AI demand is projected to account for 4.2-6.6 billion cubic meters of water withdrawal in 2027, which is more than the total annual water withdrawal of 4-6 Denmark or half of the United Kingdom. This is concerning, as freshwater scarcity has become one of the most pressing challenges. To respond to the global water challenges, AI can, and also must, take social responsibility and lead by example by addressing its own water footprint. In this paper, we provide a principled methodology to estimate the water footprint of AI, and also discuss the unique spatial-temporal diversities of AI's runtime water efficiency. Finally, we highlight the necessity of holistically addressing water footprint along with carbon footprint to enable truly sustainable AI.

cs.LG↗

A Fully Reconfigurable All-Optical Integrated Nonlinear Activator

Photonic neural networks have been considered as the promising candidates for next-generation neuromorphic computation, aiming to break both the power consumption wall and processing speed boundary of state-to-date digital computing architectures. Optics has shown its advantages in parallelism and linear manipulation. However, the lack of low-power and high-speed all-optical nonlinear activation neurons limits its revolution in large-scale photonic neural networks. Here we demonstrate an all-optical nonlinear activator (AONA) based on Fano-enhanced nonlinear optical effects in intra-cavity field, in which our device enables reconfigurability both in shape and type of the nonlinear functions (NFs) relying on the tuning biases on Fano interference and cavity buildup. Experimental results show that our AONA enables nonlinear optical computing with low-power continuous-wave light of 0.1 mW threshold, which can also support the overall processing speed of 13 GHz. The performances of the generated reconfigurable NFs are verified in the classification of handwritten digits and image recognition tasks, yielding the converged cost and enhanced accuracy compared to the linear-only networks. Our proposed device would pave the way for energy-efficient and accelerated all-optical intelligent processors with versatile functionalities and large-scale integration.

physics.optics↗

Learning-Augmented Online Control for Decarbonizing Water Infrastructures

Water infrastructures are essential for drinking water supply, irrigation, fire protection, and other critical applications. However, water pumping systems, which are key to transporting water to the point of use, consume significant amounts of energy and emit millions of tons of greenhouse gases annually. With the wide deployment of digital water meters and sensors in these infrastructures, Machine Learning (ML) has the potential to optimize water supply control and reduce greenhouse gas emissions. Nevertheless, the inherent vulnerability of ML methods in terms of worst-case performance raises safety concerns when deployed in critical water infrastructures. To address this challenge, we propose a learning-augmented online control algorithm, termed LAOC, designed to dynamically schedule the activation and/or speed of water pumps. To ensure safety, we introduce a novel design of safe action sets for online control problems. By leveraging these safe action sets, LAOC can provably guarantee safety constraints while utilizing ML predictions to reduce energy and environmental costs. Our analysis reveals the tradeoff between safety requirements and average energy/environmental cost performance. Additionally, we conduct an experimental study on a building water supply system to demonstrate the empirical performance of LAOC. The results indicate that LAOC can effectively reduce environmental and energy costs while guaranteeing safety constraints.

eess.SY↗

Online Budgeted Matching with General Bids

Online Budgeted Matching (OBM) is a classic problem with important applications in online advertising, online service matching, revenue management, and beyond. Traditional online algorithms typically assume a small bid setting, where the maximum bid-to-budget ratio (κ) is infinitesimally small. While recent algorithms have tried to address scenarios with non-small or general bids, they often rely on the Fractional Last Matching (FLM) assumption, which allows for accepting partial bids when the remaining budget is insufficient. This assumption, however, does not hold for many applications with indivisible bids. In this paper, we remove the FLM assumption and tackle the open problem of OBM with general bids. We first establish an upper bound of 1-κon the competitive ratio for any deterministic online algorithm. We then propose a novel meta algorithm, called MetaAd, which reduces to different algorithms with first known provable competitive ratios parameterized by the maximum bid-to-budget ratio κ\in [0, 1]. As a by-product, we extend MetaAd to the FLM setting and get provable competitive algorithms. Finally, we apply our competitive analysis to the design learning-augmented algorithms.

cs.GT↗

Learning-Augmented Decentralized Online Convex Optimization in Networks

This paper studies decentralized online convex optimization in a networked multi-agent system and proposes a novel algorithm, Learning-Augmented Decentralized Online optimization (LADO), for individual agents to select actions only based on local online information. LADO leverages a baseline policy to safeguard online actions for worst-case robustness guarantees, while staying close to the machine learning (ML) policy for average performance improvement. In stark contrast with the existing learning-augmented online algorithms that focus on centralized settings, LADO achieves strong robustness guarantees in a decentralized setting. We also prove the average cost bound for LADO, revealing the tradeoff between average performance and worst-case robustness and demonstrating the advantage of training the ML policy by explicitly considering the robustness requirement.

cs.LG↗

Engineering biphoton spectral wavefunction in a silicon micro-ring resonator with split resonances

Frequency-time is a degree of freedom suitable for photonic high-dimensional entanglement, with advantages such as compatibility with single-mode devices and insensitivity to dispersion. The engineering control of the frequency-time amplitude of a photon's electric field has been demonstrated on platforms with second-order optical nonlinearity. For integrated photonic platforms with only third-order optical nonlinearity, the engineered generation of the state remains unexplored. Here, we demonstrate a cavity-enhanced photon-pair source on the silicon-on-insulator (SOI) platform that can generate both separable states and controllable entangled states in the frequency domain without post-manipulation. By choosing different resonance combinations and employing on-chip optical field differentiation, we achieve independent control over two functions that affect the joint spectral intensity (JSI) of the state. A semi-analytical model is derived to simulate the biphoton spectral wavefunction in the presence of resonance splitting and pump differentiation, and its parameters can be fully determined through fitting-based parameter extraction from the resonator's measured linear response. The measured spectral purity for the separable state is $95.5\pm 1.2\%$, while the measured JSIs for the entangled states show two- or four-peaked functions in two-dimensional frequency space. The experiments and simulations demonstrate the capacity to manipulate the frequency-domain wavefunction in a silicon-based device, which is promising for applications like quantum information processing using pulsed temporal-mode encoding or long-distance quantum key distribution.

quant-ph↗

Building Socially-Equitable Public Models

Public models offer predictions to a variety of downstream tasks and have played a crucial role in various AI applications, showcasing their proficiency in accurate predictions. However, the exclusive emphasis on prediction accuracy may not align with the diverse end objectives of downstream agents. Recognizing the public model's predictions as a service, we advocate for integrating the objectives of downstream agents into the optimization process. Concretely, to address performance disparities and foster fairness among heterogeneous agents in training, we propose a novel Equitable Objective. This objective, coupled with a policy gradient algorithm, is crafted to train the public model to produce a more equitable/uniform performance distribution across downstream agents, each with their unique concerns. Both theoretical analysis and empirical case studies have proven the effectiveness of our method in advancing performance equity across diverse downstream agents utilizing the public model for their decision-making. Codes and datasets are released at https://github.com/Ren-Research/Socially-Equitable-Public-Models.

cs.LG↗