output
20092026
most citedImproving fairness in machine learning systems: What do industry practitioners need?

758 citations

Showing 2016Show all

14 papers · 1 filter

cs.GT2016★ 1 cited

On-demand or Spot? Selling the cloud to risk-averse customers

Darrell Hoy, Nicole Immorlica, Brendan Lucier

In Amazon EC2, cloud resources are sold through a combination of an on-demand market, in which customers buy resources at a fixed price, and a spot market, in which customers bid f…

stat.ML2016★ 19 cited

Optimal and Adaptive Off-policy Evaluation in Contextual Bandits

Yu-Xiang Wang, Alekh Agarwal, Miroslav Dudik

We study the off-policy evaluation problem---estimating the value of a target policy using data collected by another policy---under the contextual bandit model. We consider the gen…

econ.GN2016★ 7 cited

Functional Forms for Tractable Economic Models and the Cost Structure of International Trade

Michal Fabinger, E. Glen Weyl

We present functional forms allowing a broader range of analytic solutions to common economic equilibrium problems. These can increase the realism of pen-and-paper solutions or spe…

cs.GT2016★ 3 cited

Arbitrage-Free Combinatorial Market Making via Integer Programming

Christian Kroer, Miroslav Dudík, Sébastien Lahaie +1

We present a new combinatorial market maker that operates arbitrage-free combinatorial prediction markets specified by integer programs. Although the problem of arbitrage-free pric…

stat.ML2016★ 41 cited

Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relations

Aaron Schein, Mingyuan Zhou, David M. Blei +1

We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country--country interaction event data. These data consist of interaction events of the form "country to…

cs.LG2016★ 39 cited

Off-policy evaluation for slate recommendation

Adith Swaminathan, Akshay Krishnamurthy, Alekh Agarwal +4

This paper studies the evaluation of policies that recommend an ordered set of items (e.g., a ranking) based on some context---a common scenario in web search, ads, and recommendat…

cs.SI2016★ 23 cited

Averaging Gone Wrong: Using Time-Aware Analyses to Better Understand Behavior

Samuel Barbosa, Dan Cosley, Amit Sharma +1

Online communities provide a fertile ground for analyzing people's behavior and improving our understanding of social processes. Because both people and communities change over tim…

cs.SI2016★ 35 cited

Predictability of Popularity: Gaps between Prediction and Understanding

Benjamin Shulman, Amit Sharma, Dan Cosley

Can we predict the future popularity of a song, movie or tweet? Recent work suggests that although it may be hard to predict an item's popularity when it is first introduced, peeki…

cs.LG2016★ 39 cited

Efficient Algorithms for Adversarial Contextual Learning

Vasilis Syrgkanis, Akshay Krishnamurthy, Robert E. Schapire

We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action…

cs.SI2016★ 147 cited

Exploring limits to prediction in complex social systems

Travis Martin, Jake M. Hofman, Amit Sharma +2

How predictable is success in complex social systems? In spite of a recent profusion of prediction studies that exploit online social and information network data, this question re…

cs.GT2016★ 9 cited

Bayesian Exploration: Incentivizing Exploration in Bayesian Games

Yishay Mansour, Aleksandrs Slivkins, Vasilis Syrgkanis +1

We consider a ubiquitous scenario in the Internet economy when individual decision-makers (henceforth, agents) both produce and consume information as they make strategic choices i…

cs.LG2016★ 4 cited

Search Improves Label for Active Learning

Alina Beygelzimer, Daniel Hsu, John Langford +1

We investigate active learning with access to two distinct oracles: Label (which is standard) and Search (which is not). The Search oracle models the situation where a human search…

cs.LG2016★ 9 cited

PAC Reinforcement Learning with Rich Observations

Akshay Krishnamurthy, Alekh Agarwal, John Langford

We propose and study a new model for reinforcement learning with rich observations, generalizing contextual bandits to sequential decision making. These models require an agent to…

cs.LG2016★ 50 cited

Efficient Second Order Online Learning by Sketching

Haipeng Luo, Alekh Agarwal, Nicolo Cesa-Bianchi +1

We propose Sketched Online Newton (SON), an online second order learning algorithm that enjoys substantially improved regret guarantees for ill-conditioned data. SON is an enhanced…