SearcharxivSearch

arXiv subjects

Jiaze Sun

Publications and source records attributed to Jiaze Sun.

12 recordsLinked to original sources

Maximum Entropy Encoding of Energy-Weighted Spherical Moments

We study how angular energy signals composed of non-negative Monte Carlo path samples can be compressed and reconstructed for irradiance using finite moments. Writing each sample as an energy-weighted directional feature $x = r u$, we adopt total energy, the first directional moment, and the traceless second moment as $1+3+5$ linearly additive, rotationally covariant statistics. Under a fixed Lebesgue reference measure, the maximum-entropy closure yields $p(r,u) \propto \exp(-βr g(u))$, where $g(u) = 1 - b \cdot u + u^T Q u$, whose directional probability and angular energy density are proportional to $g^{-3}$ and $g^{-4}$, respectively. When $g_{\min} > 0$ the closure is normalizable and the reconstruction is strictly positive. We further provide analytic moment matching, variance, inverse sampling, and closed-form diffuse response for the pure-dipole four-parameter subfamily, as well as the realizability domain, partition function, azimuthal algebraic integral, and LUT-oriented reconstruction form for the dipole-second-moment coaxial five-parameter subfamily. Experiments cover 981 Poly Haven HDRI 2K scenes and three Debevec probes. Five-parameter MaxEnt achieves a 78.7% per-scene win rate against stored QZH, with mean luminance RMSE reduced by 15.8%; the advantage is more pronounced in scenes with strong directionality. Both MaxEnt variants maintain zero negative irradiance across all scenes. Full second-order SH-2 yields the lowest overall error, while five-parameter MaxEnt ranks second and outperforms SH-2 in the high-directionality bucket; the coaxial subfamily shows systematic closure error on non-coaxial multi-source scenes.

cs.GR

FinStressTS: A Parametric Synthetic Benchmark for Time-Series Forecasting in Finance

Financial forecasting is difficult due to low signal-to-noise ratios, latent factors, heavy tails, regime shifts, and jumps. Real-world benchmarks offer limited failure attribution: researchers can observe underperformance, but often cannot isolate why because mechanisms are unobservable and entangled. Real financial data reveal only one realized path, making it difficult to assess tail-risk calibration or data efficiency. We introduce FinStressTS, a mechanism-aware synthetic benchmark that links model behavior to controlled structural causes. FinStressTS comprises 30 diagnostic environments around six mechanism families: volatility clustering, multi-scale persistence, heavy-tailed shocks, regime switching, self-exciting jumps, and zero-inflated processes. We evaluate two tasks: point forecasting, using NMAE across five settings, and probabilistic forecasting, using CRPS under known data-generating mechanisms. We benchmark 15 models, from classical methods (HAR, VAR) to Transformer forecasters (PatchTST, iTransformer) and deep probabilistic architectures (DeepAR, TSFlow), and use learning curves to measure sample efficiency. Our evaluation reveals three insights. First, performance is mechanism-dependent: autoregressive and linear models are highly competitive, and often outperform Transformer-based models, in several volatility-, tail-, and jump-driven environments. Second, distributional alignment matters: parametric probabilistic models such as DeepAR calibrate well in stationary settings, while flexible models can help when distributions become multimodal or sparse. Third, neural models often require more data to match simple baselines, with larger gains mainly when learning latent regimes or complex distributions. FinStressTS provides an open framework for diagnosing failure modes and advancing risk-aware forecasting.

q-fin.CP

Fault2Flow: An AlphaEvolve-Optimized Human-in-the-Loop Multi-Agent System for Fault-to-Workflow Automation

Power grid fault diagnosis is a critical process hindered by its reliance on manual, error-prone methods. Technicians must manually extract reasoning logic from dense regulations and attempt to combine it with tacit expert knowledge, which is inefficient, error-prone, and lacks maintainability as ragulations are updated and experience evolves. While Large Language Models (LLMs) have shown promise in parsing unstructured text, no existing framework integrates these two disparate knowledge sources into a single, verified, and executable workflow. To bridge this gap, we propose Fault2Flow, an LLM-based multi-agent system. Fault2Flow systematically: (1) extracts and structures regulatory logic into PASTA-formatted fault trees; (2) integrates expert knowledge via a human-in-the-loop interface for verification; (3) optimizes the reasoning logic using a novel AlphaEvolve module; and (4) synthesizes the final, verified logic into an n8n-executable workflow. Experimental validation on transformer fault diagnosis datasets confirms 100\% topological consistency and high semantic fidelity. Fault2Flow establishes a reproducible path from fault analysis to operational automation, substantially reducing expert workload.

cs.AI

A Multimodal Foundation Agent for Financial Trading: Tool-Augmented, Diversified, and Generalist

Financial trading is a crucial component of the markets, informed by a multimodal information landscape encompassing news, prices, and Kline charts, and encompasses diverse tasks such as quantitative trading and high-frequency trading with various assets. While advanced AI techniques like deep learning and reinforcement learning are extensively utilized in finance, their application in financial trading tasks often faces challenges due to inadequate handling of multimodal data and limited generalizability across various tasks. To address these challenges, we present FinAgent, a multimodal foundational agent with tool augmentation for financial trading. FinAgent's market intelligence module processes a diverse range of data-numerical, textual, and visual-to accurately analyze the financial market. Its unique dual-level reflection module not only enables rapid adaptation to market dynamics but also incorporates a diversified memory retrieval system, enhancing the agent's ability to learn from historical data and improve decision-making processes. The agent's emphasis on reasoning for actions fosters trust in its financial decisions. Moreover, FinAgent integrates established trading strategies and expert insights, ensuring that its trading approaches are both data-driven and rooted in sound financial principles. With comprehensive experiments on 6 financial datasets, including stocks and Crypto, FinAgent significantly outperforms 9 state-of-the-art baselines in terms of 6 financial metrics with over 36% average improvement on profit. Specifically, a 92.27% return (a 84.39% relative improvement) is achieved on one dataset. Notably, FinAgent is the first advanced multimodal foundation agent designed for financial trading tasks.

q-fin.TR

MAPConNet: Self-supervised 3D Pose Transfer with Mesh and Point Contrastive Learning

3D pose transfer is a challenging generation task that aims to transfer the pose of a source geometry onto a target geometry with the target identity preserved. Many prior methods require keypoint annotations to find correspondence between the source and target. Current pose transfer methods allow end-to-end correspondence learning but require the desired final output as ground truth for supervision. Unsupervised methods have been proposed for graph convolutional models but they require ground truth correspondence between the source and target inputs. We present a novel self-supervised framework for 3D pose transfer which can be trained in unsupervised, semi-supervised, or fully supervised settings without any correspondence labels. We introduce two contrastive learning constraints in the latent space: a mesh-level loss for disentangling global patterns including pose and identity, and a point-level loss for discriminating local semantics. We demonstrate quantitatively and qualitatively that our method achieves state-of-the-art results in supervised 3D pose transfer, with comparable results in unsupervised and semi-supervised settings. Our method is also generalisable to unseen human and animal data with complex topologies.

cs.CV

SeCGAN: Parallel Conditional Generative Adversarial Networks for Face Editing via Semantic Consistency

Semantically guided conditional Generative Adversarial Networks (cGANs) have become a popular approach for face editing in recent years. However, most existing methods introduce semantic masks as direct conditional inputs to the generator and often require the target masks to perform the corresponding translation in the RGB space. We propose SeCGAN, a novel label-guided cGAN for editing face images utilising semantic information without the need to specify target semantic masks. During training, SeCGAN has two branches of generators and discriminators operating in parallel, with one trained to translate RGB images and the other for semantic masks. To bridge the two branches in a mutually beneficial manner, we introduce a semantic consistency loss which constrains both branches to have consistent semantic outputs. Whilst both branches are required during training, the RGB branch is our primary network and the semantic branch is not needed for inference. Our results on CelebA and CelebA-HQ demonstrate that our approach is able to generate facial images with more accurate attributes, outperforming competitive baselines in terms of Target Attribute Recognition Rate whilst maintaining quality metrics such as self-supervised Fréchet Inception Distance and Inception Score.

cs.CV

A BCS-GDE Multi-objective Optimization Algorithm for Combined Cooling, Heating and Power Model with Decision Strategies

District energy systems can not only reduce energy consumption but also set energy supply dispatching schemes according to demand. In addition to economic cost, energy consumption and pollutant are more worthy of attention when evaluating combined cooling, heating and power (CCHP) models. In this paper, the CCHP model is established with the objective of economic cost, primary energy consumption, and pollutant emissions. The mathematical expression of the CCHP system is proposed, and a multi-objective optimization model with constraints is established. According to different usage requirements, two decision-making strategies are designed, which can adapt to different scenarios. Besides, a generalized differential evolution with the best compromise solution processing mechanism (BCS-GDE) algorithm is proposed to optimize the CCHP model for the first time. The algorithm provides the optimal energy scheduling scheme by optimizing the production capacity of different capacity equipment. The simulation is conducted in three application scenarios: hotels, offices, and residential buildings. The simulation results show that the model established in this paper can reduce economic cost by 72%, primary energy consumption by 73%, and pollutant emission by 88%. Concurrently, the Wilcoxon signed-rank test shows that BCSGDE is significantly better than OMOPSO, NSGA-II, and SPEA2 with greater than 95% confidence.

eess.SY

A BCS-GDE Algorithm for Multi-objective Optimization of Combined Cooling, Heating and Power Model

District energy systems can not only reduce energy consumption but also set energy supply dispatching schemes according to demand. In this paper, the combined cooling heating and power economic emission dispatch (CCHPEED) model is established with the objective of economic cost, primary energy consumption, and pollutant emissions, as well as three decision-making strategies, are proposed to meet the demand for energy supply. Besides, a generalized differential evolution with the best compromise solution processing mechanism (BCS-GDE) is proposed to solve the model, also, the best compromise solution processing mechanism is put forward in the algorithm. In the simulation, the resource dispatching is performed according to the different energy demands of hotels, offices, and residential buildings on the whole day. The simulation results show that the model established in this paper can reduce the economic cost, energy consumption, and pollutant emission, in which the maximum reduction rate of economic cost is 72%, the maximum reduction rate of primary energy consumption is 73%, and the maximum reduction rate of pollutant emission is 88%. Concurrently, BCS-GDE also has better convergence and diversity than the classic algorithms.

eess.SP

MatchGAN: A Self-Supervised Semi-Supervised Conditional Generative Adversarial Network

We present a novel self-supervised learning approach for conditional generative adversarial networks (GANs) under a semi-supervised setting. Unlike prior self-supervised approaches which often involve geometric augmentations on the image space such as predicting rotation angles, our pretext task leverages the label space. We perform augmentation by randomly sampling sensible labels from the label space of the few labelled examples available and assigning them as target labels to the abundant unlabelled examples from the same distribution as that of the labelled ones. The images are then translated and grouped into positive and negative pairs by their target labels, acting as training examples for our pretext task which involves optimising an auxiliary match loss on the discriminator's side. We tested our method on two challenging benchmarks, CelebA and RaFD, and evaluated the results using standard metrics including Fréchet Inception Distance, Inception Score, and Attribute Classification Rate. Extensive empirical evaluation demonstrates the effectiveness of our proposed method over competitive baselines and existing arts. In particular, our method surpasses the baseline with only 20% of the labelled examples used to train the baseline.

cs.CV

Indicator & crowding Distance-Based Evolutionary Algorithm for Combined Heat and Power Economic Emission Dispatch

Heat and power have become the most indispensable resources. However, the traditional ways of generating power and heat are inefficient and cause high pollution; a CHP (Combined Heat and Power) unit can solve these problems well. In recent years, more attention has been paid to energy conservation and environmental protection, and Combined Heat and Power Economic Emission Dispatch (CHPEED) has become an important multi-objective optimization problem. In this paper, an Indicator & crowding Distance-based Evolutionary Algorithm (IDBEA) is put forward for handling this non-convex and non-linear problem. With consideration of the valve-point effects and power transmission loss, IDBEA is tested on three standard test systems with different types, including four units, five units and seven units. In the experiment, IDBEA is compared with several evolutionary algorithms, the simulation results demonstrate that IDBEA has strong stability and superiority, while the solutions show better convergence and diversity than several typical algorithms.

eess.SP

Enhanced Expressive Power and Fast Training of Neural Networks by Random Projections

Random projections are able to perform dimension reduction efficiently for datasets with nonlinear low-dimensional structures. One well-known example is that random matrices embed sparse vectors into a low-dimensional subspace nearly isometrically, known as the restricted isometric property in compressed sensing. In this paper, we explore some applications of random projections in deep neural networks. We provide the expressive power of fully connected neural networks when the input data are sparse vectors or form a low-dimensional smooth manifold. We prove that the number of neurons required for approximating a Lipschitz function with a prescribed precision depends on the sparsity or the dimension of the manifold and weakly on the dimension of the input vector. The key in our proof is that random projections embed stably the set of sparse vectors or a low-dimensional smooth manifold into a low-dimensional subspace. Based on this fact, we also propose some new neural network models, where at each layer the input is first projected onto a low-dimensional subspace by a random projection and then the standard linear connection and non-linear activation are applied. In this way, the number of parameters in neural networks is significantly reduced, and therefore the training of neural networks can be accelerated without too much performance loss.

cs.LG

Social cognitive optimization with tent map for combined heat and power economic dispatch

Combined heat and power economic dispatch (CHPED) problem is a sophisticated constrained nonlinear optimization problem in a heat and power production system for assigning heat and power production to minimize the production costs. To address this challenging problem, a novel social cognitive optimization algorithm with tent map (TSCO) is presented for solving the CHPED problem. To handle the equality constraints in heat and power balance constraints, adaptive constraints relaxing rule is adopted in constraint processing. The novelty of our work lies in the introduction of a new powerful TSCO algorithm to solve the CHPED issue. The effectiveness and superiority of the presented algorithm is validated by conducting 2 typical CHPED cases. The numerical results show that the proposed approach has better convergence speed and solution quality than all other existing state-of-the-art algorithms.

math.OC