1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.GT2026
Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games
Mohan Dantam, Richard Mayr
We consider the strategy complexity (i.e., memory and randomization) of optimal strategies in turn-based 2-player zero-sum stochastic games. Results in [Gimbert,Kelmendi:2023] show…
cs.LG2023★ 1 cited
Inference and Interference: The Role of Clipping, Pruning and Loss Landscapes in Differentially Private Stochastic Gradient Descent
Lauren Watson, Eric Gan, Mohan Dantam +2
Differentially private stochastic gradient descent (DP-SGD) is known to have poorer training and test performance on large neural networks, compared to ordinary stochastic gradient…
math.OC2020
On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems
Mohan Dantam, Amaury Pouly
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable con…