{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/applying-deep-learning-to-the-newsvendor","title":"Applying Deep Learning to the Newsvendor Problem","arxiv_id":"1607.02177","date":"2016-07-07","proceeding":null,"authors":["Afshin Oroojlooyjadid","Lawrence Snyder","Martin Takáč"],"abstract":"The newsvendor problem is one of the most basic and widely applied inventory\nmodels. There are numerous extensions of this problem. If the probability\ndistribution of the demand is known, the problem can be solved analytically.\n  However, approximating the probability distribution is not easy and is prone\nto error; therefore, the resulting solution to the newsvendor problem may be\nnot optimal. To address this issue, we propose an algorithm based on deep\nlearning that optimizes the order quantities for all products based on features\nof the demand data. Our algorithm integrates the forecasting and\ninventory-optimization steps, rather than solving them separately, as is\ntypically done, and does not require knowledge of the probability distributions\nof the demand. Numerical experiments on real-world data suggest that our\nalgorithm outperforms other approaches, including data-driven and machine\nlearning approaches, especially for demands with high volatility. Finally, in\norder to show how this approach can be used for other inventory optimization\nproblems, we provide an extension for (r,Q) policies.","url_abs":"http://arxiv.org/abs/1607.02177v4","url_pdf":"http://arxiv.org/pdf/1607.02177v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"applying-deep-learning-to-the-newsvendor","repo_url":"https://github.com/oroojlooy/newsvendor","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"BSD-3-Clause"}},{"paper_slug":"applying-deep-learning-to-the-newsvendor","repo_url":"https://github.com/karnwatcharasupat/DeepNewsvendor","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1607.02177","atlas_url":"https://app.syntology.ai/?focus=1607.02177","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1607.02177"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1607.02177\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1607.02177"},"call":"get_concepts_for_paper(arxiv_id=\"1607.02177\")"}],"by_repo":[{"repo":"oroojlooy/newsvendor","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"karnwatcharasupat/DeepNewsvendor","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f1c2a790f5c7e5e5855b0f0b00166070069ea5d1e31c9f25cf8fea1249c5b366","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}