Nicolò Felicioni

ORCID: 0000-0002-3555-7760
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Recommender Systems and Techniques
  • Advanced Bandit Algorithms Research
  • Image and Video Quality Assessment
  • Distributed systems and fault tolerance
  • Consumer Market Behavior and Pricing
  • Cloud Computing and Resource Management
  • Topic Modeling
  • Distributed and Parallel Computing Systems
  • Image Retrieval and Classification Techniques
  • Network Security and Intrusion Detection
  • Mobile Crowdsensing and Crowdsourcing
  • Information Retrieval and Search Behavior
  • Quantum Computing Algorithms and Architecture
  • Sentiment Analysis and Opinion Mining
  • Expert finding and Q&A systems
  • Stochastic Gradient Optimization Techniques

Politecnico di Milano
2020-2023

It has been long known that quantum computing the potential to revolutionize way we find solutions of problems are difficult solve on classical computers. was only recently small but functional computers have become available cloud, allowing test their potential. In this paper propose leverage capabilities address an important task for recommender systems providers, optimal selection recommendation carousels. many video-on-demand and music streaming services user is provided with a homepage...

10.1145/3460231.3478853 article EN 2021-09-13

In this paper we provide a description of the methods used as team BanaNeverAlone for ACM RecSys Challenge 2020, organized by Twitter. The challenge addresses problem user engagement prediction: goal is to predict probability (Like, Reply, Retweet or with comment), based on series past interactions Twitter platform. Our proposed solution relies several features that extracted from original dataset, well consolidated models, such gradient boosting decision trees and neural networks. ensemble...

10.1145/3415959.3415998 article EN 2020-09-25

Data is a precious resource in today's society, and generated at an unprecedented constantly growing pace. The need to store, analyze, make data promptly available multitude of users introduces formidable challenges modern software platforms. These radically transformed all research fields that gravitate around management processing, with the introduction distributed data-intensive systems offer new programming models implementation strategies handle characteristics such as its volume, rate...

10.48550/arxiv.2203.10836 preprint EN cc-by-nc-sa arXiv (Cornell University) 2022-01-01

Many video-on-demand and music streaming services provide the user with a page consisting of several recommendation lists, i.e., widgets or swipeable carousels , each built specific criteria (e.g., most recent, TV series, etc.). Finding efficient strategies to select which display is an active research topic great industrial interest. In this setting, overall quality recommendations new algorithm cannot be assessed by measuring solely its individual quality. Rather, it should evaluated in...

10.3389/fdata.2022.910030 article EN cc-by Frontiers in Big Data 2022-06-09

It is common for video-on-demand and music streaming services to adopt a user interface composed of several recommendation lists, i.e., widgets or swipeable carousels, each generated according specific criterion algorithm (e.g., most recent, top popular, recommended you, editors' choice, etc.). Selecting the appropriate combination carousel has significant impact on satisfaction. A crucial aspect this that measure relevance new it not sufficient account solely its individual quality....

10.1145/3452918.3465493 article EN ACM International Conference on Interactive Media Experiences 2021-06-21

We investigate the role of uncertainty in decision-making problems with natural language as input. For such tasks, using Large Language Models agents has become norm. However, none recent approaches employ any additional phase for estimating agent about world during task. focus on a fundamental framework input, which is one contextual bandits, where context information consists text. As representative no estimation, we consider an LLM bandit greedy policy, picks action corresponding to...

10.48550/arxiv.2404.02649 preprint EN arXiv (Cornell University) 2024-04-03

The Off-Policy Evaluation (OPE) problem consists of evaluating the performance counterfactual policies with data collected by another one. This is utmost importance for various application domains, e.g., recommendation systems, medical treatments, and many others. To solve OPE problem, we resort to estimators, which aim estimate in most accurate way possible that would have had if they were deployed place logging policy. In literature, several estimators been developed, all different...

10.48550/arxiv.2406.18022 preprint EN arXiv (Cornell University) 2024-06-25

Many video-on-demand and music streaming services provide the user with a page consisting of several recommendation lists, i.e., widgets or swipeable carousels, each built specific criterion (e.g., most recent, TV series, etc.). Finding efficient strategies to select which carousels display is an active research topic great industrial interest. In this setting, overall quality recommendations new algorithm cannot be assessed by measuring solely its individual quality. Rather, it should...

10.1145/3450614.3461680 preprint EN 2021-06-21

Evaluating recommendation systems is a task of utmost importance and very active research field. While online evaluation the most reliable procedure, it may also be too expensive to perform, if not unfeasible. Therefore, researchers practitioners resort offline evaluation. Offline much more efficient scalable, but traditional approaches suffer from high bias. This issue led increased popularity counterfactual techniques. These techniques are used for learning in recommender reduce bias have...

10.1145/3523227.3547429 article EN 2022-09-13
Coming Soon ...