Chennai Mathematical Institute

∙ Siruseri , India ∙ 0 followers

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.

How do SGD hyperparameters in natural training affect adversarial robustness?

Learning rate, batch size and momentum are three important hyperparamete...
06/20/2020 ∙ by Sandesh Kamath, et al. ∙ 11 ∙ share

read it
Invariance vs. Robustness of Neural Networks

We study the performance of neural network models on random geometric tr...
02/26/2020 ∙ by Sandesh Kamath, et al. ∙ 10 ∙ share

read it
Universalization of any adversarial attack using very few test examples

Deep learning models are known to be vulnerable not only to input-depend...
05/18/2020 ∙ by Sandesh Kamath, et al. ∙ 3 ∙ share

read it
Groupwise Maximin Fair Allocation of Indivisible Goods

We study the problem of allocating indivisible goods among n agents in a...
11/21/2017 ∙ by Siddharth Barman, et al. ∙ 0 ∙ share

read it
Big Data Classification Using Augmented Decision Trees

We present an algorithm for classification tasks on big data. Experiment...
10/26/2017 ∙ by Rajiv Sambasivan, et al. ∙ 0 ∙ share

read it
Big Data Regression Using Tree Based Segmentation

Scaling regression to large datasets is a common problem in many applica...
07/24/2017 ∙ by Rajiv Sambasivan, et al. ∙ 0 ∙ share

read it
A KdV-like advection-dispersion equation with some remarkable properties

We discuss a new non-linear PDE, u_t + (2 u_xx/u) u_x = epsilon u_xxx, i...
09/17/2011 ∙ by Abhijit Sen, et al. ∙ 0 ∙ share

read it
Clustering Mixed Datasets Using Homogeneity Analysis with Applications to Big Data

Datasets with a mixture of numerical and categorical attributes are rout...
08/17/2016 ∙ by Rajiv Sambasivan, et al. ∙ 0 ∙ share

read it
Fast Gaussian Process Regression for Big Data

Gaussian Processes are widely used for regression tasks. A known limitat...
09/17/2015 ∙ by Sourish Das, et al. ∙ 0 ∙ share

read it
Frameworks for Designing In-place Graph Algorithms

Read-only memory model is a classical model of computation to study time...
11/27/2017 ∙ by Sankardeep Chakraborty, et al. ∙ 0 ∙ share

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 ...
10/09/2017 ∙ by Pranjal Dutta, et al. ∙ 0 ∙ share

read it
Greedy Algorithms for Maximizing Nash Social Welfare

We study the problem of fairly allocating a set of indivisible goods amo...
01/27/2018 ∙ by Siddharth Barman, et al. ∙ 0 ∙ share

read it
Shortest k-Disjoint Paths via Determinants

The well-known k-disjoint path problem (k-DPP) asks for pairwise vertex-...
02/05/2018 ∙ by Samir Datta, et al. ∙ 0 ∙ share

read it
Reachability and Distances under Multiple Changes

Recently it was shown that the transitive closure of a directed graph ca...
04/23/2018 ∙ by Samir Datta, et al. ∙ 0 ∙ share

read it
Covering and separation for logical fragments with modular predicates

For every class C of word languages, one may associate a decision proble...
04/24/2018 ∙ by Thomas Place, et al. ∙ 0 ∙ share

read it
A Note on Polynomial Identity Testing for Depth-3 Circuits

Let C be a depth-3 arithmetic circuit of size at most s, computing a pol...
05/17/2018 ∙ by V. Arvind, et al. ∙ 0 ∙ share

read it
Maximal and maximum transitive relation contained in a given binary relation

We study the problem of finding a maximal transitive relation contained ...
05/23/2018 ∙ by Sourav Chakraborty, et al. ∙ 0 ∙ share

read it
Fast Exact Algorithms Using Hadamard Product of Polynomials

In this paper we develop an efficient procedure for computing a (scaled)...
07/12/2018 ∙ by V. Arvind, et al. ∙ 0 ∙ share

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}...
08/31/2018 ∙ by V. Arvind, et al. ∙ 0 ∙ share

read it
A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

A tournament is a directed graph T such that every pair of vertices is ...
09/22/2018 ∙ by Daniel Lokshtanov, et al. ∙ 0 ∙ share

read it
A Bayesian Perspective of Statistical Machine Learning for Big Data

Statistical Machine Learning (SML) refers to a body of algorithms and me...
11/09/2018 ∙ by Rajiv Sambasivan, et al. ∙ 0 ∙ share

read it
Hierarchical Genetic Algorithms with evolving objective functions

We propose a framework of genetic algorithms which use multi-level hiera...
12/01/2018 ∙ by Harshavardhan Kamarthi, et al. ∙ 0 ∙ share

read it
Subset Feedback Vertex Set in Chordal and Split Graphs

In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a gr...
01/08/2019 ∙ by Geevarghese Philip, et al. ∙ 0 ∙ share

read it
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions

The Fourier-Entropy Influence (FEI) Conjecture states that for any Boole...
03/27/2019 ∙ by Sourav Chakraborty, et al. ∙ 0 ∙ share

read it
Efficient Black-Box Identity Testing over Free Group Algebra

Hrubeš and Wigderson [HW14] initiated the study of noncommutative arithm...
04/28/2019 ∙ by V. Arvind, et al. ∙ 0 ∙ share

read it
Space Efficient Algorithms for Breadth-Depth Search

Continuing the recent trend, in this article we design several space-eff...
06/19/2019 ∙ by Sankardeep Chakraborty, et al. ∙ 0 ∙ share

read it
Logics for Reversible Regular Languages and Semigroups with Involution

We present MSO and FO logics with predicates `between' and `neighbour' t...
07/02/2019 ∙ by Paul Gastin, et al. ∙ 0 ∙ share

read it
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials

We study the arithmetic circuit complexity of some well-known family of ...
08/22/2019 ∙ by V. Arvind, et al. ∙ 0 ∙ share

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...
09/04/2019 ∙ by A. R. Balasubramanian, et al. ∙ 0 ∙ share

read it
Dynamic complexity of Reachability: How many changes can we handle?

In 2015, it was shown that reachability for arbitrary directed graphs ca...
04/27/2020 ∙ by Samir Datta, et al. ∙ 0 ∙ share

read it
Uniform Welfare Guarantees Under Identical Subadditive Valuations

We study the problem of allocating indivisible goods among agents that h...
05/01/2020 ∙ by Siddharth Barman, et al. ∙ 0 ∙ share

read it
Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations

We develop polynomial-time algorithms for the fair and efficient allocat...
05/15/2020 ∙ by Siddharth Barman, et al. ∙ 0 ∙ share

read it
On Universalized Adversarial and Invariant Perturbations

Convolutional neural networks or standard CNNs (StdCNNs) are translation...
06/08/2020 ∙ by Sandesh Kamath, et al. ∙ 0 ∙ share

read it
Dynamic Complexity of Expansion

Dynamic Complexity was introduced by Immerman and Patnaik <cit.> (see al...
08/13/2020 ∙ by Samir Datta, et al. ∙ 0 ∙ share

read it
Diverse Collections in Matroids and Graphs

We investigate the parameterized complexity of finding diverse sets of s...
01/12/2021 ∙ by Fedor V. Fomin, et al. ∙ 0 ∙ share

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...
06/01/2021 ∙ by Samir Datta, et al. ∙ 0 ∙ share

read it

Chennai Mathematical Institute

Featured Researchers