OpenRaiser/Intern-Atlas huggingface dataset:
TESS: A Scalable Temporally and Spatially Local Learning Rule for Spiking Neural Networks
Venue: arXiv cs.NE 2025
Year: 2025

The demand for low-power inference and training of deep neural networks (DNNs) on edge devices has intensified the need for algorithms that are both scalable and energy-efficient. While spiking neural networks (SNNs) allow for efficient inference by processing complex spatio-temporal dynamics in an event-driven fashion, training them on resource-constrained devices remains challenging due to the high computational and memory demands of conventional error backpropagation (BP)-based approaches. In this work, we draw inspiration from biological mechanisms such as eligibility traces, spike-timing-dependent plasticity, and neural activity synchronization to introduce TESS, a temporally and spatially local learning rule for training SNNs. Our approach addresses both temporal and spatial credit assignments by relying solely on locally available signals within each neuron, thereby allowing computational and memory overheads to scale linearly with the number of neurons, independently of the number of time steps. Despite relying on local mechanisms, we demonstrate performance comparable to the backpropagation through time (BPTT) algorithm, within $\sim1.4$ accuracy points on challenging computer vision scenarios relevant at the edge, such as the IBM DVS Gesture dataset, CIFAR10-DVS, and temporal versions of CIFAR10, and CIFAR100. Being able to produce comparable performance to BPTT while keeping low time and memory complexity, TESS enables efficient and scalable on-device learning at the edge.
Optimal Traffic Allocation for Multi-Slot Sponsored Search: Balance of Efficiency and Fairness
Venue: arXiv cs.GT 2025
Year: 2025

The majority of online marketplaces offer promotion programs to sellers to acquire additional customers for their products. These programs typically allow sellers to allocate advertising budgets to promote their products, with higher budgets generally correlating to improve ad performance. Auction mechanisms with budget pacing are commonly employed to implement such ad systems. While auctions deliver satisfactory average effectiveness, ad performance under allocated budgets can be unfair in practice. To address this issue, we propose a novel ad allocation model that departs from traditional auction mechanics. Our approach focuses on solving a global optimization problem that balances traffic allocation while considering platform efficiency and fairness constraints. This study presents the following contributions. First, we introduce a fairness metric based on the Gini index. Second, we formulate the optimization problem incorporating efficiency and fairness objectives. Third, we offer an online algorithm to solve this optimization problem. Finally, we demonstrate that our approach achieves superior fairness compared to baseline auction-based algorithms without sacrificing efficiency. We contend that our proposed method can be effectively applied in real-time ad allocation scenarios and as an offline benchmark for evaluating the fairness-efficiency trade-off of existing auction-based systems.
Optimizing Online Advertising with Multi-Armed Bandits: Mitigating the Cold Start Problem under Auction Dynamics
Venue: arXiv cs.LG 2025
Year: 2025

Online advertising platforms often face a common challenge: the cold start problem. Insufficient behavioral data (clicks) makes accurate click-through rate (CTR) forecasting of new ads challenging. CTR for "old" items can also be significantly underestimated due to their early performance influencing their long-term behavior on the platform. The cold start problem has far-reaching implications for businesses, including missed long-term revenue opportunities. To mitigate this issue, we developed a UCB-like algorithm under multi-armed bandit (MAB) setting for positional-based model (PBM), specifically tailored to auction pay-per-click systems. Our proposed algorithm successfully combines theory and practice: we obtain theoretical upper estimates of budget regret, and conduct a series of experiments on synthetic and real-world data that confirm the applicability of the method on the real platform. In addition to increasing the platform's long-term profitability, we also propose a mechanism for maintaining short-term profits through controlled exploration and exploitation of items.
Countering Election Sway: Strategic Algorithms in Friedkin-Johnsen Dynamics
Venue: arXiv cs.SI 2025
Year: 2025

Social influence profoundly impacts individual choices and collective behaviors in politics. In this work, driven by the goal of protecting elections from improper influence, we consider the following scenario: an individual, who has vested interests in political party $Y$, is aware through reliable surveys that parties $X$ and $Y$ are likely to get 50.1\% and 49.9\% of the vote, respectively. Could this individual employ strategies to alter public opinions and consequently invert these polling numbers in favor of party $Y$? We address this question by employing: (i) the Friedkin-Johnsen (FJ) opinion dynamics model, which is mathematically sophisticated and effectively captures the way individual biases and social interactions shape opinions, making it crucial for examining social influence, and (ii) interventions similar to those in Asch's experiments, which involve selecting a group of stooges within the network to spread a specific opinion. We mathematically formalize the aforementioned motivation as an optimization framework and establish that it is NP-hard and inapproximable within any constant factor. We introduce three efficient polynomial-time algorithms. The first two utilize a continuous approach: one employs gradient descent with Huber's estimator to approximate the median, and the other uses a sigmoid threshold influence function. The third utilizes a combinatorial greedy algorithm for targeted interventions. Through comparative analysis against various natural baselines and using real-world data, our results demonstrate that in numerous cases a small fraction of nodes chosen as stooges can significantly sway election outcomes under the Friedkin-Johnsen model.
3D Cell Oversegmentation Correction via Geo-Wasserstein Divergence
Venue: arXiv cs.CV 2025
Year: 2025

3D cell segmentation methods are often hindered by \emph{oversegmentation}, where a single cell is incorrectly split into multiple fragments. This degrades the final segmentation quality and is notoriously difficult to resolve, as oversegmentation errors often resemble natural gaps between adjacent cells. Our work makes two key contributions. First, for 3D cell segmentation, we are the first work to formulate oversegmentation as a concrete problem and propose a geometric framework to identify and correct these errors. Our approach builds a pre-trained classifier using both 2D geometric and 3D topological features extracted from flawed 3D segmentation results. Second, we introduce a novel metric, Geo-Wasserstein divergence, to quantify changes in 2D geometries. This captures the evolving trends of cell mask shape in a geometry-aware manner. We validate our method through extensive experiments on in-domain plant datasets, including both synthesized and real oversegmented cases, as well as on out-of-domain animal datasets to demonstrate transfer learning performance. An ablation study further highlights the contribution of the Geo-Wasserstein divergence. A clear pipeline is provided for end-users to build pre-trained models to any labeled dataset.
PATCH: a deep learning method to assess heterogeneity of artistic practice in historical paintings
Venue: arXiv cs.CV 2025
Year: 2025

The history of art has seen significant shifts in the manner in which artworks are created, making understanding of creative processes a central question in technical art history. In the Renaissance and Early Modern period, paintings were largely produced by master painters directing workshops of apprentices who often contributed to projects. The masters varied significantly in artistic and managerial styles, meaning different combinations of artists and implements might be seen both between masters and within workshops or even individual canvases. Information on how different workshops were managed and the processes by which artworks were created remains elusive. Machine learning methods have potential to unearth new information about artists' creative processes by extending the analysis of brushwork to a microscopic scale. Analysis of workshop paintings, however, presents a challenge in that documentation of the artists and materials involved is sparse, meaning external examples are not available to train networks to recognize their contributions. Here we present a novel machine learning approach we call pairwise assignment training for classifying heterogeneity (PATCH) that is capable of identifying individual artistic practice regimes with no external training data, or "ground truth." The method achieves unsupervised results by supervised means, and outperforms both simple statistical procedures and unsupervised machine learning methods. We apply this method to two historical paintings by the Spanish Renaissance master, El Greco: The Baptism of Christ and Christ on the Cross with Landscape, and our findings regarding the former potentially challenge previous work that has assigned the painting to workshop members. Further, the results of our analyses create a measure of heterogeneity of artistic practice that can be used to characterize artworks across time and space.
Efficient Covering Using Reed--Solomon Codes
Venue: arXiv cs.IT 2025
Year: 2025

We propose an efficient algorithm to find a Reed-Solomon (RS) codeword at a distance within the covering radius of the code from any point in its ambient Hamming space. To the best of the authors' knowledge, this is the first attempt of its kind to solve the covering problem for RS codes. The proposed algorithm leverages off-the-shelf decoding methods for RS codes, including the Berlekamp-Welch algorithm for unique decoding and the Guruswami-Sudan algorithm for list decoding. We also present theoretical and numerical results on the capabilities of the proposed algorithm and, in particular, the average covering radius resulting from it. Our numerical results suggest that the overlapping Hamming spheres of radius close to the Guruswami-Sudan decoding radius centered at the codewords cover most of the ambient Hamming space.
Reasoning Bias of Next Token Prediction Training
Venue: arXiv cs.CL 2025
Year: 2025

Since the inception of Large Language Models (LLMs), the quest to efficiently train them for superior reasoning capabilities has been a pivotal challenge. The dominant training paradigm for LLMs is based on next token prediction (NTP). Alternative methodologies, called Critical Token Prediction (CTP), focused exclusively on specific critical tokens (such as the answer in Q\&A dataset), aiming to reduce the overfitting of extraneous information and noise. Contrary to initial assumptions, our research reveals that despite NTP's exposure to noise during training, it surpasses CTP in reasoning ability. We attribute this counterintuitive outcome to the regularizing influence of noise on the training dynamics. Our empirical analysis shows that NTP-trained models exhibit enhanced generalization and robustness across various benchmark reasoning datasets, demonstrating greater resilience to perturbations and achieving flatter loss minima. These findings illuminate that NTP is instrumental in fostering reasoning abilities during pretraining, whereas CTP is more effective for finetuning, thereby enriching our comprehension of optimal training strategies in LLM development.
LLMSecConfig: An LLM-Based Approach for Fixing Software Container Misconfigurations
Venue: arXiv cs.SE 2025
Year: 2025

Security misconfigurations in Container Orchestrators (COs) can pose serious threats to software systems. While Static Analysis Tools (SATs) can effectively detect these security vulnerabilities, the industry currently lacks automated solutions capable of fixing these misconfigurations. The emergence of Large Language Models (LLMs), with their proven capabilities in code understanding and generation, presents an opportunity to address this limitation. This study introduces LLMSecConfig, an innovative framework that bridges this gap by combining SATs with LLMs. Our approach leverages advanced prompting techniques and Retrieval-Augmented Generation (RAG) to automatically repair security misconfigurations while preserving operational functionality. Evaluation of 1,000 real-world Kubernetes configurations achieved a 94\% success rate while maintaining a low rate of introducing new misconfigurations. Our work makes a promising step towards automated container security management, reducing the manual effort required for configuration maintenance.
Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer
Venue: arXiv cs.MA 2025
Year: 2025

Overestimation in single-agent reinforcement learning has been extensively studied. In contrast, overestimation in the multiagent setting has received comparatively little attention although it increases with the number of agents and leads to severe learning instability. Previous works concentrate on reducing overestimation in the estimation process of target Q-value. They ignore the follow-up optimization process of online Q-network, thus making it hard to fully address the complex multiagent overestimation problem. To solve this challenge, in this study, we first establish an iterative estimation-optimization analysis framework for multiagent value-mixing Q-learning. Our analysis reveals that multiagent overestimation not only comes from the computation of target Q-value but also accumulates in the online Q-network's optimization. Motivated by it, we propose the Dual Ensembled Multiagent Q-Learning with Hypernet Regularizer algorithm to tackle multiagent overestimation from two aspects. First, we extend the random ensemble technique into the estimation of target individual and global Q-values to derive a lower update target. Second, we propose a novel hypernet regularizer on hypernetwork weights and biases to constrain the optimization of online global Q-network to prevent overestimation accumulation. Extensive experiments in MPE and SMAC show that the proposed method successfully addresses overestimation across various tasks.
SAFE: Harnessing LLM for Scenario-Driven ADS Testing from Multimodal Crash Data
Venue: arXiv cs.SE 2025
Year: 2025

Ensuring the safety of Autonomous Driving Systems (ADS) requires realistic and reproducible test scenarios, yet extracting such scenarios from multimodal crash reports remains a major challenge. Large Language Models (LLMs) often hallucinate and lose map structure, resulting in unrealistic road layouts and vehicle behaviors. To address this, we introduce SAFE, a novel Scenario-based ADS testing Framework via multimodal Extraction, which leverages Retrieval-Augmented Generation (RAG), knowledge-grounded prompting, Chain-of-Thought (CoT) reasoning, and self-validation to improve scenario reconstruction from multimodal crash data. SAFE achieves 93.8% accuracy in extracting road network details, 80.0% for actor information, and 100% for environmental context. In human studies, SAFE outperforms LCTGen and AC3R in reconstructing consistent road networks and vehicle behaviors. Under identical ADS and simulator settings, SAFE detects 39 and 71 more safety violations than LCTGen and AC3R, respectively, and reproduces 12 more real-world crash cases than LCTGen. On 19 cases supported by AC3R, SAFE reproduces one additional crash case with statistically significant gains across five runs. It generates scenarios within 25 seconds and triggers violations after just 1 case (IDM) and 3 cases (PPO) in MetaDrive, as well as 1 case (Auto) in BeamNG. Code: https://github.com/Siwei-Luo-MQ/SAFE-ADS-Testing
Multimaterial topology optimization for finite strain elastoplasticity: theory, methods, and applications
Venue: arXiv cs.CE 2025
Year: 2025

Plasticity is inherent to many engineering materials such as metals. While it can degrade the load-carrying capacity of structures via material yielding, it can also protect structures through plastic energy dissipation. To fully harness plasticity, here we present the theory, method, and application of a topology optimization framework that simultaneously optimizes structural geometries and material phases to customize the stiffness, strength, and structural toughness of designs experiencing finite strain elastoplasticity. The framework accurately predicts structural responses by employing a rigorous, mechanics-based elastoplasticity theory that ensures isochoric plastic flow. It also effectively identifies optimal material phase distributions using a gradient-based optimizer, where gradient information is obtained via a reversed adjoint method to address history dependence, along with automatic differentiation to compute the complex partial derivatives. We demonstrate the framework by optimizing a range of 2D and 3D elastoplastic structures, including energy-dissipating dampers, load-carrying beams, impact-resisting bumpers, and cold working profiled sheets. These optimized multimaterial structures reveal important mechanisms for improving design performance under large deformation, such as the transition from kinematic to isotropic hardening with increasing displacement amplitudes and the formation of twisted regions that concentrate stress, enhancing plastic energy dissipation. Through the superior performance of these optimized designs, we demonstrate the framework's effectiveness in tailoring elastoplastic responses across various spatial configurations, material types, hardening behaviors, and combinations of candidate materials. This work offers a systematic approach for optimizing next-generation multimaterial structures with elastoplastic behaviors under large deformations.
Rethinking stance detection: A theoretically-informed research agenda for user-level inference using language models
Venue: arXiv cs.CL 2025
Year: 2025

Stance detection has emerged as a popular task in natural language processing research, enabled largely by the abundance of target-specific social media data. While there has been considerable research on the development of stance detection models, datasets, and application, we highlight important gaps pertaining to (i) a lack of theoretical conceptualization of stance, and (ii) the treatment of stance at an individual- or user-level, as opposed to message-level. In this paper, we first review the interdisciplinary origins of stance as an individual-level construct to highlight relevant attributes (e.g., psychological features) that might be useful to incorporate in stance detection models. Further, we argue that recent pre-trained and large language models (LLMs) might offer a way to flexibly infer such user-level attributes and/or incorporate them in modelling stance. To better illustrate this, we briefly review and synthesize the emerging corpus of studies on using LLMs for inferring stance, and specifically on incorporating user attributes in such tasks. We conclude by proposing a four-point agenda for pursuing stance detection research that is theoretically informed, inclusive, and practically impactful.
Sum of Squared Extended $η$-$μ$ and $κ$-$μ$ RVs: A New Framework Applied to FR3 and Sub-THz Systems
Venue: arXiv cs.IT 2025
Year: 2025

The analysis of systems operating in future frequency ranges calls for a proper statistical channel characterization through generalized fading models. In this paper, we adopt the Extended $η$-$μ$ and $κ$-$μ$ models to characterize the propagation in FR3 and the sub-THz band, respectively. For these models, we develop a new exact representation of the sum of squared independent and identically distributed random variables, which can be used to express the power of the received signal in multi-antenna systems. Unlike existing ones, the proposed analytical framework is remarkably tractable and computationally efficient, and thus can be conveniently employed to analyze systems with massive antenna arrays. For both the Extended $η$-$μ$ and $κ$-$μ$ distributions, we derive novel expressions for the probability density function and cumulative distribution function, we analyze their convergence and truncation error, and we discuss the computational complexity and implementation aspects. Moreover, we derive expressions for the outage and coverage probability, bit error probability for coherent binary modulations, and symbol error probability for M-ary phase-shift keying and quadrature amplitude modulation. Lastly, we provide an extensive performance evaluation of FR3 and sub-THz systems focusing on a downlink scenario where a single-antenna user is served by a base station employing maximum ratio transmission.
VerteNet -- A Multi-Context Hybrid CNN Transformer for Accurate Vertebral Landmark Localization in Lateral Spine DXA Images
Venue: arXiv cs.CV 2025
Year: 2025

Lateral Spine Image (LSI) analysis is important for medical diagnosis, treatment planning, and detailed spinal health assessments. Although modalities like Computed Tomography and Digital X-ray Imaging are commonly used, Dual Energy X-ray Absorptiometry (DXA) is often preferred due to lower radiation exposure, seamless capture, and cost-effectiveness. Accurate Vertebral Landmark Localization (VLL) on LSIs is important to detect spinal conditions like kyphosis and lordosis, as well as assessing Abdominal Aortic Calcification (AAC) using Inter-Vertebral Guides (IVGs). Nonetheless, few automated VLL methodologies have concentrated on DXA LSIs. We present VerteNet, a hybrid CNN-Transformer model featuring a novel dual-resolution attention mechanism in self and cross-attention domains, referred to as Dual Resolution Self-Attention (DRSA) and Dual Resolution Cross-Attention (DRCA). These mechanisms capture the diverse frequencies in DXA images by operating at two different feature map resolutions. Additionally, we design a Multi-Context Feature Fusion Block (MCFB) that efficiently integrates the features using DRSA and DRCA. We train VerteNet on 620 DXA LSIs from various machines and achieve superior results compared to existing methods. We also design an algorithm that utilizes VerteNet's predictions in estimating the Region of Interest (ROI) to detect potential abdominal aorta cropping, where inadequate soft tissue hinders calcification assessment. Additionally, we present a small proof-of-concept study to show that IVGs generated from VLL information can improve inter-reader correlation in AAC scoring, addressing two key areas of disagreement in expert AAC-24 scoring: IVG placement and quality control for full abdominal aorta assessment. The code for this work can be found at https://github.com/zaidilyas89/VerteNet.