Minimizing Regret in Unconstrained Online Convex Optimization
Related publications (40)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The response of a steel structure is closely related to the behavior of its joints. This means that it is necessary to take explicit account of joint properties in order to ensure a consistent approach to design optimization of steel frames. Semi-rigid des ...
2009
This paper describes new optimization strategies that offer significant improvements in performance over existing methods for bridge-truss design. In this study, a real-world cost function that consists of costs on the weight of the truss and the number of ...
To analyze the potential outcomes resulting from interaction between autonomous decision-making "smart parts" in logistics networks, we propose here an exactly solvable stylized model that is able to quantify how much the dynamics can be enhanced by (fully ...
The sensitivity of the unmeasured state variables to the measurements strongly affects the rate of convergence of a state estimation algorithm. To overcome potential observability problems, the approach has been to identify the model parameters so as to re ...
We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow duration, service invocation costs, availability, and reliability. All of these ...
In this paper we address the issue of network cost efficiency for live streaming peer-to-peer systems. We formalize this as an optimization problem, which features a generic cost function. The latter is appropriate to capture not only ISP-specific link wei ...
The Broker with the cost function model of the ISS/VIOLA Meta-Scheduling System implementation is described in details. The Broker includes all the algorithmic steps needed to determine a well suited machine for an application component. This judicious cho ...
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...
2005
,
We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...
2006
,
We present the first polylog-competitive online algorithm for the general multicast problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of requests accepted by our algorithm ...
