
How do SGD hyperparameters in natural training affect adversarial robustness?
Learning rate, batch size and momentum are three important hyperparamete...
read it

Invariance vs. Robustness of Neural Networks
We study the performance of neural network models on random geometric tr...
read it

Universalization of any adversarial attack using very few test examples
Deep learning models are known to be vulnerable not only to inputdepend...
read it

Groupwise Maximin Fair Allocation of Indivisible Goods
We study the problem of allocating indivisible goods among n agents in a...
read it

Big Data Classification Using Augmented Decision Trees
We present an algorithm for classification tasks on big data. Experiment...
read it

Big Data Regression Using Tree Based Segmentation
Scaling regression to large datasets is a common problem in many applica...
read it

A KdVlike advectiondispersion equation with some remarkable properties
We discuss a new nonlinear PDE, u_t + (2 u_xx/u) u_x = epsilon u_xxx, i...
read it

Clustering Mixed Datasets Using Homogeneity Analysis with Applications to Big Data
Datasets with a mixture of numerical and categorical attributes are rout...
read it

Fast Gaussian Process Regression for Big Data
Gaussian Processes are widely used for regression tasks. A known limitat...
read it

Frameworks for Designing Inplace Graph Algorithms
Readonly memory model is a classical model of computation to study time...
read it

Discovering the roots: Uniform closure results for algebraic classes under factoring
Newton iteration (NI) is an almost 350 years old recursive formula that ...
read it

Greedy Algorithms for Maximizing Nash Social Welfare
We study the problem of fairly allocating a set of indivisible goods amo...
read it

Shortest kDisjoint Paths via Determinants
The wellknown kdisjoint path problem (kDPP) asks for pairwise vertex...
read it

Reachability and Distances under Multiple Changes
Recently it was shown that the transitive closure of a directed graph ca...
read it

Covering and separation for logical fragments with modular predicates
For every class C of word languages, one may associate a decision proble...
read it

A Note on Polynomial Identity Testing for Depth3 Circuits
Let C be a depth3 arithmetic circuit of size at most s, computing a pol...
read it

Maximal and maximum transitive relation contained in a given binary relation
We study the problem of finding a maximal transitive relation contained ...
read it

Fast Exact Algorithms Using Hadamard Product of Polynomials
In this paper we develop an efficient procedure for computing a (scaled)...
read it

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators
Let F[X] be the polynomial ring over the variables X={x_1,x_2, ..., x_n}...
read it

A 2Approximation Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is ...
read it

A Bayesian Perspective of Statistical Machine Learning for Big Data
Statistical Machine Learning (SML) refers to a body of algorithms and me...
read it

Hierarchical Genetic Algorithms with evolving objective functions
We propose a framework of genetic algorithms which use multilevel hiera...
read it

Subset Feedback Vertex Set in Chordal and Split Graphs
In the Subset Feedback Vertex Set (SubsetFVS) problem the input is a gr...
read it

Fourier EntropyInfluence Conjecture for Random Linear Threshold Functions
The FourierEntropy Influence (FEI) Conjecture states that for any Boole...
read it

Efficient BlackBox Identity Testing over Free Group Algebra
Hrubeš and Wigderson [HW14] initiated the study of noncommutative arithm...
read it

Space Efficient Algorithms for BreadthDepth Search
Continuing the recent trend, in this article we design several spaceeff...
read it

Logics for Reversible Regular Languages and Semigroups with Involution
We present MSO and FO logics with predicates `between' and `neighbour' t...
read it

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials
We study the arithmetic circuit complexity of some wellknown family of ...
read it

Complexity of controlled bad sequences over finite powersets of N^k
We provide lower and upper bounds for the length of controlled bad seque...
read it

Dynamic complexity of Reachability: How many changes can we handle?
In 2015, it was shown that reachability for arbitrary directed graphs ca...
read it

Uniform Welfare Guarantees Under Identical Subadditive Valuations
We study the problem of allocating indivisible goods among agents that h...
read it

Tight Approximation Algorithms for pMean Welfare Under Subadditive Valuations
We develop polynomialtime algorithms for the fair and efficient allocat...
read it

On Universalized Adversarial and Invariant Perturbations
Convolutional neural networks or standard CNNs (StdCNNs) are translation...
read it

Dynamic Complexity of Expansion
Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see al...
read it

Diverse Collections in Matroids and Graphs
We investigate the parameterized complexity of finding diverse sets of s...
read it

Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
We present a parallel algorithm for permanent mod 2^k of a matrix of uni...
read it
Chennai Mathematical Institute
Chennai Mathematical Institute is a centre of excellence for teaching and research in the mathematical sciences. Founded in 1989 as part of the SPIC Science Foundation, it has been an autonomous institute since 1996.