Towards Carbon Footprint-Aware Recommender Systems for Greener Item Recommendation

• URL: http://arxiv.org/abs/2503.17201v1
• Date: Fri, 21 Mar 2025 14:58:47 GMT
• Title: Towards Carbon Footprint-Aware Recommender Systems for Greener Item Recommendation
• Authors: Raoul Kalisvaart, Masoud Mansoury, Alan Hanjalic, Elvin Isufi,
• Abstract summary: Despite online shopping being fueled by recommender systems (RecSys) algorithms, the role and potential of the latter in promoting more sustainable choices is little studied.<n>One of the main reasons for this could be attributed to the lack of a dataset containing carbon footprint emissions for the items.<n>We show that a simple reranking approach that accounts for the item's carbon footprint can establish a better trade-off between accuracy and greenness.
• Score: 16.57152918332189
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The commodity and widespread use of online shopping are having an unprecedented impact on climate, with emission figures from key actors that are easily comparable to those of a large-scale metropolis. Despite online shopping being fueled by recommender systems (RecSys) algorithms, the role and potential of the latter in promoting more sustainable choices is little studied. One of the main reasons for this could be attributed to the lack of a dataset containing carbon footprint emissions for the items. While building such a dataset is a rather challenging task, its presence is pivotal for opening the doors to novel perspectives, evaluations, and methods for RecSys research. In this paper, we target this bottleneck and study the environmental role of RecSys algorithms. First, we mine a dataset that includes carbon footprint emissions for its items. Then, we benchmark conventional RecSys algorithms in terms of accuracy and sustainability as two faces of the same coin. We find that RecSys algorithms optimized for accuracy overlook greenness and that longer recommendation lists are greener but less accurate. Then, we show that a simple reranking approach that accounts for the item's carbon footprint can establish a better trade-off between accuracy and greenness. This reranking approach is modular, ready to use, and can be applied to any RecSys algorithm without the need to alter the underlying mechanisms or retrain models. Our results show that a small sacrifice of accuracy can lead to significant improvements of recommendation greenness across all algorithms and list lengths. Arguably, this accuracy-greenness trade-off could even be seen as an enhancement of user satisfaction, particularly for purpose-driven users who prioritize the environmental impact of their choices. We anticipate this work will serve as the starting point for studying RecSys for more sustainable recommendations.

Related papers

• Review, Refine, Repeat: Understanding Iterative Decoding of AI Agents with Dynamic Evaluation and Selection [71.92083784393418]
  Inference-time methods such as Best-of-N (BON) sampling offer a simple yet effective alternative to improve performance. We propose Iterative Agent Decoding (IAD) which combines iterative refinement with dynamic candidate evaluation and selection guided by a verifier.
  arXiv  Detail & Related papers  (2025-04-02T17:40:47Z)
• Adaptive Sensor Placement Inspired by Bee Foraging: Towards Efficient Environment Monitoring [0.0]
  We proposed a hybrid algorithm that combines Artificial Bee Colony (ABC) with Levy flight to optimize adaptive sensor placement.<n>By enhancing exploration and exploitation, our approach significantly improves the identification of critical hotspots.
  arXiv  Detail & Related papers  (2024-11-08T22:24:06Z)
• Estimating Environmental Cost Throughout Model's Adaptive Life Cycle [2.93774265594295]
  PreIndex is a predictive index to estimate the environmental and compute resources associated with model retraining to distributional shifts in data. It can be used to estimate environmental costs such as carbon emissions and energy usage when retraining from current data distribution to new data distribution.
  arXiv  Detail & Related papers  (2024-07-23T03:58:06Z)
• Are We Really Achieving Better Beyond-Accuracy Performance in Next Basket Recommendation? [57.91114305844153]
  Next basket recommendation (NBR) is a special type of sequential recommendation that is increasingly receiving attention. Recent studies into NBR have found a substantial performance difference between recommending repeat items and explore items. We propose a plug-and-play two-step repetition-exploration framework that treats repeat items and explores items separately.
  arXiv  Detail & Related papers  (2024-05-02T09:59:35Z)
• Generative AI for Low-Carbon Artificial Intelligence of Things with Large Language Models [67.0243099823109]
  Generative AI (GAI) holds immense potential to reduce carbon emissions of Artificial Intelligence of Things (AIoT) In this article, we explore the potential of GAI for carbon emissions reduction and propose a novel GAI-enabled solution for low-carbon AIoT. We propose a Large Language Model (LLM)-enabled carbon emission optimization framework, in which we design pluggable LLM and Retrieval Augmented Generation (RAG) modules.
  arXiv  Detail & Related papers  (2024-04-28T05:46:28Z)
• Aligning GPTRec with Beyond-Accuracy Goals with Reinforcement Learning [67.71952251641545]
  GPTRec is an alternative to the Top-K model for item-by-item recommendations. We show that GPTRec offers a better tradeoff between accuracy and secondary metrics than classic greedy re-ranking techniques. Our experiments on two datasets show that GPTRec's Next-K generation approach offers a better tradeoff between accuracy and secondary metrics than classic greedy re-ranking techniques.
  arXiv  Detail & Related papers  (2024-03-07T19:47:48Z)
• Bayesian Optimisation Against Climate Change: Applications and Benchmarks [0.4640835690336652]
  We provide a review of applications and benchmarks for Bayesian optimisation in climate change applications. We identify four main application domains: material discovery, wind farm layout, optimal renewable control and environmental monitoring. For each domain we identify a public benchmark or data set that is easy to use and evaluate systems against, while being representative of real-world problems. Due to the lack of a suitable benchmark for environmental monitoring, we propose LAQN-BO, based on air pollution data.
  arXiv  Detail & Related papers  (2023-06-07T11:17:07Z)
• Machine Guided Discovery of Novel Carbon Capture Solvents [48.7576911714538]
  Machine learning offers a promising method for reducing the time and resource burdens of materials development. We have developed an end-to-end "discovery cycle" to select new aqueous amines compatible with the commercially viable acid gas scrubbing carbon capture. The prediction process shows 60% accuracy against experiment for both material parameters and 80% for a single parameter on an external test set.
  arXiv  Detail & Related papers  (2023-03-24T18:32:38Z)
• Exploration in two-stage recommender systems [79.50534282841618]
  Two-stage recommender systems are widely adopted in industry due to their scalability and maintainability. A key challenge of this setup is that optimal performance of each stage in isolation does not imply optimal global performance. We propose a method of synchronising the exploration strategies between the ranker and the nominators.
  arXiv  Detail & Related papers  (2020-09-01T16:52:51Z)
• Green Algorithms: Quantifying the carbon footprint of computation [0.0]
  We present a framework to estimate the carbon footprint of any computational task in a standardised and reliable way. Metrics to interpret and contextualise greenhouse gas emissions are defined, including the equivalent distance travelled by car or plane. We develop a freely available online tool, Green Algorithms, which enables a user to estimate and report the carbon footprint of their computation.
  arXiv  Detail & Related papers  (2020-07-15T11:05:33Z)

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.