1 code implementation • 19 Oct 2024 • Shubhajit Roy, Hrriday Ruparel, Kishan Ved, Anirban Dasgupta
We propose a novel approach for using the coarsening algorithm for graph-level tasks such as graph classification and graph regression.
no code implementations • 15 Dec 2023 • Jayesh Malaviya, Anirban Dasgupta, Rachit Chhaya
While coresets have been growing in terms of their application, barring few exceptions, they have mostly been limited to unsupervised settings.
no code implementations • 9 Jul 2023 • Aishik Rakshit, Samyak Mehta, Anirban Dasgupta
Optical Character Recognition (OCR) technology finds applications in digitizing books and unstructured documents, along with applications in other domains such as mobility statistics, law enforcement, traffic, security systems, etc.
Optical Character Recognition Optical Character Recognition (OCR)
1 code implementation • 31 May 2023 • Anant Kumar, Shrutimoy Das, Shubhajit Roy, Binita Maity, Anirban Dasgupta
We focus on the specific problem of subgraph counting and give localized versions of $k-$WL for any $k$.
Ranked #1 on Subgraph Counting - Chordal C4 on Synthetic Graph
no code implementations • 29 Sep 2021 • Vinu Sankar Sadasivan, Jayesh Malaviya, Anirban Dasgupta
Recent works attempt to prune neural networks at initialization to design sparse networks that can be trained efficiently.
1 code implementation • 27 Feb 2021 • Vinu Sankar Sadasivan, Anirban Dasgupta
Curriculum learning is a training strategy that sorts the training examples by some measure of their difficulty and gradually exposes them to the learner to improve the network performance.
no code implementations • 1 Jan 2021 • Vinu Sankar Sadasivan, Anirban Dasgupta
Curriculum learning is a training strategy that sorts the training examples by their difficulty and gradually exposes them to the learner.
no code implementations • 11 Dec 2020 • Rachit Chhaya, Jayesh Choudhari, Anirban Dasgupta, Supratim Shit
Our first algorithm gives online coresets of size $\tilde{O}(\mbox{poly}(k, d,\epsilon,\mu))$ for $k$-clusterings according to any $\mu$-similar Bregman divergence.
no code implementations • 6 Oct 2020 • Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar
We show that an approximately submodular function defined on a ground set of $n$ elements is $O(n^2)$ pointwise-close to a submodular function.
1 code implementation • ICML 2020 • Rachit Chhaya, Anirban Dasgupta, Supratim Shit
We propose a modified version of the lasso problem and obtain for it a coreset of size smaller than the least square regression.
1 code implementation • ICML 2020 • Rachit Chhaya, Jayesh Choudhari, Anirban Dasgupta, Supratim Shit
Factorizing tensors has recently become an important optimization module in a number of machine learning pipelines, especially in latent variable models.
no code implementations • NeurIPS 2018 • Flavio Chierichetti, Anirban Dasgupta, Shahrzad Haddadan, Ravi Kumar, Silvio Lattanzi
The classic Mallows model is a widely-used tool to realize distributions on per- mutations.
no code implementations • 12 Sep 2018 • Srikanta Bedathur, Indrajit Bhattacharya, Jayesh Choudhari, Anirban Dasgupta
We show using experiments on real and semi-synthetic data that HMHP is able to generalize better and recover the network strengths, topics and diffusion paths more accurately than state-of-the-art baselines.
no code implementations • 30 Nov 2017 • Kshiteej Sheth, Dinesh Garg, Anirban Dasgupta
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning.
no code implementations • 16 Sep 2015 • Anirban Dasgupta, Shubhobrata Bhattacharya, Aurobinda Routray
This paper presents a database of human faces for persons wearing spectacles.
no code implementations • 16 Sep 2015 • Anirban Dasgupta, Anshit Mandloi, Anjith George, Aurobinda Routray
In this paper, a modified algorithm for the detection of nasal and temporal eye corners is presented.
no code implementations • 16 Jun 2015 • Anirban Dasgupta, Suvodip Chakrborty, Aritra Chaudhuri, Aurobinda Routray
This paper evaluates four algorithms for denoising raw Electrooculography (EOG) data based on the Signal to Noise Ratio (SNR).
no code implementations • 29 May 2015 • Anirban Dasgupta, Aurobinda Routray
This thesis describes the development of fast algorithms for the computation of PERcentage CLOSure of eyes (PERCLOS) and Saccadic Ratio (SR).
no code implementations • 13 May 2015 • Anjith George, Anirban Dasgupta, Aurobinda Routray
Face detection is an essential step in many computer vision applications like surveillance, tracking, medical analysis, facial expression analysis etc.
no code implementations • 13 May 2015 • Anirban Dasgupta, Anjith George, S. L. Happy, Aurobinda Routray
In this paper, we propose a robust real time embedded platform to monitor the loss of attention of the driver during day as well as night driving conditions.
1 code implementation • WWW 2013 • Anirban Dasgupta, Arpita Ghosh
Our main contribution is a simple, new, mechanism for binary information elicitation for multiple tasks when agents have endogenous proficiencies, with the following properties: (i) Exerting maximum effort followed by truthful reporting of observations is a Nash equilibrium.
no code implementations • NeurIPS 2012 • Abhimanyu Das, Anirban Dasgupta, Ravi Kumar
We compare our algorithms to traditional greedy and $\ell_1$-regularization schemes and show that we obtain a more diverse set of features that result in the regression problem being stable under perturbations.
no code implementations • 12 Feb 2009 • Kilian Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford, Alex Smola
Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation.
no code implementations • 8 Oct 2008 • Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney
A large body of work has been devoted to defining and identifying clusters or communities in social and information networks.
Data Structures and Algorithms Data Analysis, Statistics and Probability Physics and Society