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 11927 publications
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 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 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
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 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
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
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 Emissions abatement and carbon dioxide removal (CDR) are critical to achieving a global net-zero scenario under which temperatures are stabilized. In the near term, organizations pursuing net-zero targets may compensate for remaining emissions by combining short-lived climate pollutant (SLCP) abatement with CDR. Because these mitigation strategies have climate impacts across distinct timescales, they provide complementary tools to address both near-term and long-term warming. However, the distinct timescales mean that, to ensure emissions remain compensated, accounting approaches must evaluate each strategy’s impact across time. We propose an approach based on sustained warming neutralization. By translating emission and mitigation impacts into a single metric - the continuous global mean surface temperature response - it ensures the warming response to an emission is neutralized in the near- and long-term. We then introduce a method to design mitigation portfolios using the approach. Ultimately, the approach structurally aligns emission compensation claims with global temperature stabilization goals. View details
Rolling Shutter Relative Pose Estimation Made Practical
Daniel Barath
European Conference on Computer Vision (ECCV) (2026)
Preview abstract Rolling shutter (RS) cameras equip virtually all consumer devices, yet RS-aware relative pose estimation has remained impractical: the state-of-the-art solver requires a minimum of 20 point correspondences, making RANSAC-based robust estimation prohibitively expensive due to the exponential dependence of the iteration count on the sample size. We make RS relative pose estimation practical by introducing affine correspondences (ACs) into the RS two-view geometry. We derive novel \emph{RS-corrected affine constraints} that account for the coupling between point perturbations and the row-dependent essential matrix, providing two equations per correspondence beyond the standard epipolar constraint. Building on these constraints, we develop a linearized algebraic solver that estimates pose and RS motion from only 7 ACs. The solver exploits the physical smallness of RS parameters to linearize the constraints, eliminates the 12 RS unknowns via null-space projection, and solves the remaining degree-20 system via action matrices in 1.2\,ms. On the TUM RS benchmark, our method achieves the best pose and RS parameter accuracy among all tested methods and, uniquely among RS solvers, provides accurate translational velocity estimates -- which are poorly conditioned from point correspondences alone due to a $\vec{v}$-$\vec{t}$ coupling. On the global-shutter EuRoC MAV dataset, the solver achieves comparable accuracy to the standard 5-point algorithm, demonstrating that it generalizes well to the GS setting. Code will be made public. View details
Balancing AI tensions: Moving from AI adoption to effective SDLC use
Jessica Baolin (Lin)
Nathen Harvey
DORA (2026)
Preview abstract Using AI in the software development life cycle (SDLC) is quickly becoming an industry standard. The 2025 DORA State of AI-assisted Software Development report found that 90% of technology professionals now use AI at work, and over 80% believe it has increased their productivity. Beneath these impressive top-line numbers, a more complex reality is emerging. Extensive qualitative analysis of enterprise software engineers reveals that AI's impact on the SDLC is not a simple linear improvement. Instead, it presents a series of profound tradeoffs. While AI successfully accelerates initial code generation and reduces the friction of starting new tasks, the time saved in creation is frequently re-allocated to a new hidden tax: high-scrutiny auditing and verification. This article explores four key tradeoffs of AI adoption, and provides actionable strategies to balance them. View details
The Differentiable Auditory Loop (DAL): An ML Framework for Hyper-Personalized Hearing Aids Using Biological Sound Representations
Alejandro Ballesta Rosen
Jack Collins
Simon Carlile
Julian Maclaren
Jason Mikiel-Hunter
Oscar Wahltinez
arXiv (2026)
Preview abstract Conventional hearing aids rely on fixed, frequency-dependent amplification and compression to manage reduced sensitivity, which often fails to provide suffi- cient listening support in complex environments, such as situations with multiple speakers (the “cocktail party” problem). To more comprehensively address the underlying encoding dysfunctions of hearing loss, we introduce the Differentiable Auditory Loop (DAL), a new open-source framework for personalized hearing aid design and fitting. Our first implementation of DAL incorporates CARFAC, a dif- ferentiable model of human cochlear function, which we ported to JAX, to optimize a deep neural network to match impaired auditory neural activity patterns with a normal-hearing reference. To build a hearing aid with the fine-grained spectro- temporal signal processing required, we adopt SEANet, a waveform-to-waveform fully convolutional UNet generator. We fine-tune the network by comparing the outputs of a CARFAC model fitted to normal hearing with that of a CARFAC model fitted to match each subject’s individual hearing impairment. The comparison is done using loss functions derived from the respective CARFAC neural activity pattern (NAP) outputs and stabilized auditory images (SAIs), the latter providing a 2D representation that captures phase-insensitive temporal structure in the au- ditory nerve output. Through gradient descent, the SEANet model learns to both denoise the input and compensate for the hearing loss modelled by the impaired CARFAC model. Across neural-representation and signal-fidelity metrics, the DAL-optimized SEANet model outperformed the tested master hearing aid (MHA) baselines. The DAL framework provides a practical path toward model-based, machine-learning-driven personalization of hearing aid signal processing. Next steps include hardware deployment to enable real-world clinical testing. View details
Preview abstract In modern System-on-Chip (SoC) architectures, hierarchical Design for Testability (DFT) heavily relies on core wrapping methodologies, such as IEEE 1500, to isolate intellectual property (IP) cores and ensure high fault coverage. While shared wrapper cells repurpose existing functional flip-flops to minimize area overhead, Dedicated Wrapper Cells (DWCs) are strictly mandated when functional registers cannot guarantee independent controllability and observability at the core boundaries. A primary structural driver for power utilization in VLSI is the presence of an Integrated Clock Gating (ICG) cell which can be even within the boundary path. When an ICG dictates the clocking of boundary registers, EDA test tools automatically instantiate DWCs to bypass the gating logic. This ensures that the shift and capture clocks remain fully deterministic during test operations, preventing coverage drops caused by unconstrained functional clock-gating conditions. However, the insertion of DWCs introduces significant challenges during External Test (Extest) Transition Delay (TD) testing. Because Extest aims to target inter-core interconnect faults, executing at-speed TD tests requires precise launch-and-capture timing. DWCs are typically driven by a slow, dedicated test clock rather than the functional high-speed clocks. Consequently, launching and capturing at-speed transitions across IP boundaries using DWCs creates complex timing bottlenecks, frequently resulting in reduced transition fault coverage on core-to-core interconnects. Furthermore, the implementation of DWCs is highly sensitive to low-power design architectures (e.g., UPF/CPF-driven flows). The physical and logical placement of DWCs must be strictly aligned with power domain boundaries. To ensure that inter-core interconnects can still be tested via Extest when the target IP core is powered down, DWCs are often required to be placed in an "always-on" power domain, or tied to the parent's voltage island rather than the switchable core domain. Misalignment of DWC placement with respect to these power domains not only compromises the integrity of the test chain during low-power modes but also necessitates the insertion of complex isolation logic, increasing both routing congestion and power consumption. To address this, our paper describes a novel method whereby paths containing ICG or macros (CTL segments) can be effectively targeted with Extest TD coverage without inducing any functional clock instability. Along with that, this paper presents an optimized placement approach that mitigates this by directing DWC placement in a way that significantly minimizes the overall low-power cell requirements through hierarchical-specific DWC methodologies. View details
Preview abstract Recent advancements in Embodied AI and spatial computing drive a growing demand for high-fidelity 4D hand-object interaction (HOI) digital assets. However, creating these assets automatically from view-efficient multi-view setups presents a fundamental trade-off between reconstruction fidelity and system scalability. Optimization-based methods offer high metric precision but are fragile under severe occlusions due to their reliance on off-the-shelf trackers. Conversely, robust inference-based approaches lack the photometric and physical consistency required for high-end assets. To bridge this gap, we propose SHOC, an automated 4D HOI reconstruction engine. First, we introduce the Hand-Object Transformer to aggregate multi-view spatiotemporal cues, robustly regressing parametric states and coarse geometry to bypass the convergence bottlenecks of prior works. Second, a Physics-Aware 4D Gaussian Splatting framework performs high-fidelity photometric refinement. It enforces anatomical rigidity via a tetrahedral As-Rigid-As-Possible proxy and disentangles appearance into view-independent albedo and view-dependent specularity. This prevents environmental illumination from baking into the geometry, effectively eliminating motion-induced flickering artifacts. Validated on public benchmarks and a large-scale internal dataset, our self-improving engine achieves state-of-the-art robustness and visual quality, providing a scalable pipeline for generating artifact-free 4D digital assets. View details
Analyzing Bytes: Pre-Disassembly Static Binary Analysis
Soumyakant Priyadarshan
ChenCheng Jiang
R. Sekar
Proceedings of the ACM on Programming Languages, Association for Computing Machinery (2026), pp. 1127-1151
Preview abstract Binary code analysis plays a central role in numerous applications in software security, performance optimization, reverse engineering, and so on. Existing techniques need to first disassemble binaries into functions in assembly code before an analysis can be performed. However, disassembly and function identification have proven to be major challenges for complex variable-length instruction sets such as the x86. A recent trend has been to use static analysis to improve the accuracy of these tasks. This raises a chicken-and-egg problem: a disassembly is needed for static analysis, but a static analysis is needed for accurate disassembly! We overcome this problem by developing a novel static analysis approach that can operate before committing to a disassembly. Our analysis operates on the output of exhaustive disassembly that considers each possible offset in a binary as an instruction, and constructs what is known as a super-set control-flow graph (CFG). The central technical challenge in analyzing this CFG is that it mixes legitimate instructions with unintended ones, causing analysis results from invalid code paths to pollute legitimate ones. To overcome this challenge, we begin with a key new insight that if we focus on backward analyses, we can ensure accuracy of analysis results at intended instructions even though we have no idea where these intended instructions are! Moreover, our analysis operates in time that is linear in the size of the binary. Specifically, in O(n) total time, it yields analysis results for every one of the n offsets in an n-byte binary. For this task, it is orders of magnitude faster than previous techniques, as the previous techniques typically need to repeat the analysis many times. View details
×