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
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 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 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
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
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
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
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
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
Near frustration free electronic structure Hamiltonian representations and lower bound certificates
Guang Hao Low
ALBERT DEPRINCE
J. Chem. Theory Comput., 12 (17) (2026), 8751–8766
Preview abstract Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified framework connecting sum-of-squares (SOS) decompositions with variational two-particle reduced density matrix (v2RDM) theory. We demonstrate that the "weighted" SOS ansatz naturally recovers the dual of the v2RDM program, enabling the strict enforcement of symmetry constraints such as particle number and spin. We provide explicit SOS constructions for the Hubbard model and electronic structure Hamiltonians, ranging from spin-free approximations to full rank-2 expansions. We also highlight theoretical connections to block-invariant symmetry shifts (BLISS). Numerical benchmarks on molecular systems and Iron-Sulfur clusters validate these near frustration-free representations, demonstrating their utility in improving spectral gap amplification and reducing block encoding costs in quantum algorithms. View details
Preview abstract Optimizing large-language model (LLM) training and serving on large-sacle distributed systems with hundreds and thousands of accelerators is always a challenging task due to the fast evloving LLMs, strong domain expertise required, and various optimization goals from different worklaods. Existing methods rely on either handcrafted optimization performed by human experts, which is tedious and time-consuming or resource-intensive black-box searches, which lack the extensibility to keep pace with evolving models and hardware. To address this, we introduce PROMPTS, a novel multi-agent framework that complements traditional search methods with expert-informed reasoning. It automates the diagnosis of performance bottlenecks by synthesizing profiler data and leverages a knowledge base to propose optimized sharding configurations with detailed justifications. Across eight real-world production workloads, PROMPTS demonstrated remarkable efficiency and accuracy, delivering performance improvements of up to 434%. These workloads spanned diverse model architectures, hardware platforms, computational scales, and various stages of the machine learning lifecycle (pre-training, serving, and post-training). In every case, the configuration adopted by human engineers was identified within the agent's top three proposals from a single invocation. Furthermore, the agent's top-ranked recommendation was the one ultimately adopted in 87.5% of cases, showcasing its ability to not only find optimized solutions, but also to correctly prioritize them. Our work establishes PROMPTS as a scalable, extensible, and explainable methodology for AI-assisted performance engineering in large-scale ML systems. View details
Preview abstract While AI scientists increasingly automate research tasks through advanced language models, generating publication-ready illustrations remains a labor-intensive bottleneck in the scientific workflow. To lift this burden, we introduce PaperBanana, an agentic framework for automated generation of publication-ready academic diagrams. Powered by Nano-Banana-Pro and Gemini-3-Pro, PaperBanana orchestrates a team of specialized agents to retrieve reference examples, devise detailed plans for content and style, render the image, and perform iterative refinement based on self-critique. To rigorously evaluate our framework and address the absence of dedicated benchmarks for automated academic illustration, we introduce PaperBananaBench, comprising 292 test cases for methodology diagrams curated from NeurIPS 2025 publications. Comprehensive experiments demonstrate that PaperBanana consistently outperforms vanilla Nano-Banana-Pro across all four dimensions—faithfulness, conciseness, readability, and aesthetics—achieving human-level performance. We further show that PaperBanana seamlessly extends to statistical plots through targeted adaptations. Collectively, PaperBanana enables AI scientists to fully automate the generation of publication-ready academic illustrations. View details
Preview abstract As integrated circuit designs scale in complexity, the insertion of Design-for-Test (DFT) structures—specifically logic testpoints—becomes essential to maintain high Quality of Results (QoR) in Automatic Test Pattern Generation (ATPG). However, conventional testpoint insertion often ignores physical constraints, leading to localized routing congestion and increased leakage power that can degrade the overall Power, Performance, and Area (PPA) profile. This paper proposes a physical-aware custom testpoint reclustering approach designed to bridge the gap between testability and physical implementation. By intelligently grouping and redistributing testpoints based on spatial proximity and netlist hierarchy, our method minimizes the routing overhead typically associated with disparate test structures. Experimental results demonstrate a significant reduction in total wirelength and congestion hotspots while simultaneously lowering leakage power through optimized cell selection and placement. Crucially, these physical gains are achieved without compromising—and in some cases improving—test coverage and pattern count. This approach provides a robust framework for achieving "physical-first" DFT, ensuring that high-fault coverage does not come at the expense of design PNR QoR. View details
Preview abstract Cinematography, the craft of visual storytelling through framing, lighting, and camera operation, fundamentally shapes how audiences perceive and emotionally engage with video content. While Large Vision Language Models (LVLMs) have made remarkable progress in video question answering, existing benchmarks primarily focus on identifying low-level techniques rather than understanding their storytelling impact. To address this, we introduce CinematicVQA, the first-of-its-kind benchmark for cinematic video understanding that goes beyond technique recognition to evaluate film-grammar reasoning, utilizing our introduced Cinematic Scene Graph (CSG), a structured representation that links filming techniques to their perceptual effects and narrative functions. Through comprehensive evaluation of state-of-the-art LVLMs, we reveal a striking semantic gap: models consistently perform higher on describing visual presentations than on identifying the underlying techniques. Surprisingly, Chain-of-Thought prompting fails to provide consistent gains and degrades performance for most models, suggesting that current LVLMs lack sufficient cinematic domain knowledge to benefit from step-by-step reasoning. Fine-tuning on CINEMATICVQA-TRAIN yields consistent improvements, particularly for narrative function and multi-hop reasoning. Overall, CinematicVQA serves both as a rigorous benchmark for cinematic evaluation in LVLMs and as a practical dataset for training more film-aware video models. View details
Preview abstract Here’s a thought experiment. Say I wave a magic wand across a codebase and an entire class of technical debt, poof, goes away and immediately evaporates if introduced in the future. For example, maybe I make it so that dead feature flags are simply no longer a problem: they just delete themselves as soon as the engineer wills it. Or maybe large-scale migrations just migrate themselves. Maybe we magically have 100% test coverage, without an engineer lifting a finger. What will happen to developer productivity? Surely, developer productivity increases overall. But will the productivity metrics that we all use as a proxy for “developer productivity” move up and to the right. Let’s explore this idea. View details
Preview abstract Our suggestion is a hybrid reputation-based routing protocol in the context of decentralized routing. networks which partitions trust measurements to on-chain immutable logs and off-chain dynamic computations to attain security and scalability. The protocol incorporates a layer of sharded blockchain to store critical. trust data and local reputation model to do real-time updates, enabling routing choices that cannot be tampered with. performance. The trust ledger which operated on-chain kept the records of the impartiality of. Historical performance and node identities, whereas the off-chain reputation engine uses graph neural network to calculate dynamic. real-time scores like packet delivery rate to be trusted. and latency. Additionally, it uses rollup-based batches of synchronization off-chain. optimistic updates to zero-knowledge proofs, making on-chain efficient. checking with minimum overhead. The suggested approach replaces conventional network discovery and forwarding modules using trust-based adjacency lists and trust-based pathing, and thus enhancing routing consistency over adversarial settings. Moreover, the structure integrates Hyperledger Fabric with. Graph Attention Network-based high-throughput sharded ledger operations. to update reputation in a privacy-preserving manner, proving to be linear. network size scalability. The experimental findings indicate that the system supports 10,000 transactions per shard and produces. Under 100 ms per ZK-Rollup proof, which is appropriate to large-scale IoT. and DeFi deployments. This publication fills the gap between pure on-chain. and off-chain reputation systems, which provides a viable solution to scalable and secure decentralized routing. View details
×