Search Results for author: Oluwasanmi O. Koyejo

Found 9 papers, 0 papers with code

Fairness with Overlapping Groups; a Probabilistic Perspective

no code implementations NeurIPS 2020 Forest Yang, Mouhamadou Cisse, Oluwasanmi O. Koyejo

In algorithmically fair prediction problems, a standard goal is to ensure the equality of fairness metrics across multiple overlapping groups simultaneously.

Classification Fairness +1

Multiclass Performance Metric Elicitation

no code implementations NeurIPS 2019 Gaurush Hiranandani, Shant Boodaghians, Ruta Mehta, Oluwasanmi O. Koyejo

Metric Elicitation is a principled framework for selecting the performance metric that best reflects implicit user preferences.

Binary Classification Classification +1

Faster Distributed Synchronous SGD with Weak Synchronization

no code implementations ICLR 2018 Cong Xie, Oluwasanmi O. Koyejo, Indranil Gupta

Distributed training of deep learning is widely conducted with large neural networks and large datasets.

Generalized Correspondence-LDA Models (GC-LDA) for Identifying Functional Regions in the Brain

no code implementations NeurIPS 2016 Timothy Rubin, Oluwasanmi O. Koyejo, Michael N. Jones, Tal Yarkoni

This paper presents Generalized Correspondence-LDA (GC-LDA), a generalization of the Correspondence-LDA model that allows for variable spatial representations to be associated with topics, and increased flexibility in terms of the strength of the correspondence between data types induced by the model.

Examples are not enough, learn to criticize! Criticism for Interpretability

no code implementations NeurIPS 2016 Been Kim, Rajiv Khanna, Oluwasanmi O. Koyejo

Example-based explanations are widely used in the effort to improve the interpretability of highly complex distributions.

Consistent Multilabel Classification

no code implementations NeurIPS 2015 Oluwasanmi O. Koyejo, Nagarajan Natarajan, Pradeep K. Ravikumar, Inderjit S. Dhillon

In particular, we show that for multilabel metrics constructed as instance-, micro- and macro-averages, the population optimal classifier can be decomposed into binary classifiers based on the marginal instance-conditional distribution of each label, with a weak association between labels via the threshold.

Classification General Classification

On Prior Distributions and Approximate Inference for Structured Variables

no code implementations NeurIPS 2014 Oluwasanmi O. Koyejo, Rajiv Khanna, Joydeep Ghosh, Russell Poldrack

In cases where this projection is intractable, we propose a family of parameterized approximations indexed by subsets of the domain.

Sparse Bayesian structure learning with “dependent relevance determination” priors

no code implementations NeurIPS 2014 Anqi Wu, Mijung Park, Oluwasanmi O. Koyejo, Jonathan W. Pillow

Classical sparse regression methods, such as the lasso and automatic relevance determination (ARD), model parameters as independent a priori, and therefore do not exploit such dependencies.

regression

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