arXiv:2601.09012v1 Announce Type: new Abstract: We present TranslateGemma, a suite of open machine translation models based on the Gemma 3 foundation models. To enhance the inherent multilingual capabilities of Gemma 3 for the translation task, we employ a two-stage fine-tuning process. First, supervised fine-tuning is performed using a rich mixture of high-quality large-scale synthetic parallel data generated via state-of-the-art models and human-translated parallel data. This is followed by a reinforcement learning phase, where we optimize translation quality using […]

Ver mais

The fifth-generation (5G) networks are facing critical security challenges in device authenti- cation for massive Internet of Things deployments while preserving privacy. Traditional federated learning approaches depend on the computationally expensive homomorphic encryption to protect model gradients, resulting in substantial latency, communication over- head, and the energy consumption impractical for resource-constrained 5G devices. This paper proposes zero-knowledge federated learning (ZK-FL), eliminating homomorphic encryption by enabling devices to prove model correctness without revealing gradients. Our approach integrates zero-knowledge proofs […]

Ver mais

benchANT compares MongoDB and ScyllaDB  architectures, with a focus on what the differences mean for performance and scalability When choosing a NoSQL database, the options can be overwhelming. One of the most popular choices is MongoDB, known for its easy use. But the highly performance-oriented ScyllaDB is one of the rising challengers. This benchANT report takes a closer technical look at both databases – comparing their architectures from an independent, technical angle. Both MongoDB and ScyllaDB promise a high-available, performant […]

Ver mais

Hi! I’m sorry if I’m not using the correct tag, I didn’t know which one to pick, and I’m sorry if the question is not aligned with the sub’s purpose, please let me know if that is the case and feel free to block the post as well. I’m trying to do some post-training at a somewhat large scale, but I’m struggling with some of the known frameworks out there. For some context, I’m trying to do RL […]

Ver mais

arXiv:2601.08852v1 Announce Type: new Abstract: Automated news verification requires structured claim extraction, but existing approaches either lack schema compliance or generalize poorly across domains. This paper presents NewsScope, a cross-domain dataset, benchmark, and fine-tuned model for schema-grounded news claim extraction. The dataset contains 455 articles across politics, health, science/environment, and business, consisting of 395 in-domain articles and 60 out-of-source articles for generalization testing. LLaMA 3.1 8B was fine-tuned using LoRA on 315 training examples and evaluated on held-out […]

Ver mais

arXiv:2601.05376v1 Announce Type: new Abstract: Persona conditioning can be viewed as a behavioral prior for large language models (LLMs) and is often assumed to confer expertise and improve safety in a monotonic manner. However, its effects on high-stakes clinical decision-making remain poorly characterized. We systematically evaluate persona-based control in clinical LLMs, examining how professional roles (e.g., Emergency Department physician, nurse) and interaction styles (bold vs. cautious) influence behavior across models and medical tasks. We assess performance on clinical […]

Ver mais

arXiv:2601.22323v1 Announce Type: new Abstract: Model routing chooses which language model to use for each query. By sending easy queries to cheaper models and hard queries to stronger ones, it can significantly reduce inference cost while maintaining high accuracy. However, most existing routers treat this as a fixed choice among a small set of models, which makes them hard to adapt to new models or changing budget constraints. In this paper, we propose SCOPE (Scalable and Controllable Outcome […]

Ver mais

arXiv:2602.05272v1 Announce Type: cross Abstract: We consider the problem of quickest changepoint detection under the Average Run Length (ARL) constraint where the pre-change and post-change laws lie in composite families $mathscr{P}$ and $mathscr{Q}$ respectively. In such a problem, a massive challenge is characterizing the best possible detection delay when the “hardest” pre-change law in $mathscr{P}$ depends on the unknown post-change law $Qinmathscr{Q}$. And typical simple-hypothesis likelihood-ratio arguments for Page-CUSUM and Shiryaev-Roberts do not at all apply here. To […]

Ver mais