Government
The Forgotten Code: Validating a Century-Old Translation System with AI
A pioneering rule-based mechanical translation system (precursor of modern RBMTs) was first presented in December 1929 by its inventor, Federico Pucci, who later published the full method in a book titled "Il traduttore meccanico ed il metodo per corrispondersi fra Europei conoscendo ciascuno solo la propria lingua: Parte I", in Salerno (Italy), in 1931. This study illustrates how AI breathes new life into the system of international keys and ideograms devised by Pucci to translate from/into any Romance language (at least as a first step). The methodology involves having the AIs retranslate, following Pucci's method, the two text excerpts originally translated in 1931 and clearly documented in his publication: a passage from Dante's La Vita Nuova, translated from Italian into French, and a passage from Voltaire's Zadig, translated from French into Italian. The result is notable: the two texts, translated 94 years apart using the same method--by Pucci in 1931 and by AIs in 2025--show a low average difference, with only minor variations observed. With Pucci's system thus validated, it became feasible to have the AIs reproduce the excerpts in English, Spanish, and German according to his method. The results were consistent, and Pucci--via Artificial Intelligence--was tasked with translating more modern and technical texts, thereby reviving, nearly a century later, an invention that had remained almost entirely unknown and never applied beyond its creator, now brought to wider attention and opened to possible experimentation. Such a demonstration would not only affirm Pucci's historical status but also place him among the precursors and intellectual contributors to machine translation, whose work merits examination alongside figures such as Troyanskij, Booth, and Weaver, with possible consequences for how the history of the field is understood.
MLP-Offload: Multi-Level, Multi-Path Offloading for LLM Pre-training to Break the GPU Memory Wall
Maurya, Avinash, Rafique, M. Mustafa, Cappello, Franck, Nicolae, Bogdan
Training LLMs larger than the aggregated memory of multiple GPUs is increasingly necessary due to the faster growth of LLM sizes compared to GPU memory. To this end, multi-tier host memory or disk offloading techniques are proposed by state of art. Despite advanced asynchronous multi-tier read/write strategies, such offloading strategies result in significant I/O overheads in the critical path of training, resulting in slower iterations. To this end, we propose MLP-Offload, a novel multi-level, multi-path offloading engine specifically designed for optimizing LLM training on resource-constrained setups by mitigating I/O bottlenecks. We make several key observations that drive the design of MLP-Offload, such as I/O overheads during the update dominate the iteration time; I/O bandwidth of the third-level remote storage tier remains unutilized; and, contention due to concurrent offloading amplifies I/O bottlenecks. Driven by these insights, we design and implement MLP-Offload to offload the optimizer states across multiple tiers in a cache-efficient and concurrency-controlled fashion to mitigate I/O bottlenecks during the backward and update phases. Evaluations on models up to 280B parameters shows that MLP-Offload achieves 2.5$\times$ faster iterations compared to the state-of-the-art LLM training runtimes.
Hermes 4 Technical Report
Teknium, Ryan, Jin, Roger, Suphavadeeprasit, Jai, Mahan, Dakota, Quesnelle, Jeffrey, Li, Joe, Guang, Chen, Sands, Shannon, Malhotra, Karan
We present Hermes 4, a family of hybrid reasoning models that combine structured, multi-turn reasoning with broad instruction-following ability. We describe the challenges encountered during data curation, synthesis, training, and evaluation, and outline the solutions employed to address these challenges at scale. We comprehensively evaluate across mathematical reasoning, coding, knowledge, comprehension, and alignment benchmarks, and we report both quantitative performance and qualitative behavioral analysis. To support open research, all model weights are published publicly at https://huggingface.co/collections/NousResearch/hermes-4-collection-68a731bfd452e20816725728
NVIDIA Nemotron Nano 2: An Accurate and Efficient Hybrid Mamba-Transformer Reasoning Model
NVIDIA, null, :, null, Basant, Aarti, Khairnar, Abhijit, Paithankar, Abhijit, Khattar, Abhinav, Renduchintala, Adithya, Malte, Aditya, Bercovich, Akhiad, Hazare, Akshay, Rico, Alejandra, Ficek, Aleksander, Kondratenko, Alex, Shaposhnikov, Alex, Bukharin, Alexander, Taghibakhshi, Ali, Barton, Amelia, Mahabaleshwarkar, Ameya Sunil, Shen, Amy, Tao, Andrew, Guan, Ann, Shors, Anna, Mandarwal, Anubhav, Mehta, Arham, Venkatesan, Arun, Sharabiani, Ashton, Aithal, Ashwath, Poojary, Ashwin, Dattagupta, Ayush, Buddharaju, Balaram, Zhu, Banghua, Simkin, Barnaby, Kartal, Bilal, Rouhani, Bita Darvish, Chen, Bobby, Ginsburg, Boris, Norick, Brandon, Yu, Brian, Catanzaro, Bryan, Wang, Charles, Truong, Charlie, Mungekar, Chetan, Patel, Chintan, Alexiuk, Chris, Munley, Christian, Parisien, Christopher, Su, Dan, Afrimi, Daniel, Korzekwa, Daniel, Rohrer, Daniel, Gitman, Daria, Mosallanezhad, David, Narayanan, Deepak, Rekesh, Dima, Yared, Dina, Pykhtar, Dmytro, Ahn, Dong, Riach, Duncan, Long, Eileen, Ning, Elliott, Chung, Eric, Galinkin, Erick, Bakhturina, Evelina, Prasad, Gargi, Shen, Gerald, Qian, Haifeng, Elisha, Haim, Sharma, Harsh, Ross, Hayley, Ngo, Helen, Sahota, Herman, Wang, Hexin, Shin, Hoo Chang, Huang, Hua, Cunningham, Iain, Gitman, Igor, Moshkov, Ivan, Jung, Jaehun, Kautz, Jan, Scowcroft, Jane Polak, Casper, Jared, Zhang, Jian, Zeng, Jiaqi, Zhang, Jimmy, Xue, Jinze, Huang, Jocelyn, Conway, Joey, Kamalu, John, Cohen, Jonathan, Jennings, Joseph, Vialard, Julien Veron, Yi, Junkeun, Parmar, Jupinder, Briski, Kari, Cheung, Katherine, Luna, Katherine, Wyss, Keith, Santhanam, Keshav, Kong, Kezhi, Pawelec, Krzysztof, Anik, Kumar, Li, Kunlun, Ahmadian, Kushan, McAfee, Lawrence, Sleiman, Laya, Derczynski, Leon, Vega, Luis, de Melo, Maer Rodrigues, Sreedhar, Makesh Narsimhan, Chochowski, Marcin, Cai, Mark, Kliegl, Markus, Stepniewska-Dziubinska, Marta, Novikov, Matvei, Samadi, Mehrzad, Price, Meredith, Boubdir, Meriem, Boone, Michael, Evans, Michael, Bien, Michal, Zawalski, Michal, Martinez, Miguel, Chrzanowski, Mike, Shoeybi, Mohammad, Patwary, Mostofa, Dhameja, Namit, Assaf, Nave, Habibi, Negar, Bhatia, Nidhi, Pope, Nikki, Tajbakhsh, Nima, Juluru, Nirmal Kumar, Rybakov, Oleg, Hrinchuk, Oleksii, Kuchaiev, Oleksii, Olabiyi, Oluwatobi, Ribalta, Pablo, Subramanian, Padmavathy, Chadha, Parth, Molchanov, Pavlo, Dykas, Peter, Jin, Peter, Bialecki, Piotr, Januszewski, Piotr, Thalasta, Pradeep, Gaikwad, Prashant, Varshney, Prasoon, Gundecha, Pritam, Tredak, Przemek, Mahabadi, Rabeeh Karimi, Patel, Rajen, El-Yaniv, Ran, Rajan, Ranjit, Cheruvu, Ria, Shahbazyan, Rima, Borkar, Ritika, Gala, Ritu, Waleffe, Roger, Zhang, Ruoxi, Hewett, Russell J., Prenger, Ryan, Jain, Sahil, Kriman, Samuel, Satheesh, Sanjeev, Kaji, Saori, Yurick, Sarah, Muralidharan, Saurav, Narenthiran, Sean, Bak, Seonmyeong, Sameni, Sepehr, Han, Seungju, Ramasamy, Shanmugam, Ghosh, Shaona, Sreenivas, Sharath Turuvekere, Thomas, Shelby, Diao, Shizhe, Gopal, Shreya, Prabhumoye, Shrimai, Toshniwal, Shubham, Ding, Shuoyang, Singh, Siddharth, Jain, Siddhartha, Majumdar, Somshubra, Singhal, Soumye, Alborghetti, Stefania, Akter, Syeda Nahida, Kong, Terry, Moon, Tim, Hliwiak, Tomasz, Asida, Tomer, Wang, Tony, Konuk, Tugrul, Vashishth, Twinkle, Poon, Tyler, Karpas, Udi, Noroozi, Vahid, Srinivasan, Venkat, Korthikanti, Vijay, Fugro, Vikram, Kalluru, Vineeth, Kurin, Vitaly, Lavrukhin, Vitaly, Ahmad, Wasi Uddin, Du, Wei, Byeon, Wonmin, Lu, Ximing, Dong, Xin, Karnati, Yashaswi, Choi, Yejin, Zhang, Yian, Lin, Ying, Fu, Yonggan, Suhara, Yoshi, Dong, Zhen, Li, Zhiyu, Zhu, Zhongbo, Chen, Zijia
We introduce Nemotron-Nano-9B-v2, a hybrid Mamba-Transformer language model designed to increase throughput for reasoning workloads while achieving state-of-the-art accuracy compared to similarly-sized models. Nemotron-Nano-9B-v2 builds on the Nemotron-H architecture, in which the majority of the self-attention layers in the common Transformer architecture are replaced with Mamba-2 layers, to achieve improved inference speed when generating the long thinking traces needed for reasoning. We create Nemotron-Nano-9B-v2 by first pre-training a 12-billion-parameter model (Nemotron-Nano-12B-v2-Base) on 20 trillion tokens using an FP8 training recipe. After aligning Nemotron-Nano-12B-v2-Base, we employ the Minitron strategy to compress and distill the model with the goal of enabling inference on up to 128k tokens on a single NVIDIA A10G GPU (22GiB of memory, bfloat16 precision). Compared to existing similarly-sized models (e.g., Qwen3-8B), we show that Nemotron-Nano-9B-v2 achieves on-par or better accuracy on reasoning benchmarks while achieving up to 6x higher inference throughput in reasoning settings like 8k input and 16k output tokens. We are releasing Nemotron-Nano-9B-v2, Nemotron-Nano12B-v2-Base, and Nemotron-Nano-9B-v2-Base checkpoints along with the majority of our pre- and post-training datasets on Hugging Face.
RDIT: Residual-based Diffusion Implicit Models for Probabilistic Time Series Forecasting
Lai, Chih-Yu, Ning, Yu-Chien, Boning, Duane S.
Probabilistic Time Series Forecasting (PTSF) plays a critical role in domains requiring accurate and uncertainty-aware predictions for decision-making. However, existing methods offer suboptimal distribution modeling and suffer from a mismatch between training and evaluation metrics. Surprisingly, we found that augmenting a strong point estimator with a zero-mean Gaussian, whose standard deviation matches its training error, can yield state-of-the-art performance in PTSF. In this work, we propose RDIT, a plug-and-play framework that combines point estimation and residual-based conditional diffusion with a bidirectional Mamba network. We theoretically prove that the Continuous Ranked Probability Score (CRPS) can be minimized by adjusting to an optimal standard deviation and then derive algorithms to achieve distribution matching. Evaluations on eight multivariate datasets across varied forecasting horizons demonstrate that RDIT achieves lower CRPS, rapid inference, and improved coverage compared to strong baselines.
Towards Multi-Aspect Diversification of News Recommendations Using Neuro-Symbolic AI for Individual and Societal Benefit
Reiter-Haas, Markus, Lex, Elisabeth
News recommendations are complex, with diversity playing a vital role. So far, existing literature predominantly focuses on specific aspects of news diversity, such as viewpoints. In this paper, we introduce multi-aspect diversification in four distinct recommendation modes and outline the nuanced challenges in diversifying lists, sequences, summaries, and interactions. Our proposed research direction combines symbolic and subsymbolic artificial intelligence, leveraging both knowledge graphs and rule learning. We plan to evaluate our models using user studies to not only capture behavior but also their perceived experience. Our vision to balance news consumption points to other positive effects for users (e.g., increased serendipity) and society (e.g., decreased polarization).
Enhancing Reliability in LLM-Integrated Robotic Systems: A Unified Approach to Security and Safety
Zhang, Wenxiao, Kong, Xiangrui, Dewitt, Conan, Bräunl, Thomas, Hong, Jin B.
Integrating Large Language Models (LLMs) into robotic systems has revolutionised embodied artificial intelligence, enabling advanced decision-making and adaptability. However, ensuring reliability--encompassing both security against adversarial attacks and safety in complex environments--remains a critical challenge. To address this, we propose a unified framework that mitigates prompt injection attacks while enforcing operational safety through robust validation mechanisms. Our approach combines prompt assembling, state management, and safety validation, evaluated using both performance and security metrics. Experiments show a 30.8% improvement under injection attacks and up to a 325% improvement in complex environment settings under adversarial conditions compared to baseline scenarios. The framework is open-sourced with simulation and physical deployment demos at https://llmeyesim.vercel.app/. Introduction The integration of Large Language Models (LLMs) into embodied robotic systems represents a significant leap in robotic autonomy and adaptability [11]. Recent advances enable robots to interpret natural language instructions, fuse multimodal sensor data, and make planning decisions using the general-purpose reasoning capabilities of models like GPT -4o [22]. These capabilities promise generalist agents that can execute complex, interactive tasks without task-specific training [14]. By drawing on vast internet-scale training corpora, LLMs can produce structured action plans from ambiguous user goals, acting as high-level controllers in dynamic and unpredictable environments [12]. However, these benefits come with risks. Unlike traditional robotic architectures that rely on modular safety subsystems, such as collision avoidance, mission timeouts, and hardware constraints, LLM-based controllers can bypass these safeguards via incorrect inference or adversarial inputs. The semantic sensitivity of LLMs to phrasing, ambiguity, or hallucinated knowledge introduces vulnerabilities not addressed by existing robotics safety protocols [6]. Moreover, integrating multimodal perception (e.g., camera, LiDAR) expands the input space but also introduces new failure modes, where partial, spoofed, or contextually misleading inputs can lead to unsafe behaviours [31]. The current literature lacks a unified methodology to secure and validate the behaviour of LLM-driven robots. Most prior work evaluates vision-language reasoning or robotic planning in isolation and does not consider how prompt injection attacks or input spoofing a ffect downstream physical actions. Similarly, existing LLM safety work focuses on digital assistants or text-only settings, leaving a critical gap in embodied use cases such as autonomous navigation and exploration [37, 20]. As robots begin to operate in open-world human environments, the absence of integrated security and safety layers poses real risks to both mission success and human-robot interaction.
AMBEDKAR-A Multi-level Bias Elimination through a Decoding Approach with Knowledge Augmentation for Robust Constitutional Alignment of Language Models
Mukhopadhyay, Snehasis, Kasat, Aryan, Dubey, Shivam, Karthikeyan, Rahul, Sood, Dhruv, Jain, Vinija, Chadha, Aman, Das, Amitava
Large Language Models (LLMs) can inadvertently reflect societal biases present in their training data, leading to harmful or prejudiced outputs. In the Indian context, our empirical evaluations across a suite of models reveal that biases around caste and religion are particularly salient. Yet, most existing mitigation strategies are Western-centric and fail to address these local nuances. We propose AMBEDKAR, a framework inspired by the egalitarian vision of Dr B. R. Ambedkar, architect of the Indian Constitution, to guide LLM outputs toward fairness, neutrality, and inclusion in line with Articles 14 to 17. Our approach introduces a Constitution-Aware Decoding Layer, guided by the AI Constitution of India and applied only at inference time, without any parameter updates to the base model. We incorporate a speculative decoding algorithm that proactively reduces casteist and communal bias during generation. This mitigation layer operates directly within the decoding process, avoiding changes to model internals and lowering the computational and infrastructural costs associated with retraining. We reinterpret speculative decoding not merely as an efficiency tool but as a mechanism for fairness. In this framework, a Small Language Model (SLM) acts as a potentially biased generator, while a constitutionally guided Large Language Model (LLM) serves as the verifier. Rather than accelerating generation, the LLM enforces bias-robust trajectories in the SLM outputs. This inversion of roles gives rise to a fairness-by-speculation paradigm. Our approach yields an absolute reduction of bias up to 26.41 percent compared to baseline. Our source code, datasets, and results are available at https://anonymous.4open.science/r/AMBEDKAR-983B/
Forecasting Future DDoS Attacks Using Long Short Term Memory (LSTM) Model
Yeen, Kong Mun, Noor, Rafidah Md, Shah, Wahidah Md, Hassan, Aslinda, Munir, Muhammad Umair
This paper forecasts future Distributed Denial - of - Service (DDoS) attacks us ing deep learning models. Although several studies address forecasting DDoS attacks, they remain relatively limited compared to detection - focused research . By studying the current trends and forecasting based on newer and updated datasets, mitigation plans against the attacks can be planned and formulated. The methodology used in this research work conforms to the Cross Industry Standard Process for Data Mining (CRISP - DM) model. Leveraging cyberattack data from the COVID - 19 period (2019 - 2020), sourced from Digital Attack Map and compiled by Arbor Networks, the study aims to identify recent attack trends and forecast future activity to support proactive mitigation strategies. The dataset was examined using statistical analysis techniques to identify prevailing patterns, with emphasis on the frequency of attac ks, the duration of attack instances, and the maximum throughput recorded during each incident . Compared to other deep learning models, the LSTM model is proposed for its ability to learn long - term temporal patterns in evolving DDoS traffic. The performanc e of LSTM model was evaluated using Mean Squared Error (MSE) under varying neuron counts and window sizes. While the model demonstrated limited predictive accuracy in terms of absolute values, the visual comparison between the predicted and actual data usi ng line charts revealed close alignment in trend patterns . This suggests that the model captures the underlying temporal dynamics of the data, thereby providing a promising foundation for future model optimization and performance enhancement. Many cyberattack methods are well known, including but not limited to phishing, spoofing, malware infections, ransomware, and Denial - of - Service (DoS) attacks. A DoS attack occurs when an attacker attempts to disable a service, server, or network . Attackers attempt to make services inaccessible by overwhelming the available resources on the hosting server, infrastructure and/or systems. However, DoS can be eas ily track ed, as it could contai n information about the attacker that can be obtained from network traces and attack logs.
LUCIE-3D: A three-dimensional climate emulator for forced responses
Guan, Haiwen, Arcomano, Troy, Chattopadhyay, Ashesh, Maulik, Romit
We introduce LUCIE-3D, a lightweight three-dimensional climate emulator designed to capture the vertical structure of the atmosphere, respond to climate change forcings, and maintain computational efficiency with long-term stability. Building on the original LUCIE-2D framework, LUCIE-3D employs a Spherical Fourier Neural Operator (SFNO) backbone and is trained on 30 years of ERA5 reanalysis data spanning eight vertical σ-levels. The model incorporates atmospheric CO2 as a forcing variable and optionally integrates prescribed sea surface temperature (SST) to simulate coupled ocean--atmosphere dynamics. Results demonstrate that LUCIE-3D successfully reproduces climatological means, variability, and long-term climate change signals, including surface warming and stratospheric cooling under increasing CO2 concentrations. The model further captures key dynamical processes such as equatorial Kelvin waves, the Madden--Julian Oscillation, and annular modes, while showing credible behavior in the statistics of extreme events. Despite requiring longer training than its 2D predecessor, LUCIE-3D remains efficient, training in under five hours on four GPUs. Its combination of stability, physical consistency, and accessibility makes it a valuable tool for rapid experimentation, ablation studies, and the exploration of coupled climate dynamics, with potential applications extending to paleoclimate research and future Earth system emulation.