Akash Kumar

Most-cited papers

Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
2019Symposium on the Theory of Computing18 citations Open access
Semantic Scholar
Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
2018IEEE Annual Symposium on Foundations of Computer Science17 citations Open access
Semantic Scholar
Finding Pseudorandom Colorings of Pseudorandom Graphs
Akash Kumar, Anand Louis, Madhur Tulsiani
2017Foundations of Software Technology and Theoretical Computer Science11 citations
Semantic Scholar
Robust Empirical Risk Minimization with Tolerance
Robi Bhattacharjee, Max Hopkins, Akash Kumar, Hantao Yu +1 more
2022International Conference on Algorithmic Learning Theory10 citations Open access
Semantic Scholar
Testing k-Monotonicity
C. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar +1 more
2016Information Technology Convergence and Services10 citations
Semantic Scholar
Testing k-Monotonicity: The Rise and Fall of Boolean Functions
Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar +1 more
2019Theory of Computing9 citations Open access
Semantic Scholar
The Teaching Dimension of Kernel Perceptron
Akash Kumar, Han-Qi Zhang, A. Singla, Yuxin Chen
2020International Conference on Artificial Intelligence and Statistics8 citations
Semantic Scholar
Approximation algorithms for digraph width parameters
Shiva Kintali, Nishad Kothari, Akash Kumar
2011Theoretical Computer Science8 citations Open access
Semantic Scholar
A Sublinear Time Tester for Max-Cut on Clusterable Graphs
Agastya Vibhuti Jha, Akash Kumar
2024International Colloquium on Automata, Languages and Programming5 citations
Semantic Scholar
Teaching via Best-Case Counterexamples in the Learning-with-Equivalence-Queries Paradigm
Akash Kumar, Yuxin Chen, A. Singla
2021Neural Information Processing Systems4 citations
Semantic Scholar
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon ^{-1}\right)$-time partition oracles for minor-free graph classes
Akash Kumar, C. Seshadhri, Andrew Stolman
2021IEEE Annual Symposium on Foundations of Computer Science4 citations
Semantic Scholar
Flipping out with Many Flips: Hardness of Testing k-Monotonicity
Elena Grigorescu, Akash Kumar, K. Wimmer
2017International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques4 citations Open access
Semantic Scholar
Mirror Descent on Reproducing Kernel Banach Spaces
Akash Kumar, M. Belkin, Parthe Pandit
2024arXiv.org3 citations
Semantic Scholar
The complexity of testing all properties of planar graphs, and the role of isomorphism
Sabyasachi Basu, Akash Kumar, C. Seshadhri
2021Electron. Colloquium Comput. Complex.3 citations Open access
Semantic Scholar
A Gap Between the Gaussian RKHS and Neural Networks: An Infinite-Center Asymptotic Analysis
Akash Kumar, Rahul Parhi, M. Belkin
2025Annual Conference Computational Learning Theory2 citations
Semantic Scholar
Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
2020SIAM journal on computing (Print)2 citations
Semantic Scholar
Fiding forbidden minors in sublinear time: a O(n1/2 + o(1))-query one-sided tester for minor closed properties on bounded degree graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
2018arXiv.org2 citations
Semantic Scholar
Average-case Complexity of Teaching Convex Polytopes via Halfspace Queries
Akash Kumar, A. Singla, Yisong Yue, Yuxin Chen
2020arXiv.org1 citations
Semantic Scholar
K-Monotonicity is Not Testable on the Hypercube
Elena Grigorescu, Akash Kumar, K. Wimmer
2017Electron. Colloquium Comput. Complex.1 citations
Semantic Scholar
Review of polynomia and related realms by Dan Kalman
Akash Kumar
2012SIGA1 citations
Semantic Scholar
Awakening of the Buddha: Subspace Learning During Population-Loss Plateaus
Akash Kumar
20260 citations
Semantic Scholar
Can Representation Learning Decouple from Loss Minimization? Polar Updates Have an Answer
Akash Kumar
20260 citations
Semantic Scholar
Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs
Akash Kumar, Abhiruk Lahiri, C. Seshadhri
2026arXiv.org0 citations
Semantic Scholar
A Gap Between Decision Trees and Neural Networks
Akash Kumar
2026arXiv.org0 citations
Semantic Scholar
Flat Loss, Evolving Features: Grokking in Modular Addition
Akash Kumar, Karthik Sankaranarayanan
20260 citations
Semantic Scholar
Dictionary Learning: The Complexity of Learning Sparse Superposed Features with Feedback
Akash Kumar
20250 citations
Semantic Scholar
Learning Smooth Distance Functions via Queries
Akash Kumar, Sanjoy Dasgupta
2024arXiv.org0 citations
Semantic Scholar
Spectral Approach to Modern Algorithm Design
Akash Kumar
20200 citations
Semantic Scholar
andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs
Akash Kumar, C. Seshadhri, Andrew Stolman
2019Electron. Colloquium Comput. Complex.0 citations
Semantic Scholar
" Natural Proofs Vs Derandomization "
Akash Kumar
20160 citations
Semantic Scholar
Review of combinatorial optimization by B. Korte and J. Vygen
Akash Kumar
2013SIGA0 citations
Semantic Scholar
Approximation Algorithms for Directed Width Parameters
Shiva Kintali, Nishad Kothari, Akash Kumar
2011arXiv.org0 citations
Semantic Scholar
4 Some open problems on 2-coloring and 3-coloring
Akash Kumar
0 citations
Semantic Scholar