Publications

Our teams aspire to make discoveries that impact everyone, and core to our approach is sharing our research and tools to fuel progress in the field.

people standing in front of a screen with images and a chipboard

Our teams aspire to make discoveries that impact everyone, and core to our approach is sharing our research and tools to fuel progress in the field.

Sort By
  • Title
  • Title, descending
  • Year
  • Year, descending
1 - 15 of 11943 publications
Who’s Doing the Thinking Now? Reflexivity and Oversight in GenAI-Mediated Decision-Making
Oliver Herrbach
Siddharth Gaurav Majhi
Under review with Information Systems Journal (2027) (to appear)
Preview abstract Generative AI (GenAI) is increasingly embedded in organizational decision-making, reshaping how judgment, oversight, and productivity are enacted in everyday work. While prior research documents performance gains from AI assistance, less is known about how sustained GenAI use affects human reflexivity, i.e., the capacity for critical evaluation, deliberation, and decision override in AI-mediated tasks. This study advances Algorithmic Reflexivity Reallocation Theory (ALERT), which theorizes how repeated algorithmic mediation reallocates cognitive effort away from human judgment through cognitive offloading and automation bias, producing a trade-off between productivity and reflexive oversight. We test ALERT using a three-stage mixed-methods design comprising qualitative grounding interviews, a controlled behavioral experiment, and a large-scale survey-based structural equation model. Behavioral results show that GenAI assistance increases task efficiency but reduces override behavior, particularly when recommendations are plausible yet incorrect. Structural modeling further demonstrates that human–AI trust, task familiarity, and algorithmic structuration predict cognitive offloading, which in turn suppresses override behavior and weakens individual reflexivity while increasing perceived productivity. Transparency emerges as a key design condition that mitigates cognitive offloading and preserves evaluative engagement. By theorizing reflexivity as a reallocatable cognitive and organizational resource, ALERT extends structuration and human–AI interaction research by explaining how productivity gains can coexist with the erosion of reflective judgment under sustained GenAI use. The study contributes a process theory of AI-mediated decision-making with implications for the design and governance of AI-supported work systems. View details
A Data-Driven Biophotonic Skin Model for Wearable Sensing
Kaiyuan (Kai) Yao
Hamed Vavadi
Biomedical Optics Express (2027) (to appear)
Preview abstract Accurate modeling of light-matter interactions in biological tissue is fundamental to the advancement of biophotonic sensing, in-vivo diagnostics, and the development of next-generation wearable health monitors. While computational methods such as Monte Carlo simulations are powerful tools for virtual prototyping, the reliability of their predictions is strictly limited by the fidelity of the underlying skin model. Current industry-standard models primarily rely on optical parameters derived from ex-vivo tissue samples or dataset with limited size and variabilities in measurement methods, often failing to capture the complex spectral responses and inter-subject variability found in living populations. To address this limitation, we present a data-driven biophotonic skin model rigorously calibrated and validated against extensive in-vivo dataset. Our study utilizes smartwatch data acquired across a broad spectral range (UV to SWIR) and multiple sensor geometries, with subjects covering a diverse range of skin tones. By grounding the standard multilayer skin architecture in experimental data, this work provides a robust, statistically validated foundation for the design, simulation, and optimization of future wearable optical sensors. View details
A 3D Scene Graphs Survey: Open Challenges and Future Directions
Dennis Rotondi
Francesco Argenziano
Sebastian Koch
Nathan Hughes
Martin Büchner
Johanna Wald
Lukas Schmid
Daniele Nardi
Abhinav Valada
Liam Paul
Luca Carlone
Kai Arras
Annual Review of Control, Robotics, and Autonomous Systems (ARCRAS), 10 (2027) (to appear)
Preview abstract 3D Scene Graphs (3DSGs) have emerged as a powerful representation for spatial AI by combining geometric grounding with semantic and relational abstractions of the environment. Their expressiveness has made them relevant to a broad range of problems in robotics and computer vision, including mapping, task and motion planning, scene understanding, and many others. However, the field remains fragmented: different communities adopt distinct formulations, construction pipelines, and evaluation protocols, making it difficult to compare methods, identify common assumptions, and assess remaining challenges for robust real- world deployment. This survey provides a unified and critical review of 3DSGs, with particular emphasis on open challenges and future directions. We first formalize 3DSGs under a common definition and analyze the principal modeling choices that characterize existing formulations, including node and edge attributes, hierarchical structure, dynamic scene representations, and affordance-aware extensions. We then review how 3DSGs are constructed from raw sensory observations, covering both learning-oriented and construction-oriented systems. Finally, we examine downstream applications and evaluation strategies, from intrinsic graph quality to task-level performance. To support the community, we also provide a dedicated website that organizes and extends the surveyed works. View details
Preview abstract Enterprise digital transformation projects are among the most complex and costly initiatives in modern organizations, yet conventional governance frameworks rely predominantly on reactive, lagging indicators of project health. This paper presents an empirical binary classification study applying machine learning to identify high-risk implementations in enterprise digital transformation portfolios. A publicly available dataset of 4,000 project records encoding 49 governance-relevant features is used; an original four-level risk taxonomy is collapsed into two governance-actionable classes: High-Risk and Not High-Risk Implementation. This study proposes a governance-actionable machine learning framework that converts multi-level project risk into binary escalation decisions and combines cross-validated model selection with direct SHAP attribution for enterprise transformation portfolios. Seven classifiers are benchmarked against a majority-class baseline across six metrics. Model selection incorporates five-fold stratified cross-validation and grid-search hyperparameter optimization for the two strongest classifiers. Five-fold stratified cross-validation confirms generalization stability across all models: AdaBoost achieves the highest cross-validation performance—85.85% ± 1.46% accuracy, 85.56% ± 1.32% balanced accuracy, 84.02% ± 1.36% F1-score, and 0.9380 ± 0.0070 ROC-AUC—and also leads on the held-out test set (90.87% accuracy, 90.69% balanced accuracy, 89.76% F1-score, 0.9766 ROC-AUC). All seven classifiers exhibit standard deviations below the 3.0 percentage-point instability threshold, confirming robust generalization without overfitting. SHAP-based explainability, applied directly to the AdaBoost model via TreeExplainer, identifies Complexity_Score, Org_Process_Maturity, and Technology_Familiarity as the primary drivers of high-risk classification, consistent with digital transformation governance literature. Practical integration scenarios for portfolio dashboards and governance escalation workflows are discussed. View details
Preview abstract Large Language Models (LLMs) are increasingly deployed to automate enterprise recruitment pipelines, yet evaluating their decision consistency and underlying logic remains heavily throttled by a lack of credible, real-world benchmark datasets. Free-form floating-point scoring methods frequently used in recruitment AI suffer from severe numerical calibration drift and mask the models' intermediate reasoning. To address these challenges, we introduce Djinni-CB, a novel, two-tiered evaluation benchmark containing 2,484 real candidate-job pairs spanning 21 diverse job categories, bridged entirely from naturally occurring, anonymized candidate résumés and standardized employer postings. Rather than relying on generic scores, we implement a rigorous 29-question structured questionnaire across 9 diagnostic groups to audit pure deterministic reasoning boundaries. We establish comprehensive baseline results at temperature T=0.0 comparing frontier model architectures: Gemini 4.1m, DeepSeek Pro, GPT-5.4, and Gemini 2.5 Pro. Over 235,000 discrete decision points reveal a distinct dichotomy in the LLM ecosystem: a "Literal Gatekeeper" cluster (DeepSeek Pro and GPT-5.4) that prioritizes strict keyword matching, and a "Holistic" cluster (the Gemini family) that leverages contextual domain inference. Our dataset provides a highly structured resource complete with verbatim natural-language reasoning logs, offering an essential framework for future research into interpretability, factuality, and consistency in automated hiring. View details
Preview abstract Recent reports have highlighted how mobile apps share user location data with third parties, risking user privacy and platform trust. Although location data is highly sensitive, when users grant apps location access, they may not know the full extent to which it is used. We study how requiring Android apps to show a reason for location access could impact developers, users, and the platform. We surveyed 323 Android app developers and found most supported such a requirement. The majority said it would have a positive impact on user privacy, trust for apps, and trust for Android, where impact on user trust for Android correlated most strongly with support. Many developers also said the intervention would increase the number of users granting location access. Yet their open-ended comments also revealed consistent concerns, such as apps providing dishonest reasons and platform verification. To study the impact on user behavior, we conducted a randomized controlled experiment with 2579 US Android users. We tested how users' decisions to grant location access were impacted by app type, whether reasons were included in the requests, and the content of the reasons, including monetization. We did not find the reasons impacted users' decisions; decisions were instead driven by app type and demographics. Yet we did find the reasons could have a positive impact on user perception for the platform when the reasons did not include using data for ads. Our findings provide insights into developers' willingness to implement privacy-enhancing changes, and expose limits to improving user privacy by simply adding information to user interfaces. View details
The Decision-Accountability Gap: Symbolic Oversight Theory and Pivot to Human-in-the-Accountability-Loop (HIAL)
Sreekumar Hariharan
Amrita George
Shaliet Rose Sebastian
Sent for review (2027) (to appear)
Preview abstract As organizations increasingly deploy agentic artificial intelligence (AI) systems, Human-in-the-Loop (HITL) oversight structures are widely mandated to ensure compliance, ethics, and control. However, the substantive efficacy of these structures remains poorly understood under conditions of AI scale and high operational complexity. This study introduces Symbolic Oversight Theory (SOT), a novel AI governance framework rooted in neo-institutional theory and bounded rationality. We theorize that when AI systems exhibit high epistemic authority under intense operational velocity and regulatory pressures, traditional decision-centric HITL mechanisms decouple from operational realities. This creates a state of "symbolic oversight"—a ritualistic formality where formal review checkpoints persist for institutional legitimacy, but substantive human cognition, reflexivity, and intervention capacity erode, structurally shifting accountability loads onto individuals without true decisional agency. To validate and apply SOT, we employ a rigorous mixed-method research design across three studies: (1) a controlled behavioral experiment tracking heuristic processing and error-detection among finance professionals, (2) a field survey validating the structural relations and psychometric properties of our constructs, and (3) an empirical study integrating anonymized interaction telemetry logs from internal enterprise agentic AI systems with semi-structured, anonymized internal employee interviews. Our findings demonstrate an empirical divergence between nominal and enacted oversight, showing that symbolic HITL suppresses human reflexivity through cognitive offloading and proceduralization, ultimately yielding a systemic decision-accountability gap. To resolve this governance design failure, we present a design-science architecture shifting governance from decision-centric loops to a consequence-centric Human-in-the-Accountability-Loop (HIAL) framework, establishing new metrics for consequence traceability, accountability latency, and auditability-controllability symmetry. View details
Preview abstract Modern transformers have been scaled up in size, data, training-time compute, and more recently test-time compute based on Chain-of-Thought (CoT), but the consequences of trading off these parameters are unknown. We construct explicit tradeoffs between two of these aspects: the number of layers in a transformer and the number of CoT tokens. Our first result is general: with mild assumptions and a single-token prompt, for any integer k, a transformer using soft attention and SwiGLU MLP layers with L layers and n CoT tokens can be converted to a transformer with at most ckL layers and ⌈n/k⌉ CoT tokens, and vice versa, although with an increase to the size of other parameters. We then a multi-token prompt path following task, finding that additional preprocessing from the multi-token prompt changes the depth-CoT relationship in this case. We construct an attention-only network with L layers and 2^(L−2) heads that can traverse 2^(L−1) − 1 edges along a path with a single CoT token, demonstrating at least an exponential relationship between increases in depth and reductions in the number of CoT tokens needed to traverse the entire path. This relationship for the path following task holds empirically as well, as demonstrated by training networks with up to 5 layers, with the tradeoff between depth and the maximum number of edge traversals in a single CoT token exactly matching our theoretical constructions. View details
Preview abstract While MVP and CLEAN Architecture are popular Android patterns, they often introduce boilerplate or lack reactivity. This article introduces the Reactive Data Layer Architecture (RDLA), an offline-first, push-based data layer pattern designed for modern Android apps using Jetpack Compose and Room. Using a heart rate tracking example, we demonstrate how RDLA provides robust local-remote synchronization, clean separation of concerns without Use Case overhead, and simplified unit testing via the TestExtensions pattern. View details
Preview abstract We resolve a long-standing question in query complexity about whether a randomized algorithm can solve a problem faster than its certificate complexity, i.e., faster than the size of the smallest witness for the function. We then generalize this to show a stronger separation between quantum algorithms and certificate complexity. View details
Preview abstract A growing body of qualitative research has identified contextual risk factors that elevate people’s chances of experiencing digital-safety attacks. However, the lack of quantitative data on the population level distribution of these risk factors prevents policymakers and tech companies from developing targeted, evidence-based interventions to improve digital safety. To address this gap, we surveyed 5,001 adults in the United States to analyze: (1) the frequency of and relationship between digital-safety attacks (e.g., scams, harassment, account hacking), and (2) how these attacks align with 10 contextual risk factors. Nearly half of our respondents identify as resource constrained, which significantly correlates with higher likelihood of experiencing four common attacks. We also present qualitative insights to expand our understanding of the factors beyond the existing literature (e.g., “prominence” included high-visibility roles in local communities). This study provides the first large-scale quantitative analysis correlating digital-safety attacks with contextual risk factors and demographics. View details
Towards 10kAmp AI Chip: A System Perspective from Lateral to Vertical Power Delivery
Houle Gan
LJ LuJian
Cheng-Wei Chen
Gregory Sizikov
Zichao Ye
IEEE Transactions on Components, Packaging and Manufacturing Technology (2026)
Preview abstract The increasing current demands of HighPerformance Computing (HPC) accelerators – including TPUs, GPUs, and custom ASICs – are rapidly exceeding the 10,000 A threshold, presenting unprecedented challenges for traditional Lateral Power Delivery (LPD) architectures. Beyond I2R loss and transient performance, system-level optimization must harmonize competing requirements in Power Integrity (PI), Signal Integrity (SI), thermal management, and mechanical/physical design. This paper evaluates the systemic benefits and trade-offs of transitioning from LPD to Vertical Power Delivery (VPD), identifying the fundamental physical limitations and scalability bottlenecks that render lateral solutions unsustainable as current demands escalate. Critical VPD power and PI design considerations are investigated, comparing the merits of various input voltage selections and module granularities (e.g., monolithic vs. modular designs). Furthermore, several state-of-the-art VPD hardware implementations are presented, highlighting practical challenges in thermal management, mechanical warpage, and manufacturing. Finally, future trends in VPD and emerging technologies poised to further extend the performance ceiling of high-density power delivery are discussed. View details
SIGMA: Scalable Spectral Insights for LLM Collapse
Lingyou Pang
Carey E. Priebe
Xiangkun Ye
Tianyu Wang
Yi Gu
Alexander Aue
Jianyu Lin
2026
Preview abstract The rapid adoption of synthetic data for training Large Language Models (LLMs) has introduced the technical challenge of “model collapse”–a degenerative process where recursive training on model-generated content leads to a contraction of distributional variance and representational quality. While the phenomenology of collapse is increasingly evident, rigorous methods to quantify and predict its onset in high-dimensional spaces remain elusive. In this paper, we introduce SIGMA (Spectral Inequalities for Gram Matrix Analysis), a unified framework that benchmarks model collapse through the spectral lens of the embedding Gram matrix. By deriving and utilizing deterministic and stochastic bounds on the matrix’s spectrum, SIGMA provides a mathematically grounded metric to track the contraction of the representation space. Crucially, our stochastic formulation enables scalable estimation of these bounds, making the framework applicable to large-scale foundation models where full eigendecomposition is intractable. We demonstrate that SIGMA effectively captures the transition towards degenerate states, offering both theoretical insights into the mechanics of collapse and a practical, scalable tool for monitoring the health of recursive training pipelines. View details
Preview abstract The verification of modern GPU subsystems—encompassing high-speed interconnects, external MMUs, and security firewalls—against real-world gaming workloads poses a significant scheduling challenge. Achieving steady-state execution for benchmarks like Manhattan 3.1 or Honkai Rail in an RTL simulation environment typically requires over 20 days, creating a prohibitive bottleneck for iterative performance and power optimization. To overcome this, we propose a hybrid methodology that leverages two distinct hardware-assisted platforms to drastically reduce runtimes. First, we utilize Hardware Emulation (Zebu/SimXL) at the IP level to execute full benchmarks in approximately one hour, during which cycle-accurate ACE activity is captured across multi-leg interfaces into time-ordered trace logs. Second, these traces are transitioned to a simulation environment where the computationally expensive GPU core is "stubbed out" and replaced by a custom UVM Replay Framework, focusing simulation resources exclusively on the auxiliary subsystem logic. Technical focus is placed on the architecture of the UVM Replay Agent, which parses the emulation-extracted traces and drives ACE VIP sequences. A primary innovation of this framework is the preservation of Protocol Fidelity; the agent dynamically manages transaction dependencies and inter-channel timing (AW, W, AR, R, B) to ensure the replayed traffic mirrors the original hardware-level concurrency and out-of-order behavior. To ensure functional equivalence, we implement a Memory Model Scoreboard that validates data integrity across protocol converters. View details
Mining Attribute Subspaces for Efficient Fine-tuning of 3D Foundation Models
Yu Jiang
Hanwen Jiang
Vincent Chu
Brandon Y. Feng
Zhangyang Wang
Qixing Huang
IEEE/CVF Conference on Computer Vision and Pattern Recognition (2026)
Preview abstract With the emergence of 3D foundation models, there is growing interest in fine-tuning them for downstream tasks, where LoRA is the dominant fine-tuning paradigm. As 3D datasets exhibit distinct variations in texture, geometry, camera motion, and lighting, there are interesting fundamental questions: 1) Are there LoRA subspaces associated with each type of variation? 2) Are these subspaces disentangled (i.e., orthogonal to each other)? 3) How do we compute them effectively? This paper provides answers to all these questions. We introduce a robust approach that generates synthetic datasets with controlled variations, fine-tunes a LoRA adapter on each dataset, and extracts a LoRA sub-space associated with each type of variation. We show that these subspaces are approximately disentangled. Integrating them leads to a reduced LoRA subspace that enables efficient LoRA fine-tuning with improved prediction accuracy for downstream tasks. In particular, we show that such a reduced LoRA subspace, despite being derived entirely from synthetic data, generalizes to real datasets. An ablation study validates the effectiveness of the choices in our approach. View details
×