AJAli Jadbabaie

Ali Jadbabaie

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ali Jadbabaie has a total of 581 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Media Bias, News Verification, and Subscription Choice

    by Chin-Chia Hsu, Amir Ajorlou, Muhamet Yildiz, Ali Jadbabaie

    We study how individuals choose among biased information sources with persuasion motiveswhen the news may or may not be informative. We develop a game-theoretic model featuringanonymous subscribers with diverse ideological perspectives and two news intermediarieswith opposing ideological perspectives. In our model, each individual subscribes to a news intermediary,and then intermediaries may receive a private signal. To influence public opinion,the intermediaries strategically decide whether to verify the informativeness of a private signaland whether to disclose it to their subscribers. In equilibrium, moderate subscribers subscribeto the intermediary with an opposing view, optimizing their information acquisition throughcross-ideological sorting. In contrast, extremist subscribers select the intermediary with analigned view, exhibiting aligned-ideological sorting.

  • Open Access

    Communication-Limited Multi-Agent Grid Congestion Management via Differentiable Optimization

    by James Y Chen, Stéphane Drobot, Lucas Saludjian, Patrick Panciatici, Pin-Yu Chen, Ali Jadbabaie, Priya L Donti

  • Algebraic topological characterizations of tie strength in higher-order social networks

    by Arnab Sarker, Jean-Baptiste Seby, Austin Benson, Ali Jadbabaie

    The association between tie strength and network structure is a fundamental topic in the analysis of complex social systems. We study this association by analyzing tie strength using higher-order networks, an increasingly relevant model which can encode group interactions between three or more individuals. First, we introduce three measures based on algebraic topology which characterize the network context and influence of an edge. Our experimental results across 15 datasets indicate that these measures outperform standard network proxies in estimating tie strength as a function of the unweighted network topology. These measures can further replicate and explain a puzzle wherein certain bridging ties are surprisingly strong. We then consider a single centrality measure which combines the three initial measures, is highly inversely correlated with tie strength, and can be interpreted through an information exchange process that highlights ties that have access to useful information. In this sense, we are able to illuminate the information advantages of weak ties due to their network position.


  • Open Access

    Is Your Conditional Diffusion Model Actually Denoising?

    by Daniel Pfrommer, Zehao Dou, Christopher Scarvelis, Max Simchowitz, Ali Jadbabaie

    We study the inductive biases of diffusion models with a conditioning-variable, which have seen widespread application as both text-conditioned generative image models and observation-conditioned continuous control policies. We observe that when these models are queried conditionally, their generations consistently deviate from the idealized "denoising" process upon which diffusion models are formulated, inducing disagreement between popular sampling algorithms (e.g. DDPM, DDIM). We introduce Schedule Deviation, a rigorous measure which captures the rate of deviation from a standard denoising process, and provide a methodology to compute it. Crucially, we demonstrate that the deviation from an idealized denoising process occurs irrespective of the model capacity or amount of training data. We posit that this phenomenon occurs due to the difficulty of bridging distinct denoising flows across different parts of the conditioning space and show theoretically how such a phenomenon can arise through an inductive bias towards smoothness.

  • Open Access

    Estimating the Impact of Drone Strikes on Civilians Using Call Detail Records

    by Paolo Bertolotti, Aidan Milliff, Fotini Christia, Ali Jadbabaie

    Drone strikes are a fixture of US counter-terrorism policy, often advertised as ‘surgical’ alternatives to ground operations. Drone strikes’ effects, however, are less precise than proponents suggest. Using data from over 12 billion call detail records from Yemen between 2010 and 2012, we show that the US drone campaign significantly disrupted civilian lives in previously-unmeasured ways. Strikes cause large increases in civilian mobility away from affected areas and create immediate, durable displacement: mobility among nearby individuals increases 24 percent on strike days, and average distance from the strike region increases steadily for over a month afterward, signifying prolonged displacement for thousands of individuals. Strikes are disruptive regardless of whether they kill civilians, though effects are larger after civilian casualties. Our findings suggest that even carefully targeted drone campaigns generate collateral disruption that has not been weighed in public debate or policy decisions about the costs and benefits of drone warfare.


  • Nonsubmodular Visual Attention for Robot Navigation

    by Reza Vafaee, Kian Behzad, Milad Siami, Luca Carlone, Ali Jadbabaie

    This paper presents a task-oriented computational framework to enhance Visual-Inertial Navigation (VIN) in robots, addressing challenges such as limited time and energy resources. The framework strategically selects visual features using a Mean Square Error (MSE)-based, non-submodular objective function and a simplified dynamic anticipation model. To address the NP-hardness of this problem, we introduce four polynomial-time approximation algorithms: a classic greedy method with constant-factor guarantees; a low-rank greedy variant that significantly reduces computational complexity; a randomized greedy sampler that balances efficiency and solution quality; and a linearization-based selector based on a first-order Taylor expansion for near-constant-time execution. We establish rigorous performance bounds by leveraging submodularity ratios, curvature, and element-wise curvature analyses. Extensive experiments on both standardized benchmarks and a custom control-aware platform validate our theoretical results, demonstrating that these methods achieve strong approximation guarantees while enabling real-time deployment.


  • Stochastic Opinion Dynamics Under Social Pressure in Arbitrary Networks

    by Jennifer Tang, Aviv Adler, Amir Ajorlou, Ali Jadbabaie

    Social pressure is a key factor affecting the evolution of opinions on networks in many types of settings, pushing people to conform to their neighbors’ opinions. To study this, the interacting Pólya urn model was introduced by Jadbabaie et al., 2023, in which each agent has two kinds of opinion: inherent beliefs, which are hidden from the other agents and fixed; and declared opinions, which are randomly sampled at each step from a distribution which depends on the agent’s inherent belief and her neighbors’ past declared opinions (the social pressure component), and which is then communicated to her neighbors. Each agent also has a bias parameter denoting her level of resistance to social pressure. At every step, each agent updates her declared opinion (simultaneously with all other agents) according to her neighbors’ aggregate past declared opinions, her inherent belief, and her bias parameter. We study the asymptotic behavior of this opinion dynamics model and show that the agents’ declaration probabilities approach a set of equilibrium points of the expected dynamics using Lyapunov theory and stochastic approximation techniques. We also derive necessary and sufficient conditions for the agents to approach consensus on their declared opinions. Our work provides further insight into the difficulty of inferring the inherent beliefs of agents when they are under social pressure.


  • Open Access

    GraphHash: Graph Clustering Enables Parameter Efficiency in Recommender Systems

    by Xinyi Wu, Donald Loveland, Runjin Chen, Yozen Liu, Xin Chen, Leonardo Neves, Ali Jadbabaie, Mingxuan Ju, Neil Shah, Tong Zhao