no code implementations • 21 Dec 2023 • Michael Kuoch, Chi-Ning Chou, Nikhil Parthasarathy, Joel Dapello, James J. DiCarlo, Haim Sompolinsky, SueYeon Chung
Recently, growth in our understanding of the computations performed in both biological and artificial neural networks has largely been driven by either low-level mechanistic studies or global normative approaches.
1 code implementation • 10 Feb 2022 • Yao-Yuan Yang, Chi-Ning Chou, Kamalika Chaudhuri
Neural networks are known to use spurious correlations such as background information for classification.
no code implementations • 24 Feb 2021 • Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy
In this work we consider the approximability of $\textsf{Max-CSP}(f)$ in the context of sketching algorithms and completely characterize the approximability of all Boolean CSPs.
Computational Complexity Data Structures and Algorithms
no code implementations • 11 Jun 2020 • Chi-Ning Chou, Juspreet Singh Sandhu, Mien Brabeeba Wang, Tiancheng Yu
In this work, we present a streamlined three-step recipe to tackle the "chicken and egg" problem and give a general framework for analyzing stochastic dynamics in learning algorithms.
no code implementations • 4 Nov 2019 • Chi-Ning Chou, Mien Brabeeba Wang
In this work, we give the first convergence rate analysis for the biological version of Oja's rule in solving streaming PCA.
no code implementations • NeurIPS 2019 • Boaz Barak, Chi-Ning Chou, Zhixian Lei, Tselil Schramm, Yueqi Sheng
Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time algorithm that given a pair of $\gamma$-correlated $G(n, p)$ graphs $G_0, G_1$ with average degree between $n^{\varepsilon}$ and $n^{1/153}$ for $\varepsilon = o(1)$, recovers the "ground truth" permutation $\pi\in S_n$ that matches the vertices of $G_0$ to the vertices of $G_n$ in the way that minimizes the number of mismatched edges.
no code implementations • 28 Mar 2018 • Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu
Our main technical insight is a dual view of the SNN dynamics, under which SNN can be viewed as a new natural primal-dual algorithm for the l1 minimization problem.