A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food

• URL: http://arxiv.org/abs/2403.10638v1
• Date: Fri, 15 Mar 2024 19:12:28 GMT
• Title: A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food
• Abstract summary: We developed a common algorithmic solution addressing the problem of resource-constrained outreach encountered by social change organizations with different missions and operations. We developed an estimation and optimization approach for partially-observed episodic restless bandits under $k$-step transitions.
• Score: 29.017017395878597
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We developed a common algorithmic solution addressing the problem of resource-constrained outreach encountered by social change organizations with different missions and operations: Breaking Ground -- an organization that helps individuals experiencing homelessness in New York transition to permanent housing and Leket -- the national food bank of Israel that rescues food from farms and elsewhere to feed the hungry. Specifically, we developed an estimation and optimization approach for partially-observed episodic restless bandits under $k$-step transitions. The results show that our Thompson sampling with Markov chain recovery (via Stein variational gradient descent) algorithm significantly outperforms baselines for the problems of both organizations. We carried out this work in a prospective manner with the express goal of devising a flexible-enough but also useful-enough solution that can help overcome a lack of sustainable impact in data science for social good.

Related papers

• Adaptive Multi-Round Allocation with Stochastic Arrivals [26.102812388131813]
  We study a sequential resource allocation problem motivated by adaptive network recruitment.<n>We first show that the single-round allocation problem admits an exact greedy solution based on marginal survival probabilities.<n>In the multi-round setting, the resulting Bellman recursion is intractable due to the high-dimensional evolution of the frontier.
  arXiv  Detail & Related papers  (2026-05-12T13:29:06Z)
• AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization [61.535567824938205]
  We introduce AdaEvolve, a framework that reformulates LLM-driven evolution as a hierarchical adaptive optimization problem.<n>AdaEvolve consistently outperforms the open-ended baselines across 185 different open-ended optimization problems.
  arXiv  Detail & Related papers  (2026-02-23T18:45:31Z)
• Decoding Rewards in Competitive Games: Inverse Game Theory with Entropy Regularization [52.74762030521324]
  We propose a novel algorithm to learn reward functions from observed actions.<n>We provide strong theoretical guarantees for the reliability and sample efficiency of our algorithm.
  arXiv  Detail & Related papers  (2026-01-19T04:12:51Z)
• Food4All: A Multi-Agent Framework for Real-time Free Food Discovery with Integrated Nutritional Metadata [27.735512297142623]
  Food4All is the first multi-agent framework explicitly designed for real-time, context-aware free food retrieval.<n>Food4All unifies three innovations: 1) heterogeneous data aggregation across official databases, community platforms, and social media to provide a continuously updated pool of food resources; 2) a lightweight reinforcement learning algorithm trained on curated cases to optimize for both geographic accessibility and nutritional correctness; and 3) an online feedback loop that dynamically adapts retrieval policies to evolving user needs.
  arXiv  Detail & Related papers  (2025-10-21T04:35:02Z)
• Contextual Budget Bandit for Food Rescue Volunteer Engagement [13.339011713989628]
  Volunteer-based food rescue platforms tackle food waste by matching surplus food to communities in need.<n>Existing algorithms to improve volunteer engagement exacerbate geographical disparities, leaving some communities systematically disadvantaged.<n>We propose Contextual Budget Bandit, which incorporates context-dependent budget allocation in restless multi-armed bandits.
  arXiv  Detail & Related papers  (2025-09-13T01:49:00Z)
• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• Frugal inference for control [2.20480252274709]
  Key challenge in advancing artificial intelligence is achieving the right balance between external movement and resource use.<n>We develop a version of the POMDP framework where the information gained through inference is treated as a resource that must be optimized alongside task performance and motion effort.<n>This work provides a foundation for a new type of rational computation that both brains and machines could use for effective but resource-efficient control under uncertainty.
  arXiv  Detail & Related papers  (2024-06-20T15:50:38Z)
• Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation [51.687404103375506]
  We partner with a non-profit organization in the state of Indiana that leads emphFood Drop, a program that is designed to redirect rejected truckloads of food away from landfills and into food banks. Our goal in this partnership is to completely automate Food Drop. In doing so, we need a matching algorithm for making real-time decisions that strikes a balance between ensuring fairness for the food banks that receive the food and optimizing efficiency for the truck drivers.
  arXiv  Detail & Related papers  (2024-06-10T15:22:41Z)
• The Stochastic Dynamic Post-Disaster Inventory Allocation Problem with Trucks and UAVs [1.3812010983144802]
  Humanitarian logistics operations face increasing difficulties due to rising demands for aid in disaster areas. This paper investigates the dynamic allocation of scarce relief supplies across multiple affected districts over time. It introduces a novel dynamic post-disaster inventory allocation problem with trucks and unmanned aerial vehicles delivering relief goods.
  arXiv  Detail & Related papers  (2023-11-30T19:03:04Z)
• Learning Optimal and Fair Policies for Online Allocation of Scarce Societal Resources from Data Collected in Deployment [5.0904557821667]
  We use administrative data collected in deployment to design an online policy that maximizes expected outcomes while satisfying budget constraints. We show that using our policies improves rates of exit from homelessness by 1.9% and that policies that are fair in either allocation or outcomes by race come at a very low price of fairness.
  arXiv  Detail & Related papers  (2023-11-23T01:40:41Z)
• Rebalancing Social Feed to Minimize Polarization and Disagreement [24.939887831898453]
  We propose a novel problem formulation aimed at slightly nudging users' social feeds in order to strike a balance between relevance and diversity. Our approach is based on re-weighting the relative importance of the accounts that a user follows, so as to calibrate the frequency with which the content produced by various accounts is shown to the user.
  arXiv  Detail & Related papers  (2023-08-28T10:59:05Z)
• Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto [10.882996403581524]
  Land zoning and historic under-investment have resulted in walkability and social inequality among residents. We tackle the problem of Walkability Optimization through the lens of spatial- optimization. We derive Mixed-Integer Linear Programming (MILP) and Constraint Programming (CP) models. We conduct a case study on 31 underserved neighborhoods in the City of Toronto, Canada.
  arXiv  Detail & Related papers  (2022-12-10T03:52:03Z)
• Learning to Optimize with Stochastic Dominance Constraints [103.26714928625582]
  In this paper, we develop a simple yet efficient approach for the problem of comparing uncertain quantities. We recast inner optimization in the Lagrangian as a learning problem for surrogate approximation, which bypasses apparent intractability. The proposed light-SD demonstrates superior performance on several representative problems ranging from finance to supply chain management.
  arXiv  Detail & Related papers  (2022-11-14T21:54:31Z)
• Deep Learning for Principal-Agent Mean Field Games [5.2220228867103815]
  We develop a deep learning algorithm for solving Principal-Agent mean field games with market-clearing conditions. We use an actor-critic approach to optimization, where the agents form a Nash equilibria according to the principal's penalty function. Our numerical results illustrate the efficacy of the algorithm and lead to interesting insights into the nature of optimal PA interactions.
  arXiv  Detail & Related papers  (2021-10-03T23:38:40Z)
• Efficient Empowerment Estimation for Unsupervised Stabilization [75.32013242448151]
  empowerment principle enables unsupervised stabilization of dynamical systems at upright positions. We propose an alternative solution based on a trainable representation of a dynamical system as a Gaussian channel. We show that our method has a lower sample complexity, is more stable in training, possesses the essential properties of the empowerment function, and allows estimation of empowerment from images.
  arXiv  Detail & Related papers  (2020-07-14T21:10:16Z)
• Robust Reinforcement Learning with Wasserstein Constraint [49.86490922809473]
  We show the existence of optimal robust policies, provide a sensitivity analysis for the perturbations, and then design a novel robust learning algorithm. The effectiveness of the proposed algorithm is verified in the Cart-Pole environment.
  arXiv  Detail & Related papers  (2020-06-01T13:48:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.