Theory and Algorithms Commons^™

Face Value: A Computational Approach To Subjective Impressions Of Faces, Kevin Kpankou

Undergraduate Research Symposium

Various computational models of first impressions have been developed to uncover the mechanisms driving these judgments. However, the implicit notion of a singular ``human'' often overlooks meaningful individual differences in beliefs, attitudes, and associations, as well as culturally grounded group-level constructs. In this paper, we extend Cultural Consensus Theory (CCT) to estimate culturally shared beliefs about faces by incorporating latent constructs structured around interpretable facial features extracted via computer vision algorithms. We apply our model to a large-scale dataset of people’s first impressions of faces. Our approach reveals a robust mapping between facial features and culturally constructed impressions, allowing us …

Establishing Convergence Thresholds For Pre-Trajectory Sampling With Batched Execution Across Random Quantum Circuits, Taylor L. Eskew, Jerome F. Gonthier, Taylor L. Patti, Andrew N. Jordan

Student Scholar Symposium Abstracts and Posters

A crucial aspect of validating quantum protocols is understanding the noise produced by quantum computing devices. Using simulations that can replicate this noise allows for a lower-cost alternative to hardware experiments. Stochastic, so-called "trajectory" methods are often used as a quadratically reduced approximation to density matrix simulations, but traditional implementations have limited sampling capacity and provide no error-based metadata. The Pre-Trajectory Sampling with Batched Execution (PTSBE) [Patti et al., 2025] algorithm provides a solution by combining fine-tuned, well-documented noise sampling with computational intermediate caching.

While the original work is effective on quantum error correction circuits, its performance on general circuits …

Privacy Preserving-Based Artificial Intelligence For Precision Agriculture, Partha P. Sengupta

Dissertations

The research work finds a solution to precision agriculture of cotton cultivation using artificial intelligence (AI) models. Two sets of model performance based on the application are selected namely a low resource and a high resource setting. This is because using drone surveys to capture images identifying the classes of stressed and unstressed cotton plantation requires limited model architecture and CPU based computation. Thus, traditional AI models were selected for low resource settings. Again, for high computation intensive models like transfer learning-convolution neural network (CNN) based architectures were grouped into high resource settings. There was another issue of class imbalance …

Coupled Machine Learning Models: Combining Observations And Numerical Analysis In A Physics-Regularized Approach, Austin B. Schmidt

LSU New Orleans Theses and Dissertations

This dissertation investigates surrogate modeling for fixed-location environmental forecasting using novel data-combination techniques. The work surveys the landscape of observational measurements and numerically generated data, identifying similar research and gaps in current methodologies. The ratio-coupled training framework is introduced to combine two data sources per predicted feature through a tunable parameter that weights training signal strength. An optimization scheme is developed to simultaneously tune surrogate weights and the coupled signal ratio, allowing relative influence between signals to act as an explicit regularizer. Three case studies demonstrate the methodology and approach in a variety of contexts. The first study is based …

Universal Systems Simulation Via Constraint Hypergraphs With Applications To Digital Twins, John Morris

All Dissertations

The characterization of systems encompasses a variety of modeling frameworks designed to capture specific behaviors and components of various system domains. Whatever the framework, the core elements of a system representation are the information of the system and a description of how that information is related. The relations in deterministic systems are functions, which, when composed to form executable processes, can be used to simulate system data. A declarative modeling framework is one that encodes mechanisms for preparing these simulations within the model structure, allowing an external agent to form the execution processes required for a given context. To date, …

Topic Modeling And Culturomic Analysis Of 30,000 Books Over 100 Years Using Gensim, Michael A. Freeman

Electronic Theses and Dissertations

This thesis explores the cultural influence of historical events on English-language fiction published between 1820 and 1929. Using a corpus of 30,256 digitized books from Project Gutenberg, Latent Dirichlet Allocation (LDA) topic modeling was applied to identify recurring themes across eleven decades. The study sought to determine whether historically significant events could be detected within fictional narratives. One clear instance emerged: Napoleon Bonaparte and the Napoleonic Wars appeared explicitly in the 1820s corpus. Beyond this, several thematic patterns were observed—such as maritime language in the 1840s, national identity in the 1880s, and youth-oriented dialogue in the early 20th century—that plausibly …

Island-Based Evolutionary Computation With Diverse Surrogates And Adaptive Knowledge Transfer For High-Dimensional Data-Driven Optimization, Xianrong Zhang, Yuejiao Gong, Zhiguang Cao, Jun Zhang

Research Collection School Of Computing and Information Systems

In recent years, there has been a growing interest in data-driven evolutionary algorithms (DDEAs) employing surrogate models to approximate the objective functions with limited data. However, current DDEAs are primarily designed for lower-dimensional problems and their performance drops significantly when applied to large-scale optimization problems (LSOPs). To address the challenge, this paper proposes an offline DDEA named DSKT-DDEA. DSKT-DDEA leverages multiple islands that utilize different data to establish diverse surrogate models, fostering diverse subpopulations and mitigating the risk of premature convergence. In the intra-island optimization phase, a semi-supervised learning method is devised to fine-tune the surrogates. It not only facilitates …

Navigating Ai-Nature Frictions: Autonomous Vehicle Testing And Nature-Based Constraints, Prerona Das, Orlando Woods, Lily Kong

Research Collection College of Integrative Studies

In cities, the application of Artificial Intelligence (AI) is being directed towards transforming different aspects of urban life. These applications take material form in urban spaces, with autonomous vehicles (AVs) providing a prominent example. AI systems rely on large volumes of data on their surroundings to refine the algorithms and enhance the accuracy of prediction for operational efficiency and safety. However, such algorithmic learning and execution can present challenges when dealing with the unpredictable, complex, and dynamic aspects of urban spaces. Nature is a paradigmatic example of such unpredictability, because natural phenomena usually defy consistent patterns and precise data-based modelling. …

Detection Of Phase-Binning And Interpolation Artifacts In 4-Dimensional Computed Tomography Imaging Using Deep Learning And Rule-Based Approaches, Jorge Cisneros, Nathan H. Feldt, Yevgeniy Vinogradskiy, Richard Castillo, Edward Castillo

Department of Radiation Oncology Faculty Papers

BACKGROUND: Four-dimensional computed tomography (4DCT) imaging is a crucial component to lung cancer radiotherapy planning and enables CT-ventilation-based functional avoidance planning to mitigate radiation toxicity. However, 4DCT scans are frequently impaired by acquisition artifacts that corrupt downstream analyses that depend on lung segmentation and deformable image registration, such as CT-ventilation and dose accumulation.

PURPOSE: This study develops 3D deep learning models to identify phase-binning artifacts at the voxel level and a heuristic, rule-based method to identify interpolation slices within 4DCT images.

METHODS: We introduce a generator that systematically inserts synthetic phase-binning and interpolation artifacts into any artifact-free breathing phase obtained …

A Rate-Dependent Coreset Selector For Continual Learning On Time-Varying Data Distributions, Zilin Luo, Zichen Tian, Yaoyao Liu, Qianru Sun

Research Collection School Of Computing and Information Systems

In this paper we review the concept of “phase” defined in Class-Incremental Learning (CIL), i.e., learning new classes while not forgetting old ones. Due to this design, classic CIL algorithms are mostly offline or can handle only intensive data distribution shifts across the phases. However, real-world data streams are often online, usually with uncertain or untraceable changes in their data distributions. To this end, we design the per-step distribution shifts by modeling the class sampling weights using bell-shaped curves. Such a design respects the rise-and-fall nature and presents realistic but underexplored challenges for CIL: 1) The data non-stationarity across steps …

Spatio-Temporal Gcn With Softmax Classifier For Skeleton-Based Human Action Recognition, Kabul Khudaybergenov, Avazjon Marakhimov, Zahriddin Muminov

Chemical Technology, Control and Management

Skeleton-based human action recognition is an important research area with many practical applications. Most existing methods rely on single representations of skeletal sequences, which cannot totally obtain all the complex features of human movements. This paper presents LFHAR (Latent Features for Human Action Recognition), a new framework that uses multiple spatio-temporal latent representations to improve the extraction of action features. Our method captures how skeletal poses change over time and combines motion information from both individual joints and connected body parts. The proposed approach applies graph-based processing to each skeleton frame in a sequence, then arranges the resulting graph features …

Branch-And-Cut-And-Price For Agile Earth Observation Satellite Scheduling, Guansheng Peng, Jianjiang Wang, Guopeng Song, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The Agile Earth Observation Satellite scheduling selects and sequences satellite observations of possible targets on the Earth’s surface, each with a specific profit and multiple time windows. The objective is to maximize the collected profit of all observations completed under some operational constraints. The problem can be modeled as a variant of the Team Orienteering Problem with Time Windows (TOPTW). The key differences with the regular TOPTW are twofold: first, a time-dependent transition time is required for each pair of consecutive observations to adjust the camera’s look angles. Second, the time windows of each target vary during different observation cycles, …

Attorneys And Ai: How Lawyers Use Artificial Intelligence And Analyze Its Impacts, Matthew I. Hall, Christian Turner, Eddie A. Gomez Schieber, Nathaniel Kite, Ari Schlesinger

Scholarly Works

AI systems are testing lawyers' professional ethics obligations of competence, confidentiality, and candor. In the legal profession, the widespread availability of AI systems presents opportunities, like improving the review of documents during the discovery stage of a lawsuit, and challenges, illustrated by the handful of high-profile incidents where lawyers submitted legal briefs in court citing and describing fictitious cases based on AI-generated output. We conducted interviews with 44 legal professionals in the U.S. to understand how attorneys are making sense of AI technology and the impacts these technologies are having on their profession, legal ethics, and legal institutions. We describe …

Csc36000 - Modern Distributed Computing Assignment, Saptarashmi Bandyopadhyay

Open Educational Resources

This assignment covers standard performance metrics for Distributed Systems and the basics of Multiprocessing for CSC36000 - Modern Distributed Computing at the City College of New York CUNY. It is an interactive coding assignment intended to be executed in a Python notebook.

Classical Shadows With Improved Median-Of-Means Estimation, Winston Fu, Dax Enshan Koh, Siong Thye Goh, Jian Feng Kong

Research Collection School Of Computing and Information Systems

The classical shadows protocol, introduced by Huang et al (2020 Nat. Phys. 16 1050), makes use of the median-of-means (MoM) estimator to efficiently estimate the expectation values of M observables with failure probability δ using only O ( log ⁡ ( M / δ ) ) measurements. In their analysis, Huang et al used loose constants in their asymptotic performance bounds for simplicity. However, the specific values of these constants can significantly affect the number of shots used in practical implementations. To address this, we studied a modified MoM estimator proposed by Minsker (2023 Proc. 36th Conf. on Learning Theory …

Search Trajectory Network-Enhanced Multi-Objective Dynamic Algorithm Configuration, Robbert Reijnen, Zaharah Bukhsh, Hoong Chuin Lau, Yaoxin Wu, Yingqian Zhang

Research Collection School Of Computing and Information Systems

Deep reinforcement learning (DRL) has emerged as an effective technique for dynamic algorithm configuration, particularly in evolutionary computation, enabling adaptive parameter updates during algorithmic execution. DRL-based methods have shown broad applicability across different problem domains and are designed to configure algorithms without problem-specific information, making them highly transferable across problem variants and scalable to different problem sizes. This paper proposes a novel graph neural network-based approach that learns representations of Search Trajectory Networks (STNs) to track the convergence behavior of multiple objectives and dynamically reconfigures multiobjective evolutionary algorithms during execution. By capturing how solutions evolve and interact over time, the …

Heuristic Weight Initialization For Transfer Learning In Classification Problems, Musulmon Lolaev, Anand Paul, Jeonghong Kim

School of Public Health Faculty Publications

Transfer learning is the predominant method for adapting pre-trained models on another task to new domains while preserving their internal architectures and augmenting them with requisite layers in Deep Neural Network models. Training intricate pre-trained models on a sizable dataset requires significant resources to fine-tune hyperparameters carefully. Most existing initialization methods mainly focus on gradient flow-related problems, such as gradient vanishing or exploding, or other existing approaches that require extra models that do not consider our setting, which is more practical. To address these problems, we suggest employing gradient-free heuristic methods to initialize the weights of the final new-added fully …

Federated Boolean Matrix Factorization Using Integer Programming, Quynh Anh Nguyen, Ngoc Nguyen, Nhat Phan

Research from the Berry Summer Thesis Institute, 2025

Identifying the underlying structural patterns in data and extracting meaningful insights is a key challenge in data analysis. One effective approach to this problem is matrix factorization (MF), which approximates large matrices with lower-dimensional representations, making it effective for uncovering hidden patterns. MF techniques are widely applicable across various domains, such as recommender systems, cancer genomics, system identification, clustering, and image processing. Despite their effectiveness, existing MF methods often struggle with computational constraints and convergence challenges when tackling large-scale, nonsmooth, and nonconvex optimization problems, which are common in real-world applications.

This project aims to explore both the theoretical understanding and …

Solving Two-Stage Stochastic Integer Programs Via Representation Learning, Yaoxin Wu, Zhiguang Cao, Wen Song, Yingqian Zhang

Research Collection School Of Computing and Information Systems

Solving stochastic integer programs (SIPs) is extremely intractable due to the high computational complexity. To solve two-stage SIPs efficiently, we propose a conditional variational autoencoder (CVAE) for scenario representation learning. A graph convolutional network (GCN) based VAE embeds scenarios into a low-dimensional latent space, conditioned on the deterministic context of each instance. With the latent representations of stochastic scenarios, we perform two auxiliary tasks: objective prediction and scenario contrast, which predict scenario objective values and the similarities between them, respectively. These tasks further integrate objective information into the representations through gradient backpropagation. Experiments show that the learned scenario representations can …

Optimal Hypergraph Connectivity With Cut Queries, Hang Liao

Dartmouth College Ph.D Dissertations

Finding connected components in undirected hypergraphs—hypergraph connectivity—is a fundamental problem in computer science. It can be framed as a special case of Symmetric Submodular Function Minimization (SSFM), where the objective is to determine if the non-trivial minimizer is zero. This thesis develops an optimal algorithm for hypergraph connectivity within the $\CUT$ query model, where an algorithm probes a subset of vertices to learn the weight of the hyperedges ``cut" by that partition.

Our approach is constructive, culminating in an optimal algorithm for the general problem by first developing the necessary tools for two foundational subproblems. The main contributions of this …

Non-Homophilic Graph Pre-Training And Prompt Learning, Xingtong Yu, Jie Zhang, Yuan Fang, Renhe Jiang

Research Collection School Of Computing and Information Systems

Graphs are ubiquitous for modeling complex relationships between objects across various fields. Graph neural networks (GNNs) have become a mainstream technique for graph-based applications, but their performance heavily relies on abundant labeled data. To reduce labeling requirement, pre-training and prompt learning has become a popular alternative. However, most existing prompt methods do not distinguish between homophilic and heterophilic characteristics in graphs. In particular, many real-world graphs are non-homophilic-neither strictly nor uniformly homophilic-as they exhibit varying homophilic and heterophilic patterns across graphs and nodes. In this paper, we propose ProNoG, a novel pre-training and prompt learning framework for such non-homophilic graphs. …

Optimizing Group Utility In Itinerary Planning: A Strategic And Crowd-Aware Approach, Junhua Liu, Aldy Gunawan, Kristin L. Wood, Kwan Hui Lim

Research Collection School Of Computing and Information Systems

Itinerary recommendation is a complex sequence prediction problem with numerous practical applications. The task becomes significantly more challenging when optimizing multiple factors simultaneously, such as user queuing times, crowd levels, attraction popularity, walking durations, and operating hours. These factors, combined with the dynamic and unpredictable nature of visitor flow, introduce substantial complexities, particularly when accounting for collective user behavior. Existing solutions often adopt a single-user perspective, overlooking critical challenges arising from natural crowd dynamics. For example, the Selfish Routing problem illustrates how individual decision-making can lead to suboptimal outcomes for the group as a whole. To address these challenges, we …

Advancing Real-World Implementation Of The Well Optimized Linear Finder (Wolf) High-Speed Atmospheric Turbulence Compensation Method, Timothy Evan Coon

Theses and Dissertations

This dissertation advances the real-world implementation of the Well Optimized Linear Finder (WOLF) method for high-speed Atmospheric Turbulence Compensation (ATC). Atmospheric turbulence introduces phase aberrations into optical wavefronts and degrades image quality in terrestrial imaging systems. Traditional phase diversity methods are computationally intensive and poorly suited to real-time operation. The WOLF method addresses these limitations through a novel, point-wise formulation of the optical transfer function (OTF) as a structured autocorrelation of the generalized pupil function (GPF). This formulation enables the estimation of phase aberrations at individual spatial coordinates with distributed computational complexity.

The research begins by developing a MATLAB-based simulation …

Three Essays In The Economics Of Disagreements: Incentives, Measurement And Persistence, Mustafa W. Alam

All Dissertations

This dissertation presents three chapters that contribute to the study of economic forces shaping disagreements in society.

In Chapter 1, I demonstrate that political polarization can intensify due to innovations in the information market even if a population's ideological distribution is fixed. Viewership-maximizing news firms cater to a diverse audience who assess source accuracy using noisy private signals that vary in precision and ideological bias. If better-informed consumers disproportionately migrate to newer platforms for news (e.g., the Internet), traditional media firms increase news slant to appeal more to less-informed partisans on both sides of the ideological spectrum. This leads to …

L3net: Localized And Layered Reparameterization For Incremental Learning, Xuandi Luo, Huaidong Zhang, Yi Xie, Hongrui Zhang, Xuemiao Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

Model-based class incremental learning (CIL) methods aim to address the challenge of catastrophic forgetting by retaining certain parameters and expanding the model architecture. However, retaining too many parameters can lead to an overly complex model, increasing inference overhead. Additionally, compressing these parameters to reduce the model size can result in performance degradation. To tackle these challenges, we propose a novel three-stage CIL framework called Localized and Layered Reparameterization for Incremental Learning (L3Net). The rationale behind our approach is to balance model complexity and performance by selectively expanding and optimizing critical components. Specifically, the framework introduces a Localized Dual-path Expansion structure, …

Algebraic Multigrid Methods For Nonsymmetric And Indefinite Problems: Theory And Applications, Ahsan Ali

Mathematics & Statistics ETDs

Algebraic multigrid (AMG) is a well-established and highly efficient solver for symmetric positive definite (SPD) systems arising from elliptic and parabolic PDEs, while nonsymmetric systems from hyperbolic PDEs remain a significant challenge. This dissertation develops AMG methods and theory for nonsymmetric problems. First, we develop a novel approach combining mode constraints from energy-minimization AMG with local approximations of ideal restriction in $\ell$AIR, resulting in constrained $\ell$AIR (C$\ell$AIR), which demonstrates scalable convergence across advective and diffusive problems. Second, we extend optimal AMG theory by deriving spectral radius estimates for the two-grid error transfer operator using matrix-induced orthogonality, enabling convergence predictions for …

Pure And Strong Nash Equilibrium Computation In Compactly Representable Aggregate Games, Jared Soundy, Mohammad T. Irfan, Hau Chan

Research & Publications

Aggregate games model interdependent decision making when an agent’s utility depends on their own choice and the aggregation of everyone's choices. We define a compactly representable subclass of aggregate games we call additive aggregate games, which encompasses popular games like congestion games, anonymous games, Schelling games, etc. We study computational questions on pure Nash equilibrium (PNE) and pure strong Nash equilibrium (SNE). We show that PNE existence is NP-complete for very simple cases of additive aggregate games. We devise an efficient algorithmic scheme for deciding the existence of a PNE and computing one (if it exists) for bounded aggregate space. …

Syntax-Enhanced Boundary-Aware Named Entity Recognition Model, Chuanming Yu, Bin Deng, Zhengang Zhang

Journal of Scientific Information Research

[Purpose/significance] This study addresses the issue of inadequate perception of entity boundaries in traditional character-level modeling-based named entity recognition models by integrating syntax information containing entity boundary features into the task using a multi-head graph attention network with dense connections. This integration enhances the effectiveness of named entity recognition.

[Method/process] This study proposes a Syntax-enhanced Boundary-aware Named Entity Recognition Model (SynBNER), which utilizes BERT for text semantic representation and integrates syntax information using a dense-connected graph attention network. This integration incorporates implicit entity boundary information from syntax information into word representations, thereby enhancing the model's entity boundary perception capability.

[Result/conclusion] …

Multi-Label Classification Of Acoustic And Electronic Drum Sounds Using Machine Learning, Sean Perman

Electronic Theses and Dissertations

This paper presents a system for multi-class classification of drum sounds using audio signal processing and machine learning techniques. The project utilizes a diverse dataset of both acoustic and electronic drum samples and extracts ten distinct audio features to capture the timbral and temporal characteristics of each sound. The methodology includes signal preprocessing, feature extraction, and the application of supervised classification algorithms to distinguish between multiple drum classes. Experimental evaluations demonstrate that the selected features significantly enhance classification accuracy across a varied dataset. These findings underscore the effectiveness of combining traditional audio processing with modern machine learning, offering promising applications …

Optimizing Option Market Clearing, Juan Andrés Malaver Alvarado

Electronic Theses and Dissertations

Modern options markets clear each strike in isolation, leaving cross-strike arbitrage unexploited. This thesis applies a payoff-dominant clearing mechanism to realized trades—roughly 2 000 Cboe VIX option executions from June–November 2016—after classifying each trade’s side and bundling by expiration. Three optimization formulations are tested: a fractional linear program (LP), a mixed-integer LP, and a pure integer program. On a 10-core laptop every bundle solves in < 0.5 s. The LP captures the greatest surplus, yet the integer models recover nearly as much while filling whole contracts and holding only modest margin. Results reveal persistent, albeit small, inefficiencies in executed trades and demonstrate that an integral cross-strike auction could operate in real time. The accompanying C/Gurobi code is modular and readily extendable to early-exercise options. Trade-level evidence thus supports redesigning exchange clearing to consider the complete option book.