arXiv:2601.15318v1 Announce Type: new Abstract: Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the sense of the (weighted) Euclidean distance, i.e., the orthogonal projection of the game on the set of balanced games. Besides an analytical approach which becomes rapidly intractable, we propose a fast algorithm to find the closest balanced game, avoiding exponential complexity […]

Ver mais

arXiv:2602.10250v1 Announce Type: new Abstract: As 3GPP systems have strengthened security at the upper layers of the cellular stack, plaintext PHY and MAC layers have remained relatively understudied, though interest in them is growing. In this work, we explore lower-layer exploitation in modern 5G, where recent releases have increased the number of lower-layer control messages and procedures, creating new opportunities for practical attacks. We present two practical attacks and evaluate them in a controlled lab testbed. First, we […]

Ver mais

With experience I can say that all the AI usage in Test Automation relies mostly on the Machine Learning techniques and prediction based analytics to identify bugs or security risks, experience from the previous test runs to improve the problem detection and even generate test scenarios automatically. Here I will try to simplify it further so that maximum Testers can understand the enhancements AI can offer in Automation and implement it in real time scenarios. AI implementation in […]

Ver mais

Reinforcement learning algorithms are defined by their learning update rules, which are typically hand-designed and fixed. We present an evolutionary framework for discovering reinforcement learning algorithms by searching directly over executable update rules that implement complete training procedures. The approach builds on REvolve, an evolutionary system that uses large language models as generative variation operators, and extends it from reward-function discovery to algorithm discovery. To promote the emergence of nonstandard learning rules, the search excludes canonical mechanisms such […]

Ver mais

arXiv:2603.26730v1 Announce Type: new Abstract: Deploying embodied AI agents in the physical world demands cognitive capabilities for long-horizon planning that execute reliably, deterministically, and transparently. We present HARMONIC, a cognitive-robotic architecture that pairs OntoAgent, a content-centric cognitive architecture providing metacognitive self-monitoring, domain-grounded diagnosis, and consequence-based action selection over ontologically structured knowledge, with a modular reactive tactical layer. HARMONIC’s modular design enables a functional evaluation of whether LLMs can replicate OntoAgent’s cognitive capabilities, evaluated within the same robotic system […]

Ver mais

arXiv:2602.13289v1 Announce Type: new Abstract: Multimodal Large Language Models (MLLM) are increasingly deployed in domains where both reliability and efficiency are critical. However, current models remain overconfident, producing highly certain but incorrect answers. At the same time, their large size limits deployment on edge devices, necessitating compression. We study the intersection of these two challenges by analyzing how Post-Training Quantization (PTQ) compression affects both accuracy and reliability in Visual Question Answering (VQA). We evaluate two MLLMs, Qwen2-VL-7B and […]

Ver mais

arXiv:2601.02412v1 Announce Type: new Abstract: Recommender systems shape online interactions by matching users with creators content to maximize engagement. Creators, in turn, adapt their content to align with users preferences and enhance their popularity. At the same time, users preferences evolve under the influence of both suggested content from the recommender system and content shared within their social circles. This feedback loop generates a complex interplay between users, creators, and recommender algorithms, which is the key cause of […]

Ver mais

Privacy-Preserving Federated Learning (PPFL) is a Decentralized machine learning paradigm that enables multiple participants to collaboratively train a global model without sharing their data with the integration of cryptographic and privacy-based techniques to enhance the security of the global system. This privacy-oriented approach makes PPFL a highly suitable solution for training shared models in sectors where data privacy is a critical concern. In traditional FL, local models are trained on edge devices, and only model updates are shared […]

Ver mais

Table of Links Abstract and 1. Introduction Related Work and Background Analysis 3.1 Limitations about Existing ReLUficatio 3.2 dReLU Are Neurons in Expert still Sparsely Activated? dReLU Sparsification Experiments Results 6.1 Downstream Tasks Performance 6.2 Sparsity of Sparsified Models Practical Inference Speedup Evaluation 7.1 Experiments Setting 7.2 Pure CPU Inference and 7.3 Hybrid GPU-CPU Inference 7.4 Deploy LLMs on mobile phones Conclusion and References A. Appendix / supplemental material B. Limitation C. Broader Impact 5 dReLU Sparsification In […]

Ver mais

arXiv:2603.26738v1 Announce Type: new Abstract: While automated sleep staging has achieved expert-level accuracy, its clinical adoption is hindered by a lack of auditable reasoning. We introduce SleepVLM, a rule-grounded vision-language model (VLM) designed to stage sleep from multi-channel polysomnography (PSG) waveform images while generating clinician-readable rationales based on American Academy of Sleep Medicine (AASM) scoring criteria. Utilizing waveform-perceptual pre-training and rule-grounded supervised fine-tuning, SleepVLM achieved Cohen’s kappa scores of 0.767 on an held out test set (MASS-SS1) and […]

Ver mais