Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Wang, Joshua"'
Online caching is among the most fundamental and well-studied problems in the area of online algorithms. Innovative algorithmic ideas and analysis - including potential functions and primal-dual techniques - give insight into this still-growing area.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23d5481caa9e371ac0bd988e758f0cbf
We study the power of menus of contracts in principal-agent problems with adverse selection (agents can be one of several types) and moral hazard (we cannot observe agent actions directly). For principal-agent problems with $T$ types and $n$ actions,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba5d382ad51fcc2291b6cee710e186c9
Caching is among the most well-studied topics in algorithm design, in part because it is such a fundamental component of many computer systems. Much of traditional caching research studies cache management for a single-user or single-processor enviro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a2a4543412e1a2153f51f295409adcb
We consider the problem of multi-class classification, where a stream of adversarially chosen queries arrive and must be assigned a label online. Unlike traditional bounds which seek to minimize the misclassification rate, we minimize the total dista
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5ced761bf1f5563366edd6bae247bc8
http://arxiv.org/abs/2111.08057
http://arxiv.org/abs/2111.08057
We consider the problem of efficiently scheduling jobs with precedence constraints on a set of identical machines in the presence of a uniform communication delay. Such precedence-constrained jobs can be modeled as a directed acyclic graph, $G = (V,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5be2cf5bb2788b8582dc1bbb7e7d4591
http://arxiv.org/abs/2108.02770
http://arxiv.org/abs/2108.02770
We prove that the evolution of weight vectors in online gradient descent can encode arbitrary polynomial-space computations, even in very simple learning settings. Our results imply that, under weak complexity-theoretic assumptions, it is impossible
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e96ccf0cd1fab24bac8e660c1268802
http://arxiv.org/abs/1807.01280
http://arxiv.org/abs/1807.01280
Autor:
Roughgarden, Tim, Wang, Joshua R.
We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe $[n]=\{1,2,...,n\}$ and a sequence of $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1379d6a6eda2f103b05a5d9f71fac6f5
In this paper we study the fundamental problems of maximizing a continuous non-monotone submodular function over the hypercube, both with and without coordinate-wise concavity. This family of optimization problems has several applications in machine
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ca398fa10ecb81a095e88a788abe5b1
Given a set of numbers, the $k$-SUM problem asks for a subset of $k$ numbers that sums to zero. When the numbers are integers, the time and space complexity of $k$-SUM is generally studied in the word-RAM model; when the numbers are reals, the comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c025278706337e8687de8a89f1a9050
http://arxiv.org/abs/1605.07285
http://arxiv.org/abs/1605.07285
The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another node. In direc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5af3a3c8171946f3ef1c53e9dbfbb0b1