Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Online Bin Packing with Predictions (2102.03311v3)

Published 5 Feb 2021 in cs.DS and cs.LG

Abstract: Bin packing is a classic optimization problem with a wide range of applications, from load balancing to supply chain management. In this work, we study the online variant of the problem, in which a sequence of items of various sizes must be placed into a minimum number of bins of uniform capacity. The online algorithm is enhanced with a (potentially erroneous) prediction concerning the frequency of item sizes in the sequence. We design and analyze online algorithms with efficient tradeoffs between the consistency (i.e., the competitive ratio assuming no prediction error) and the robustness (i.e., the competitive ratio under adversarial error), and whose performance degrades near-optimally as a function of the prediction error. This is the first theoretical and experimental study of online bin packing under competitive analysis, in the realistic setting of learnable predictions. Previous work addressed only extreme cases with respect to the prediction error, and relied on overly powerful and error-free oracles.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (67)
  1. Customizing ML predictions for online algorithms.  In International Conference on Machine Learning (ICML), pp. 303–313. PMLR.
  2. Online computation with untrusted advice.  In Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS), pp. 52:1–52:15.
  3. Online bin packing with advice of small size.  Theory of Computing Systems, 62(8), 2006–2034.
  4. Online bin packing with predictions.  In Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), pp. 4574–4580. ijcai.org.
  5. Online metric algorithms with untrusted predictions.  In Proceedings of the 37th International Conference on Machine Learning (ICML), pp. 345–355.
  6. Secretary and online matching problems with machine learned advice.  In Proceedings of the 33rd Conference on Neural Information Processing Systems (NeurIPS).
  7. Learning from a sample in online algorithms.  In Proceedings of the 31st Conference on Neural Information Processing Systems (NeurIPS).
  8. Tight bounds for online vector bin packing.  In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), pp. 961–970.
  9. A new and improved algorithm for online bin packing.  In Proceedings of the 26th European Symposium on Algorithms (ESA), Vol. 112, pp. 5:1–5:14.
  10. A new lower bound for classic online bin packing.  Algorithmica, 83(7), 2047–2062.
  11. Uniform loss algorithms for online stochastic decision-making with applications to bin packing.  In Abstracts of the Performance Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), pp. 1–2.
  12. Banerjee, S. (2020). Improving online rent-or-buy algorithms with sequential decision making and ML predictions.  In Proceedings of the 33rd Conference on Neural Information Processing Systems (NeurIPS).
  13. Cloud storage and online bin packing.  In Proceedings of the 5th International Symposium on Intelligent Distributed Computing (IDC), pp. 63–68. Springer.
  14. Online bin packing with advice.  Algorithmica, 74(1), 507–527.
  15. Canonne, C. L. (2020). A short note on learning discrete distributions.. arXiv math.ST:2002.11457.
  16. Weibull-based benchmarks for bin packing.  In Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP), Vol. 7514, pp. 207–222.
  17. Approximation and online algorithms for multidimensional bin packing: A survey.  Comput. Sci. Rev., 24, 63–79.
  18. On packing two-dimensional bins.  SIAM Journal on Algebraic Discrete Methods, 3(1), 66–76.
  19. Approximation algorithms for bin packing: A survey.  In Approximation Algorithms for NP-Hard Problems, p. 46–93. Springer.
  20. Overcommitment in cloud services: Bin packing with chance constraints.  Management Science, 65(7), 3255–3271.
  21. On the sum-of-squares algorithm for bin packing.  Journal of the ACM, 53, 1–65.
  22. On the sum-of-squares algorithm for bin packing.  Journal of the ACM (JACM), 53(1), 1–65.
  23. Bin packing can be solved within 1+epsilon in linear time.  Comb., 1(4), 349–355.
  24. Bin packing and cutting stock problems: mathematical models and exact algorithms.  In Decision models for smarter cities.
  25. BPPLIB: a library for bin packing and cutting stock problems.  Optim. Lett., 12(2), 235–250.
  26. Learning online algorithms with distributional advice.  In ICML, Vol. 139 of Proceedings of Machine Learning Research, pp. 2687–2696. PMLR.
  27. Dósa, G. (2007). The tight bound of first fit decreasing bin-packing algorithm is f⁢f⁢d⁢(i)≤11/9⁢o⁢p⁢t⁢(i)+6/9𝑓𝑓𝑑𝑖119𝑜𝑝𝑡𝑖69ffd(i)\leq 11/9opt(i)+6/9italic_f italic_f italic_d ( italic_i ) ≤ 11 / 9 italic_o italic_p italic_t ( italic_i ) + 6 / 9.  In Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, pp. 1–11. Springer.
  28. Bin completion algorithms for multicontainer packing, knapsack, and covering problems.  Journal of Artificial Intelligence Research (JAIR), 28, 393–429.
  29. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
  30. Gent, I. P. (1998). Heuristic solution of open bin packing problems.  Journal of Heuristics, 3(4), 299–304.
  31. Online algorithms for rent-or-buy with expert advice.  In Proceedings of the 36th International Conference on Machine Learning (ICML), pp. 2319–2327.
  32. A survey on ensemble learning for data stream classification.  ACM Computing Surveys (CSUR), 50(2), 1–36.
  33. Dual inequalities for stabilized column generation revisited.  INFORMS Journal on Computing, 28(1), 175–194.
  34. Interior-point-based online stochastic bin packing.  Operations Research, 68(5), 1474–1492.
  35. A logarithmic additive integrality gap for bin packing.  In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2616–2625. SIAM.
  36. Optimal rectangle packing: An absolute placement approach.  Journal of Artificial Intelligence Research (JAIR), 46, 47–87.
  37. Online knapsack with frequency predictions.  In Proceedings of the 34th Annual Conference on Neural Information Processing Systems 2021 (NuerIPS), pp. 2733–2743.
  38. Intel (2010). Implementing and expanding a virtualized environment (white paper)..
  39. Worst-case performance bounds for simple one-dimensional packing algorithms.  SIAM Journal on Computing (SICOMP), 3, 256–278.
  40. All-around near-optimal solutions for the online bin packing problem.  In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC), Vol. 9472, pp. 727–739.
  41. All-around near-optimal solutions for the online bin packing problem.  In International Symposium on Algorithms and Computation (ISAAC), pp. 727–739.
  42. Online weighted matching with a sample.  In SODA, pp. 1247–1272. SIAM.
  43. Korf, R. E. (2002). A new algorithm for optimal bin packing.  In Proceedings of the 18th AAAI Conference on Artificial Intelligence, pp. 731–736.
  44. Korf, R. E. (2003). An improved algorithm for optimal bin packing.  In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1252–1258.
  45. Online scheduling via learned weights.  In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1859–1877.
  46. Learnable and instance-robust predictions for online matching, flows and load balancing.  CoRR, abs/2011.11743.
  47. A simple on-line bin-packing algorithm.  Journal of the ACM (JACM), 32(3), 562–572.
  48. Competitive caching with machine learned advice.  Journal of the ACM (JACM), 68(4), 1–25.
  49. Allocating online advertisement space with unreliable estimates.  In Proceedings of the 8th ACM Conference on Electronic Commerce (EC), pp. 288–294. ACM.
  50. Online optimization with uncertain information.  ACM Trans. Algorithms, 8(1), 2:1–2:29.
  51. Mann, Z. A. (2015). Allocation of virtual machines in cloud data centers - A survey of problem models and optimization algorithms.  ACM Comput. Surv., 48(1), 11:1–11:34.
  52. Lower bounds and reduction procedures for the bin packing problem.  Discrete Applied Mathematics, 28(1), 59–70.
  53. Mikkelsen, J. W. (2016). Randomization can be as helpful as a glimpse of the future in online computation.  In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), Vol. 55, pp. 39:1–39:14.
  54. Algorithms with predictions.  In Roughgarden, T. (Ed.), Beyond the Worst-Case Analysis of Algorithms, pp. 646–662. Cambridge University Press.
  55. Improving online algorithms via ML predictions.  In Proceedings of the 31st Conference on Neural Information Processing Systems (NeurIPS), Vol. 31, pp. 9661–9670.
  56. On line bin packing with items of random size.  Math. Oper. Res., 18(2), 438–445.
  57. Rohatgi, D. (2020). Near-optimal bounds for online caching with machine learned advice.  In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1834–1845.
  58. Rothvoß, T. (2013). Approximating bin packing within o⁢(log⁡o⁢p⁢t⋅log⁡log⁡o⁢p⁢t)𝑜⋅𝑜𝑝𝑡𝑜𝑝𝑡o(\log opt\cdot\log\log opt)italic_o ( roman_log italic_o italic_p italic_t ⋅ roman_log roman_log italic_o italic_p italic_t ) bins.  In Proceedings of the 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 20–29.
  59. Schoenfield, J. E. (2002). Fast, exact solution of open bin packing problems without linear programming.  Draft, US Army Space and Missile Defense Command.
  60. Improved bin completion for optimal bin packing and number partitioning.  In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pp. 651–658.
  61. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP.  International Transactions in Operational Research, 5(4), 377–389.
  62. Adaptive resource provisioning for the cloud using online bin packing.  IEEE Transactions on Computers, 63(11), 2647–2660.
  63. VMware (2021). Server consolidation..   https://www.vmware.com/ca/solutions/consolidation.html, accessed: 2024-04-17.
  64. Consolidating virtual machines with dynamic bandwidth demand in data centers.  In Proceedings of the 30th IEEE Conference on Computer Communications (INFOCOM), pp. 71–75.
  65. Heuristics for the integer one-dimensional cutting stock problem: A computational study.  Operations-Research-Spektrum, 18(3), 131–144.
  66. Optimal robustness-consistency trade-offs for learning-augmented online algorithms.  In Proceedings of the 34th Annual Conference on Neural Information Processing Systems (NeurIPS).
  67. Online 3d bin packing with constrained deep reinforcement learning.  In Proceedings of the 35th AAAI Conference on Artificial Intelligence, pp. 741–749.
Citations (23)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets