K. V. Subrahmanyam

According to our database, K. V. Subrahmanyam authored at least 24 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Orbit closures, stabilizer limits and intermediate G-varieties.

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2023

2022

Geometric Complexity Theory - Lie Algebraic Methods for Projective Limits of Stable Points.

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2022

Universalization of Any Adversarial Attack using Very Few Test Examples.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam, Vineeth N. Balasubramanian

Proceedings of the CODS-COMAD 2022: 5th Joint International Conference on Data Science & Management of Data (9th ACM IKDD CODS and 27th COMAD), Bangalore, India, January 8, 2022

2021

Can we have it all? On the Trade-off between Spatial and Adversarial Robustness of Neural Networks.

Sandesh Kamath, Amit Deshpande, Subrahmanyam Kambhampati Venkata, Vineeth N. Balasubramanian

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

How do SGD hyperparameters in natural training affect adversarial robustness?

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

On Universalized Adversarial and Invariant Perturbations.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

Universalization of any adversarial attack using very few test examples.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

Invariance vs. Robustness of Neural Networks.

Sandesh Kamath, Amit Deshpande, K. V. Subrahmanyam

CoRR, 2020

2019

SO(2)-equivariance in Neural networks using tensor nonlinearity.

Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam

Proceedings of the 30th British Machine Vision Conference 2019, 2019

2017

Non-commutative Edmonds' problem and matrix semi-invariants.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

Comput. Complex., 2017

Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Invariant representations of images for better learning.

Muthuvel Murugan Issakkimuthu, K. V. Subrahmanyam

Proceedings of the 25th European Symposium on Artificial Neural Networks, 2017

2015

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

CoRR, 2015

On generating the ring of matrix semi-invariants.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

CoRR, 2015

2009

Quantum deformations of the restriction of GL_mn(C)-modules to GL_m(C) × GL_n(C)

Bharat Adsul, Milind A. Sohoni, K. V. Subrahmanyam

CoRR, 2009

1999

The Query Complexity of Program Checking by Constant-Depth Circuits.

Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

1998

Computing Mimicking Networks.

Shiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Solving Some Discrepancy Problems in NC.

Sanjeev Mahajan, Edgar A. Ramos, K. V. Subrahmanyam

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1994

Abstract and Generic Rigidity in the Plane.

Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam

J. Comb. Theory B, 1994

Directed Monotone Contact Networks for Threshold Functions.

Jaikumar Radhakrishnan, K. V. Subrahmanyam

Inf. Process. Lett., 1994

1993

On Some Communication Complexity Problems Related to THreshold Functions.

Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Directed vs. Undirected Monotone Contact Networks for Threshold Functions

Magnús M. Halldórsson, Jaikumar Radhakrishnan, K. V. Subrahmanyam

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

On the Power of Enumerative Counting.

Sanjeev Saluja, K. V. Subrahmanyam

Inf. Process. Lett., 1992

Descriptive Complexity of #P Functions.

Sanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992