Zobrazeno 1 - 10
of 397
pro vyhledávání: '"Kleinberg, Robert"'
Autor:
Fikioris, Giannis, Kleinberg, Robert, Kolumbus, Yoav, Kumar, Raunak, Mansour, Yishay, Tardos, Éva
In many repeated auction settings, participants care not only about how frequently they win but also how their winnings are distributed over time. This problem arises in various practical domains where avoiding congested demand is crucial, such as on
Externí odkaz:
http://arxiv.org/abs/2411.04843
We introduce the notion of an online matroid embedding, which is an algorithm for mapping an unknown matroid that is revealed in an online fashion to a larger-but-known matroid. The existence of such embedding enables a reduction from the version of
Externí odkaz:
http://arxiv.org/abs/2407.10316
Autor:
Dagan, Yuval, Daskalakis, Constantinos, Fishelson, Maxwell, Golowich, Noah, Kleinberg, Robert, Okoroafor, Princewill
A set of probabilistic forecasts is calibrated if each prediction of the forecaster closely approximates the empirical distribution of outcomes on the subset of timesteps where that prediction was made. We study the fundamental problem of online cali
Externí odkaz:
http://arxiv.org/abs/2406.13668
We present Prequal (Probing to Reduce Queuing and Latency), a load balancer for distributed multi-tenant systems. Prequal aims to minimize real-time request latency in the presence of heterogeneous server capacities and non-uniform, time-varying anta
Externí odkaz:
http://arxiv.org/abs/2312.10172
Predictive models in ML need to be trustworthy and reliable, which often at the very least means outputting calibrated probabilities. This can be particularly difficult to guarantee in the online prediction setting when the outcome sequence can be ge
Externí odkaz:
http://arxiv.org/abs/2310.17002
Autor:
Wilson, Tegan, Amir, Daniel, Saran, Nitika, Kleinberg, Robert, Shrivastav, Vishal, Weatherspoon, Hakim
In a landmark 1981 paper, Valiant and Brebner gave birth to the study of oblivious routing and, simultaneously, introduced its most powerful and ubiquitous method: Valiant load balancing (VLB). By routing messages through a randomly sampled intermedi
Externí odkaz:
http://arxiv.org/abs/2308.14837
We consider the problem of evaluating forecasts of binary events whose predictions are consumed by rational agents who take an action in response to a prediction, but whose utility is unknown to the forecaster. We show that optimizing forecasts for a
Externí odkaz:
http://arxiv.org/abs/2307.00168
Estimating the empirical distribution of a scalar-valued data set is a basic and fundamental task. In this paper, we tackle the problem of estimating an empirical distribution in a setting with two challenging features. First, the algorithm does not
Externí odkaz:
http://arxiv.org/abs/2301.05682
Online convex optimization (OCO) is a widely used framework in online learning. In each round, the learner chooses a decision in a convex set and an adversary chooses a convex loss function, and then the learner suffers the loss associated with their
Externí odkaz:
http://arxiv.org/abs/2210.09903