DHDean Frederick Hougen

Dean Frederick Hougen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Dean Frederick Hougen has a total of 124 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Agentic Continual Adaptation: Enabling Lifelong Learning in Wireless Channel Estimation

    by Ahsan Bilal, Muhammad Ahmed Mohsin, Muhammad Umer, Muhammad Ali Jamshed, Ayesha Mohsin, John M. Cioffi, Dean F. Hougen

    As wireless networks evolve toward 6G and beyond, deep learning-based channel estimators face a fundamental challenge: their performance degrades when operating conditions deviate from training distributions. This phenomenon, known as distribution shift, manifests through temporal non-stationarity due to user mobility and operational regime changes across varying signal-to-noise ratios (SNR). Traditional sequential training approaches suffer from catastrophic forgetting, where adaptation to new conditions erases previously learned knowledge. This article introduces Agentic Continual Adaptation (ACA), a framework that formulates continual learning as reinforcement-based sequential decision-making to enable continuous adaptation without forgetting. ACA integrates three synergistic mechanisms: an anchor memory that detects forgetting in real-time through continuous performance monitoring on representative samples, a Reinforcement Learning (RL) agent that dynamically selects from seven adaptation strategies balancing plasticity and stability, and a forgetting-aware rollback mechanism that rejects parameter updates exceeding adaptive degradation thresholds. Experimental evaluation across ten SNR regimes demonstrates 4.3% average improvement in channel estimation accuracy with peak gains of 13.6% at challenging low-SNR conditions, while triggering rollback on only 7.5% of parameter updates. This work provides a practical framework for continual adaptation in next-generation wireless networks, addressing an important part of the gap between laboratory performance and real-world deployment.

  • Open Access

    Evolving Multi-Channel Confidence-Aware Activation Functions for Missing Data with Channel Propagation

    by Naeem Shahabi Sani, Ferial Najiantabriz, Shayan Shafaei, Dean Hougen

    Learning in the presence of missing data can result in biased predictions and poor generalizability, among other difficulties, which data imputation methods only partially address. In neural networks, activation functions significantly affect performance, yet typical options (e.g., ReLU, Swish) operate only on feature values and do not account for missingness indicators or confidence scores. We propose Three-Channel Evolved Activations (3C-EA), which we evolve using Genetic Programming to produce multivariate activation functions f(x, m, c) in the form of trees that take (i) the feature value x, (ii) a missingness indicator m, and (iii) an imputation confidence score c. To make these activations useful beyond the input layer, we introduce ChannelProp, an algorithm that deterministically propagates missingness and confidence values via linear layers based on weight magnitudes, retaining reliability signals throughout the network. We evaluate 3C-EA and ChannelProp on datasets with natural and injected (Missing Completely at Random, Missing at Random, and Missing Not at Random) missingness at multiple rates under identical preprocessing and splits. Results indicate that integrating missingness and confidence inputs into the activation search improves classification performance under missingness.

  • Open Access

    Real-Time Breath Diagnostics: Linking Molecular Pathways, Measurement Technologies, and Clinical Translation

    by Velmurugan Thavasi, Nirmal Choradia, Naoko Takebe, Neal Naito, Susan Yeyeodu, Peter William Sadler, Dean Hougen, Sanchith Velmurugan, Jordan P. Metcalf, Donna L. Tyungu, et al.

    Diagnostic latency limits time-sensitive care and early detection, and exhaled breath provides a rapid, repeatable window into metabolic and inflammatory chemistry. We review real-time breath sampling and analytical technologies and evaluate their readiness for clinical adoption, with emphasis on molecular pathways reflected in the breath volatilome and in exhaled breath condensate. Real-time mass spectrometry enables kinetic VOC profiling and targeted quantification, while humidity-aware sensors and wearable condensate platforms extend monitoring beyond the laboratory. Pathway-anchored interpretation links breath readouts to ketone handling, isoprenoid metabolism, nitric oxide signaling, lipid peroxidation, uremic nitrogen handling, and microbiome–host co-metabolism, but performance remains vulnerable to confounding, drift, and non-representative comparators. Translation requires standardized breath fraction control, traceable features, robust quality systems, and governed device algorithm stacks so that breath outputs inform decisions and outcomes.

  • Open Access

    OH-MEMA: An Integrated One Health Mixed-Effects Modeling Approach for Syndromic Surveillance

    by Aseel Basheer, Parisa Masnadi Khiabani, Wolfgang Jentner, Aaron Wendelboe, Jason R. Vogel, Katrin Gaardbo Kuhn, Michael C. Wimberly, Dean Hougen, David Ebert

    Background/Objectives: Integrating heterogeneous One Health time series into transparent and usable surveillance workflows remains difficult because data preparation, modeling, and interpretation are often separated across tools. In this paper, we introduce OH-MEMA (One Health Mixed-Effects Modeling and Analytics), an interactive visual analytics framework that integrates heterogeneous One Health data streams, including human clinical outcomes, environmental factors, and wastewater surveillance data, to support syndromic surveillance and pandemic preparedness. Methods: The system enables users to upload and analyze multi-source datasets through an interactive web-based interface. The modeling component supports fixed effects for multi-source predictors, random effects for spatial, temporal, and demographic grouping variables, optional random slopes, and rolling time-series validation. Model results are visualized as time series comparing observed and predicted outcomes, with evaluation metrics including Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and correlation. To support iterative exploration, the system incorporates analytic provenance through a visual model tree that records prior configurations. Results: OH-MEMA was validated through both quantitative and qualitative evaluations. Quantitatively, mixed-effects models were assessed across multiple counties and outcomes using RMSE, MAE, and correlation, demonstrating robust predictive performance. Qualitatively, expert users, including epidemiologists and disease surveillance analysts, evaluated the system using the NASA Task Load Index and open-ended interviews, indicating improved interpretability, manageable cognitive workload, and effective workflow integration. Conclusions: OH-MEMA provides an interpretable, human-in-the-loop platform for exploratory forecasting and comparative model analysis in syndromic surveillance. The framework effectively bridges data integration, modeling, and interpretation, supporting user-centered analytical reasoning and decision-making in One Health applications.


  • Open Access

    Real-Time Breath Diagnostics: Linking Molecular Pathways, Measurement Technologies, and Clinical Translation

    by Velmurugan Thavasi, Nirmal Choradia, Naoko Takebe, Neal Naito, Susan Yeyeodu, Peter W. Sadler, Dean Hougen, Sanchith Velmurugan, Jordan P. Metcalf, Donna L. Tyungu, et al.

    Diagnostic latency limits time-sensitive care and early detection, and exhaled breath provides a rapid, repeatable window into metabolic and inflammatory chemistry. We review real-time breath sampling and analytical technologies and evaluate their readiness for clinical adoption, with emphasis on molecular pathways reflected in the breath volatilome and in exhaled breath condensate. Real-time mass spectrometry enables kinetic VOC profiling and targeted quantification, while humidity-aware sensors and wearable condensate platforms extend monitoring beyond the laboratory. Pathway-anchored interpretation links breath readouts to ketone handling, isoprenoid metabolism, nitric oxide signaling, lipid peroxidation, uremic nitrogen handling, and microbiome-host co-metabolism, but performance remains vulnerable to confounding, drift, and non-representative comparators. Translation requires standardized breath fraction control, traceable features, robust quality systems, and governed device algorithm stacks so that breath outputs change decisions and outcomes.

  • Open Access

    SR4-Fit: An Interpretable and Informative Classification Algorithm Applied to Prediction of U.S. House of Representatives Elections

    by Shyam Sundar Murali Krishnan, Dean Frederick Hougen

    The growth of machine learning demands interpretable models for critical applications, yet most high-performing models are ``black-box'' systems that obscure input-output relationships, while traditional rule-based algorithms like RuleFit suffer from a lack of predictive power and instability despite their simplicity. This motivated our development of Sparse Relaxed Regularized Regression Rule-Fit (SR4-Fit), a novel interpretable classification algorithm that addresses these limitations while maintaining superior classification performance. Using demographic characteristics of U.S. congressional districts from the Census Bureau's American Community Survey, we demonstrate that SR4-Fit can predict House election party outcomes with unprecedented accuracy and interpretability. Our results show that while the majority party remains the strongest predictor, SR4-Fit has revealed intrinsic combinations of demographic factors that affect prediction outcomes that were unable to be interpreted in black-box algorithms such as random forests. The SR4-Fit algorithm surpasses both black-box models and existing interpretable rule-based algorithms such as RuleFit with respect to accuracy, simplicity, and robustness, generating stable and interpretable rule sets while maintaining superior predictive performance, thus addressing the traditional trade-off between model interpretability and predictive capability in electoral forecasting. To further validate SR4-Fit's performance, we also apply it to six additional publicly available classification datasets, like the breast cancer, Ecoli, page blocks, Pima Indians, vehicle, and yeast datasets, and find similar results.

  • Open Access

    MAGIC-MASK: Multi-Agent Guided Inter-Agent Collaboration with Mask-Based Explainability for Reinforcement Learning

    by Maisha Maliha, Dean Hougen

    Understanding the decision-making process of Deep Reinforcement Learning agents remains a key challenge for deploying these systems in safety-critical and multi-agent environments. While prior explainability methods like StateMask, have advanced the identification of critical states, they remain limited by computational cost, exploration coverage, and lack of adaptation to multi-agent settings. To overcome these limitations, we propose a mathematically grounded framework, MAGIC-MASK (Multi-Agent Guided Inter-agent Collaboration with Mask-Based Explainability for Reinforcement Learning), that extends perturbation-based explanation to Multi-Agent Reinforcement Learning. Our method integrates Proximal Policy Optimization, adaptive epsilon-greedy exploration, and lightweight inter-agent collaboration to share masked state information and peer experience. This collaboration enables each agent to perform saliency-guided masking and share reward-based insights with peers, reducing the time required for critical state discovery, improving explanation fidelity, and leading to faster and more robust learning. The core novelty of our approach lies in generalizing explainability from single-agent to multi-agent systems through a unified mathematical formalism built on trajectory perturbation, reward fidelity analysis, and Kullback-Leibler divergence regularization. This framework yields localized, interpretable explanations grounded in probabilistic modeling and multi-agent Markov decision processes. We validate our framework on both single-agent and multi-agent benchmarks, including a multi-agent highway driving environment and Google Research Football, demonstrating that MAGIC-MASK consistently outperforms state-of-the-art baselines in fidelity, learning efficiency, and policy robustness while offering interpretable and transferable explanations.

  • Open Access

    Neural Loss Function Evolution for Large-Scale Image Classifier Convolutional Neural Networks

    by Brandon Morgan, Dean Hougen

    For classification, neural networks typically learn by minimizing cross-entropy, but are evaluated and compared using accuracy. This disparity suggests neural loss function search (NLFS), the search for a drop-in replacement loss function of cross-entropy for neural networks. We apply NLFS to image classifier convolutional neural networks. We propose a new search space for NLFS that encourages more diverse loss functions to be explored, and a surrogate function that accurately transfers to large-scale convolutional neural networks. We search the space using regularized evolution, a mutation-only aging genetic algorithm. We transferred the final loss functions across multiple architectures, datasets, and image augmentation techniques to assess generalization. In the end, we discovered three new loss functions, called the NeuroLoss functions, that were able to outperform cross-entropy in terms of a higher mean test accuracy as a simple drop-in replacement loss function across the majority of experiments.


  • Open Access

    Neural Optimizer Equation, Decay Function, and Learning Rate Schedule Joint Evolution

    by Brandon Morgan, Dean Hougen

    A major contributor to the quality of a deep learning model is the selection of the optimizer. We propose a new dual-joint search space in the realm of neural optimizer search (NOS), along with an integrity check, to automate the process of finding deep learning optimizers. Our dual-joint search space simultaneously allows for the optimization of not only the update equation, but also internal decay functions and learning rate schedules for optimizers. We search the space using our proposed mutation-only, particle-based genetic algorithm able to be massively parallelized for our domain-specific problem. We evaluate our candidate optimizers on the CIFAR-10 dataset using a small ConvNet. To assess generalization, the final optimizers were then transferred to large-scale image classification on CIFAR-100 and TinyImageNet, while also being fine-tuned on Flowers102, Cars196, and Caltech101 using EfficientNetV2Small. We found multiple optimizers, learning rate schedules, and Adam variants that outperformed Adam, as well as other standard deep learning optimizers, across the image classification tasks.

  • Open Access

    Evolving Loss Functions for Specific Image Augmentation Techniques

    by Brandon Morgan, Dean Hougen

    Previous work in Neural Loss Function Search (NLFS) has shown a lack of correlation between smaller surrogate functions and large convolutional neural networks with massive regularization. We expand upon this research by revealing another disparity that exists, correlation between different types of image augmentation techniques. We show that different loss functions can perform well on certain image augmentation techniques, while performing poorly on others. We exploit this disparity by performing an evolutionary search on five types of image augmentation techniques in the hopes of finding image augmentation specific loss functions. The best loss functions from each evolution were then taken and transferred to WideResNet-28-10 on CIFAR-10 and CIFAR-100 across each of the five image augmentation techniques. The best from that were then taken and evaluated by fine-tuning EfficientNetV2Small on the CARS, Oxford-Flowers, and Caltech datasets across each of the five image augmentation techniques. Multiple loss functions were found that outperformed cross-entropy across multiple experiments. In the end, we found a single loss function, which we called the inverse bessel logarithm loss, that was able to outperform cross-entropy across the majority of experiments.