no code implementations • 21 Jun 2022 • Nafiseh Ghoroghchian, Rajasekhar Anguluri, Gautam Dasarathy, Stark C. Draper
We consider the controllability of large-scale linear networked dynamical systems when complete knowledge of network structure is unavailable and knowledge is limited to coarse summaries.
no code implementations • 17 Aug 2021 • Tharindu B. Adikari, Stark C. Draper
In this paper we design and analyze compression methods that exploit temporal correlation in systems both with and without error-feedback.
no code implementations • 30 Jun 2021 • Sankalp Gilda, Stark C. Draper, Sebastien Fabbro, William Mahoney, Simon Prunet, Kanoa Withington, Matthew Wilson, Yuan-Sen Ting, Andrew Sheinis
We leverage epistemic and aleatoric uncertainties in conjunction with probabilistic generative modeling to identify candidate vent adjustments that are in-distribution (ID); for the optimal configuration for each ID sample, we predict the reduction in required observing time to achieve a fixed SNR.
1 code implementation • 25 Feb 2021 • Nafiseh Ghoroghchian, Gautam Dasarathy, Stark C. Draper
Our objective is to develop conditions on the graph structure, the quantity, and properties of measurements, under which we can recover the community organization in this coarse graph.
no code implementations • 4 Nov 2020 • Nafiseh Ghoroghchian, David M. Groppe, Roman Genov, Taufik A. Valiante, Stark C. Draper
This is particularly true when the number of nodes is high or there are temporal changes in the network.
no code implementations • 25 Oct 2020 • Nafiseh Ghoroghchian, Stark C. Draper, Roman Genov
Such a model maps signals onto vertices of a graph and the time-space dependencies among signals are modeled by the edge weights.
no code implementations • ICLR 2019 • Nuwan Ferdinand, Haider Al-Lawati, Stark C. Draper, Matthew Nokleby
Anytime Minibatch prevents stragglers from holding up the system without wasting the work that stragglers can complete.
no code implementations • 26 Oct 2018 • Tharindu Adikari, Stark C. Draper
In this paper, we introduce Differentiable Boundary Sets, an algorithm that overcomes the computational issues of the differentiable boundary tree scheme and also improves its classification accuracy and data representability.