Latest ArticlesAiming at the problems of Pareto dominance failure, weak optimization ability, and slow convergence speed of multi-objective firefly algorithm in solving many-objective optimization problems, we propose a many-objective firefly algorithm based on reference point guidance and multiple cooperative strategies (MaOFA-RR). This algorithm presets a set of uniformly distributed reference points in the objective space. By examining the distance relationship between fireflies and reference points, it distinguishes between guide fireflies and ordinary fireflies to replace Pareto dominance, thereby increasing selection pressure. Three evolutionary strategies are employed to update the positions of the fireflies: guide fireflies explore the local space, while ordinary fireflies learn from guide fireflies or explore the global space based on a distance threshold, enhancing the algorithm’s optimization capability and convergence speed. Finally, the algorithm ingeniously integrates the idea of opposition-based learning. In the process of opposition-based learning, for each firefly in the population, its opposite position is calculated in the solution space. By adding these opposite solutions to the original population, the algorithm effectively expands the scope of population search, significantly improving the possibility of discovering better solutions. We conduct comprehensive experiments by comparing MaOFA-RR with eight recent many-objective evolutionary algorithms. The experimental results show that MaOFA-RR exhibits efficient performance in handing many-objective optimization problems.
Implicit discourse relation recognition aims at automatically identifying semantic relations (such as Comparison) between two arguments (sentence or clause) in the absence of explicit connectives. Existing methods have confirmed that the introduction of phrase information can effectively boost the performance. However, there are still the following shortcomings: 1) These models typically rely on syntactic parsers and do not fully capture the interactions among words, phrases, and arguments. 2) The problem of data sparsity often occurs during training when incorporating the phrase information. To address the above issues, we propose an implicit discourse relation recognition model based on multi-granularity information interaction (MGII) and develop a chain decoding-inspired data augmentation method (DAM). Specifically, our proposed model is designed to automatically acquire semantic representations of n-grams using a stacked convolutional neural network. It then explicitly models the interactions among words, phrases and arguments based on Transformer layers and ultimately predicts multi-level discourse relationships in a chain-decoding way. DAM proposed in our paper simultaneously pretrains both the encoding and decoding modules, enabling the effective utilization of massive explicit discourse data, which are naturally annotated by connectives, to mitigate the issue of data sparsity. The proposed method significantly outperforms recent benchmark models on PDTB datasets. Furthermore, it does not rely on syntactic parsers, demonstrating strong applicability.
Stencil computations are widely adopted in scientific applications. Many HPC platforms utilize the high computation capability of GPUs to accelerate Stencil computations. In recent years, Stencils have become more complex in terms of Stencil order, memory accesses, and computation patterns. To adapt Stencil computations to GPU architectures, the academic community has proposed a variety of optimization techniques based on streaming and tiling. Due to the diversity of Stencil computational patterns and GPU architectures, no single optimization technique fits all Stencil instances. Therefore, researchers have proposed Stencil auto-tuning mechanisms to conduct parameter searches for a given combination of optimization techniques. However, existing mechanisms introduce huge offline profiling costs and online prediction overhead, unable to be flexible to arbitrary Stencil patterns. To address the above problems, we propose a generalized Stencil auto-tuning framework GeST, which achieves the ultimate performance optimization of Stencil computations on GPU platforms. Specifically, GeST constructs the global search space through the zero-padding format, quantifying parameter correlations via the coefficient of variation to generate parameter groups. After that, GeST iteratively selects parameter values from the parameter groups, adjusting the sampling ratio according to the reward policy and avoiding redundant execution through Hash coding. The experimental results show that GeST can identify better-performing parameter settings in a short time compared with other state-of-the-art auto-tuning work.
As the scale of AI grows rapidly, errors in deep learning applications are also increasing. Existing popular deep learning frameworks are mostly built on the dynamical-typed language Python, which lacks type checking mechanisms. This leads to many errors that cannot be eliminated through type checking at the compilation stage. We propose a strongly-typed functional programming style deep learning framework based on the theorem prover Coq. The framework features typed tensor structures and a powerful static type checking capability. The experimental results demonstrate that the framework can automatically, quickly, and effectively detect shape mismatch errors in deep learning models, and it has greater advantages in terms of speed and detection capability compared with other checking tools. Furthermore, we design and implement a set of rewriting rules that translate functional programming models into C code, realizing the translation from functional neural network operator expressions to multi-core parallel OpenMP C code. According to the results of multiple sets of experiments, the C code for operators generated by this method is on par with manually written code. Furthermore, the speed of the generated neural network operator C code with multi-core parallel optimization is improved by 4−10 times compared with the sequentially executed operator C code. Additionally, the generated C operators are highly secure and can effectively avoid common issues such as out-of-bounds indexing and memory allocation errors in manually written code.
Feature generation (FG) aims to enhance the prediction potential of original data by constructing high-order feature combinations and removing redundant features. It is a key preprocessing step for tabular scientific data to improve downstream machine-learning model performance. Traditional methods face the following two challenges when dealing with the feature generation of scientific data: First, the effective construction of high-order feature combinations in scientific data necessitates profound and extensive domain-specific expertise. Secondly, as the order of feature combinations increases, the search space expands exponentially, imposing prohibitive human labor consumption. Advancements in the data-centric artificial intelligence (DCAI) paradigm have opened novel avenues for automating feature generation processes. Inspired by that, this paper revisits the conventional feature generation workflow and proposes the multi-agent feature generation (MAFG) framework. Specifically, in the iterative exploration stage, multi-agents will construct mathematical transformation equations collaboratively, synthesize and identify feature combinations exhibiting high information content, and leverage a reinforcement learning mechanism to evolve their strategies. Upon completing the exploration phase, MAFG integrates the large language models (LLMs) to interpretatively evaluate the generated features of each significant model performance breakthrough. Experimental results and case studies consistently demonstrate that MAFG framework effectively automates the feature generation process and significantly enhances various downstream scientific data mining tasks.
Driven by rapid advancements in data acquisition and storage technologies, vast amounts of unlabeled tabular data have been collected and stored across various industries. Clustering analysis serves as a fundamental method for uncovering the latent grouping structures within such data. Currently, traditional clustering algorithms still predominantly constitute the methods employed for processing this type of data. Deep learning techniques and large model technologies, known for their powerful representation and inference capabilities, are primarily employed for handling unstructured data types like images, text, and audio; their advantages remain largely underexploited in the context of structured tabular data processing. In 2025, Nature published TabPFN, a foundation model for tabular data capable of efficiently handling classification and regression tasks, offering a novel perspective for tabular data learning. Building upon TabPFN, this paper proposes a clustering method for tabular data based on pretrained foundation models with synthetic data. The method comprises two main phases: a pretraining phase and an iterative inference phase. The pretraining phase leverages traditional clustering algorithms and TabPFN model to obtain initial pseudo-labels for the unlabeled tabular data. The iterative inference phase then employs the fine-tuned TabPFN model to cyclically update these pseudo-labels until the final clustering results are obtained. Extensive experimental analyses conducted on benchmark datasets demonstrate that the proposed method significantly improves the clustering performance of seven representative clustering algorithms.
Efficient exercise recommendation is crucial in intelligent education to provide learners with personalized learning resources based on their cognitive states. Existing methods often rely on learners’ mastery levels of knowledge concepts, yet critically overlook contextual information embedded in response sequences data, thus limiting the enhancement of learners’ knowledge transfer abilities. This study introduces a context-aware adaptive exercise recommendation method for response sequences data (CAE-RRS). By constructing a learning context representation module that integrates knowledge concept and exercise contexts, the method offers a richer contextual representation. Furthermore, it incorporates a cognitive state representation module fused with temporal large language models (LLMs) and implements a context-aware adaptive exercise recommendation module based on knowledge graphs. This module dynamically links exercises, knowledge concepts, and learner characteristics, enabling precise and adaptive recommendations according to learning context features. It effectively addresses the challenge of context-aware adaptive recommendations, bolstering the model’s contextual perception and adaptability. Consequently, it ensures learning effectiveness while enhancing the novelty of the learning process and the efficiency and accuracy of exercise recommendation systems. Comparative and ablation experiments across the AAAI 2023 and NeurIPS_t34 datasets demonstrate that our model surpasses baseline models in both accuracy and novelty.
Test-time adaptation (TTA) seeks to dynamically recalibrate a deployed model through online fine-tuning with unlabeled or sparsely labeled data, addressing performance degradation caused by distribution shift, sensor noise, illumination changes, and other real-world challenges. It has demonstrated great promise in latency- and robustness-critical applications such as autonomous driving, remote healthcare, and video surveillance. However, existing multimodal TTA methods typically overlook the quality variance across views—low-quality or faulty views data can introduce harmful gradients—and lack mechanisms to preserve internal temporal consistency, undermining stability in dynamic scenarios. To tackle these issues, we propose CVPTA (confidence-guided view pruning and temporal contrastive attention), a unified framework comprising three core modules: 1) confidence-guided dynamic attention, which computes each view’s confidence via its predictive entropy and uses a softmax over inverted entropy scores to attenuate high-entropy views data during feature fusion; 2) view pruning, which evaluates image-modal quality using the Laplacian variance (for blur) and histogram skewness (for exposure), discards views below a quality threshold, and maintains a constant view count by interpolating adjacent high-quality views data or injecting Gaussian noise—dramatically reducing noise accumulation; 3) temporal contrastive self-supervision, which treats adjacent frames of the same view as positive pairs and non-adjacent frames as negatives, and applies a contrastive loss to enforce temporal feature consistency. We evaluate EVPTA on the public Kinetics-50-C and VGGSound-C perturbation benchmarks under the same online-update settings as prior work. Results show that EVPTA boosts Top-1 accuracy by approximately 2.3% and 0.7% on each benchmark and retains over 0.2% gains even under extreme noise conditions. Ablation studies further confirm the individual and synergistic contributions of all three modules. EVPTA requires no extra annotations, integrates seamlessly with existing multimodal systems, and delivers both efficiency and robustness—offering significant theoretical insights and practical value.
Text-based person retrieval, a pivotal task in multimodal intelligent surveillance systems, seeks to identify target pedestrian images from large-scale databases using free-form textual descriptions, with critical applications in public security and video forensics such as suspect tracking in criminal investigations and cross-camera forensic analysis. Conventional approaches predominantly operate under the idealized assumption of perfectly aligned image-text pairs, thereby overlooking the pervasive presence of complex noisy data—incorrect or ambiguous associations between visual instances and their textual annotations—that inevitably arise from human annotation biases, web-crawled data impurities, or semantic granularity mismatches between localized visual attributes and holistic textual contexts. To bridge this critical gap, we propose semantic-informed noisy correspondence learning, a unified framework that systematically addresses both noise identification and robust learning through dual innovative mechanisms. First, the semantic-aware noise identification criterion holistically integrates intra-modal semantic consistency with cross-modal interaction signals, enabling precise discrimination of false-positive and false-negative correspondences via adaptive thresholding. Second, the noise-robust complementary learning paradigm implements differentiated optimization strategies: positive learning with momentum contrastive alignment enforces discriminative feature learning on purified reliable pairs, while negative learning via entropy minimization constrains overfitting to noisy subsets. Extensive experiments on three public benchmarks validate the effectiveness of the proposed approach, achieving superior performance under both synthetic and real-world noise scenarios.