Government
Deductive Closure Training of Language Models for Coherence, Accuracy, and Updatability
Akyürek, Afra Feyza, Akyürek, Ekin, Choshen, Leshem, Wijaya, Derry, Andreas, Jacob
While language models (LMs) can sometimes generate factually correct text and estimate truth values of individual claims, these generally do not reflect a globally coherent, manipulable model of the world. As a consequence, current LMs also generate incorrect or nonsensical content, and are difficult to edit and bring up to date. We present a method called Deductive Closure Training (DCT) that uses LMs themselves to identify implications of (and contradictions within) the text that they generate, yielding an efficient self-supervised procedure for improving LM factuality. Given a collection of seed documents, DCT prompts LMs to generate additional text implied by these documents, reason globally about the correctness of this generated text, and finally fine-tune on text inferred to be correct. Given seed documents from a trusted source, DCT provides a tool for supervised model updating; if seed documents are sampled from the LM itself, DCT enables fully unsupervised fine-tuning for improved coherence and accuracy. Across the CREAK, MQUaKE, and Reversal Curse datasets, supervised DCT improves LM fact verification and text generation accuracy by 3-26%; on CREAK fully unsupervised DCT improves verification accuracy by 12%. These results show that LMs' reasoning capabilities during inference can be leveraged during training to improve their reliability.
ADVENT: Attack/Anomaly Detection in VANETs
Baharlouei, Hamideh, Makanju, Adetokunbo, Zincir-Heywood, Nur
This enables immediate control over vehicle functions like brakes, acceleration, and steering. It offers advantages such as contributing to traffic safety by delivering precise information directly to drivers. However, the dynamic nature of VANETs, marked by constantly changing network topologies, varying vehicle speeds, and differences in the density of V2X communications, introduces new challenges and vulnerabilities that must be addressed [1]. These vulnerabilities can be exploited to launch various types of attacks, which could result in various issues such as accidents and traffic congestion. Thus, ensuring the security of VANETs is of great significance due to the potential risks to human lives, property, and economic activities. This underscores the need to prioritize the development of robust information system security tools and mechanisms capable of not only detecting but also effectively mitigating these attacks. Taking proactive measures is essential to ensure the integrity and safety of VANETs in the face of the evolving cybersecurity threats.
Safe Mission-Level Path Planning for Exploration of Lunar Shadowed Regions by a Solar-Powered Rover
Lamarre, Olivier, Malhotra, Shantanu, Kelly, Jonathan
Exploration of the lunar south pole with a solar-powered rover is challenging due to the highly dynamic solar illumination conditions and the presence of permanently shadowed regions (PSRs). In turn, careful planning in space and time is essential. Mission-level path planning is a global, spatiotemporal paradigm that addresses this challenge, taking into account rover resources and mission requirements. However, existing approaches do not proactively account for random disturbances, such as recurring faults, that may temporarily delay rover traverse progress. In this paper, we formulate a chance-constrained mission-level planning problem for the exploration of PSRs by a solar-powered rover affected by random faults. The objective is to find a policy that visits as many waypoints of scientific interest as possible while respecting an upper bound on the probability of mission failure. Our approach assumes that faults occur randomly, but at a known, constant average rate. Each fault is resolved within a fixed time, simulating the recovery period of an autonomous system or the time required for a team of human operators to intervene. Unlike solutions based upon dynamic programming alone, our method breaks the chance-constrained optimization problem into smaller offline and online subtasks to make the problem computationally tractable. Specifically, our solution combines existing mission-level path planning techniques with a stochastic reachability analysis component. We find mission plans that remain within reach of safety throughout large state spaces. To empirically validate our algorithm, we simulate mission scenarios using orbital terrain and illumination maps of Cabeus Crater. Results from simulations of multi-day, long-range drives in the LCROSS impact region are also presented.
N-Adaptive Ritz Method: A Neural Network Enriched Partition of Unity for Boundary Value Problems
Baek, Jonghyuk, Wang, Yanran, Chen, J. S.
Conventional finite element methods are known to be tedious in adaptive refinements due to their conformal regularity requirements. Further, the enrichment functions for adaptive refinements are often not readily available in general applications. This work introduces a novel neural network-enriched Partition of Unity (NN-PU) approach for solving boundary value problems via artificial neural networks with a potential energy-based loss function minimization. The flexibility and adaptivity of the NN function space are utilized to capture complex solution patterns that the conventional Galerkin methods fail to capture. The NN enrichment is constructed by combining pre-trained feature-encoded NN blocks with an additional untrained NN block. The pre-trained NN blocks learn specific local features during the offline stage, enabling efficient enrichment of the approximation space during the online stage through the Ritz-type energy minimization. The NN enrichment is introduced under the Partition of Unity (PU) framework, ensuring convergence of the proposed method. The proposed NN-PU approximation and feature-encoded transfer learning forms an adaptive approximation framework, termed the neural-refinement (n-refinement), for solving boundary value problems. Demonstrated by solving various elasticity problems, the proposed method offers accurate solutions while notably reducing the computational cost compared to the conventional adaptive refinement in the mesh-based methods.
Battery-Swapping Multi-Agent System for Sustained Operation of Large Planetary Fleets
Holand, Ethan, Homer, Jarrod, Storrer, Alex, Khandeker, Musheeera, Muhlon, Ethan F., Patel, Maulik, Vainqueur, Ben-oni, Antaki, David, Cooke, Naomi, Wilson, Chloe, Shafai, Bahram, Hanson, Nathaniel, Padır, Taşkın
We propose a novel, heterogeneous multi-agent architecture that miniaturizes rovers by outsourcing power generation to a central hub. By delegating power generation and distribution functions to this hub, the size, weight, power, and cost (SWAP-C) per rover are reduced, enabling efficient fleet scaling. As these rovers conduct mission tasks around the terrain, the hub charges an array of replacement battery modules. When a rover requires charging, it returns to the hub to initiate an autonomous docking sequence and exits with a fully charged battery. This confers an advantage over direct charging methods, such as wireless or wired charging, by replenishing a rover in minutes as opposed to hours, increasing net rover uptime. This work shares an open-source platform developed to demonstrate battery swapping on unknown field terrain. We detail our design methodologies utilized for increasing system reliability, with a focus on optimization, robust mechanical design, and verification. Optimization of the system is discussed, including the design of passive guide rails through simulation-based optimization methods which increase the valid docking configuration space by 258%. The full system was evaluated during integrated testing, where an average servicing time of 98 seconds was achieved on surfaces with a gradient up to 10{\deg}. We conclude by briefly proposing flight considerations for advancing the system toward a space-ready design. In sum, this prototype represents a proof of concept for autonomous docking and battery transfer on field terrain, advancing its Technology Readiness Level (TRL) from 1 to 3.
"Paraphrasing The Original Text" Makes High Accuracy Long-Context QA
However, currently no fine-tuning method on open-source datasets has achieved an LLM with Most open-source generative language models satisfactory long-context performance, and while refining the currently have a context window of no more than 4k, form of prompt may bring improvements to powerful LLMs limiting their ability when facing long text. Many [6], it may not work for those whose inherent long-context previous efforts have tried to extend the context ability is relatively weak. With this background, our research window of models, but their actual effects have focuses primarily on enhancing inherent long-context been found to be very limited. To address this issue, capabilities of LLM through lightweight fine-tuning on a we theoretically analyze the effectiveness of the low-cost constructed dataset, without specifically long-context training data and find that long-context designing the input format, significantly modifying the training requires "effective" data rather than simply model's structure, increasing its parameter scale or "long" data, which is rarely noticed in previous constructing expensive, labor-intensive and proprietary studies. Thus, we propose adding "original text datasets.
Diffusion-Based Speech Enhancement in Matched and Mismatched Conditions Using a Heun-Based Sampler
Gonzalez, Philippe, Tan, Zheng-Hua, Østergaard, Jan, Jensen, Jesper, Alstrøm, Tommy Sonne, May, Tobias
Diffusion models are a new class of generative models that have recently been applied to speech enhancement successfully. Previous works have demonstrated their superior performance in mismatched conditions compared to state-of-the art discriminative models. However, this was investigated with a single database for training and another one for testing, which makes the results highly dependent on the particular databases. Moreover, recent developments from the image generation literature remain largely unexplored for speech enhancement. These include several design aspects of diffusion models, such as the noise schedule or the reverse sampler. In this work, we systematically assess the generalization performance of a diffusion-based speech enhancement model by using multiple speech, noise and binaural room impulse response (BRIR) databases to simulate mismatched acoustic conditions. We also experiment with a noise schedule and a sampler that have not been applied to speech enhancement before. We show that the proposed system substantially benefits from using multiple databases for training, and achieves superior performance compared to state-of-the-art discriminative models in both matched and mismatched conditions. We also show that a Heun-based sampler achieves superior performance at a smaller computational cost compared to a sampler commonly used for speech enhancement.
EDGAR: An Autonomous Driving Research Platform -- From Feature Development to Real-World Application
Karle, Phillip, Betz, Tobias, Bosk, Marcin, Fent, Felix, Gehrke, Nils, Geisslinger, Maximilian, Gressenbuch, Luis, Hafemann, Philipp, Huber, Sebastian, Hübner, Maximilian, Huch, Sebastian, Kaljavesi, Gemb, Kerbl, Tobias, Kulmer, Dominik, Mascetta, Tobias, Maierhofer, Sebastian, Pfab, Florian, Rezabek, Filip, Rivera, Esteban, Sagmeister, Simon, Seidlitz, Leander, Sauerbeck, Florian, Tahiraj, Ilir, Trauth, Rainer, Uhlemann, Nico, Würsching, Gerald, Zarrouki, Baha, Althoff, Matthias, Betz, Johannes, Bengler, Klaus, Carle, Georg, Diermeyer, Frank, Ott, Jörg, Lienkamp, Markus
While current research and development of autonomous driving primarily focuses on developing new features and algorithms, the transfer from isolated software components into an entire software stack has been covered sparsely. Besides that, due to the complexity of autonomous software stacks and public road traffic, the optimal validation of entire stacks is an open research problem. Our paper focuses on these two aspects. We present our autonomous research vehicle EDGAR and its digital twin, a detailed virtual duplication of the vehicle. While the vehicle's setup is closely related to the state of the art, its virtual duplication is a valuable contribution as it is crucial for a consistent validation process from simulation to real-world tests. In addition, different development teams can work with the same model, making integration and testing of software stacks much easier, significantly accelerating the development process. The real and virtual vehicles are embedded in a comprehensive development environment, which is also introduced. All parameters of the digital twin are provided open-source at https://github.com/TUMFTM/edgar
Iran announces strikes in northern Iraq, Syria
Fox News Flash top headlines are here. Check out what's clicking on Foxnews.com. Iran announced late Monday that it had launched strikes against a "spy headquarters and the gathering of anti-Iranian terrorist groups" shortly after missiles hit an area near the U.S. consulate in Irbil, the seat of Iraq's semi-autonomous Kurdish region. Soon after, a statement from Iran's Revolutionary Guards on state media said it had struck "terrorist operations" including Islamic State targets in Syria "and destroyed them by firing a number of ballistic missiles." Another statement claimed that it had hit a headquarters of Mossad, the Israeli intelligence agency, in the Kurdish region of Iraq.
OpenAI won't let politicians use its tech for campaigning, for now
The company, which makes the popular ChatGPT chatbot, DALL-E image generator and provides AI technology to many companies, including Microsoft, said in a Monday blog post that it wouldn't allow people to use its tech to build applications for political campaigns and lobbying, to discourage people from voting or spread misinformation about the voting process. OpenAI said it would also begin putting embedded watermarks -- a tool to detect AI-created photographs -- into images made with its DALL-E image-generator "early this year."