Filters








17,292 Hits in 6.2 sec

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems [article]

David R. Karger and Sewoong Oh and Devavrat Shah
2013 arXiv   pre-print
We show that our algorithm, inspired by belief propagation and low-rank matrix approximation, significantly outperforms majority voting and, in fact, is optimal through comparison to an oracle that knows  ...  Hence, our non-adaptive approach is order-optimal under both scenarios. This strongly relies on the fact that workers are fleeting and can not be exploited.  ...  Hence, there is no gain in switching to an adaptive algorithm. We provide an optimal task allocation scheme and an optimal algorithm for inference on that task allocation.  ... 
arXiv:1110.3564v4 fatcat:h3nptybwuvggrhpekfxwohhu4q

Optimal Budget Allocation for Sample Average Approximation

Johannes O. Royset, Roberto Szechtman
2013 Operations Research  
, and superlinear convergence regimes for the optimization algorithm.  ...  We examine the convergence rate of the estimators as the computing budget tends to infinity, and characterize the allocation policies that maximize the convergence rate in the case of sublinear, linear  ...  Acknowledgement This study is supported by the Air Force Office of Scientific Research Young Investigator and Optimization & Discrete Mathematics programs.  ... 
doi:10.1287/opre.2013.1163 fatcat:pyt4ssmanbh6bifzfifkuy62eu

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems

David R. Karger, Sewoong Oh, Devavrat Shah
2014 Operations Research  
We show that our algorithm, inspired by belief propagation and low-rank matrix approximation, significantly outperforms majority voting and, in fact, is optimal through comparison to an oracle that knows  ...  Hence, our non-adaptive approach is order-optimal under both scenarios. This strongly relies on the fact that workers are fleeting and can not be exploited.  ...  We provide both an order-optimal task allocation scheme (based on random graphs) and an order-optimal algorithm for inference (based on low-rank approximation and belief propagation) on that task assignment  ... 
doi:10.1287/opre.2013.1235 fatcat:ozoasgl7tvfpbfctwpmbjscuhy

Statistical Decision Making for Optimal Budget Allocation in Crowd Labeling [article]

Xi Chen, Qihang Lin, Dengyong Zhou
2014 arXiv   pre-print
Since data instances have different levels of labeling difficulty and workers have different reliability, it is desirable to have an optimal policy to allocate the budget among all instance-worker pairs  ...  We consider categorical labeling tasks and formulate the budget allocation problem as a Bayesian Markov decision process (MDP), which simultaneously conducts learning and decision making.  ...  The Opt-KG is computationally efficient, achieves superior empirical performance and has some asymptotic theoretical guarantees.  ... 
arXiv:1403.3080v2 fatcat:tntusblngnegpoqiatzyk4nrwq

Simulation optimization using the Particle Swarm Optimization with optimal computing budget allocation

Si Zhang, Pan Chen, Loo Hay Lee, Chew Ek Peng, Chun-Hung Chen
2011 Proceedings of the 2011 Winter Simulation Conference (WSC)  
In this paper, we integrate the notion of optimal computing budget allocation (OCBA) into a simulation optimization approach, Particle Swarm Optimization (PSO), to improve the efficiency of PSO.  ...  The computing budget allocation models for two versions of PSO are built and two allocation rules PSOs_OCBA and PSObw_OCBA are derived by some approximations.  ...  budget allocated to X .  ... 
doi:10.1109/wsc.2011.6148117 dblp:conf/wsc/ZhangCLCC11 fatcat:hphziyvmy5atxnhr4dmsvlhhw4

Robust Budget Allocation Via Continuous Submodular Functions

Matthew Staib, Stefanie Jegelka
2019 Applied Mathematics and Optimization  
Formally, in the Budget Allocation Problem, one is given a bipartite influence graph between channels S and people T , and the task is to assign a budget y(s) to each channel s in S with the goal of maximizing  ...  We hence revisit a continuous version of the Budget Allocation or Bipartite Influence Maximization problem introduced by Alon et al. [3] from a robust optimization perspective, where an adversary may choose  ...  and also supported by NSF CAREER award 1553284 and The Defense Advanced Research Projects Agency (grant number YFA17 N66001-17-1-4039).  ... 
doi:10.1007/s00245-019-09567-0 fatcat:lxbezcnc7ffslcrote6hzy7ckm

DA-OCBA: Distributed Asynchronous Optimal Computing Budget Allocation Algorithm of Simulation Optimization Using Cloud Computing

Yukai Wang, Wenjie Tang, Yiping Yao, Feng Zhu
2019 Symmetry  
Among all ranking and selection algorithms, the optimal computing budget allocation (OCBA) algorithm is one of the most efficient.  ...  The ranking and selection of simulation optimization is a very powerful tool in systems engineering and operations research.  ...  Among all ranking and selection algorithms, optimal computing budget allocation (OCBA) [7] is one of the most efficient algorithms for simulation optimization [8] .  ... 
doi:10.3390/sym11101297 fatcat:cy3wgizm2nasncmszvc47ta34y

An Optimal Computing Budget Allocation Tree Policy for Monte Carlo Tree Search [article]

Yunchuan Li, Michael C. Fu, Jie Xu
2020 arXiv   pre-print
We present a new tree policy that optimally allocates a limited computing budget to maximize a lower bound on the probability of correctly selecting the best action at each node.  ...  Numerical experiments demonstrate the efficiency of our algorithm in selecting the best action at the root.  ...  the APCS at each sampling stage and prove that our algorithm converges to the optimal action. 3) We provide theoretical analyses, such as convergence guarantee, proof of optimality of the proposed algorithm  ... 
arXiv:2009.12407v1 fatcat:tb6xevspffhdzecvlfskulavqi

Simulation optimization using the cross-entropy method with optimal computing budget allocation

Donghai He, Loo Hay Lee, Chun-Hung Chen, Michael C. Fu, Segev Wasserkrug
2010 ACM Transactions on Modeling and Computer Simulation  
C., and Wasserkrug, S. 2010. Simulation optimization using the cross-entropy method with optimal computing budget allocation. ACM Trans. Model. Comput.  ...  We propose to improve the efficiency of simulation optimization by integrating the notion of optimal computing budget allocation into the Cross-Entropy (CE) method, which is a global optimization search  ...  for the performance of CE method and intend to find an efficient computing budget allocation so that this objective can be optimized.  ... 
doi:10.1145/1667072.1667076 fatcat:ankwlionrbhkxfrow6k3ql6rim

Numerical optimal control for HIV prevention with dynamic budget allocation [article]

Dmitry Gromov, Ingo Bulla, Ethan O. Romero-Severson, Oana Silvia Serea
2016 arXiv   pre-print
optimal control profiles; finally, the computed results are applied to the real problem yielding important and practically relevant results.  ...  The contribution of the paper is threefold: first, a novel model of HIV propagation is proposed; second, the methods from numerical optimal control are successfully applied to the developed model to compute  ...  Currently, we work on improving the developed algorithm in order to introduce it into the epidemiological community.  ... 
arXiv:1611.06728v1 fatcat:4nvacw44u5dyfoh35gnuxd6fii

Optimal Bidding, Allocation and Budget Spending for a Demand Side Platform Under Many Auction Types [article]

Alfonso Lobos, Paul Grigas, Zheng Wen, Kuang-chih Lee
2018 arXiv   pre-print
With a few minimal additional assumptions on the properties of the auctions, we demonstrate theoretically that our computationally efficient procedure based on convex optimization principles is guaranteed  ...  Our proposed formulation leads to a non-convex optimization problem due to the joint optimization over both impression allocation and bid price decisions.  ...  others which we don't explore here. ird, it can be proven that eorem 5.1 guarantees that Algorithm 3 would converge to an optimal solution for (2) as we get be er λ solutions of the dual problem.  ... 
arXiv:1805.11645v1 fatcat:rp7gwcwidvhvxp7fbeqny5eqya

Optimal SP frame selection and bit budget allocation for mobile H.264 video streaming

Stefania Colonnese, Stefano Rinauro, Lorenzo Rossi, Gaetano Scarano
2012 EURASIP Journal on Image and Video Processing  
In this study, we address the issue of optimal joint selection of the SP frames locations and bit budget allocation at frame layer.  ...  The optimization is carried out via a game theoretic approach under assigned system constraints on the overall streaming rate and the maximum random access delay.  ...  Optimal SP selection and bit budget allocation Here, we carry out a frame layer optimization of SP frame selection and bit budget allocation for mobile H.264 video streaming resorting to a game theoretic  ... 
doi:10.1186/1687-5281-2012-18 fatcat:5z5djyoaa5go5m3cgzuv4mdpxa

Optimal measurement budget allocation for Kalman prediction over a finite time horizon by genetic algorithms

Antoine Aspeel, Axel Legay, Raphaël M. Jungers, Benoit Macq
2021 EURASIP Journal on Advances in Signal Processing  
In addition, we investigate the closely related problem of finding a trade-off between number of measurements and signal to noise ratio.First, the optimal measurement budget allocation problem is reduced  ...  AbstractIn this paper, we address the problem of optimal measurement budget allocation to estimate the state of a linear discrete-time dynamical system over a finite horizon.  ...  There is no budget constraint on the use of each measurement process. In 2012, Vitus et al. [26] proposed an efficient algorithm to choose a sensor among a given set at each discrete time step.  ... 
doi:10.1186/s13634-021-00732-8 fatcat:lp2nat3bovhrblhhxogc6hmzxe

Asymptotically Optimal Algorithms for Budgeted Multiple Play Bandits [article]

Alexander Luedtke, Emilie Kaufmann, Antoine Chambaz (MAP5 - UMR 8145)
2019 arXiv   pre-print
We derive an asymptotic regret lower bound for any uniformly efficient algorithm in our setting.  ...  We show these algorithms are asymptotically optimal, both in rateand leading problem-dependent constants, including in the thick margin setting where multiple arms fall on the decision boundary.  ...  Acknowledgements The authors acknowledge the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-13-BS01-0005 (project SPADRO) and ANR-16-CE40-0002 (project BADASS).  ... 
arXiv:1606.09388v3 fatcat:uek4qx7oavhc7lkx4hydfifajy

Achieving Budget-optimality with Adaptive Schemes in Crowdsourcing [article]

Ashish Khetan, Sewoong Oh
2017 arXiv   pre-print
In particular, we ask whether adaptive task assignment schemes lead to a more efficient trade-off between the accuracy and the budget.  ...  Adaptive schemes, where tasks are assigned adaptively based on the data collected thus far, are widely used in practical crowdsourcing systems to efficiently use a given fixed budget.  ...  Acknowledgements This work is supported by NSF SaTC award CNS-1527754, NSF CISE award CCF-1553452, NSF CISE award CCF-1705007 and GOOGLE Faculty Research Award.  ... 
arXiv:1602.03481v3 fatcat:qorrngjnffe7fjkd2lnnjbvwfe
« Previous Showing results 1 — 15 out of 17,292 results