1 code implementation • 22 Jun 2023 • Emil Carlsson, Debabrota Basu, Fredrik D. Johansson, Devdatt Dubhashi
Both these algorithms try to track an optimal allocation based on the lower bound and computed by a weighted projection onto the boundary of a normal cone.
no code implementations • 17 May 2023 • Emil Carlsson, Devdatt Dubhashi
In this work we introduce a structured signaling game, an extension of the classical signaling game with a similarity structure between meanings in the context, along with a variant of the Rational Speech Act (RSA) framework which we call structured-RSA (sRSA) for pragmatic reasoning in structured domains.
no code implementations • 17 May 2023 • Emil Carlsson, Devdatt Dubhashi, Terry Regier
It has been argued that semantic systems reflect pressure for efficiency, and a current debate concerns the cultural evolutionary process that produces this pattern.
no code implementations • 27 Dec 2021 • Adel Daoud, Felipe Jordan, Makkunda Sharma, Fredrik Johansson, Devdatt Dubhashi, Sourabh Paul, Subhashis Banerjee
In this paper, we use deep learning to estimate living conditions in India.
no code implementations • 6 Sep 2021 • Emil Carlsson, Devdatt Dubhashi, Fredrik D. Johansson
We propose algorithms based on a multi-level Thompson sampling scheme, for the stochastic multi-armed bandit and its contextual variant with linear expected rewards, in the setting where arms are clustered.
no code implementations • 28 May 2021 • Emil Carlsson, Devdatt Dubhashi, Fredrik D. Johansson
The agents gradually learn to communicate using reinforcement learning and the resulting numeral systems are shown to be efficient in the information-theoretic framework of Regier et al. (2015); Gibson et al. (2017).
no code implementations • 8 Dec 2020 • Adel Daoud, Devdatt Dubhashi
The algorithmic modeling culture (AMC) refers to practices defining a machine-learning (ML) procedure that generates accurate predictions about an event of interest.
Causal Inference Methodology Computers and Society
no code implementations • 21 Sep 2020 • Aniruddha Adiga, Devdatt Dubhashi, Bryan Lewis, Madhav Marathe, Srinivasan Venkatramanan, Anil Vullikanti
COVID-19 pandemic represents an unprecedented global health crisis in the last 100 years.
no code implementations • 30 Mar 2020 • Arman Rahbar, Ashkan Panahi, Chiranjib Bhattacharyya, Devdatt Dubhashi, Morteza Haghir Chehreghani
Knowledge transfer is shown to be a very successful technique for training neural classifiers: together with the ground truth data, it uses the "privileged information" (PI) obtained by a "teacher" network to train a "student" network.
no code implementations • 13 May 2019 • Arman Rahbar, Emilio Jorge, Devdatt Dubhashi, Morteza Haghir Chehreghani
The approximated representations induced by these kernels are fed to the neural network and the optimization and generalization properties of the final model are evaluated and compared.
no code implementations • 9 Mar 2019 • Arman Rahbar, Ashkan Panahi, Morteza Haghir Chehreghani, Devdatt Dubhashi, Hamid Krim
We develop a novel theoretical framework for understating OT schemes respecting a class structure.
no code implementations • 29 Nov 2017 • Vinay Jethava, Devdatt Dubhashi
We introduce a framework using Generative Adversarial Networks (GANs) for likelihood--free inference (LFI) and Approximate Bayesian Computation (ABC) where we replace the black-box simulator model with an approximator network and generate a rich set of summary features in a data driven fashion.
no code implementations • ICML 2017 • Ashkan Panahi, Devdatt Dubhashi, Fredrik D. Johansson, Chiranjib Bhattacharyya
Standard clustering methods such as K-means, Gaussian mixture models, and hierarchical clustering are beset by local minima, which are sometimes drastically suboptimal.
no code implementations • 16 Jan 2017 • Aristide C. Y. Tossou, Christos Dimitrakakis, Devdatt Dubhashi
We present a novel extension of Thompson Sampling for stochastic sequential decision problems with graph feedback, even when the graph structure itself is unknown and/or changing.
no code implementations • NeurIPS 2015 • Fredrik D. Johansson, Ankani Chattoraj, Chiranjib Bhattacharyya, Devdatt Dubhashi
We introduce a unifying generalization of the Lovász theta function, and the associated geometric embedding, for graphs with weights on both nodes and edges.
no code implementations • NeurIPS 2012 • Vinay Jethava, Anders Martinsson, Chiranjib Bhattacharyya, Devdatt Dubhashi
We show that the random graph with a planted clique is an example of $SVM-\theta$ graph, and as a consequence a SVM based approach easily identifies the clique in large graphs and is competitive with the state-of-the-art.