activity
20212025
collaborators

8 papers

cs.LG2025

Optimal Transfer Learning for Missing Not-at-Random Matrix Completion

Akhil Jalan, Yassir Jedra, Arya Mazumdar +2

We study transfer learning for matrix completion in a Missing Not-at-Random (MNAR) setting that is motivated by biological problems. The target matrix has entire rows and colum…

cs.SI2025

Opinion Dynamics with Multiple Adversaries

Akhil Jalan, Marios Papachristou

Opinion dynamics models how the publicly expressed opinions of users in a social network coevolve according to their neighbors as well as their own intrinsic opinion. Motivated by…

cs.LG2024

Transfer Learning for Latent Variable Network Models

Akhil Jalan, Arya Mazumdar, Soumendu Sundar Mukherjee +1

We study transfer learning for estimation in latent variable network models. In our setting, the conditional edge probability matrices given the latent variables are represented by…

math.OC2024

Strategic Negotiations in Endogenous Network Formation

Akhil Jalan, Deepayan Chakrabarti

In network formation games, agents form edges with each other to maximize their utility. Each agent's utility depends on its private beliefs and its edges in the network. Strategic…

math.CO2023

A Cheeger Inequality for Small Set Expansion

Akhil Jalan

The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory Series B 1985), is an indispensable tool for converting the combinatorial condition of graph expansion to a…

math.OC2022

Incentive-Aware Models of Financial Networks

Akhil Jalan, Deepayan Chakrabarti, Purnamrita Sarkar

Financial networks help firms manage risk but also enable financial shocks to spread. Despite their importance, existing models of financial networks have several limitations. Prio…

cs.CC2022

Extractors for Images of Varieties

Zeyu Guo, Ben Lee Volk, Akhil Jalan +1

We construct explicit deterministic extractors for polynomial images of varieties, that is, distributions sampled by applying a low-degree polynomial map $f : \mathbb{F}_q^r \to \m…

cs.DS2021

Near-Optimal Cayley Expanders for Abelian Groups

Akhil Jalan, Dana Moshkovitz

We give an efficient deterministic algorithm that outputs an expanding generating set for any finite abelian group. The size of the generating set is close to the randomized constr…