no code implementations • 3 Nov 2021 • Ido Nachum, Jan Hązła, Michael Gastpar, Anatoly Khina
The celebrated Johnson--Lindenstrauss lemma answers this question for linear fully-connected neural networks (FNNs), stating that the geometry is essentially preserved.
no code implementations • ICLR 2022 • Ido Nachum, Jan Hazla, Michael Gastpar, Anatoly Khina
The celebrated Johnson-Lindenstrauss lemma answers this question for linear fully-connected neural networks (FNNs), stating that the geometry is essentially preserved.
no code implementations • 21 Nov 2020 • Anatoly Khina, Arie Yeredor, Ram Zamir
It is common to assess the "memory strength" of a stationary process looking at how fast the normalized log-determinant of its covariance submatrices (i. e., entropy rate) decreases.
no code implementations • 17 Sep 2018 • Mohammad Javad Khojasteh, Anatoly Khina, Massimo Franceschetti, Tara Javidi
In the case of scalar plants, we derive an upper bound on the attacker's deception probability for any measurable control policy when the attacker uses an arbitrary learning algorithm to estimate the system dynamics.