SearcharxivSearch

arXiv subjects

Jie Gong

Publications and source records attributed to Jie Gong.

At least 19 recordsLinked to original sources

SPECTRA: Band-Routed Embedding and Stage-Wise LoRA for Cross-Sensor Fine-Tuning of Geospatial Foundation Models

Geospatial foundation models (GeoFMs), pretrained on large-scale geospatial data such as Earth observation (EO), climate, and weather data, have shown promising performance when fine-tuned on diverse downstream tasks. However, there are two challenges of adapting EO-pretrained GeoFMs to practical downstream datasets. The first challenge is how to handle spectral mismatch: pretrained patch embeddings expect a fixed set of input bands, whereas downstream sensors may provide different channels. The second challenge is how to reduce fine-tuning cost and make it efficient. While existing work has made efforts on these challenges individually, jointly improving fine-tuning performance under spectral mismatch while reducing adaptation cost remains underexplored. We propose SPECTRA, a parameter-efficient fine-tuning framework that addresses both spectral mismatch and adaptation cost. To handle spectral mismatch, SPECTRA introduces Band-Routed Embedding (BRE), which maps all available downstream bands into the band space expected by the pretrained GeoFM. By using BRE, all available bands in the downstream dataset are utilized to improve the selected-band input without changing the pretrained patch embedding interface. To reduce adaptation cost, SPECTRA further introduces a Stage-wise Transferability-aware LoRA (ST-LoRA) fine-tuning. ST-LoRA estimates stage-wise transferability before fine-tuning and assigns stage-specific LoRA ranks, concentrating trainable parameters on the stages with high transferability for the target task. Across three EO-pretrained GeoFMs and four downstream segmentation datasets, experiments show that BRE improves performance by utilizing all spectral bands, while ST-LoRA reduces trainable parameters compared with full fine-tuning and standard LoRA. Code is available at https://github.com/big-data-lab-umbc/SPECTRA.

cs.CV

Kimi K3: Open Frontier Intelligence

We introduce Kimi K3, a 2.8T parameter Mixture-of-Experts model with 104 billion activated parameters, native vision capabilities, and a 1-million-token context window. Kimi K3 is built on Kimi Delta Attention and Attention Residuals, which improve information flow across sequence length and model depth. Together with Stable LatentMoE, which effectively activates 16 of 896 routed experts per token, and refined training and data recipes, these advances yield an approximately 2.5x improvement in overall scaling efficiency over Kimi K2. Post-training highlights reinforcement learning across general, agentic, and coding domains and multiple reasoning-effort levels, enabling compositional generalization and robust long-horizon execution. At 2.8T scale, Kimi K3 is supported by infrastructure advances in multiple areas: algorithm-system co-design for KDA, perfectly balanced expert-parallel training with efficient memory management, million-token agentic RL with persistent rollout and sandbox states, and deployment innovations. Extensive evaluations show that Kimi K3 achieves frontier-level performance across long-horizon coding, agentic, knowledge, reasoning, and vision tasks. While its overall performance still trails the most powerful proprietary models, namely Claude Fable 5 and GPT-5.6 Sol, Kimi K3 consistently outperforms other open and proprietary models evaluated in our suite. We release the full Kimi K3 model weights to facilitate future research and accelerate the broader deployment and adoption of frontier intelligence.

cs.CL

ShiJianBench: From Dialogue to Decision for Long-Horizon Evaluation of Investment Advisors

Conversational investment advisors influence not only what users know, but also how they make subsequent decisions as market conditions evolve. Existing evaluations primarily assess response quality or observed outcomes, leaving the long-horizon pathway from advisor language to investor behavior difficult to audit. We introduce ShiJianBench, an offline framework for evaluating conversational investment advisors through matched investor trajectories under fixed historical market feedback. At its core is a multi-agent investor simulator with explicit evolving state variables, motive-driven deliberation, long-term memory, and dialogue-grounded updates. The simulator is calibrated against aggregate behavioral patterns from 7,199 real users, and advisor policies are evaluated using separate investor-side, service-side, and content-side metrics under a hard compliance gate. Experiments on Chinese fund-market traces from 2021 to 2026 identify a stable leading group of LLM advisors that combines substantially stronger personalized content with competitive investor-side trajectory outcomes. These results reveal a systematic distinction between producing a high-quality response and delivering an effective long-horizon intervention, motivating trajectory-aware evaluation of conversational advisors.

cs.CL

Echo-LoRA: Parameter-Efficient Fine-Tuning via Cross-Layer Representation Injection

Parameter-efficient fine-tuning (PEFT) has become a practical route for adapting large language models to downstream tasks, with LoRA-style methods being particularly attractive because they are inexpensive to train and easy to deploy. Most LoRA variants, however, revise the update rule within the weight space of each layer and leave the intermediate representations formed by deeper layers largely unused. We propose Echo-LoRA, a cross-layer representation injection method for parameter-efficient fine-tuning. During training, Echo-LoRA collects boundary hidden states from deeper source layers, aggregates them into a sample-level echo representation, and uses lightweight projection and gating networks to inject the resulting signal into shallow LoRA or DoRA modules. Answer-only masking, masked distillation, and stochastic routing are used to keep this auxiliary path stable and to reduce the gap between training and inference. On eight commonsense reasoning benchmarks, Echo-LoRA exceeds the reported LoRA baselines by 5.7 percentage points on average across LLaMA-7B, LLaMA2-7B, and LLaMA3-8B. Under reproduced LoRA baselines in our unified implementation, the average gain is 3.0 points; when combined with DoRA, the gain is 2.7 points. The Echo path is discarded after training, so the deployed model keeps the original low-rank LoRA/DoRA form and adds neither inference-time parameters nor inference computation.

cs.LG

A Benchmark Dataset for Satellite-Based Estimation and Detection of Rain

Accurately tracking the global distribution and evolution of precipitation is essential for both research and operational meteorology. Satellite observations remain the only means of achieving consistent, global-scale precipitation monitoring. While machine learning has long been applied to satellite-based precipitation retrieval, the absence of a standardized benchmark dataset has hindered fair comparisons between methods and limited progress in algorithm development. To address this gap, the International Precipitation Working Group has developed SatRain, the first AI-ready benchmark dataset for satellite-based detection and estimation of rain, snow, graupel, and hail. SatRain includes multi-sensor satellite observations representative of the major platforms currently used in precipitation remote sensing, paired with high-quality reference estimates from ground-based radars corrected using rain gauge measurements. It offers a standardized evaluation protocol to enable robust and reproducible comparisons across machine learning approaches. In addition to supporting algorithm evaluation, the diversity of sensors and inclusion of time-resolved geostationary observations make SatRain a valuable foundation for developing next-generation AI models to deliver more accurate, detailed, and globally consistent precipitation estimates.

physics.ao-ph

Multi-Source Peak Age of Information Optimization in Mobile Edge Computing Systems

Age of Information (AoI) is emerging as a novel metric for measuring information freshness in real-time monitoring systems. For computation-intensive status data, the information is not revealed until being processed. We consider a status update problem in a multi-source single-server system where the sources are scheduled to generate and transmit status data which are received and processed at the edge server. Generate-at-will sources with both random transmission time and process time are considered, introducing the joint optimization of source scheduling and status sampling on the basis of transmission-computation balancing. We show that a random scheduler is optimal for both non-preemptive and preemptive server settings, and the optimal sampler depends on the scheduling result and its structure remains consistent with the single-source system, i.e., threshold-based sampler for non-preemptive case and transmission-aware deterministic sampler for preemptive case. Then, the problem can be transformed to jointly optimizing the scheduling frequencies and the sampling thresholds/functions, which is non-convex. We proposed an alternation optimization algorithm to solve it. Numerical experiments show that the proposed algorithm can achieve the optimal in a wide range of settings.

cs.IT

Age-Energy Analysis in Multi-Source Systems with Wake-up Control and Packet Management

In recent years, there has been an increasing focus on real-time mobile applications, such as news updates and weather forecast. In these applications, data freshness is of significant importance, which can be measured by age-of-synchronization (AoS). At the same time, the reduction of carbon emission is increasingly required by the communication operators. Thus, how to reduce energy consumption while keeping the data fresh becomes a matter of concern. In this paper, we study the age-energy trade-off in a multi-source single-server system, where the server can turn to sleep mode to save energy. We adopt the stochastic hybrid system (SHS) method to analyze the average AoS and power consumption with three wake-up policies including N-policy, single-sleep policy and multi-sleep policy, and three packet preemption strategies, including Last-Come-First-Serve with preemption-in-Service (LCFS-S), LCFS with preemption-only-in-Waiting (LCFS-W), and LCFS with preemption-and-Queueing (LCFS-Q). The trade-off performance is analyzed via both closed-form expressions and numerical simulations. It is found that N-policy attains the best trade-off performance among all three sleep policies. Among packet management strategies, LCFS-S is suitable for scenarios with high requirements on energy saving and small arrival rate difference between sources. LCFS-Q is suitable for scenarios with high requirements on information freshness and large arrival rate difference between sources.

cs.IT

SatVision-TOA: A Geospatial Foundation Model for Coarse-Resolution All-Sky Remote Sensing Imagery

Foundation models have the potential to transform the landscape of remote sensing (RS) data analysis by enabling large computer vision models to be pre-trained on vast amounts of remote sensing data. These models can then be fine-tuned with small amounts of labeled training and applied to a variety of applications. Most existing foundation models are designed for high spatial resolution, cloud-free satellite imagery or photos, limiting their applicability in scenarios that require frequent temporal monitoring or broad spectral profiles. As a result, foundation models trained solely on cloud-free images have limited utility for applications that involve atmospheric variables or require atmospheric corrections. We introduce SatVision-TOA, a novel foundation model pre-trained on 14-band MODIS L1B Top-Of-Atmosphere (TOA) radiance imagery, addressing the need for models pre-trained to handle moderate- and coarse-resolution all-sky remote sensing data. The SatVision-TOA model is pre-trained using a Masked-Image-Modeling (MIM) framework and the SwinV2 architecture, and learns detailed contextual representations through self-supervised learning without the need for labels. It is a 3 billion parameter model that is trained on 100 million images. To our knowledge this is the largest foundation model trained solely on satellite RS imagery. Results show that SatVision-TOA achieves superior performance over baseline methods on downstream tasks such as 3D cloud retrieval. Notably, the model achieves a mean intersection over union (mIOU) of 0.46, a substantial improvement over the baseline mIOU of 0.22. Additionally, the rate of false negative results in the fine-tuning task were reduced by over 50% compared to the baseline. Our work advances pre-trained vision modeling for multispectral RS by learning from a variety of atmospheric and aerosol conditions to improve cloud and land surface monitoring.

cs.CV

Controllable and Fast Growth of High-Quality Atomically Thin and Atomically Flat Bi$_2$O$_2$Se Films

As a novel and promising 2D material, bismuth oxyselenide (Bi$_2$O$_2$Se) has demonstrated significant potential to overcome existing technical barriers in various electronic device applications, due to its unique physical properties like high symmetry, adjustable electronic structure, ultra-high electron mobility. However, the rapid growth of Bi$_2$O$_2$Se films down to a few atomic layers with precise control remains a significant challenge. In this work, the growth of two-dimensional (2D) Bi$_2$O$_2$Se thin films by the pulsed laser deposition (PLD) method is systematically investigated. By controlling temperature, oxygen pressure, laser energy density and laser emission frequency, we successfully prepare atomically thin and flat Bi$_2$O$_2$Se (001) thin films on the (001) surface of SrTiO3. Importantly, we provide a fundamental and unique perspective toward understanding the growth process of atomically thin and flat Bi$_2$O$_2$Se films, and the growth process can be primarily summarized into four steps: i) anisotropic non-spontaneous nucleation preferentially along the step roots; ii) monolayer Bi$_2$O$_2$Se nanosheets expanding across the surrounding area, and eventually covering the entire STO substrate step; iii) vertical growth of Bi$_2$O$_2$Se monolayer in a 2D Frank-van der Merwe (FM) epitaxial growth, and iv) with a layer-by-layer 2D FM growth mode, ultimately producing an atomically flat and epitaxially aligned thin film. Moreover, the combined results of the crystallinity quality, surface morphology and the chemical states manifest the successful PLD-growth of high-quality Bi$_2$O$_2$Se films in a controllable and fast mode.

cond-mat.mtrl-sci

Optimizing Peak Age of Information in MEC Systems: Computing Preemption and Non-preemption

The freshness of information in real-time monitoring systems has received increasing attention, with Age of Information (AoI) emerging as a novel metric for measuring information freshness. In many applications, update packets need to be computed before being delivered to a destination. Mobile edge computing (MEC) is a promising approach for efficiently accomplishing the computing process, where the transmission process and computation process are coupled, jointly affecting freshness. In this paper, we aim to minimize the average peak AoI (PAoI) in an MEC system. We consider the generate-at-will source model and study when to generate a new update in two edge server setups: 1) computing preemption, where the packet in the computing process will be preempted by the newly arrived one, and 2) non-preemption, where the newly arrived packet will wait in the queue until the current one completes computing. We prove that the fixed threshold policy is optimal in a non-preemptive system for arbitrary transmission time and computation time distributions. In a preemptive system, we show that the transmission-aware threshold policy is optimal when the computing time follows an exponential distribution. Our numerical simulation results not only validate the theoretical findings but also demonstrate that: 1) in our problem, preemptive systems are not always superior to non-preemptive systems, even with exponential distribution, and 2) as the ratio of the mean transmission time to the mean computation time increases, the optimal threshold increases in preemptive systems but decreases in non-preemptive systems.

cs.IT

Multi-source Scheduling and Resource Allocation for Age-of-Semantic-Importance Optimization in Status Update Systems

In recent years, semantic communication is progressively emerging as an effective means of facilitating intelligent and context-aware communication. However, current researches seldom simultaneously consider the reliability and timeliness of semantic communication, where scheduling and resource allocation (SRA) plays a crucial role. In contrast, conventional age-based approaches cannot seamlessly extend to semantic communication due to their oversight of semantic importance. To bridge this gap, we introduce a novel metric: Age of Semantic Importance (AoSI), which adaptly captures both the freshness of information and its semantic importance. Utilizing AoSI, we formulate an average AoSI minimization problem by optimizing multi-source SRA. To address this problem, we proposed a AoSI-aware joint SRA algorithm based on Deep Q-Network (DQN). Simulation results validate the effectiveness of our proposed method, demonstrating its ability to facilitate timely and reliable semantic communication.

cs.IT

CodeFuse-13B: A Pretrained Multi-lingual Code Large Language Model

Code Large Language Models (Code LLMs) have gained significant attention in the industry due to their wide applications in the full lifecycle of software engineering. However, the effectiveness of existing models in understanding non-English inputs for multi-lingual code-related tasks is still far from well studied. This paper introduces CodeFuse-13B, an open-sourced pre-trained code LLM. It is specifically designed for code-related tasks with both English and Chinese prompts and supports over 40 programming languages. CodeFuse achieves its effectiveness by utilizing a high quality pre-training dataset that is carefully filtered by program analyzers and optimized during the training process. Extensive experiments are conducted using real-world usage scenarios, the industry-standard benchmark HumanEval-x, and the specially designed CodeFuseEval for Chinese prompts. To assess the effectiveness of CodeFuse, we actively collected valuable human feedback from the AntGroup's software development process where CodeFuse has been successfully deployed. The results demonstrate that CodeFuse-13B achieves a HumanEval pass@1 score of 37.10%, positioning it as one of the top multi-lingual code LLMs with similar parameter sizes. In practical scenarios, such as code generation, code translation, code comments, and testcase generation, CodeFuse performs better than other models when confronted with Chinese prompts.

cs.SE

Age-Energy Trade-off in Status Update System with Wake-up Control

In the status update system, the freshness of information is drawing more and more attention. To measure the freshness of the data, age-of-synchronization (AoS) is introduced. Since many communication devices are energy-constrained, how to reduce energy consumption while keeping the timely response of data needs to be carefully addressed. In this paper, we study the age-energy trade-off problem in a single-source single-server scenario. We assume the server enters a low-power sleep state when idle to save energy and consider three wake-up policies. We adopt the stochastic hybrid system (SHS) method to analyze the average AoS and average energy consumption under different policies. The age-energy trade-off relationship under different parameters is illustrated by numerical results.

cs.IT

Pair distribution function analysis for oxide defect identification through feature extraction and supervised learning

Feature extraction and a neural network model are applied to predict the defect types and concentrations in experimental TiO$_2$ samples. A dataset of TiO$_2$ structures with vacancies and interstitials of oxygen and titanium is built and the structures are relaxed using energy minimization. The features of the calculated pair distribution functions (PDFs) of these defected structures are extracted using linear methods (principal component analysis, non-negative matrix factorization) and non-linear methods (autoencoder, convolutional neural network). The extracted features are used as the inputs to a neural network that maps the feature weights to the concentration of each defect type. The performance of this machine learning pipeline is validated by predicting the defect concentrations based on experimentally-measured TiO$_2$ PDFs and comparing the results to brute-force predictions. A physics-based initialization of the autoencoder has the highest accuracy in predicting the defect concentrations. This model incorporates physical interpretability and predictability of material properties, enabling a more efficient material characterization process with scattering data.

cond-mat.mtrl-sci

Pair distribution function analysis driven by atomistic simulations: Application to microwave radiation synthesized TiO$_2$ and ZrO$_2$

A workflow is presented for performing pair distribution function (PDF) analysis of defected materials using structures generated from atomistic simulations. A large collection of structures, which differ in the types and concentrations of defects present, are obtained through energy minimization with an empirical interatomic potential. Each of the structures is refined against an experimental PDF. The structures with the lowest goodness of fit $R_w$ values are taken as being representative of the experimental structure. The workflow is applied to anatase titanium dioxide ($a$-TiO$_2$) and tetragonal zirconium dioxide ($t$-ZrO$_2$) synthesized in the presence of microwave radiation, a low temperature process that generates disorder. The results suggest that titanium vacancies and interstitials are the dominant defects in $a$-TiO$_2$, while oxygen vacancies dominate in $t$-ZrO$_2$. Analysis of the atomic displacement parameters extracted from the PDF refinement and mean squared displacements calculated from molecular dynamics simulations indicate that while these two quantities are closely related, it is challenging to make quantitative comparisons between them. The workflow can be applied to other materials systems, including nanoparticles.

cond-mat.mtrl-sci

Simulations of Heat Transport in Single-Molecule Junctions: Investigations of the Thermal Diode Effect

With the objective to understand microscopic principles governing thermal energy flow in nanojunctions, we study phononic heat transport through metal-molecule-metal junctions using classical molecular dynamics (MD) simulations. Considering a single-molecule gold-alkanedithiol-gold junction, we first focus on aspects of method development and compare two techniques for calculating thermal conductance: (i) The Reverse Nonequilibrium MD (RNEMD) method, where heat is inputted and extracted at a constant rate from opposite metals. In this case, the thermal conductance is calculated from the nonequilibrium temperature profile that is created on the junction. (ii) The Approach-to-Equilibrium MD (AEMD) method, with the thermal conductance of the junction obtained from the equilibration dynamics of the metals. In both methods, simulations of alkane chains of growing size display an approximate length-independence of the thermal conductance, with calculated values matching computational and experimental studies. The RNEMD and AEMD methods offer different insights on thermal transport, and we discuss their relative benefits and shortcomings. Assessing the potential application of molecular junctions as thermal diodes, the alkane junctions are made spatially asymmetric by modifying their contact regions with the bulk, either by using distinct endgroups or by replacing one of the Au contacts by Ag. Anharmonicity is built into the system within the molecular force-field. Using the RNEMD method, we show that, while the temperature profile strongly varies (compared to the gold-alkanedithiol-gold junctions) due to these structural modifications, the thermal diode effect is inconsequential in these systems -- unless one goes to very large thermal biases. This finding suggests that one should seek molecules with considerable internal anharmonic effects for developing nonlinear thermal devices.

cond-mat.mes-hall

On the Age of Information for AMP based Grant-Free Random Access

With the rapid development of Internet of Things (IoT), massive devices are deployed, which poses severe challenges on access networks due to limited communication resources. When massive users contend for access, the information freshness gets worse caused by increasing collisions. It could be fatal for information freshness sensing scenarios, such as remote monitoring systems or self-driving systems, in which information freshness plays a critical part. In this paper, by taking the Age of Information (AoI) as the primary performance indicator, the information freshness using AMP-based grant-free scheme is investigated and compared with grant-based scheme. Base on the analysis, a user scheduling strategy with sleep threshold and forcing active threshold is proposed to further reduce average AoI (AAoI). Numerical results reveal that the AMP-based grant-free scheme can provide sufficient access capability with less pilot resources, and it is robust to the fluctuation of the number of active users. That ensures that the AMP-based grant-free scheme can keep the AAoI at a low level. It is also shown that the proposed threshold strategy can effectively improve the information freshness.

cs.IT

Online Scheduling of Transmission and Processing for AoI Minimization with Edge Computing

Age of Information (AoI), which measures the time elapsed since the generation of the last received packet at the destination, is a new metric for real-time status update tracking applications. In this paper, we consider a status-update system in which a source node samples updates and sends them to an edge server over a delay channel. The received updates are processed by the server with an infinite buffer and then delivered to a destination. The channel can send only one update at a time, and the server can process one at a time as well. The source node applies generate-at-will model according to the state of the channel, the edge server, and the buffer. We aim to minimize the average AoI with \emph{independent and identically distributed} transmission time and processing time. We consider three online scheduling policies. The first one is the optimal long wait policy, under which the source node only transmits a new packet after the old one is delivered. Secondly, we propose a peak age threshold policy, under which the source node determines the sending time based on the estimated peak age of information (PAoI). Finally, we improve the peak age threshold policy by considering a postponed plan to reduce the waiting time in the buffer. The AoI performance under these policies is illustrated by numerical results with different parameters.

cs.IT