Goto

Collaborating Authors

 Greene County


Classical AI vs. LLMs for Decision-Maker Alignment in Health Insurance Choices

Mainali, Mallika, Sureshbabu, Harsha, Sen, Anik, Rauch, Christopher B., Reifsnyder, Noah D., Meyer, John, Turner, J. T., Floyd, Michael W., Molineaux, Matthew, Weber, Rosina O.

arXiv.org Artificial Intelligence

As algorithmic decision-makers are increasingly applied to high-stakes domains, AI alignment research has evolved from a focus on universal value alignment to context-specific approaches that account for decision-maker attributes. Prior work on Decision-Maker Alignment (DMA) has explored two primary strategies: (1) classical AI methods integrating case-based reasoning, Bayesian reasoning, and naturalistic decision-making, and (2) large language model (LLM)-based methods leveraging prompt engineering. While both approaches have shown promise in limited domains such as medical triage, their generalizability to novel contexts remains underexplored. In this work, we implement a prior classical AI model and develop an LLM-based algorithmic decision-maker evaluated using a large reasoning model (GPT -5) and a non-reasoning model (GPT -4) with weighted self-consistency under a zero-shot prompting framework, as proposed in recent literature. We evaluate both approaches on a health insurance decision-making dataset annotated for three target decision-makers with varying levels of risk tolerance (0.0, 0.5, 1.0). In the experiments reported herein, classical AI and LLM-based models achieved comparable alignment with attribute-based targets, with classical AI exhibiting slightly better alignment for a moderate risk profile.


$O(p \log d)$ Subgraph Isomorphism using Stigmergic Swarming Agents

Parunak, H. Van Dyke

arXiv.org Artificial Intelligence

Subgraph isomorphism compares two graphs (sets of nodes joined by edges) to determine whether they contain a common subgraph. Many applications require identifying the subgraph, not just deciding its existence. A particularly common use case, using graphs with labeled nodes, seeks to find instances of a smaller pattern graph with $p$ nodes in the larger data graph with $d$ nodes. The problem is NP-complete, so that naïve solutions are exponential in $p + d$. A wide range of heuristics have been proposed, with the best complexity $O(p^2d^2)$. This paper outlines ASSIST (Approximate Swarming Subgraph Isomorphism through Stigmergy), inspired by the ant colony optimization approach to the traveling salesperson problem. ASSIST is linearithmic, $O(p \log d)$, and also supports matching problems (such as temporally ordered edges, inexact matches, and missing nodes or edges in the data graph) that frustrate other heuristics.


Investigating the Impact of Observation Space Design Choices On Training Reinforcement Learning Solutions for Spacecraft Problems

Hamilton, Nathaniel, Dunlap, Kyle, Hobbs, Kerianne L

arXiv.org Artificial Intelligence

AAS 25-147 INVESTIGATING THE IMP ACT OF OBSERVATION SP ACE DESIGN CHOICES ON TRAINING REINFORCEMENT LEARNING SOLUTIONS FOR SP ACECRAFT PROBLEMS Nathaniel Hamilton *, Kyle Dunlap, and Kerianne L. Hobbs Recent research using Reinforcement Learning (RL) to learn autonomous control for spacecraft operations has shown great success. However, a recent study showed their performance could be improved by changing the action space, i.e. control outputs, used in the learning environment. This has opened the door for finding more improvements through further changes to the environment. The work in this paper focuses on how changes to the environment's observation space can impact the training and performance of RL agents learning the spacecraft inspection task. The studies are split into two groups. The first looks at the impact of sensors that were designed to help agents learn the task. The second looks at the impact of reference frames, reorienting the agent to see the world from a different perspective. The results show the sensors are not necessary, but most of them help agents learn more optimal behavior, and that the reference frame does not have a large impact, but is best kept consistent. INTRODUCTION Autonomous spacecraft operation is a critical capability for managing the growing number of space and increasingly complex operations.


Officials respond to drone sighting near major Air Force base in Ohio: 'Taking all appropriate measures'

FOX News

Ocean County, New Jersey Sheriff Michael Mastronardy shares how he launched his own drones to learn more information about the mysterious drones hovering over his state on'Your World.' Government officials have responded to the recent drone sightings near an Air Force base in Ohio on Monday, noting that the incidents appear unrelated to the unusual sightings in the Northeast. The drones were seen near Wright-Patterson Air Force Base in Greene County over the weekend. Following the sightings, the base closed its airspace for four hours on Saturday. According to its website, Wright-Patterson is "headquarters for a vast, worldwide logistics system, a world-class laboratory research function, and is the foremost acquisition and development center in the U.S. Air Force." In a statement to Fox News, Robert Purtiman, Chief of Public Affairs of the 88th Air Base Wing, confirmed that officials were aware of the drones.


Investigating the Impact of Choice on Deep Reinforcement Learning for Space Controls

Hamilton, Nathaniel, Dunlap, Kyle, Hobbs, Kerianne L.

arXiv.org Artificial Intelligence

For many space applications, traditional control methods are often used during operation. However, as the number of space assets continues to grow, autonomous operation can enable rapid development of control methods for different space related tasks. One method of developing autonomous control is Reinforcement Learning (RL), which has become increasingly popular after demonstrating promising performance and success across many complex tasks. While it is common for RL agents to learn bounded continuous control values, this may not be realistic or practical for many space tasks that traditionally prefer an on/off approach for control. This paper analyzes using discrete action spaces, where the agent must choose from a predefined list of actions. The experiments explore how the number of choices provided to the agents affects their measured performance during and after training. This analysis is conducted for an inspection task, where the agent must circumnavigate an object to inspect points on its surface, and a docking task, where the agent must move into proximity of another spacecraft and "dock" with a low relative speed. A common objective of both tasks, and most space tasks in general, is to minimize fuel usage, which motivates the agent to regularly choose an action that uses no fuel. Our results show that a limited number of discrete choices leads to optimal performance for the inspection task, while continuous control leads to optimal performance for the docking task.


Critical Review for One-class Classification: recent advances and the reality behind them

Hayashi, Toshitaka, Cimr, Dalibor, Fujita, Hamido, Cimler, Richard

arXiv.org Artificial Intelligence

This paper offers a comprehensive review of one-class classification (OCC), examining the technologies and methodologies employed in its implementation. It delves into various approaches utilized for OCC across diverse data types, such as feature data, image, video, time series, and others. Through a systematic review, this paper synthesizes promi-nent strategies used in OCC from its inception to its current advance-ments, with a particular emphasis on the promising application. Moreo-ver, the article criticizes the state-of-the-art (SOTA) image anomaly de-tection (AD) algorithms dominating one-class experiments. These algo-rithms include outlier exposure (binary classification) and pretrained model (multi-class classification), conflicting with the fundamental con-cept of learning from one class. Our investigation reveals that the top nine algorithms for one-class CIFAR10 benchmark are not OCC. We ar-gue that binary/multi-class classification algorithms should not be com-pared with OCC.


Accurate Crystal Structure Prediction of New 2D Hybrid Organic Inorganic Perovskites

Karimitari, Nima, Baldwin, William J., Muller, Evan W., Bare, Zachary J. L., Kennedy, W. Joshua, Csányi, Gábor, Sutton, Christopher

arXiv.org Artificial Intelligence

Low dimensional hybrid organic-inorganic perovskites (HOIPs) represent a promising class of electronically active materials for both light absorption and emission. The design space of HOIPs is extremely large, since a diverse space of organic cations can be combined with different inorganic frameworks. This immense design space allows for tunable electronic and mechanical properties, but also necessitates the development of new tools for in silico high throughput analysis of candidate structures. In this work, we present an accurate, efficient, transferable and widely applicable machine learning interatomic potential (MLIP) for predicting the structure of new 2D HOIPs. Using the MACE architecture, an MLIP is trained on 86 diverse experimentally reported HOIP structures. The model is tested on 73 unseen perovskite compositions, and achieves chemical accuracy with respect to the reference electronic structure method. Our model is then combined with a simple random structure search algorithm to predict the structure of hypothetical HOIPs given only the proposed composition. Success is demonstrated by correctly and reliably recovering the crystal structure of a set of experimentally known 2D perovskites. Such a random structure search is impossible with ab initio methods due to the associated computational cost, but is relatively inexpensive with the MACE potential. Finally, the procedure is used to predict the structure formed by a new organic cation with no previously known corresponding perovskite. Laboratory synthesis of the new hybrid perovskite confirms the accuracy of our prediction. This capability, applied at scale, enables efficient screening of thousands of combinations of organic cations and inorganic layers.


VLSI Architectures of Forward Kinematic Processor for Robotics Applications

Roy, Sourav, Paul, Subhadeep, Maiti, Tapas Kumar

arXiv.org Artificial Intelligence

This paper aims to get a comprehensive review of current-day robotic computation technologies at VLSI architecture level. We studied several repots in the domain of robotic processor architecture. In this work, we focused on the forward kinematics architectures which consider CORDIC algorithms, VLSI circuits of WE DSP16 chip, parallel processing and pipelined architecture, and lookup table formula and FPGA processor. This study gives us an understanding of different implementation methods for forward kinematics. Our goal is to develop a forward kinematics processor with FPGA for real-time applications, requires a fast response time and low latency of these devices, useful for industrial automation where the processing speed plays a great role.


Collision Avoidance and Geofencing for Fixed-wing Aircraft with Control Barrier Functions

Molnar, Tamas G., Kannan, Suresh K., Cunningham, James, Dunlap, Kyle, Hobbs, Kerianne L., Ames, Aaron D.

arXiv.org Artificial Intelligence

Safety-critical failures often have fatal consequences in aerospace control. Control systems on aircraft, therefore, must ensure the strict satisfaction of safety constraints, preferably with formal guarantees of safe behavior. This paper establishes the safety-critical control of fixed-wing aircraft in collision avoidance and geofencing tasks. A control framework is developed wherein a run-time assurance (RTA) system modulates the nominal flight controller of the aircraft whenever necessary to prevent it from colliding with other aircraft or crossing a boundary (geofence) in space. The RTA is formulated as a safety filter using control barrier functions (CBFs) with formal guarantees of safe behavior. CBFs are constructed and compared for a nonlinear kinematic fixed-wing aircraft model. The proposed CBF-based controllers showcase the capability of safely executing simultaneous collision avoidance and geofencing, as demonstrated by simulations on the kinematic model and a high-fidelity dynamical model.


Deep Reinforcement Learning for Autonomous Spacecraft Inspection using Illumination

van Wijk, David, Dunlap, Kyle, Majji, Manoranjan, Hobbs, Kerianne L.

arXiv.org Artificial Intelligence

This paper investigates the problem of on-orbit spacecraft inspection using a single free-flying deputy spacecraft, equipped with an optical sensor, whose controller is a neural network control system trained with Reinforcement Learning (RL). This work considers the illumination of the inspected spacecraft (chief) by the Sun in order to incentivize acquisition of well-illuminated optical data. The agent's performance is evaluated through statistically efficient metrics. Results demonstrate that the RL agent is able to inspect all points on the chief successfully, while maximizing illumination on inspected points in a simulated environment, using only low-level actions. Due to the stochastic nature of RL, 10 policies were trained using 10 random seeds to obtain a more holistic measure of agent performance. Over these 10 seeds, the interquartile mean (IQM) percentage of inspected points for the finalized model was 98.82%.