close

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 11928 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 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 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
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 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
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
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
Conversational diagnostic artificial intelligence in ambulatory primary care: a prospective feasibility study
Peter Brodeur
Jacob M. Koshy
Khaled Saab
Ava Homiar
Roma Ruparel
Charles Wu
Ryutaro Tanno
Joseph Xu
Amy Wang
David Stutz
Hannah M. Ferrera
David Barrett
Lindsey Crowley
Jihyeon Lee
Spencer E. Rittner
Selena K. Zhang
Elahe Vedadi
Christine G. Kohn
Kavita Kulkarni
Vinay Kadiyala
Sara Mahdavi
Wendy Du
David Feinbloom
Renee Wong
Petar Sirkovic
Alessio Orlandi
Juro Gottweis
Joelle Barral
Kat Chou
James Manyika
Rob Fields
Jonathan X. Li
Marc L. Cohen
Adam Rodman
The Lancet (2026)
Preview abstract Background: Artificial intelligence (AI)-based systems show promise for assisting primary care providers (PCPs) with patient care. We aimed to evaluate the safety and quality of clinical conversations of a patient-facing conversational AI system, which engaged in real-world urgent primary care appointments. Methods: In this prospective, single-centre, single-arm feasibility study, English-speaking patients aged at least 18 years interacted with the Articulate Medical Intelligence Explorer (AMIE) up to 5 days before a single-complaint urgent primary care appointment. Physician safety supervisors monitored all interactions and were trained to intervene on the basis of predefined safety criteria. AMIE transcripts and summaries were shared with PCPs before the visit. Primary outcomes were the number of supervised conversation safety stops, AMIE’s conversation quality assessed by clinical evaluators, and patient and PCP experiences per surveys. This study is registered with ClinicalTrials.gov (NCT06911398). Findings: From April to November, 2025, 114 patients were enrolled with 98 completing both the AMIE interaction and the PCP appointment. Zero conversation safety stops were required on the basis of prespecified criteria. Safety supervisors noted one hallucination and added clinical information in five interactions. AMIE’s conversations were rated favourably in 87–100% of cases (17 criteria) by clinical evaluators, and 48–96% (16 criteria) by patients. Patient attitudes towards AI improved after interacting with AMIE and remained elevated after the patient’s visit with their physician. PCPs completed post-surveys in 60 of 98 cases, including 44 cases in which they reviewed the AMIE transcript before the visit. PCPs found AMIE helpful for visit preparation in 33 of 44 cases and reported that it might have changed their behaviour in 25 of 44 cases. Interpretation: Although further research is needed, this study shows the initial feasibility of conversational AI in a real-world setting—assessed via conversation safety and quality, as well as user acceptance—and represents a crucial step towards clinical translation. Funding: Alphabet. View details
From Copilot to Captain: The Governance of Autonomous Agents
Japjit Singh
workflowotg (2026) (to appear)
Preview abstract As AI evolves from simple assistants to autonomous agents capable of independent decision-making, organizations face a critical inflection point in corporate governance. This document outlines a comprehensive framework for managing the risks of an agentic economy. It explores the necessity of a "Digital Constitution" to provide non-negotiable operational boundaries, the legal implications of "hallucinated" contracts and the need for Agentic Terms of Service (ATOS), and strategies for defending against cognitive attacks through Zero-Trust architectures. Furthermore, it discusses the management of "Context Currency" to protect proprietary data and introduces "Return on Autonomy" (ROA) as a vital metric for measuring the strategic success of autonomous systems. Ultimately, thriving in this era requires treating AI governance as a fundamental generational shift in corporate management. View details
LiveSVG: Zero-Shot SVG Animation via Video Generation
Matan Levy
Ran Margolin
Bar Cavia
Dvir Samuel
Shmuel Peleg
Alex Rav Acha
Arik Shamir
Dani Lischinski
Google (2026)
Preview abstract We introduce LiveSVG, a zero-shot approach for generating Scalable Vector Graphics (SVG) animations using video diffusion models. Current SVG animation methods struggle with complex motions: LLM-based code synthesis fails to express fine, non-rigid Bézier deformations, while Score Distillation Sampling (SDS) provides noisy gradients and often requires category-specific priors like skeletons. In contrast, LiveSVG fits vector geometry directly to an explicitly generated target video. Given an input SVG image and a motion prompt, we generate a previewable target video using a frozen image-to-video model, then fit the original SVG to this video via differentiable rendering. Our fitting stage is skeleton-free, utilizing a dual-level motion representation that combines per-group homographies for coarse articulation with per-path Bézier control-point offsets for local deformations. To resolve color-induced correspondence ambiguities during pixel-wise fitting, we introduce a novel sphere-packing recolorization strategy. We also present ChallengeSVG, a benchmark of complex, multi-object scenes that exposes the limitations of prior work. Evaluations demonstrate that LiveSVG significantly outperforms existing methods on both AniClipart and ChallengeSVG, establishing direct reference-video fitting as a practical, robust route to prompt-aligned and fully editable vector animation. View details
Editing Everything Everywhere All at Once
Fabio Quattrini
Carmine Zaccagnino
Enis Simsar
Marta Tintore Gazulla
Rita Cucchiara
Silvia Cascianelli
2026
Preview abstract Editing multiple elements of an image in a single forward pass has recently emerged as a practical alternative to multi-turn image manipulation, offering improved efficiency. However, when several instructions target different regions, semantic interference often leads to attribute leakage and poor edit disentanglement, especially as the number of edits increases. In this work, we propose MICE (Multi-Instance Concurrent Editing), a training-free strategy for scalable multi-instance image editing with Multimodal Diffusion Transformers. MICE modifies the additive bias of joint attention to regulate interactions between instance-specific text, latent, and context tokens identified via user-provided segmentation masks. Specifically, MICE allows intra-instance attention, penalizes interactions between neighboring region tokens, and suppresses unrelated cross-instance attention. As a result, our method enforces attribute binding while preserving global visual consistency. We evaluate MICE on LoMOE-Bench and introduce MICE-Bench, a more challenging benchmark with an average of 8.5 concurrent edits per image. The experiments demonstrate that our approach outperforms strong baselines and recent competitors in terms of the number of attempted edits and faithfulness to the textual editing instruction. View details
Preview abstract Modern compute subsystems have evolved into complex architectures where custom Compute-IPs interface directly or downstream with a mix of in-flight 1st-party IPs (1PIP), stable legacy components, and pre-verified 3rd-party IPs (3PIP). These connections—whether coherent, non-coherent / configuration, for custom use-cases utilizing in-house protocols, etc—often require concurrent development of both the compute tiles and their integration logic to meet aggressive time-to-market goals. However, this parallel approach introduces a critical bottleneck: the subsystem cannot be verified until both the Compute-IP and the 1PIPs reach maturity. Consequently, fundamental functional misalignments—such as protocol handshaking deadlocks, clock and reset sequencing issues, and architectural assumption mismatches—often remain hidden during IP development phases, resulting in a high-risk discovery tail where "integration-killer" bugs are uncovered only when RTL rework costs and schedule impacts are prohibitive. To break this deadlock, we present a verification-driven methodology that utilizes a silicon-proven Golden Proxy, Direct-Execution Traffic Profiles, and Programmable Sequencers to provide a functional proof of concept and pre-pull critical inter-IP interaction mismatch discoveries months prior to traditional integration milestones. View details
A Computer Vision Problem in Flatland
Erin Connelly
Annalisa Crannell
Timothy Duff
Rekha R. Thomas
SIAM Journal on Applied Algebra and Geometry, 10 (2026), pp. 14-45
Preview abstract When is it possible to project two sets of labeled points of equal cardinality lying in a pair of projective planes to the same image on a projective line? We give a complete answer to this question, obtaining the following results. We first show that such a pair of projections exist if and only if the two point sets are themselves images of a common point set in projective space. Moreover, we find that for generic pairs of point sets, a common projection exists if and only if their cardinality is at most seven. In these cases, we give an explicit description of the loci of projection centers that enable a common image. View details
PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
Qinglin Meng
Steve Hanneke
Amirreza Shaeiri
Shay Moran
2026
Preview abstract We study the problem of multiclass PAC learning with bandit feedback in the realizable setting. In this framework, there is an unknown data distribution over an instance space $\mathcal{X}$ and a label space $\mathcal{Y}$, as in classical multiclass PAC learning, but the learner does not observe the labels of the i.i.d.\ training examples. Instead, in each round, it receives an unlabeled instance, predicts its label, and receives bandit feedback indicating only whether the prediction is correct. Despite this restriction, the goal remains the same as in classical PAC learning. We provide a general characterization of the optimal sample complexity of this problem, sharp for every concept class up to logarithmic factors. Our characterization is based on a new combinatorial dimension, termed the \textit{bandit $\mathrm{DS}$ dimension}, defined via generalized combinatorial structures we call \emph{pseudo-boxes}. These extend the pseudo-cubes underlying the $\mathrm{DS}$ dimension by allowing a different number of neighbors in each coordinate. In contrast to the $\mathrm{DS}$ dimension, which governs the full-information setting by counting the number of coordinates in the pseudo-cube, the bandit $\mathrm{DS}$ dimension aggregates the number of neighbors across coordinates, leading to a characterization in which the sample complexity scales with the total number of neighbors. We also propose a general learning algorithm achieving the upper bound, based on an algorithmic principle called \emph{ListCascade}, which connects bandit learning to list learning and may be of independent interest. View details
×
Image