Search Results for author: Devdatt Dubhashi

Found 19 papers, 1 papers with code

Pure Exploration in Bandits with Linear Constraints

1 code implementation22 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.

Pragmatic Reasoning in Structured Signaling Games

no code implementations17 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.

Multi-agent Reinforcement Learning reinforcement-learning

Cultural evolution via iterated learning and communication explains efficient color naming systems

no code implementations17 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.

Thompson Sampling for Bandits with Clustered Arms

no code implementations6 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.

Clustering Thompson Sampling

Learning Approximate and Exact Numeral Systems via Reinforcement Learning

no code implementations28 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).

reinforcement-learning Reinforcement Learning (RL)

Statistical modeling: the three cultures

no code implementations8 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

Analysis of Knowledge Transfer in Kernel Regime

no code implementations30 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.

Knowledge Distillation Transfer Learning

Do Kernel and Neural Embeddings Help in Training and Generalization?

no code implementations13 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.

General Classification

Easy High-Dimensional Likelihood-Free Inference

no code implementations29 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.

Vocal Bursts Intensity Prediction

Clustering by Sum of Norms: Stochastic Incremental Algorithm, Convergence and Cluster Recovery

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.

Clustering

Thompson Sampling For Stochastic Bandits with Graph Feedback

no code implementations16 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.

Thompson Sampling

The Lovász ϑ function, SVMs and finding large dense subgraphs

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.

Combinatorial Optimization

Cannot find the paper you are looking for? You can Submit a new open access paper.